A reduction heuristic for the all-colors shortest path problem

被引：4

作者：

Carrabs, Francesco ^{[1
]}

Cerulli, Raffaele ^{[1
]}

Raiconi, Andrea ^{[1
]}

机构：

[1] Univ Salerno, Dept Math, Fisciano, Italy

来源：

RAIRO-OPERATIONS RESEARCH | 2021年 / 55卷

关键词：

All-Colors Shortest Path problem; Equality Generalized Traveling Salesman Problem; E-GTSP; heuristic;

D O I：

10.1051/ro/2020078

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

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.

引用

页码：S2071 / S2082

页数：12

共 50 条

[41] NOTE ON SPIRAS ALGORITHM FOR ALL-PAIRS SHORTEST-PATH PROBLEM
CARSON, JS
LAW, AM
SIAM JOURNAL ON COMPUTING, 1977, 6 (04) : 696 - 699
[42] Solving the Nearly Symmetric All-Pairs Shortest-Path Problem
Brown, Gerald G.
Carlyle, W. Matthew
INFORMS JOURNAL ON COMPUTING, 2020, 32 (02) : 279 - 288
[43] More effective crossover operators for the all-pairs shortest path problem
Doerr, Benjamin
Johannsen, Daniel
Koetzing, Timo
Neumann, Frank
Theile, Madeleine
THEORETICAL COMPUTER SCIENCE, 2013, 471 : 12 - 26
[44] Sub-cubic cost algorithms for the all pairs shortest path problem
Takaoka, T
GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 1995, 1017 : 333 - 343
[45] A SHARPER ANALYSIS OF A PARALLEL ALGORITHM FOR THE ALL PAIRS SHORTEST-PATH PROBLEM
GU, QP
TAKAOKA, T
PARALLEL COMPUTING, 1990, 16 (01) : 61 - 67
[46] SCALABILITY OF PARALLEL ALGORITHMS FOR THE ALL-PAIRS SHORTEST-PATH PROBLEM
KUMAR, V
SINGH, V
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1991, 13 (02) : 124 - 138
[47] A NEW UPPER BOUND ON THE COMPLEXITY OF THE ALL PAIRS SHORTEST-PATH PROBLEM
TAKAOKA, T
LECTURE NOTES IN COMPUTER SCIENCE, 1992, 570 : 209 - 213
[48] More Effective Crossover Operators for the All-Pairs Shortest Path Problem
Doerr, Benjamin
Johannsen, Daniel
Koetzing, Timo
Neumann, Frank
Theile, Madeleine
PARALLEL PROBLEMS SOLVING FROM NATURE - PPSN XI, PT I, 2010, 6238 : 184 - +
[49] A Heterogeneous Solution to the All-pairs Shortest Path Problem using FPGAs
Chirila, Mihnea
D'Alberto, Paolo
Ting, Hsin-Yu
Veidenbaum, Alexander
Nicolau, Alexandru
PROCEEDINGS OF THE TWENTY THIRD INTERNATIONAL SYMPOSIUM ON QUALITY ELECTRONIC DESIGN (ISQED 2022), 2022, : 108 - 113
[50] Solving all-pairs shortest path problem based on amoeba algorithm
2013, ICIC Express Letters Office, Tokai University, Kumamoto Campus, 9-1-1, Toroku, Kumamoto, 862-8652, Japan (07):

← 1 2 3 4 5 →