Skip to main content
SpringerLink
Log in

Rerouting Path Generation in Emergency

  • Chapter
  • First Online:
High-Speed Railway Operation Under Emergent Conditions

Part of the book series: Advances in High-speed Rail Technology ((ADVHIGHSPEED))

  • 216 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 149.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 199.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1:269–271

    Article  MathSciNet  Google Scholar 

  2. Bellman RE (1958) On a routing problem. Q Appl Math 16:87–90

    Article  Google Scholar 

  3. Ford LR Jr, Fulkerson DR (1962) Flows in networks. Princeton University Press, Princeton

    Google Scholar 

  4. Allottino S (1984) Shortest-path methods: complexity, interrelations and new propositions. Networks 14:257–267

    Article  Google Scholar 

  5. Glover F, Glover R, Klingman D (1984) Computational study of an improved shortest path algorithm. Network 14:25–37

    Article  Google Scholar 

  6. Glover F, Klingman D, Phillips N (1985) A new polynomially bounded shortest paths algorithm. Oper Res 33:65–73

    Article  MathSciNet  Google Scholar 

  7. 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)

    Google Scholar 

  8. Tseng P, Bertsekas DP (1990) Parallel algorithms for network flow and other problems. SIAM J Control Optim 28(3):678–710

    Article  MathSciNet  Google Scholar 

  9. Paige RC, Kruskal CP (1985) Parallel algorithms for shortest path problems. In: Proceedings of the international conference on parallel processing, 14–20

    Google Scholar 

  10. Chandy KM, Misra J (1982) Distributed computation on graphs: shortest path algorithms. Commun ACM 25(11):833–837

    Article  MathSciNet  Google Scholar 

  11. Habbal M (1994) A decomposition algorithm for the all-pairs shortest path problem on massively parallel computer architectures. Transp Sci 28(3):273–290

    MathSciNet  MATH  Google Scholar 

  12. 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

    Google Scholar 

  13. 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)

    Google Scholar 

  14. Guozhen T, Wen G (2002) Shortest path algorithm in time-dependent networks. Chin J Comput 25:165–172 (in Chinese)

    MathSciNet  Google Scholar 

  15. 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  Google Scholar 

  16. Xiaojun K, Maocai W (2008) Shortest path algorithm implements based on genetic algorithm. Comput Eng Appl 44(23):22–23 (in Chinese)

    Google Scholar 

  17. 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)

    Google Scholar 

  18. 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)

    Google Scholar 

  19. Ghoseiri K, Nadjari B (2010) An ant colony optimization algorithm for the bi-objective shortest path problem. Appl Soft Comput 10(4):1237–1246

    Article  Google Scholar 

  20. Ji XY, Iwamura K, Shao Z (2007) New models for shortest path problem with fuzzy arc lengths. Appl Math Model 31(2):259–269

    Article  Google Scholar 

  21. 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)

    Google Scholar 

  22. 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)

    Google Scholar 

  23. Meng XL, Jia LM (2009) Paths generating in emergency on China new railway network. J Beijing Inst Technol 19(S2):84–88

    MathSciNet  Google Scholar 

  24. Xuelei M (2011) Research on theory and method of vehicle operation organization under emergency conditions. Beijing Jiaotong University, Beijing (in Chinese)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Beijing Jiaotong University, Beijing, China

    Limin Jia, Li Wang & Yong Qin

Authors
  1. Limin Jia
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Li Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yong Qin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Limin Jia .

Rights and permissions

Reprints and permissions

Copyright information

© 2022 Beijing Jiaotong University Press and Springer-Verlag GmbH Germany

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Jia, L., Wang, L., Qin, Y. (2022). Rerouting Path Generation in Emergency. In: High-Speed Railway Operation Under Emergent Conditions. Advances in High-speed Rail Technology. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-63033-4_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-63033-4_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-63031-0

  • Online ISBN: 978-3-662-63033-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation