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 条
  • [41] Adaptations of k-Shortest Path Algorithms for Transportation Networks
    Scano, Gregoire
    Huguet, Marie-Jose
    Ngueveu, Sandra Ulrich
    2015 INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND SYSTEMS MANAGEMENT (IESM), 2015, : 663 - 669
  • [42] An O(nm)-time network simplex algorithm for the shortest path problem
    Goldfarb, D
    Jin, ZY
    OPERATIONS RESEARCH, 1999, 47 (03) : 445 - 448
  • [43] O(nm)-time network simplex algorithm for the shortest path problem
    Columbia University, New York, NY, United States
    不详
    Oper Res, 3 (445-448):
  • [44] A dynamic programming algorithm for the shortest path problem with time windows and linear node costs
    Ioachim, I
    Gelinas, S
    Soumis, F
    Desrosiers, J
    NETWORKS, 1998, 31 (03) : 193 - 204
  • [45] A time-varying neural network for solving minimum spanning tree problem on time-varying network
    Xu, Zhilei
    Huang, Wei
    Wang, Jinsong
    NEUROCOMPUTING, 2021, 466 : 139 - 147
  • [46] An Empirical Comparison of k-Shortest Simple Path Algorithms on Multicores
    Ajwani, Deepak
    Duriakova, Erika
    Hurley, Neil
    Meyer, Ulrich
    Schickedanz, Alexander
    PROCEEDINGS OF THE 47TH INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING, 2018,
  • [47] ROUTE ASSIGNMENT BASED ON K-SHORTEST PATHS PROBLEM
    Majer, Tomas
    QUANTITATIVE METHODS IN ECONOMICS [MULTIPLE CRITERIA DECISION MAKING XV], 2010, : 117 - 126
  • [48] Implementation of K-shortest path algorithm in GPU using CUDA
    AvadheshPratapSingh
    DhirendraPratapSingh
    INTERNATIONAL CONFERENCE ON COMPUTER, COMMUNICATION AND CONVERGENCE (ICCC 2015), 2015, 48 : 5 - 13
  • [49] K-Shortest Path Algorithm for Overlay Protection in Optical Networks
    Wang, Xi
    Zhang, Qiong
    Palacharla, Paparao
    Naito, Takao
    2009 14TH OPTOELECTRONICS AND COMMUNICATIONS CONFERENCE (OECC 2009), 2009, : 60 - 61
  • [50] Time-varying shortest path problems with constraints
    Cai, X
    Kloks, T
    Wong, CK
    NETWORKS, 1997, 29 (03) : 141 - 149
12345