Paper
14 March 2024 Simple and fast TSP initialization by Delaunay graph
Jimi Tuononen, Pasi Fränti
Author Affiliations +
Proceedings Volume 13074, Fifth International Conference on Image, Video Processing, and Artificial Intelligence (IVPAI 2023); 130740I (2024) https://doi.org/10.1117/12.3023741
Event: Fifth International Conference on Image, Video Processing and Artificial Intelligence, 2023, Shenzhen, China
Abstract
Finding an initial solution for traveling salesman fast and with reasonable quality is needed both by the state-of-the-art local search and branch-and-bound optimal algorithms. Classical heuristics require O(n2) and their quality may be insufficient to keep the efficiency of the local search high. In this paper, we present two fast variants that utilize a Delaunay neighborhood graph. The best methods achieve 2.66% gap for Dots datasets, and 15.04% gap for the selected TSPLIB datasets. However, these results were obtained with slower algorithms. The best of the fast methods achieved 5.76% gap for Dots datasets, and 19.07% gap for the selected TSPLIB datasets in 307 milliseconds, on average.
(2024) Published by SPIE. Downloading of the abstract is permitted for personal use only.
Jimi Tuononen and Pasi Fränti "Simple and fast TSP initialization by Delaunay graph", Proc. SPIE 13074, Fifth International Conference on Image, Video Processing, and Artificial Intelligence (IVPAI 2023), 130740I (14 March 2024); https://doi.org/10.1117/12.3023741
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Nonlinear optimization

Back to Top