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 条
  • [21] A shortest path problem in a stochastic network with exponential travel time
    Peer, S. K.
    Sharma, Dinesh K.
    Chakraborty, B.
    Jana, R. K.
    INTERNATIONAL JOURNAL OF APPLIED MANAGEMENT SCIENCE, 2021, 13 (03) : 179 - 199
  • [22] A simplification of the double-sweep algorithm to solve the k-shortest path problem
    Rink, KA
    Rodin, EY
    Sundarapandian, V
    APPLIED MATHEMATICS LETTERS, 2000, 13 (08) : 77 - 85
  • [23] The Shortest Path Problem on a Fuzzy Time-Dependent Network
    Huang, Wei
    Ding, Lixin
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2012, 60 (11) : 3376 - 3385
  • [24] A GENERALIZED PERMANENT LABELING ALGORITHM FOR THE SHORTEST-PATH PROBLEM WITH TIME WINDOWS
    DESROCHERS, M
    SOUMIS, F
    INFOR, 1988, 26 (03) : 191 - 212
  • [25] Reachability for airline networks: fast algorithm for shortest path problem with time windows
    Gao, Xiaofeng
    Xianzang, Yueyang
    You, Xiaotian
    Dang, Yaru
    Chen, Guihai
    Wang, Xinglong
    THEORETICAL COMPUTER SCIENCE, 2018, 749 : 66 - 79
  • [26] Research on the algorithm for K-shortest paths problem based on A* in complicated network
    Chen, Lichao
    Liu, Jia
    Zhang, Yingjun
    Xie, Binhong
    PROCEEDINGS OF THE SIXTH IEEE INTERNATIONAL CONFERENCE ON COGNITIVE INFORMATICS, 2007, : 419 - +
  • [27] COMPUTING K-SHORTEST PATH LENGTHS IN EUCLIDEAN NETWORKS
    SKISCIM, CC
    GOLDEN, BL
    NETWORKS, 1987, 17 (03) : 341 - 352
  • [28] A recurrent neural network for solving the shortest path problem
    Wang, J
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-FUNDAMENTAL THEORY AND APPLICATIONS, 1996, 43 (06): : 482 - 486
  • [29] Solving the shortest path problem using an analog network
    Bu, LK
    Chiueh, TD
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 1999, 46 (11) : 1360 - 1363
  • [30] Solving the Network Shortest Path Problem on a Quantum Annealer
    Krauss T.
    McCollum J.
    IEEE Transactions on Quantum Engineering, 2020, 1
12345