Complexity analysis and optimization of the shortest path tour problem

被引：16

作者：

Festa, Paola ^{[1
]}

机构：

[1] Univ Napoli FEDERICO II Compl MSA, Dept Math & Applicat, I-80126 Naples, Italy

来源：

OPTIMIZATION LETTERS | 2012年 / 6卷 / 01期

关键词：

Shortest path problems; Network flowproblems; Network optimization; Combinatorial optimization; ROUTE METHODS; ALGORITHMS; BUCKETS;

D O I：

10.1007/s11590-010-0258-y

中图分类号：

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

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

The shortest path tour problem (SPTP) consists in finding a shortest path from a given origination node s to a given destination node d in a directed graph with nonnegative arc lengths with the constraint that the optimal path P should successively and sequentially pass through at least one node from given node subsets T (1), T (2), . . . , T (N) , where T(i)boolean AND T(j)=empty set, (sic) i, j = 1, ..., N, i not equal j. In this paper, it will proved that the SPTP belongs to the complexity class P and several alternative techniques will be presented to solve it.

引用

页码：163 / 175

页数：13

共 50 条

[21] The computational complexity of the relative robust shortest path problem with interval data
Zielinski, P
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 158 (03) : 570 - 576
[22] The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms
Holzmann, Tim
Smith, J. Cole
OPERATIONS RESEARCH, 2021, 69 (01) : 82 - 99
[23] New models for the robust shortest path problem: complexity, resolution and generalization
Virginie Gabrel
Cécile Murat
Lei Wu
Annals of Operations Research, 2013, 207 : 97 - 120
[24] A Shortest Path Problem
JIA Zhengsheng(Mathematics and Mechanics Department of Taiyuan University of technology Taiyuan 030024)FAN Hui(Foundation Department Shan Xi Mining Industry institute
JournalofSystemsScienceandSystemsEngineering, 1996, (04) : 496 - 499
[25] Lagrangian Heuristics for Capacitated Shortest Path Tour Problem Based Online Service Chaining
Hara, Takanori
Sasabe, Masahiro
PROCEEDINGS OF THE IEEE/IFIP NETWORK OPERATIONS AND MANAGEMENT SYMPOSIUM 2022, 2022,
[26] The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions
Carrabs, Francesco
D'Ambrosio, Ciriaco
Ferone, Daniele
Festa, Paola
Laureana, Federica
NETWORKS, 2021, 78 (01) : 17 - 31
[27] The Robust Shortest Path Problem by Means of Robust Linear Optimization
Chaerani, D.
Roos, C.
Aman, A.
OPERATIONS RESEARCH PROCEEDINGS 2004, 2005, : 335 - 342
[28] Solving shortest path problem using particle swarm optimization
Mohemmed, Ammar W.
Sahoo, Nirod Chandra
Geok, Tan Kim
APPLIED SOFT COMPUTING, 2008, 8 (04) : 1643 - 1653
[29] On the complexity of equal shortest path routing
Giroire, Frederic
Perennes, Stephane
Tahiri, Issam
NETWORKS, 2015, 65 (04) : 344 - 352
[30] A NEW UPPER BOUND ON THE COMPLEXITY OF THE ALL PAIRS SHORTEST-PATH PROBLEM
TAKAOKA, T
INFORMATION PROCESSING LETTERS, 1992, 43 (04) : 195 - 199

← 1 2 3 4 5 →