Given the flight schedule of an airline, the fleet assignment problem consists of determining the aircraft type to assign to each flight leg in order to maximize the total expected profits while satisfying aircraft routing and availability constraints. The profit for a leg is a function of the...

We studied the following organization for the letter and parcel pick-up and delivery problem in an urban environment: the working day is divided in time periods during which each vehicle starts from a sorting center, travels to a precise area of the region, picks up and delivers letters and...

This paper considers the locomotive assignment problem encountered during the planning of the operations of a freight railroad, which consists of providing sufficient motive power to pull a set of scheduled trains at minimum cost while satisfying locomotive availability and maintenance...

In this paper, we present a sophisticated model and a heuristic solution approach based on mathematical optimization for the assignment of locomotives and cars to passenger trains. Given a periodic schedule and a fleet composed of several types of locomotives and cars, our approach determines a...

The model described determines airline flight schedules which will maximise company profits and passenger satisfaction. The approach represents a significant improvement in analytical methods for fleet planning and scheduling which take into account the complex interaction between the passenger...

This paper describes and solves the operational pilot scheduling problem for one day of operations. The problem consists in simultaneously modifying, as necessary, the existing flight departure schedules and planned individual work days (duties) while keeping planned aircraft itineraries...

In this paper we consider the daily aircraft routing and scheduling problem (DARSP). It consists of determining daily schedules which maximize the anticipated profits derived from the aircraft of a heterogeneous fleet. This fleet must cover a set of operational flight legs with known departure...

We consider the problem of finding the minimum number of vehicles required to visit once a set of nodes subject to time window constraints, for a homogeneous fleet of vehicles located at a common depot. This problem can be formulated as a network flow problem with additional time constraints....