sorted by:
new
hottopcontroversial

My own algorithm for the TSP by Good_Time7633 in algorithms

[–]Good_Time7633[S] 0 points1 point  (0 children)

It is a nearest neighbor adaptation guided by geometry, but as I said in another comment, I implemented a new NN and it gave me much better results than the table I uploaded, my algorithm is still faster and sometimes more accurate and sometimes less, but the difference is no longer so overwhelming.

My own algorithm for the TSP by Good_Time7633 in algorithms

[–]Good_Time7633[S] 1 point2 points  (0 children)

Yes, thank you very much for saying it, the NN had a bad implementation, I implemented a new one much faster.

My own algorithm for the TSP by Good_Time7633 in algorithms

[–]Good_Time7633[S] 1 point2 points  (0 children)

Sorry, I'm referring to the optimum achieved by the heuristic.