Capacity Optimization of High-speed Railway Train in Established Schedule Plan Based on Improved ACO Algorithm
Hao Li, Xiaowei Liu, Kun Yang
Available Online July 2018.
- https://doi.org/10.2991/msam-18.2018.33How to use a DOI?
- high-speed railway; carrying capacity; ATSP; ACO
- In order to improve the transporting ability of high-speed trains, Gave the definition of the minimizing departure interval between trains, and the definition of the drawing compact diagram without considering overtaking conditions. After considering the matching coefficient of train operation, an 0-1 integer programming model was established to maximize capacity of trains and convert the problem into an asymmetric traveling salesman problem (ATSP). Then a improved algorithm-ant colony optimazition(ACO) algorithm is designed to solve the problem. The case of Shanghai to Beijing high-speed trains were taken as an example solving by programming. Computation results show that considering the matching coefficient of train operation, the optimized scheme can shorten the total time by 219 min (about 28.52%) than the existing scheme.
- Open Access
- This is an open access article distributed under the CC BY-NC license.
Cite this article
TY - CONF AU - Hao Li AU - Xiaowei Liu AU - Kun Yang PY - 2018/07 DA - 2018/07 TI - Capacity Optimization of High-speed Railway Train in Established Schedule Plan Based on Improved ACO Algorithm BT - Proceedings of the 2018 3rd International Conference on Modelling, Simulation and Applied Mathematics (MSAM 2018) PB - Atlantis Press SP - 152 EP - 157 SN - 1951-6851 UR - https://doi.org/10.2991/msam-18.2018.33 DO - https://doi.org/10.2991/msam-18.2018.33 ID - Li2018/07 ER -