Shortest path algorithm in time-dependent network

Jisuanji Xuebao/Chinese Journal of Computers

Volumn 25, Issue 2, 2002, Pages 165-172

  Tan, Guo Zhen ^a   Gao, Wen ^a  

^a DALIAN UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

Algorithms; Network optimality; Shortest paths; Time dependent networks

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; OPTIMIZATION;

NETWORKS OPTIMIZATION; SHORTEST PATHS; TIME DEPENDENT NETWORKS;

GRAPH THEORY;

EID: 0036462915     PISSN: 02544164     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (20)

1. Shortest path algorithm for adaptive routing in communications networks
2. Floats, integers, and single source shortest paths
3. Time work tradeoffs of the single source shortest pats problem
4. Shortest path routing in arbitrary networks
5. Fully dynamic algorithms for maintaining shortest paths trees
6. An O(nm)-time network simple algorithm for the shortest path problem
7. Shortest-path algorithms: Taxonomy and annotation
8. Shortest paths algorithms: Theory and experimental evaluation
9. Shortest paths algorithms: Design, analysis, implementation and experimental evaluation
10. Minimum time paths in a network with mixed time constraints
11. An appraisal of some shortest path algorithms
12. Fastest path in time-dependent networks for intelligent vehicle-highway systems application
13. Shortest paths in a network with time-dependent flow speeds
14. Shortest path and minimum-delay algorithm in networks with time-dependent edge-length
15. Distributed shortest path protocols for time dependent networks
16. Shortest path problems with time constraints
17. Approaches of vehicle traveling route choice based on urban transportation control systems