A two-level metaheuristic for the all colors shortest path problem

F. Carrabs (), R. Cerulli (), R. Pentangelo () and A. Raiconi ()
Additional contact information
F. Carrabs: University of Salerno
R. Cerulli: University of Salerno
R. Pentangelo: University of Salerno
A. Raiconi: University of Salerno

Computational Optimization and Applications, 2018, vol. 71, issue 2, No 10, 525-551

Abstract: Abstract Given an undirected weighted graph, in which each vertex is assigned to a color and one of them is identified as source, in the all-colors shortest path problem we look for a minimum cost shortest path that starts from the source and spans all different colors. The problem is known to be NP-Hard and hard to approximate. In this work we propose a variant of the problem in which the source is unspecified and show the two problems to be computationally equivalent. Furthermore, we propose a mathematical formulation, a compact representation for feasible solutions and a VNS metaheuristic that is based on it. Computational results show the effectiveness of the proposed approach for the two problems.

Keywords: Shortest path; Colored graph; Variable neighboord search (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10589-018-0014-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:71:y:2018:i:2:d:10.1007_s10589-018-0014-2

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-018-0014-2

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().