Train rescheduling and platforming in large high-speed railway stations  

作　　者：Jing Teng Jinke Gao Pengling Wang Siyuan Qu 

机构地区：[1]College of Transportation Engineering,Tongji University,4800 Cao’an Road,Shanghai 201804,China [2]Shanghai Key Laboratory of Rail Infrastructure Durability and System Safety,Tongji University,4800 Cao’an Road,Shanghai 201804,China [3]Shanghai Collaborative Innovation Research Center for Multi-Network&Multi-Modal Rail Transit,Tongji University,4800 Cao’an Road,Shanghai 201804,China [4]Transport Department,China Railway Shanghai Group Co.Ltd,80 East Tianmu Road,Shanghai 200070,China

出　　处：《International Journal of Transportation Science and Technology》2024年第4期100-118,共19页交通科学与技术(英文)

基　　金：supported by the National Key R&D Program of China,(No.2021YFB1600100);the Natural Science Foundation of Shanghai(Nos.21YF1450200 and 23ZR1467400);the National Natural Science Foundation of China(No.72101184);the Fundamental Research Funds for the Central Universities.

摘　　要：To deal with train delays in large high-speed railway stations,a multi-objective mixedinteger nonlinear programming(MO-MINLP)optimization model was proposed.The model used the arrival time,departure time,track occupation,and route selection as the decision variables,and fully considered the station infrastructure layout,train operational requirements,and time standards as limiting factors.The optimization objectives were to minimize train delays and reduce track and to route adjustments.To realize the large-scale and rapid solution of the MO-MINLP model,this study proposed a rolling horizon optimization algorithm that used half an hour as a time interval and solved the rescheduling and platforming problem of each time interval step-by-step.In numerical experiments,227 train movements under delay circumstances in Hangzhoudong station were optimized by using the proposed model and solution algorithm.The results show that the proposed MO-MINLP model could resolve route conflicts,compress unnecessary dwell times,and reduce train delays,and the solution algorithm could efficiently increase the computational speed.The maximum solution time for optimizing the 227 train movements is 15 min 24 s.

关 键 词：Large high-speed railway station Rescheduling and platforming Multiple objective mixed-integer nonlinear programming(MO-MINLP) Rolling horizon 

分 类 号：O17[理学—数学]