I have this maps with targets and their coordinates in meter. I have to reach all targets with the shortest route possible. I already tried Travelling Salesman Problem method but the shortest route that I got is around 1320 meter, while I believe it can be shorter than that. Does anyone have any idea how to solve this problems?

1 7 8 1. [ [-135, 1.50, 0.01, 2. [-212.00, -73.95, 0.0], 3. [-212.00, -198.22, 0.01, 4. [-135.50, -256.00, 0.01, 5. [-84.5, -198.22, 0.01, 6. [-135.50, -128.00, 0.01, 7. [-135.50, -48.20, 0.01, 8. [44.50, -65.75, 0.0], 9. [0.0, -128.00, 0.0], 10. 144.50, -198.22, 0.01, 11. (0.0, -256.00, 0.0 | 2 6 9 3 5 10 11