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 条
  • [11] A New(?) k-Shortest Path Algorithm
    Paluch, Stanislav
    PROCEEDINGS OF 30TH INTERNATIONAL CONFERENCE MATHEMATICAL METHODS IN ECONOMICS, PTS I AND II, 2012, : 664 - 669
  • [12] A NEW FORMULATION TO THE SHORTEST PATH PROBLEM WITH TIME WINDOWS AND CAPACITY CONSTRAINTS
    Dondo, R.
    LATIN AMERICAN APPLIED RESEARCH, 2012, 42 (03) : 257 - 265
  • [13] The electric vehicle shortest path problem with time windows and prize collection
    Cassia, Antonio
    Jabali, Ola
    Malucelli, Federico
    Pascoal, Marta
    PROCEEDINGS OF THE 2022 17TH CONFERENCE ON COMPUTER SCIENCE AND INTELLIGENCE SYSTEMS (FEDCSIS), 2022, : 313 - 322
  • [14] A Modified K-Shortest Paths Algorithm for Solving the Earliest Arrival Problem on the Time-Dependent Model of Transportation Systems
    Yang, Yang
    Wang, Shuai
    Hu, Xiaolin
    Li, Jianmin
    Xu, Bingji
    INTERNATIONAL MULTICONFERENCE OF ENGINEERS AND COMPUTER SCIENTIST, IMECS 2012, VOL II, 2012, : 1562 - 1567
  • [15] A Note on k-Shortest Paths Problem
    Gravin, Nick
    Chen, Ning
    JOURNAL OF GRAPH THEORY, 2011, 67 (01) : 34 - 37
  • [16] Assessing the effectiveness of k-shortest path sets in problems of network interdiction
    Yates, Justin
    Wang, Xinghua
    Chen, Nannan
    OPTIMIZATION AND ENGINEERING, 2014, 15 (03) : 721 - 749
  • [17] Optimization of modern tram network based on k-shortest path algorithm
    Hu, Junhong
    Guo, Xiucheng
    Tao, Tao
    Hu, Tingting
    Dongnan Daxue Xuebao (Ziran Kexue Ban)/Journal of Southeast University (Natural Science Edition), 2017, 47 (06): : 1274 - 1278
  • [18] k-PathA: k-shortest Path Algorithm
    Ullrich, Alexander
    Forst, Christian V.
    2009 INTERNATIONAL WORKSHOP ON HIGH PERFORMANCE COMPUTATIONAL SYSTEMS BIOLOGY, PROCEEDINGS, 2009, : 23 - +
  • [19] Assessing the effectiveness of k-shortest path sets in problems of network interdiction
    Justin Yates
    Xinghua Wang
    Nannan Chen
    Optimization and Engineering, 2014, 15 : 721 - 749
  • [20] K-Shortest Path Network Problem Solution with a Hybrid Genetic Algorithm: Particle Swarm Optimization Algorithm
    Kusetogullari, H.
    Leeson, M. S.
    Ren, W.
    Hines, E. L.
    2011 13TH INTERNATIONAL CONFERENCE ON TRANSPARENT OPTICAL NETWORKS (ICTON), 2011,
12345