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 条

[31] Minimizing maximum cost in task coverage problem with multiple mobile sensors: A heuristic approach based on all-pairs shortest path
Min, Hyeun Jeong
Lim, Hyo-Sang
INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS, 2017, 13 (11)
[32] CONSTRAINED SHORTEST PATH PROBLEM
ANEJA, YP
NAIR, KPK
NAVAL RESEARCH LOGISTICS, 1978, 25 (03) : 549 - 555
[33] Neutrosophic Shortest Path Problem
Kumar, Ranjan
Edaltpanah, S. A.
Jha, Sripati
Broumi, Said
Dey, Arindam
NEUTROSOPHIC SETS AND SYSTEMS, 2018, 23 : 5 - 15
[34] The shortest path problem with an obstructor
Yamaguchi, K
Araki, T
Kashiwabara, T
ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE, 1998, 81 (02): : 13 - 23
[35] On the shortest α-reliable path problem
Corredor-Montenegro, David
Cabrera, Nicolas
Akhavan-Tabatabaei, Raha
Medaglia, Andres L.
TOP, 2021, 29 (01) : 287 - 318
[36] Fuzzy shortest path problem
Okada, Shinkoh
Gen, Mitsuo
Computers and Industrial Engineering, 1994, 27 (1-4): : 465 - 468
[37] On the Quadratic Shortest Path Problem
Rostami, Borzou
Malucelli, Federico
Frey, Davide
Buchheim, Christoph
EXPERIMENTAL ALGORITHMS, SEA 2015, 2015, 9125 : 379 - 390
[38] The multiple shortest path problem with path deconfliction
Hughes, Michael S.
Lunday, Brian J.
Weir, Jeffrey D.
Hopkinson, Kenneth M.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2021, 292 (03) : 818 - 829
[39] A NEW UPPER BOUND ON THE COMPLEXITY OF THE ALL PAIRS SHORTEST-PATH PROBLEM
TAKAOKA, T
INFORMATION PROCESSING LETTERS, 1992, 43 (04) : 195 - 199
[40] A faster algorithm for the all-pairs shortest path problem and its application
Takaoka, T
COMPUTING AND COMBINATORICS, PROCEEDINGS, 2004, 3106 : 278 - 289

← 1 2 3 4 5 →