Solving large-scale TSP problem in 1 hour: Santa Claus Challenge 2020
R. Mariescu-Istodor and P. Fränti
Submitted to Frontiers in Robotics
DRAG SOLUTION HERE
File API & FileReader API not supported
XHR2's FormData is not supported
XHR2's upload progress isn't supported
The data package contains the dataset and sample solutions for each variant. The dataset is displayed on the map here.
One point per line.
Points have been converted to the Finnish National Coordinate System (KKJ).
Euclidean distance should be used for the optimization.
A text file containing the indices in correct order (one index per line).
Valid indices are all integers between 1 and 1,437,195.
For the closed loop case, repeat the first index at the end.
For the k-tsp, separate each part by a blank line.
If your first index is 1 (Santa's home), you are solving variant 3.
You can validate your result and share your best outcome by dragging your solution on this page. Warning: uploading is slow.
Note: These results can contain solutions obtained by exceeding the processing time limit. So, some of the scores can be exceptionally good. Nonetheless, valid solutions have the same order of magnitude as the top scoring ones.