Fifth International Conference on Image, Video Processing, and Artificial Intelligence (IVPAI 2023) 2024
DOI: 10.1117/12.3023741
|View full text |Cite
|
Sign up to set email alerts
|

Simple and fast TSP initialization by Delaunay graph

Jimi Tuononen,
Pasi Fränti

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(n 2 ) 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 … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 15 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?