Models and algorithms for shortest paths in a time dependent network

被引：0
|
作者：
Li, Yinzhen [1 ]
He, Ruichun [1 ]
Zhang, Zhongfu [1 ]
Gu, Yaohuang [1 ]
机构：
[1] Lanzhou Jiaotong Univ, Lanzhou 730070, Peoples R China
来源：
OPERATIONS RESEARCH AND ITS APPLICATIONS | 2005年 / 5卷
关键词：
time dependent networks; shortest path; model; genetic algorithm; traffic and transportation;
D O I：
暂无
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
The shortest path problem in the time dependent network is an important extension of the classical shortest path problem and has been widely applied in real life. It is known as nonlinear and NP-hard. Therefore, the algorithms of the classical shortest path are incapable to solve this problem. In this paper, the models of the shortest path problem in the time dependent network are formulated and algorithms are designed for solving the proposed models. Finally, a numerical example is given.
引用
收藏
页码：319 / 328
页数：10
相关论文
共 50 条
  • [1] The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms
    Sherali, HD
    Ozbay, K
    Subramanian, S
    NETWORKS, 1998, 31 (04) : 259 - 272
  • [2] Shortest paths in a network with time-dependent flow speeds
    Sung, K
    Bell, MGH
    Seong, M
    Park, S
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 121 (01) : 32 - 39
  • [3] ALGORITHMS FOR FINDING THE K-SHORTEST PATHS IN A NETWORK
    SHIER, DR
    NETWORKS, 1979, 9 (03) : 195 - 214
  • [4] On the Complexity of Time-Dependent Shortest Paths
    Foschini, Luca
    Hershberger, John
    Suri, Subhash
    PROCEEDINGS OF THE TWENTY-SECOND ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2011, : 327 - 341
  • [5] On the Complexity of Time-Dependent Shortest Paths
    Luca Foschini
    John Hershberger
    Subhash Suri
    Algorithmica, 2014, 68 : 1075 - 1097
  • [6] On the Complexity of Time-Dependent Shortest Paths
    Foschini, Luca
    Hershberger, John
    Suri, Subhash
    ALGORITHMICA, 2014, 68 (04) : 1075 - 1097
  • [7] Shortest Paths in Time-Dependent FIFO Networks
    Dehne, Frank
    Omran, Masoud T.
    Sack, Joerg-Ruediger
    ALGORITHMICA, 2012, 62 (1-2) : 416 - 435
  • [8] Shortest Paths in Time-Dependent FIFO Networks
    Frank Dehne
    Masoud T. Omran
    Jörg-Rüdiger Sack
    Algorithmica, 2012, 62 : 416 - 435
  • [9] Improved Approximation for Time-Dependent Shortest Paths
    Omran, Masoud
    Sack, Joerg-Ruediger
    COMPUTING AND COMBINATORICS, COCOON 2014, 2014, 8591 : 453 - 464
  • [10] Querying Shortest Paths on Time Dependent Road Networks
    Wang, Yong
    Li, Guoliang
    Tang, Nan
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2019, 12 (11): : 1249 - 1261
12345