Skip to main content

Train Re-Pathing in Emergencies Based on Fuzzy Linear Programming

  • Chapter
  • First Online:
Train Operation in Emergencies

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

  • 431 Accesses

Abstract

Train pathing is a typical problem which is to assign the train trips on the sets of rail segments, such as rail tracks and links. This chapter focuses on the train pathing problem, determining the paths of the train trips in emergencies. We analyze the influencing factors of train pathing, such as transferring cost, running cost, and social adverse effect cost. With the overall consideration of the segment and station capability constraints, we build the fuzzy linear programming model to solve the train pathing problem. We design the fuzzy membership function to describe the fuzzy coefficients. Furthermore, contraction–expansion factors are introduced to contract or expand the value ranges of the fuzzy coefficients, coping with the uncertainty of the value range of the fuzzy coefficients. We propose a method based on triangular fuzzy coefficient and transfer the train pathing (fuzzy linear programming model) to a determinate linear model to solve the fuzzy linear programming problem. An emergency is presented which is based on the real data of the Beijing–Shanghai Railway. The model in this chapter was solved and the computation results prove the availability of the model and efficiency of the algorithm.

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.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

  • Blum, J., & Eskandarian, A. (2002). Enhancing intelligent agent collaboration for flow optimization of railroad traffic. Transportation Research Part A, 36(10), 919–930.

    Article  Google Scholar 

  • Caimi, G., Chudak, F., Fuchsberger, M., Laumanns, M., & Zenklusen, R. (2011). A new resource-constrained multicommodity flow model for conflict-free train routing and scheduling. Transportation Science, 45(2), 212–227.

    Article  Google Scholar 

  • Caprara, A., Kroon, L. G., Monaci, M., Peeters, M., & Toth, P. (2007). Passenger railway optimization, Chap. 3. In C. Barnhart & G. Laporte (Eds.), Handbooks in operations research and management science (Vol. 14, pp. 129–187). Amsterdam: Elsevier.

    Google Scholar 

  • Carey, M. (1994a). A model and strategy for train pathing with choice of lines, platforms, and routes. Transportation Research Part B, 28(5), 333–353.

    Article  Google Scholar 

  • Carey, M. (1994b). Extending a train pathing model from one-way to two-way track. Transportation Research Part B, 28(5), 395–400.

    Article  Google Scholar 

  • Carey, M., & Crawford, I. (2007). Scheduling trains on a network of busy complex stations. Transportation Research Part B, 41(2), 159–178.

    Article  Google Scholar 

  • Carey, M., & Lockwood, D. (1995). Model, algorithms and strategy for train pathing. Journal of the Operational Research Society, 46(8), 988–1005.

    Article  MATH  Google Scholar 

  • Cordeau, J., Toth, P., & Vigo, D. (1998). A survey of optimization models for train routing and scheduling. Transportation Science, 32(4), 380–404.

    Article  MATH  Google Scholar 

  • D’Ariano, A., Corman, F., Pacciarelli, D., & Pranzo, M. (2008). Reordering and local rerouting strategies to manage train traffic in real time. Transportation Science, 42(4), 405–419.

    Article  Google Scholar 

  • D’Ariano, A., & Pranzo, M. (2009). An advanced real-time train dispatching system for minimizing the propagation of delays in a dispatching area under severe disturbances. Networks and Spatial Economics, 9(1), 63–84.

    Article  MathSciNet  MATH  Google Scholar 

  • Dorfman, M. J., & Medanic, J. (2004). Scheduling trains on a railway network using a discrete event model of railway traffic. Transportation Research Part B, 38(1), 81–98.

    Article  Google Scholar 

  • Erlebach, T., Gantenbein, M., HĂĽrlimann, D., Neyer, G., Pagourtzis, A., Penna, P., et al. (2001). On the complexity of train assignment problems. In Proceedings of ISAAC01 (Vol. 2223, pp. 390–402). Lecture Notes in Computer Science.

    Google Scholar 

  • Lee, Y., & Chen, C. Y. (2009). A heuristic for the train pathing and timetabling problem. Transportation Research Part B, 43(8–9), 837–851.

    Article  Google Scholar 

  • Li, F., Gao, Z., Li, K., & Wang, Z. (2013). Train routing model and algorithm combined with train scheduling. Journal of Transportation Engineering, 139(1), 81–91. (in Chinese).

    Article  MathSciNet  Google Scholar 

  • Li, W., & Lu, W. (1997). Exploration on index calculating method of railway transportation cost. Journal of the China Railway Society, 19(5), 15–20. (in Chinese).

    Google Scholar 

  • Lusby, R. M., Larsen, J., & Ryan, D. M. (2013). A set packing inspired method for real-time junction train routing. Computers & Operations Research, 40(3), 713–724.

    Article  MATH  Google Scholar 

  • Meng, X., Jia, L., Chen, C., Xu, J., Wang, L., & Xie, J. (2009). Paths generating in emergency on china new railway network. Journal of Beijing Institute of Technology, 19(S2), 84–88. (in Chinese).

    Google Scholar 

  • Meng, X., Jia, L., & Qin, Y. (2010). Train timetable optimizing and re-scheduling based on improved particle swarm algorithm. Journal of Transportation Research Record, 2(2197), 71–79.

    Article  Google Scholar 

  • Narayanaswami, S., & Rangaraj, N. (2011). Scheduling and re-scheduling of railway operations: A review and expository analysis. Technology Operation Management, 2(2), 102–122.

    Article  Google Scholar 

  • Pellegrini, P., Marlière, G., & Rodriguez, J. (2014). Optimal train routing and scheduling for managing traffic perturbations in complex junctions. Transportation Research Part B, 59(59), 58–80.

    Article  Google Scholar 

  • Pu Z. (1999). On calculation of cost of normal speed train transferring to high-speed railway (Master’s thesis). Southweat Jiaotong University, Chengdu, China.

    Google Scholar 

  • Qi, X., & Xiong, J. (2008). Optimization model of organization of passenger trains running crossing PDLs and existing railways. Railway Transport and Economy, 30(4), 16–19.

    Google Scholar 

  • Törnquist, J. (2007). Railway traffic disturbance management—An experimental analysis of disturbance complexity, management objectives and limitations in planning horizon. Transportation Research Part A, 41(3), 249–266.

    Google Scholar 

  • Yang, L., Gao, Z., Li, X., & Li, K. (2011). A weighted min–max model for balanced freight train routing problem with fuzzy information. Engineering Optimization, 43(12), 1289–1309.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Limin Jia .

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer Nature Singapore Pte Ltd.

About this chapter

Cite this chapter

Jia, L., Meng, X., Qin, Y. (2017). Train Re-Pathing in Emergencies Based on Fuzzy Linear Programming. In: Train Operation in Emergencies. Advances in High-speed Rail Technology. Springer, Singapore. https://doi.org/10.1007/978-981-10-4597-4_6

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-4597-4_6

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-4596-7

  • Online ISBN: 978-981-10-4597-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics