2022
DOI: 10.48550/arxiv.2201.09424
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

An Effective Iterated Two-stage Heuristic Algorithm for the Multiple Traveling Salesmen Problem

Abstract: We propose an effective ITSHA local search for the minsum and minmax TSP.• We propose three effective local search neighborhoods for the TSP.• We propose several approaches for escaping from the local optima to improve ITSHA.• Experimental results demonstrate the superiority of the proposed algorithm.

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 33 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?