POPMUSIC for the travelling salesman problem

•Proposes a low-complexity constructive method for general and large TSP instances.•Proposes a low-complexity improvement method for general TSP instances.•Union of tours produced by constructive method are high quality candidate edges.•Method is shown highly efficient for various instances with mil...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:European journal of operational research Jg. 272; H. 2; S. 420 - 429
Hauptverfasser: Taillard, Éric D., Helsgaun, Keld
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 16.01.2019
Schlagworte:
Large-scale optimization
Local search
Metaheuristics
POPMUSIC
Travelling salesman
Local search
Large-scale optimization
Metaheuristics
POPMUSIC
Travelling salesman
ISSN:0377-2217, 1872-6860
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:•Proposes a low-complexity constructive method for general and large TSP instances.•Proposes a low-complexity improvement method for general TSP instances.•Union of tours produced by constructive method are high quality candidate edges.•Method is shown highly efficient for various instances with millions of cities. POPMUSIC— Partial OPtimization Metaheuristic Under Special Intensification Conditions — is a template for tackling large problem instances. This metaheuristic has been shown to be very efficient for various hard combinatorial problems such as p-median, sum of squares clustering, vehicle routing, map labelling and location routing. A key point for treating large Travelling Salesman Problem (TSP) instances is to consider only a subset of edges connecting the cities. The main goal of this article is to present how to build a list of good candidate edges with a complexity lower than quadratic in the context of TSP instances given by a general function. The candidate edges are found with a technique exploiting tour merging and the POPMUSIC metaheuristic. When these candidate edges are provided to a good local search engine, high quality solutions can be found quite efficiently. The method is tested on TSP instances of up to several million cities with different structures (Euclidean uniform, clustered, 2D to 5D, grids, toroidal distances). Numerical results show that solutions of excellent quality can be obtained with an empirical complexity lower than quadratic without exploiting the geometrical properties of the instances.
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2018.06.039