Solving the k-shortest path problem with time windows in a time varying network

被引：20
|
作者：
Androutsopoulos, Konstantinos N. [1 ]
Zografos, Konstantinos G. [1 ]
机构：
[1] Athens Univ Econ & Business, Dept Management Sci & Technol, Transportat Syst & Logist Lab, Athens 11362, Greece
来源：
OPERATIONS RESEARCH LETTERS | 2008年 / 36卷 / 06期
关键词：
k-shortest path; Routing and scheduling; Dynamic programming;
D O I：
10.1016/j.orl.2008.07.003
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
The k-shortest path problem in a network with time dependent cost attributes arises in many transportation decisions including hazardous materials routing and urban trip planning. The present paper proposes a label setting algorithm for solving this problem given that departure and arrival are constrained within specified time windows.(C) 2008 Elsevier B.V. All rights reserved.
引用
收藏
页码：692 / 695
页数：4
相关论文
共 50 条
  • [31] Solving the shortest path problem using an analog network
    Bu, Linkai
    Chiueh, Tzi-Dar
    IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications, 1999, 46 (11): : 1360 - 1363
  • [32] Uncertainty-Based Map Matching: The Space-Time Prism and k-Shortest Path Algorithm
    Kuijpers, Bart
    Moelans, Bart
    Othman, Walied
    Vaisman, Alejandro
    ISPRS INTERNATIONAL JOURNAL OF GEO-INFORMATION, 2016, 5 (11)
  • [33] SHORTEST ROUTE PROBLEM WITH SOFT TIME WINDOWS
    Braekers, Kris
    Janssens, Gerrit K.
    EUROPEAN SIMULATION AND MODELLING CONFERENCE 2013, 2013, : 279 - 283
  • [34] Solving the K-shortest paths problem in timetable-based public transportation systems
    Wang, Shuai
    Yang, Yang
    Hu, Xiaolin
    Li, Jianmin
    Xu, Bingji
    JOURNAL OF INTELLIGENT TRANSPORTATION SYSTEMS, 2016, 20 (05) : 413 - 427
  • [35] The time-varying shortest path problem with fuzzy transit costs and speedup
    Rezapour, Hassan
    Shirdel, Gholamhassan
    ACTA UNIVERSITATIS SAPIENTIAE-MATHEMATICA, 2016, 8 (01) : 166 - 173
  • [36] A rapid algorithm to find replacement services for K-Shortest path problem with QoS constraints
    Hu, Jianqiang
    Feng, Xingzhi
    Zhang, Zhiwei
    Wu, Quanyuan
    2007 IFIP INTERNATIONAL CONFERENCE ON NETWORK AND PARALLEL COMPUTING WORKSHOPS, PROCEEDINGS, 2007, : 710 - +
  • [37] An adaptive time-varying neural network for solving K optimal time-varying destroy locations query problem
    Xu, Zhilei
    Huang, Wei
    KNOWLEDGE-BASED SYSTEMS, 2024, 303
  • [38] ALGORITHMS FOR FINDING THE K-SHORTEST PATHS IN A NETWORK
    SHIER, DR
    NETWORKS, 1979, 9 (03) : 195 - 214
  • [39] Time version of the shortest path problem in a stochastic-flow network
    Lin, Yi-Kuei
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2009, 228 (01) : 150 - 157
  • [40] Path enumeration by finding the constrained K-shortest paths
    van der Zijpp, NJ
    Catalano, SF
    TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2005, 39 (06) : 545 - 563
12345