Paper Info
Title
A Reduction Heuristic For The All-Colors Shortest Path Problem
Abstract
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.
Year
DOI
Venue
2021
10.1051/ro/2020078
RAIRO-OPERATIONS RESEARCH
Keywords
DocType
Volume
All-Colors Shortest Path problem, Equality Generalized Traveling Salesman Problem, E-GTSP, heuristic
Journal
55
Issue
ISSN
Citations 
Supplement
0399-0559
0
PageRank 
References 
Authors
0.34
0
3
Name
Order
Citations
PageRank
Francesco Carrabs119915.55
R. Cerulli225223.85
A. Raiconi31319.68