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 条
  • [41] On the Quadratic Shortest Path Problem
    Rostami, Borzou
    Malucelli, Federico
    Frey, Davide
    Buchheim, Christoph
    EXPERIMENTAL ALGORITHMS, SEA 2015, 2015, 9125 : 379 - 390
  • [42] A Shortest-Path Algorithm for the Departure Time and Speed Optimization Problem
    Franceschetti, Anna
    Honhon, Dorothee
    Laporte, Gilbert
    Van Woensel, Tom
    TRANSPORTATION SCIENCE, 2018, 52 (04) : 756 - 768
  • [43] 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
  • [44] The Optimal Path Tour Problem
    Yan, Chao
    Gao, Cai
    Yu, Jianjun
    Deng, Yong
    Nan, Kai
    INTERNATIONAL JOURNAL OF UNCONVENTIONAL COMPUTING, 2014, 10 (5-6) : 429 - 454
  • [45] Combinations of Some Shop Scheduling Problems and the Shortest Path Problem: Complexity and Approximation Algorithms
    Nip, Kameng
    Wang, Zhenbo
    Xing, Wenxun
    COMPUTING AND COMBINATORICS, 2015, 9198 : 97 - 108
  • [46] Analysis of a Simple Evolutionary Algorithm for the Multiobjective Shortest Path Problem
    Horoba, Christian
    FOGA'09: PROCEEDINGS OF THE 10TH ACM SIGRVO CONFERENCE ON FOUNDATIONS OF GENETIC ALGORITHMS, 2009, : 113 - 120
  • [47] Analysis of FPTASes for the multi-objective shortest path problem
    Breugem, Thomas
    Dollevoet, Twan
    van den Heuvel, Wilco
    COMPUTERS & OPERATIONS RESEARCH, 2017, 78 : 44 - 58
  • [48] Competitive analysis for the on-line fuzzy shortest path problem
    Ma, WM
    Chen, GQ
    PROCEEDINGS OF 2005 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-9, 2005, : 862 - 867
  • [49] An extended shortest path problem: A data envelopment analysis approach
    Amirteimoori, Alireza
    APPLIED MATHEMATICS LETTERS, 2012, 25 (11) : 1839 - 1843
  • [50] Complexity of pairwise shortest path routing in the grid
    Gonzalez, TF
    Serena, D
    THEORETICAL COMPUTER SCIENCE, 2004, 326 (1-3) : 155 - 185
12345