a simulated annealing algorithm for first train transfer problem in urban railway networks：城市轨道交通列车第一次换乘问题的模拟退火算法.pdfVIP

Applied Mathematical Modelling xxx (2015) xxx–xxx Contents lists available at ScienceDirect Applied Mathematical Modelling journal homepage: www.else /locate/apm A simulated annealing algorithm for first train transfer problem in urban railway networks Liujiang Kang ⇑, Xiaoning Zhu School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China a r t i c l e i n f o a b s t r a c t Article history: Passengers often have to transfer between different subway lines to reach their destina- Received 28 November 2013 tions. Time coordination of first trains between feeder and connecting lines plays an impor- Received in revised form 28 March 2015 tant role in reducing passenger transfer waiting time. This paper addresses the first train Accepted 15 May 2015 synchronization problem, and proposes a first train coordination model which aims at min- Available online xxxx imizing total passenger transfer waiting time. Taking into account the specification of the first train problem, we use mixed-integer variables to enable the correct calculation of the Keywords: waiting time for the ‘‘first available’’ train at each transfer station. In addition, we develop a Subway network simulated annealing algorithm to deal with a case study of the Beijing subway network. First train timetabling Transfer waiting time Results indicate that the proposed approa