Coordination Optimization of the First and Last Trains' Departure Time on Urban Rail Transit Network

Coordinating the departure times of different line directions' of first and the last trains contributes to passengers' transferring. In this paper, a coordination optimization model (i.e., M1) referring to the first train's departure time is constructed firstly to minimize passengers' total originating waiting time and transfer waiting time for the first trains. Meanwhile, the other coordination optimization model (i.e., M2) of the last trains' departure time is built to reduce passengers' transfer waiting time for the last trains and inaccessible passenger volume of all origin-destination (OD) and improve passengers' accessible reliability for the last trains. Secondly, two genetic algorithms, in which a fixed-length binary-encoding string is designed according to the time interval between the first train departure time and the earliest service time of each line direction or between the last train departure time and the latest service time of each line direction, are designed to solve M1 and M2, respectively. Finally, the validity and rationality of M1, M2, and their solving genetic algorithms are verified with numerical analysis, in which the effects of the parameters in M1 and M2 on coordination optimization result are analyzed.

[1]  Ziyou Gao,et al.  Efficient scheduling of railway traffic based on global information of train , 2008 .

[2]  Erhan Kozan,et al.  Optimal scheduling of trains on a single line track , 1996 .

[3]  B Szpigel,et al.  OPTIMAL TRAIN SCHEDULING ON A SINGLE LINE RAILWAY , 1973 .

[4]  S. L. Dhingra,et al.  DEVELOPMENT OF FEEDER ROUTES FOR SUBURBAN RAILWAY STATIONS USING HEURISTIC APPROACH , 2001 .

[5]  Malachy Carey,et al.  Scheduling and Platforming Trains at Busy Complex Stations , 2003 .

[6]  Erhan Kozan,et al.  Scheduling trains as a blocking parallel-machine job shop scheduling problem , 2009, Comput. Oper. Res..

[7]  Malachy Carey,et al.  A Model, Algorithms and Strategy for Train Pathing , 1995 .

[8]  Malachy Carey,et al.  Scheduling Trains on a Network of Busy Complex Stations , 2007 .

[9]  Malachy Carey,et al.  A model and strategy for train pathing with choice of lines, platforms, and routes , 1994 .

[10]  Ming Zhong,et al.  Bicriteria train scheduling for high-speed passenger railroad planning applications , 2005, Eur. J. Oper. Res..

[11]  Erhan Kozan,et al.  A disjunctive graph model and framework for constructing new train schedules , 2010, Eur. J. Oper. Res..

[12]  Harold H. Greenberg,et al.  A Branch-Bound Solution to the General Scheduling Problem , 1968, Oper. Res..

[13]  Matteo Fischetti,et al.  Modeling and Solving the Train Timetabling Problem , 2002, Oper. Res..

[14]  M. J Dorfman,et al.  Scheduling trains on a railway network using a discrete event model of railway traffic , 2004 .

[15]  Yusin Lee,et al.  A heuristic for the train pathing and timetabling problem , 2009 .

[16]  Xiaoqiang Cai,et al.  Greedy heuristics for rapid scheduling of trains on a single track , 1998 .

[17]  Xuesong Zhou,et al.  Single-Track Train Timetabling with Guaranteed Optimality: Branch-and-Bound Algorithms with Enhanced Lower Bounds , 2007 .

[18]  E R Kraft.  A BRANCH AND BOUND PROCEDURE FOR OPTIMAL TRAIN DISPATCHING , 1987 .

[19]  Ismail Sahin,et al.  Railway traffic control and train scheduling based oninter-train conflict management , 1999 .

[20]  Ferenc Szidarovszky,et al.  A multi-objective train scheduling model and solution , 2004 .

[21]  Patrick T. Harker,et al.  Tactical Scheduling of Rail Operations: The SCAN I System , 1991, Transp. Sci..