Issue |
RAIRO-Oper. Res.
Volume 55, 2021
Regular articles published in advance of the transition of the journal to Subscribe to Open (S2O). Free supplement sponsored by the Fonds National pour la Science Ouverte
|
|
---|---|---|
Page(s) | S2071 - S2082 | |
DOI | https://doi.org/10.1051/ro/2020078 | |
Published online | 02 March 2021 |
A reduction heuristic for the all-colors shortest path problem
Department of Mathematics, University of Salerno, Fisciano, Italy
* Corresponding author: araiconi@unisa.it
Received:
25
March
2020
Accepted:
5
July
2020
The All-Colors Shortest Path (ACSP) is a recently introduced NP-Hard optimization problem, in which a color is assigned to each vertex of an edge weighted graph, and the aim is to find the shortest path spanning all colors. The solution path can be not simple, that is it is possible to visit multiple times the same vertices if it is a convenient choice. The starting vertex can be constrained (ACSP) or not (ACSP-UE). We propose a reduction heuristic based on the transformation of any ACSP-UE instance into an Equality Generalized Traveling Salesman Problem one. Computational results show the algorithm to outperform the best previously known one.
Mathematics Subject Classification: 90C59 / 90C27 / 05C38
Key words: All-Colors Shortest Path problem / Equality Generalized Traveling Salesman Problem / E-GTSP / heuristic
© EDP Sciences, ROADEF, SMAI 2021
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.