With the rapid construction of high-speed railway network and the rise of the urban agglomeration, the passenger volume of large-scale railway passenger transport hubs continuous increases. However, due to the limitation of the through train operation scheme, only part of Origin-Destination(OD) pairs can be served, resulting in a large number of transfer passenger flows in the railway network. Adjusting the train arrival and departure schedule in large passenger transport hubs can safely and effectively organize the transfer passenger flow at the station and significantly improve the passenger satisfaction. Therefore, a 0-1 mixed integer linear high-speed rail hub train connection optimization model is established in this article which make the overall invalid passenger waiting time minimum as the optimization function, considering maintenance time constraints, station operation time constraints, reception-departure track capacity constraints, and transfer time constraints, and using the Benders decomposition algorithm for solving. The results show that this technique can obtain the exact optimal solution of the model, and has significant competitiveness in terms of solution quality and solution efficiency compared with other optimization algorithms of the same problem.
Research on transfer schedule optimization of high-speed railway based on benders decomposition algorithm
International Conference on Algorithms, Microchips and Network Applications ; 2022 ; Zhuhai,China
Proc. SPIE ; 12176
06.05.2022
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
A Benders Decomposition Algorithm for the Passenger Train Service Planning
DOAJ | 2021
|Aggregation Methods for Railway Network Design Based on Lifted Benders Cuts
Springer Verlag | 2018
|