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 条
  • [21] Improved Algorithms for Dynamic Shortest Paths
    H. N. Djidjev
    G. E. Pantziou
    C. D. Zaroliagis
    Algorithmica, 2000, 28 : 367 - 389
  • [22] TIME AND SPACE EFFICIENT ALGORITHMS FOR SHORTEST PATHS BETWEEN CONVEX POLYGONS
    ROHNERT, H
    INFORMATION PROCESSING LETTERS, 1988, 27 (04) : 175 - 179
  • [23] Efficient Estimation of Time-Dependent Shortest Paths Based on Shortcuts
    Liao, Linbo
    Yang, Shipeng
    Lai, Yongxuan
    Zeng, Wenhua
    Yang, Fan
    Jiang, Min
    ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING, ICA3PP 2021, PT II, 2022, 13156 : 18 - 32
  • [24] Constant time algorithms for the edge and vertex insertion problem with respect to shortest paths
    Venema, S
    Shen, H
    Suraweera, F
    INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-IV, PROCEEDINGS, 1998, : 1792 - 1795
  • [25] DYNAMIC ALGORITHMS FOR SHORTEST PATHS IN PLANAR GRAPHS
    FEUERSTEIN, E
    MARCHETTISPACCAMELA, A
    THEORETICAL COMPUTER SCIENCE, 1993, 116 (02) : 359 - 371
  • [26] Centrality of shortest paths: Algorithms and complexity results
    Phosavanh, Johnson
    Matsypura, Dmytro
    arXiv,
  • [27] DYNAMIC ALGORITHMS FOR SHORTEST PATHS IN PLANAR GRAPHS
    FEUERSTEIN, E
    MARCHETTISPACCAMELA, A
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 570 : 187 - 197
  • [28] Distributed Approximation Algorithms for Weighted Shortest Paths
    Nanongkai, Danupon
    STOC'14: PROCEEDINGS OF THE 46TH ANNUAL 2014 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2014, : 565 - 573
  • [29] Massively Parallel Algorithms for Approximate Shortest Paths
    Dory, Michal
    Matar, Shaked
    PROCEEDINGS OF THE 36TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, SPAA 2024, 2024, : 415 - 426
  • [30] Approximation algorithms for shortest descending paths in terrains
    Ahmed, Mustaq
    Das, Sandip
    Lodha, Sachin
    Lubiw, Anna
    Maheshwari, Anil
    Roy, Sasanka
    JOURNAL OF DISCRETE ALGORITHMS, 2010, 8 (02) : 214 - 230
12345