Author(s)

T. Katori, H. Yamazaki & T. Izumi

Abstract

It is an important subject to automatically generate train rescheduling timetables after a transport disorder has occurred. In urban areas in Japan, for the convenience of passengers, JR and private companies have lines that converge with each other. However, certain types of cars cannot run on other companies’ tracks and this may hamper rescheduling operations. Therefore, we propose an automatic method to generate train rescheduling timetables. For the through operation and turning operation, we consider routes on tracks and different car types. We treat train rescheduling as returning trains to their original location in rescheduling time. Generating a rescheduling timetable is an operation that results in trains returning to their original location in rescheduling time. For this method, we use a recursive tree structure for the route on track, and calculate the schedule by round robin. All solutions can become options for rescheduling. Choosing from the several options that are calculated, our method adopts the solution that has the even distribution of headway at the main stations. Keywords: train rescheduling timetable, tree structure, recursive processing, car types, train routes.

Keywords

train rescheduling timetable, tree structure, recursive processing, car types, train routes.