Skip to main content
main-content

Tipp

Weitere Kapitel dieses Buchs durch Wischen aufrufen

2022 | OriginalPaper | Buchkapitel

4. Rerouting Path Generation in Emergency

verfasst von: Limin Jia, Li Wang, Yong Qin

Erschienen in: High-Speed Railway Operation Under Emergent Conditions

Verlag: Springer Berlin Heidelberg

share
TEILEN

Abstract

Generally, there are three types of traffic paths: shortest path, specific path, and detour path (Dijkstra in Numer Math 1:269–271, 1959). The shortest path refers to the path with the shortest transportation distance among multiple paths existing between any arrival and departure station, which is adopted by passenger trains under normal operation conditions.
Literatur
2.
3.
Zurück zum Zitat Ford LR Jr, Fulkerson DR (1962) Flows in networks. Princeton University Press, Princeton Ford LR Jr, Fulkerson DR (1962) Flows in networks. Princeton University Press, Princeton
4.
Zurück zum Zitat Allottino S (1984) Shortest-path methods: complexity, interrelations and new propositions. Networks 14:257–267 CrossRef Allottino S (1984) Shortest-path methods: complexity, interrelations and new propositions. Networks 14:257–267 CrossRef
5.
Zurück zum Zitat Glover F, Glover R, Klingman D (1984) Computational study of an improved shortest path algorithm. Network 14:25–37 CrossRef Glover F, Glover R, Klingman D (1984) Computational study of an improved shortest path algorithm. Network 14:25–37 CrossRef
6.
Zurück zum Zitat Glover F, Klingman D, Phillips N (1985) A new polynomially bounded shortest paths algorithm. Oper Res 33:65–73 MathSciNetCrossRef Glover F, Klingman D, Phillips N (1985) A new polynomially bounded shortest paths algorithm. Oper Res 33:65–73 MathSciNetCrossRef
7.
Zurück zum Zitat Anning NI, Zhicai J, Linjie G (2006) An overview of research on parallel shortest path algorithm in transportation network. J Highw Transp Res Dev 23(12):128–132 (in Chinese) Anning NI, Zhicai J, Linjie G (2006) An overview of research on parallel shortest path algorithm in transportation network. J Highw Transp Res Dev 23(12):128–132 (in Chinese)
8.
Zurück zum Zitat Tseng P, Bertsekas DP (1990) Parallel algorithms for network flow and other problems. SIAM J Control Optim 28(3):678–710 MathSciNetCrossRef Tseng P, Bertsekas DP (1990) Parallel algorithms for network flow and other problems. SIAM J Control Optim 28(3):678–710 MathSciNetCrossRef
9.
Zurück zum Zitat Paige RC, Kruskal CP (1985) Parallel algorithms for shortest path problems. In: Proceedings of the international conference on parallel processing, 14–20 Paige RC, Kruskal CP (1985) Parallel algorithms for shortest path problems. In: Proceedings of the international conference on parallel processing, 14–20
10.
Zurück zum Zitat Chandy KM, Misra J (1982) Distributed computation on graphs: shortest path algorithms. Commun ACM 25(11):833–837 MathSciNetCrossRef Chandy KM, Misra J (1982) Distributed computation on graphs: shortest path algorithms. Commun ACM 25(11):833–837 MathSciNetCrossRef
11.
Zurück zum Zitat Habbal M (1994) A decomposition algorithm for the all-pairs shortest path problem on massively parallel computer architectures. Transp Sci 28(3):273–290 MathSciNetMATH Habbal M (1994) A decomposition algorithm for the all-pairs shortest path problem on massively parallel computer architectures. Transp Sci 28(3):273–290 MathSciNetMATH
12.
Zurück zum Zitat Dey S, Srimani PK (1989) Fast parallel algorithm for all pairs shortest path problem and its VLSI implementation. IEE Proc Part E: Comput Dig Tech 136(2):85–89 Dey S, Srimani PK (1989) Fast parallel algorithm for all pairs shortest path problem and its VLSI implementation. IEE Proc Part E: Comput Dig Tech 136(2):85–89
13.
Zurück zum Zitat He R, Li Y (2008) Model of time-dependent network paths and two-level optimal intelligent algorithm. J China Railw Soc 30: 32–37 (in Chinese) He R, Li Y (2008) Model of time-dependent network paths and two-level optimal intelligent algorithm. J China Railw Soc 30: 32–37 (in Chinese)
14.
Zurück zum Zitat Guozhen T, Wen G (2002) Shortest path algorithm in time-dependent networks. Chin J Comput 25:165–172 (in Chinese) MathSciNet Guozhen T, Wen G (2002) Shortest path algorithm in time-dependent networks. Chin J Comput 25:165–172 (in Chinese) MathSciNet
15.
Zurück zum Zitat Chen Jingrong Yu, Jianning LY (2012) Network path optimization since multi-attribute random events. J Southwest Jiaotong Univ 47(2):291–298 (in Chinese) MATH Chen Jingrong Yu, Jianning LY (2012) Network path optimization since multi-attribute random events. J Southwest Jiaotong Univ 47(2):291–298 (in Chinese) MATH
16.
Zurück zum Zitat Xiaojun K, Maocai W (2008) Shortest path algorithm implements based on genetic algorithm. Comput Eng Appl 44(23):22–23 (in Chinese) Xiaojun K, Maocai W (2008) Shortest path algorithm implements based on genetic algorithm. Comput Eng Appl 44(23):22–23 (in Chinese)
17.
Zurück zum Zitat Shijie S, Gaofeng L, Zhongyou Z et al (2010) An improved ant colony algorithm solving the shortest path and TSP problem. Comput Technol Dev 20(4):144–147 (in Chinese) Shijie S, Gaofeng L, Zhongyou Z et al (2010) An improved ant colony algorithm solving the shortest path and TSP problem. Comput Technol Dev 20(4):144–147 (in Chinese)
18.
Zurück zum Zitat Changlin J (2012) Research and implementation of urban road network dynamic shortest path search based on distributed ant colony algorithm. Beijing Jiaotong University, Beijing (in Chinese) Changlin J (2012) Research and implementation of urban road network dynamic shortest path search based on distributed ant colony algorithm. Beijing Jiaotong University, Beijing (in Chinese)
19.
Zurück zum Zitat Ghoseiri K, Nadjari B (2010) An ant colony optimization algorithm for the bi-objective shortest path problem. Appl Soft Comput 10(4):1237–1246 CrossRef Ghoseiri K, Nadjari B (2010) An ant colony optimization algorithm for the bi-objective shortest path problem. Appl Soft Comput 10(4):1237–1246 CrossRef
20.
Zurück zum Zitat Ji XY, Iwamura K, Shao Z (2007) New models for shortest path problem with fuzzy arc lengths. Appl Math Model 31(2):259–269 CrossRef Ji XY, Iwamura K, Shao Z (2007) New models for shortest path problem with fuzzy arc lengths. Appl Math Model 31(2):259–269 CrossRef
21.
Zurück zum Zitat Dengfeng C, Dengrong Z (2002) Algorithm and its application to N shortest paths problem. J Zhejiang Univ (Eng Sci) 36(5):531–534 (in Chinese) Dengfeng C, Dengrong Z (2002) Algorithm and its application to N shortest paths problem. J Zhejiang Univ (Eng Sci) 36(5):531–534 (in Chinese)
22.
Zurück zum Zitat Bai Yiduo Hu, Peng XL et al (2009) A kth-shortest path algorithm based on k-1 shortest paths. Geomat Inf Sci Wuhan Univ 34(4):492–494 (in Chinese) Bai Yiduo Hu, Peng XL et al (2009) A kth-shortest path algorithm based on k-1 shortest paths. Geomat Inf Sci Wuhan Univ 34(4):492–494 (in Chinese)
23.
Zurück zum Zitat Meng XL, Jia LM (2009) Paths generating in emergency on China new railway network. J Beijing Inst Technol 19(S2):84–88 MathSciNet Meng XL, Jia LM (2009) Paths generating in emergency on China new railway network. J Beijing Inst Technol 19(S2):84–88 MathSciNet
24.
Zurück zum Zitat Xuelei M (2011) Research on theory and method of vehicle operation organization under emergency conditions. Beijing Jiaotong University, Beijing (in Chinese) Xuelei M (2011) Research on theory and method of vehicle operation organization under emergency conditions. Beijing Jiaotong University, Beijing (in Chinese)
Metadaten
Titel
Rerouting Path Generation in Emergency
verfasst von
Limin Jia
Li Wang
Yong Qin
Copyright-Jahr
2022
Verlag
Springer Berlin Heidelberg
DOI
https://doi.org/10.1007/978-3-662-63033-4_4

Stellenausschreibungen

Anzeige

Premium Partner