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 条
  • [41] A DECOMPOSITION ALGORITHM FOR SHORTEST PATHS IN A NETWORK
    HU, TC
    OPERATIONS RESEARCH, 1968, 16 (01) : 91 - &
  • [42] Network orientation via shortest paths
    Silverbush, Dana
    Sharan, Roded
    BIOINFORMATICS, 2014, 30 (10) : 1449 - 1455
  • [43] Shortest Paths in a Hybrid Network Model
    Augustine, John
    Hinnenthal, Kristian
    Kuhn, Fabian
    Seheideler, Christian
    Schneider, Philipp
    PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2020, : 1280 - 1299
  • [44] A K-SHORTEST PATHS ROUTING HEURISTIC FOR STOCHASTIC NETWORK EVACUATION MODELS
    KARBOWICZ, CJ
    SMITH, JM
    ENGINEERING OPTIMIZATION, 1984, 7 (04) : 253 - 280
  • [45] Finding K shortest looping paths with waiting time in a time-window network
    Yang, HH
    Chen, YL
    APPLIED MATHEMATICAL MODELLING, 2006, 30 (05) : 458 - 465
  • [46] Nonadditive Shortest Paths: Subproblems in Multi-Agent Competitive Network Models
    Steven A. Gabriel
    David Bernstein
    Computational & Mathematical Organization Theory, 2000, 6 (1): : 29 - 45
  • [47] Improved algorithms for the k simple shortest paths and the replacement paths problems
    Gotthilf, Zvi
    Lewenstein, Moshe
    INFORMATION PROCESSING LETTERS, 2009, 109 (07) : 352 - 355
  • [48] Multi-criteria shortest paths in time-dependent train networks
    Disser, Yann
    Mueller-Hannemann, Matthias
    Schnee, Mathias
    EXPERIMENTAL ALGORITHMS, PROCEEDINGS, 2008, 5038 : 347 - +
  • [49] Shortest paths between shortest paths
    Kaminski, Marcin
    Medvedev, Paul
    Milanic, Martin
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (39) : 5205 - 5210
  • [50] Shortest paths in matrix multiplication time
    Sankowski, P
    ALGORITHMS - ESA 2005, 2005, 3669 : 770 - 778
12345