Mathematical optimization for the train timetabling problem

Abstract

Rail transportation is very rich in terms of problems that can be modeled and solved using mathematical optimization techniques. The train scheduling problem as the most important part of a rail operating policy has a very significant impact on a rail company profit considering the fact that from the quality of a train timetable depends a flow of three most important resources on rail network: cars, locomotives and crews. The train timetabling problem aims at determining a periodic timetable for a set of trains that does not violate track capacities and satisfies some operational constraints. In this paper, we developed an integer programming approach for determining an optimal train schedule for a single, one-way track linking two major stations, with a number of intermediate stations between. The application has been tested on a realistic example suggested by the PE “Serbian Railways”. Obtained results show a potential for a practical application of proposed approach.