In this paper we describe a computational study to solve hard frequency assignment problems (FAPs) to optimality using a tree decomposition of the graph that models interference constraints. We present a dynamic programming algorithm which solves FAPs based on this tree decomposition. We show...

For a commercially operating railway company, providing a high level of service for the passengers is of utmost importance.The latter requires a high punctuality of the trains and an adequate rolling stock capacity.Unfortunately, the latter is currently (2002) one of the bottlenecks in the...

Disruptions of a railway system are responsible for longer travel times and much discomfort for the passengers. Since disruptions are inevitable, the railway system should be prepared to deal with them effectively. This paper explains that, in case of a disruption, rescheduling the timetable,...

Rede, in verkorte vorm uitgesproken bij de aanvaarding van het ambt van bijzonder hoogleraar aan de Faculteit der Bedrijfskunde, vanwege de Vereniging Trustfonds Erasmus Universiteit, met als leeropdracht Bedrijfskunde, in het bijzonder de Kwantitatieve Analyse van Logistieke Netwerken

This paper describes a method for solving the cyclic crew rostering problem (CCRP). This is the problem of cyclically ordering a set of duties for a number of crew members, such that several complex constraints are satisfied and such that the quality of the obtained roster is as high as...