access icon free Coordinated optimisation problem integrating EMU circulation and timetabling for high-speed railway

© The Institution of Engineering and Technology
Received 20/12/2016, Accepted 17/09/2017, Revised 18/08/2017, Published 18/09/2017

In this study, the problem of electric multiple unit (EMU) circulation planning and train timetabling is studied through a coordinated process that provides a feedback mechanism to simultaneously minimise the number of EMUs, the number of EMU maintenance tasks and the train travel time. Based on an adjustable train departure time window as the key parameter in the problem, the approach mainly consists of two components: a column generation process, which searches for better EMU circulation routes; and a mathematical model, which produces timetables. These components interact according to the results of computational assessments until the solution reaches a certain level of optimality or the allotted computation time is exhausted. Finally, the authors test this approach using a small example to illustrate the effectiveness, and they also study a real-world case. A quantitative comparative analysis shows that long travel distances and travel times of trains significantly affect the number of EMUs used. The results indicate that the proposed model and algorithm can effectively address the coordinated optimisation problem of integrating EMU circulation planning and timetabling.

Inspec keywords: feedback; minimisation; maintenance engineering; railway engineering; scheduling

Other keywords: EMU maintenance tasks; electric multiple unit; train timetabling; train departure time window; feedback mechanism; travel distances; column generation process; EMU circulation planning; train travel time; coordinated optimisation problem; high-speed railway; EMU circulation routes; coordinated process

Subjects: Optimisation techniques; Systems theory applications in transportation

References

    1. 1)
      • 11. Chung, J., Oh, S., Choi, I.: ‘A hybrid genetic algorithm for train sequencing in the Korean railway’, Omega, 2009, 37, (3), pp. 555–565.
    2. 2)
      • 8. Otsuki, T., Aisu, H., Tanaka, T.: ‘A search-based approach to railway rolling stock allocation problems’, Discrete Math. Algorithm Appl., 2011, 3, (4), pp. 443–456.
    3. 3)
      • 5. Goverde, R.M.P., Hansen, I.: ‘Performance indicators for railway timetables’. IEEE Int. Conf. Intelligent Rail Transportation (ICIRT), 30 August 1 September 2013, pp. 302–307.
    4. 4)
      • 1. Arenas, D., Chevrier, R., Hanafi, S., et al: ‘Solving the train timetabling problem, a mathematical model and a genetic algorithm solution approach’. 6th Int. Conf. Railway Operations Modelling and Analysis (RailTokyo 2015), Tokyo, Japan, March 2015, pp. 12–26.
    5. 5)
      • 15. Peeters, M., Kroon, L.: ‘Circulation of railway rolling stock: a branch-and-price approach’, Comput. Oper. Res., 2008, 35, (2), pp. 538–556.
    6. 6)
      • 9. Tsuji, Y., Kuroda, M., Kitagawa, Y., et al: ‘Ant colony optimization approach for solving rolling stock planning for passenger trains’. 2012 IEEE/SICE Int. Symp. System Integration (SII), 16–18 December 2012, pp. 16–18.
    7. 7)
      • 3. Sun, Y., Cao, C., Wu, C.: ‘Multi-objective optimization of train routing problem combined with train scheduling on a high-speed railway network’, Transp. Res. C, 2014, 44, pp. 1–20.
    8. 8)
      • 14. Fioole, P., Kroon, L., Maróti, G., et al: ‘A rolling stock circulation model for combining and splitting of passenger trains’, Eur. J. Oper. Res., 2006, 174, (2), pp. 1281–1297.
    9. 9)
      • 4. Wang, Y., Tang, T., Ning, B., et al: ‘Passenger-demands-oriented train scheduling for an urban rail transit network’, Transp. Res. C, 2015, 60, pp. 1–23.
    10. 10)
      • 13. Alfieri, A., Groot, R., Kroon, L., et al: ‘Efficient circulation of railway rolling stock, transport’, Scientist, 2006, 40, (3), pp. 378–391.
    11. 11)
      • 12. Chao, L., Zhou, L.S., Yue, Y.X., et al: ‘A branch and bound algorithm for the exact solution of the problem of EMU circulation scheduling in railway network’, Math. Probl. Eng., 2016, 2016, p. 8537089.
    12. 12)
      • 6. Zhou, X., Zhong, M.: ‘Single-track train timetabling with guaranteed optimality: branch-and-bound algorithms with enhanced lower bounds’, Transp. Res. B, 2007, 41, (3), pp. 320–341.
    13. 13)
      • 16. He, B.S., Song, R., He, S.W., et al: ‘A hybrid column generation approach for solving rolling stock assignment optimization model of urban rail transit’, China Railway Sci., 2014, 35, (1), pp. 122–129.
    14. 14)
      • 2. Schmidt, M., Schöbel, A.: ‘Timetabling with passenger routing’, OR Spectr., 2015, 37, (1), pp. 75–97.
    15. 15)
      • 7. Sparing, D., Goverde, R.: ‘An optimization model for periodic timetable generation with dynamic frequencies’. IEEE 16th Int. Conf. Intelligent Transportation Systems ITSC, 6–9 October 2013, pp. 785–790.
    16. 16)
      • 10. Hong, S., Kim, K., Lee, K., et al: ‘A pragmatic algorithm for the train-set routing: the case of Korea high-speed railway’, Omega, 2009, 37, (3), pp. 637–645.
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-its.2016.0351
Loading

Related content

content/journals/10.1049/iet-its.2016.0351
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading