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 条
  • [1] Complexity analysis and optimization of the shortest path tour problem
    Paola Festa
    Optimization Letters, 2012, 6 : 163 - 175
  • [2] Solving the shortest path tour problem
    Festa, P.
    Guerriero, F.
    Lagana, D.
    Musmanno, R.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2013, 230 (03) : 464 - 474
  • [3] The constrained shortest path tour problem
    Ferone, Daniele
    Festa, Paola
    Guerriero, Francesca
    Lagana, Demetrio
    COMPUTERS & OPERATIONS RESEARCH, 2016, 74 : 64 - 77
  • [4] Shortest path tour problem with time windows
    Pugliese, Luigi Di Puglia
    Ferone, Daniele
    Festa, Paola
    Guerriero, Francesca
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 282 (01) : 334 - 344
  • [5] A generalized shortest path tour problem with time windows
    L. Di Puglia Pugliese
    D. Ferone
    P. Festa
    F. Guerriero
    Computational Optimization and Applications, 2022, 83 : 593 - 614
  • [6] A generalized shortest path tour problem with time windows
    Pugliese, L. Di Puglia
    Ferone, D.
    Festa, P.
    Guerriero, F.
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2022, 83 (02) : 593 - 614
  • [7] On the complexity of the shortest-path broadcast problem
    Crescenzi, Pierluigi
    Fraigniaud, Pierre
    Halldorsson, Magnus
    Harutyunyan, Hovhannes A.
    Pierucci, Chiara
    Pietracaprina, Andrea
    Pucci, Geppino
    DISCRETE APPLIED MATHEMATICS, 2016, 199 : 101 - 109
  • [8] THE COMPLEXITY ANALYSIS OF THE SHORTEST PATH IMPROVEMENT PROBLEM UNDER THE HAMMING DISTANCE
    Zhang, Binwu
    Guan, Xiucui
    Wang, Qin
    He, Chunyuan
    Sackey, Samson Hansen
    PACIFIC JOURNAL OF OPTIMIZATION, 2015, 11 (04): : 605 - 618
  • [9] An efficient exact approach for the constrained shortest path tour problem
    Ferone, Daniele
    Festa, Paola
    Guerriero, Francesca
    OPTIMIZATION METHODS & SOFTWARE, 2020, 35 (01): : 1 - 20
  • [10] Constrained shortest path tour problem: Branch-and-Price algorithm
    Martin, Sebastien
    Magnouche, Youcef
    Juvigny, Corentin
    Leguay, Jeremie
    COMPUTERS & OPERATIONS RESEARCH, 2022, 144
12345