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 条
  • [31] 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
  • [32] Complexity of Inverse Shortest Path Routing
    Call, Mikael
    Holmberg, Kaj
    NETWORK OPTIMIZATION, 2011, 6701 : 339 - 353
  • [33] Shortest Path Tour Problem Based Integer Linear Programming for Service Chaining in NFV Networks
    Sasabe, Masahiro
    Hara, Takanori
    PROCEEDINGS OF THE 2020 6TH IEEE CONFERENCE ON NETWORK SOFTWARIZATION (NETSOFT 2020): BRIDGING THE GAP BETWEEN AI AND NETWORK SOFTWARIZATION, 2020, : 114 - 121
  • [34] On the robust shortest path problem
    Yu, G
    Yang, J
    COMPUTERS & OPERATIONS RESEARCH, 1998, 25 (06) : 457 - 468
  • [35] Neutrosophic Shortest Path Problem
    Kumar, Ranjan
    Edaltpanah, S. A.
    Jha, Sripati
    Broumi, Said
    Dey, Arindam
    NEUTROSOPHIC SETS AND SYSTEMS, 2018, 23 : 5 - 15
  • [36] CONSTRAINED SHORTEST PATH PROBLEM
    ANEJA, YP
    NAIR, KPK
    NAVAL RESEARCH LOGISTICS, 1978, 25 (03) : 549 - 555
  • [37] 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
  • [38] On the shortest α-reliable path problem
    Corredor-Montenegro, David
    Cabrera, Nicolas
    Akhavan-Tabatabaei, Raha
    Medaglia, Andres L.
    TOP, 2021, 29 (01) : 287 - 318
  • [39] Fuzzy shortest path problem
    Okada, Shinkoh
    Gen, Mitsuo
    Computers and Industrial Engineering, 1994, 27 (1-4): : 465 - 468
  • [40] On the Quadratic Shortest Path Problem
    Rostami, Borzou
    Malucelli, Federico
    Frey, Davide
    Buchheim, Christoph
    EXPERIMENTAL ALGORITHMS, SEA 2015, 2015, 9125 : 379 - 390
12345