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 条

[31] Shortest paths algorithms: Theory and experimental evaluation
Cherkassky, BV
Goldberg, AV
Radzik, T
MATHEMATICAL PROGRAMMING, 1996, 73 (02) : 129 - 174
[32] Shortest paths algorithms: Theory and experimental evaluation
Central Institute for Economics and Mathematics, Krasikova St. 32, Moscow, 117418, Russia
不详
不详
Mathematical Programming, Series B, 1996, 73 (02): : 129 - 174
[33] ERRATA - REVISED MATRIX ALGORITHMS FOR SHORTEST PATHS
HU, TC
SIAM JOURNAL ON APPLIED MATHEMATICS, 1967, 15 (06) : 1517 - &
[34] Improved Distributed Algorithms for Exact Shortest Paths
Ghaffari, Mohsen
Li, Jason
STOC'18: PROCEEDINGS OF THE 50TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2018, : 431 - 444
[35] EFFICIENT ALGORITHMS FOR SHORTEST PATHS IN SPARSE NETWORKS
JOHNSON, DB
JOURNAL OF THE ACM, 1977, 24 (01) : 1 - 13
[36] Algorithms for time-dependent bicriteria shortest path problems
Hamacher, Horst W.
Ruzika, Stefan
Tjandra, Stevanus A.
DISCRETE OPTIMIZATION, 2006, 3 (03) : 238 - 254
[37] Finding the first K shortest paths in a time-window network
Chen, YL
Yang, HH
COMPUTERS & OPERATIONS RESEARCH, 2004, 31 (04) : 499 - 513
[38] Shortest Paths in Stochastic Time-Dependent Networks with Link Travel Time Correlation
Dong, Wei
Vu, Hai L.
Nazarathy, Yoni
Bao Quoc Vo
Li, Minyi
Hoogendoorn, Serge Paul
TRANSPORTATION RESEARCH RECORD, 2013, (2338) : 58 - 66
[39] Incremental network design with shortest paths
Baxter, Matthew
Elgindy, Tarek
Ernst, Andreas T.
Kalinowski, Thomas
Savelsbergh, Martin W. P.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 238 (03) : 675 - 684
[40] Shortest Paths in a Hybrid Network Model
Augustine, John
Hinnenthal, Kristian
Kuhn, Fabian
Scheideler, Christian
Schneider, Philipp
PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 1280 - 1299

← 1 2 3 4 5 →