Many freight trains depart Swedish marshalling yards before or after their planned departure times. Today, a deviating time is allowed if no conflicting train path can be found few stations ahead. This increases the risk that might delayed to its destination and cause delays other trains. We present meta-heuristic modifies timetable by adding (for our train) and, necessary, adjusting surroundin...

We propose a new mixed integer programming based heuristic for computing benchmark primal solutions instances of the PESPlib. The PESPlib is collection Periodic Event Scheduling Problem (PESP), comprising periodic timetabling problems inspired by real-world railway settings, and attracting several international research teams during last years. describe two strategies to merge set good timetabl...

The break minimization problem is to find a home-away assignment that minimizes the number of breaks for a given timetable of a round-robin tournament. In a recent paper, Elf, Jünger and Rinaldi conjectured that the break minimization problem is solvable in polynomial time when the optimal value is less than the number of teams. This paper proves their conjecture affirmatively by showing that a...

In railway operations, a timetable is established to determine the departure and arrival times for the trains or other rolling stock at the different stations or relevant points inside the rail network or a subset of this network. The elaboration of this timetable is done to respond to the commercial requirements for both passenger and freight traffic, but also it must respect a set of security...

Smart card systems have been spreading globally not only for purchasing general goods and services, but also for fare payment of public transport. When an individual traveller is holding a public transport smart card, the precise times of his/her passing through ticket gates are recorded in the smart card system. The longitudinal smart card data of a large number of passengers have been stored ...

Many railway companies in Europe operate periodic timetables. Yet, most timetables are not entirely periodic but have a mixture of different periodicity and many exceptions to cope with changing demand. Current approaches for automatic timetable generation are not able to deal with such partially periodic structure, but consider only fully periodic inputs. We therefore introduce the periodic Se...

This paper presents a case study of a railway timetable optimization for the very dense Simplon corridor, a major railway connection in the Alps between Switzerland and Italy. Starting from a detailed microscopic network as it is used in railway simulation, the data is transformed by an automatic procedure into a less detailed macroscopic network, that is sufficient for the purpose of capacity ...

Intention– Cyclic locomotive assignment planning is a specific type of organization of locomotive usage, and in fact, it means putting the complete workload to a closed chain, which is repeated periodically. The concept of cyclic locomotive assignment planning type organization in the area of train traction has proven in practice as the best one, but as it is made for in-advance defined timetab...