The capacitated vehicle routing problem is to find a routing schedule describing the order in which geographically dispersed customers are visited to satisfy demand by supplying goods stored at the depot, such that the traveling costs are minimized. In many practical applications, a long term...

The Dutch railway network experiences about three large disruptions per day on average. In this paper, we present an algorithm to reschedule the crews when such a disruption occurs. The algorithm is based on column generation techniques combined with Lagrangian heuristics. Since the number of...

Given a set of timetabled tasks, the multi-depot vehicle scheduling problem is a well-known problem that consists of determining least-cost schedules for vehicles assigned to several depots such that each task is accomplished exactly once by a vehicle. In this paper, we propose to compare the...

This paper describes a model that generates weekly movie schedules in a multiplex movie theater. A movie schedule specifies within each day of the week, on which screen(s) different movies will be played, and at which time(s). The model consists of two parts: (i) conditional forecasts of the...

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...

When tracks are out of service for maintenance during a certain period, trains cannot be operated on those tracks. This leads to a modified timetable, and results in infeasible rolling stock and crew schedules. Therefore, these schedules need to be repaired. The topic of this paper is the...

Delay management models determine which connections should be maintained in case of a delayed feeder train. Recently, delay management models are developed that take into account that passengers will adjust their routes when they miss a connection. However, for large-scale real-world instances,...

In this paper we discuss several methods to solve large real-world instances of the vehicle and crew scheduling problem. Although, there has been an increased attention to integrated approaches for solving such problems in the literature, currently only small or medium-sized instances can be...

This paper presents two different models and algorithms for integrated vehicle and crew scheduling in the multiple-depot case. The algorithms are both based on a combination of column generation and Lagrangian relaxation. Furthermore, we compare those integrated approaches with each other and...

In this paper, we discuss the dynamic vehicle and crew scheduling problem and we propose a solution approach consisting of solving a sequence of optimization problems. Furthermore, we explain why it is useful to consider such a dynamic approach and compare it with a static one. Moreover, we...