A discrete-event optimization framework for mixed-speed train timetabling problem

Abstract

Railway scheduling is a complex task of rail operators that involves the generation of a conflict-free train timetable. This paper presents a discrete-event simulation-based optimization approach for solving the train timetabling problem to minimize total weighted unplanned stop time in a hybrid single and double track railway networks. The designed simulation model is used as a platform for generating feasible conflict-free train timetables. It includes detailed infrastructure information, such as station characteristics, trains running time and praying intervals. The proposed approach has the capability of scheduling trains in large-scale networks subject to the capacity constraints and infrastructure characteristics. In optimization procedure, a path relinking meta-heuristic algorithm is utilized to generate near-optimal train timetables. A case study of Iran railway network is selected for examining the efficiency of the meta-heuristic algorithm. The computational result shows that the proposed approach has the capability of generating near-optimal timetable in real-sized train scheduling problems.