A Multiobjective Optimization for Train Routing at the High-Speed Railway Station Based on Tabu Search Algorithm
Open Access
- 3 October 2018
- journal article
- research article
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2018, 1-22
Abstract
This paper focuses on the train routing problem at a high-speed railway station to improve the railway station capacity and operational efficiency. We first describe a node-based railway network by defining the turnout node and the arrival-departure line node for the mathematical formulation. Both considering potential collisions of trains and convenience for passengers’ transfer in the station, the train routing problem at a high-speed railway station is formulated as a multiobjective mixed integer nonlinear programming model, which aims to minimize trains’ departure time deviations and total occupation time of all tracks and keep the most balanced utilization of arrival-departure lines. Since massive decision variables for the large-scale real-life train routing problem exist, a fast heuristic algorithm is proposed based on the tabu search to solve it. Two sets of numerical experiments are implemented to demonstrate the rationality and effectiveness of proposed method: the small-scale case confirms the accuracy of the algorithm; the resulting heuristic proved able to obtain excellent solution quality within 254 seconds of computing time on a standard personal computer for the large-scale station involving up to 17 arrival-departure lines and 46 trains.Keywords
Funding Information
- Beijing Jiaotong University (RCS2017ZT012, RCS2018ZZ001, RCS2018ZZ003, 2018YJS193)
- Beijing Jiaotong University (RCS2017ZT012, RCS2018ZZ001, RCS2018ZZ003, 2018YJS193)
- Beijing Jiaotong University (RCS2017ZT012, RCS2018ZZ001, RCS2018ZZ003, 2018YJS193)
- Fundamental Research Funds for the Central Universities (RCS2017ZT012, RCS2018ZZ001, RCS2018ZZ003, 2018YJS193)
This publication has 23 references indexed in Scilit:
- Simultaneous passenger train routing and timetabling using an efficient train-based Lagrangian relaxation decompositionTransportation Research Part B: Methodological, 2016
- Using Simulated Annealing in a Bottleneck Optimization Model at Railway StationsJournal of Transportation Engineering, 2012
- Nominal and robust train timetabling problemsEuropean Journal of Operational Research, 2012
- Optimized Utilization of Station Arrival and Departure Tracks for Passenger Dedicated LinesAdvanced Materials Research, 2012
- Solution of the Train Platforming ProblemTransportation Science, 2011
- A tabu search algorithm for rerouting trains during rail operationsTransportation Research Part B: Methodological, 2010
- Bottlenecks Detection of Track Allocation Schemes at Rail Stations by Petri NetsJournal of Transportation Systems Engineering and Information Technology, 2009
- Assessment of flexible timetables in real-time traffic management of a railway bottleneckTransportation Research Part C: Emerging Technologies, 2008
- Using Integer Programming to Solve the Train-Platforming ProblemTransportation Science, 2003
- Routing trains through a railway station based on a node packing modelEuropean Journal of Operational Research, 2001