SHANDONG SCIENCE ›› 2017, Vol. 30 ›› Issue (6): 79-86.doi: 10.3976/j.issn.1002-4026.2017.06.013

• Tranfic and Transportation • Previous Articles     Next Articles

Comprehensive optimization for utilization of arrival-departure tracks and route selection in hub-station of high-speed railway

HUANG Quan1,HE Zhen-huan2,HE Hong3   

  1. 1.Guangzhou Railway Corporation,Guangzhou 510088,China;2.Traffic and Transportation School,Beijing Jiaotong  University,Beijing 100044,China;3.Guangzhou Institute of Railway Technology,Guangzhou 510430,China
  • Received:2017-05-19 Published:2017-12-20 Online:2017-12-20

Abstract:

Through analyzing characteristics of arrival and departure of trains as well as passenger services, and considering technique requirements of train arrival & departure and passenger organization in high-speed railway hub-station, the use of arrivaldeparture track and route selection were taken as a whole to be optimized comprehensively. Aiming at the equilibrium use of arrivaldeparture track, the equilibrium workload of ticketcheck entrance, and the minimum conflict of train arriving and departing, the 01 integer programming models were established. Meanwhile, the ant colony algorithm was designed to solve practical problems. Taking Guangzhou South station for an example, results showed that the utilization of arrivaldeparture tracks and the workload of ticketcheck entrances were more balanced, and the minimum time interval of two trains which occupied the same arrivaldeparture track was more reasonable, which was beneficial to the adjustment of track and time when the train was delayed and disturbed, achieving goals of optimization for utilization of arrivaldeparture tracks and route selection.

Key words: high-speed railway, utilization of arrival-departure tracks, ant colony algorithm, hub-station, route selection

CLC Number: 

  • U293.2

Open Access This article is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0), which permits third parties to freely share (i.e., copy and redistribute the material in any medium or format) and adapt (i.e., remix, transform, or build upon the material) the articles published in this journal, provided that appropriate credit is given, a link to the license is provided, and any changes made are indicated. The material may not be used for commercial purposes. For details of the CC BY-NC 4.0 license, please visit: https://creativecommons.org/licenses/by-nc/4.0