The aim of the train timetabling problem is to find a conflict free timetable for a set of passenger and freight trains along their routes in an infrastructure network. Several constraints like station capacities and train dependent running and headway times have to be satisfied. In this work we deal with large scale instances of the aperiodic train timetabling problem for the German railway ne...

In railways, the long-term strategic planning is process of evaluating improvements to railway network (e.g., upgrading a single track line double line) and changes composition/frequency train services adding 1 per hour along certain route). The effects different combinations infrastructure upgrades updated (also called scenarios), are usually evaluated by creating new feasible timetables follo...

The aim of this paper is to analyze and to improve the current planning process of the passenger railway service. At first, the state-of-the-art in research is presented. Given the recent changes in legislature allowing competitors to enter the railway industry in Europe, also known as liberalization of railways, the current way of planning does not reflect the situation anymore. The original p...

This paper presents two optimization methods for solving the passenger train timetabling problem to minimize the total delay time in the single track railway networks. The goal of the train timetable problem is to determine departure and arrival times to or from each station in order to prevent collisions between trains and effective utilization of resources. The two proposed methods are based ...

This paper deals with the design of timetables for complex railway systems. Rail transportation has become a rapid, clean and efficient way to transport passengers and freights. A good timetable design is crucial to ensure the quality of the services trying to improve the efficiency of the whole system. Only such a sustainable transportation system will be in accordance to the requirements of f...

We consider the customary formulation of non-cyclic train timetabling, calling for a maximumprofit collection of compatible paths in a suitable graph. The associated ILP models look for a maximum-weight clique in a(n exponentially-large) compatibility graph. By taking a close look at the structure of this graph, we analyze the existing ILP models and propose some new stronger ones, all having t...

Train scheduling is a complex and time consuming task of vital importance in many countries. To schedule trains more accurately, efficiently and robustly than permitted by current techniques a novel job shop approach is proposed and implemented. Unique characteristics of train scheduling are firstly incorporated into the disjunctive graph representation of the solution. Constructive algorithms ...