Guy Desaulniers

Retour

Cahiers du GERAD

135 résultats — page 6 de 7

, , et

Since its appearance in 1947, the primal simplex algorithm has been one of the most popular algorithm for solving linear programs. It is very efficient wh...

référence BibTeX
, et

An edge coloring of a graph <img src="/cgi-bin/mimetex.cgi?G = (V,E)"> is a function <img src="/cgi-bin/mimetex.cgi?c:E \rightarrow N"> that assigns a co...

référence BibTeX
, , et

Given a set of timetabled tasks, the multi-depot vehicle scheduling problem is a wellknown problem that consists of determining least-cost schedules for veh...

référence BibTeX
, et

The vehicle routing problem with time windows consists of delivering goods at minimum cost to a set of customers using an unlimited number of capacitated ve...

référence BibTeX
, et

Given buses of different types arriving at a depot during the evening, the bus parking problem consists of assigning these buses to parking slots in such a w...

référence BibTeX
, , , et

In this article we consider the problem of assigning parking slots to buses of different types so that the required buses can be dispatched easily in the mo...

référence BibTeX
, et

In a transit authority bus depot, buses of different types arrive in the evening to be parked in the depot for the night, and then dispatched in the morning...

référence BibTeX
, , et

Given the sets of flights and aircraft of an airline carrier, the fleet assignment problem consists of assigning the most profitable aircraft type to each f...

référence BibTeX
, , et

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

référence BibTeX

We consider vehicle routing and crew scheduling problems that involve a lexico- graphic bi-level objective function (for instance, minimizing first the numb...

référence BibTeX
, , et

This paper introduces the first exact approach for constructing aircrew member personalized monthly work schedules when a preferential bidding system (PBS) ...

référence BibTeX
et

In most vehicle routing and crew scheduling applications solved by column generation, the subproblem corresponds to a shortest path problem with resource con...

référence BibTeX
, , et

Column generation is often used to solve problems involving set partitioning constraints, such as vehicle routing and crew scheduling problems. When these co...

référence BibTeX
et

This paper reviews state-of-the-art models and approaches for solving a wide variety of public transit problems encountered at the strategic, tactical, and...

référence BibTeX
, , et

This paper presents an exact solution approach for the problem of the simultaneous dispatching and conflict-free routing of automated guided vehicles. The ...

référence BibTeX
, et

This paper considers the locomotive assignment problem encountered during the planning of the operations of a freight railroad, which consists of providing s...

référence BibTeX
et

We consider a new variant of constrained shortest path problem, where the constraints come from a set of forbidden paths (arc sequences) that cannot be part...

référence BibTeX

Assigning locomotives and cars to a set of scheduled trains is a complex but important problem for passenger railways. This task is normally carried out in ...

référence BibTeX
, , , et

This paper presents a survey on the <i>Vehicle Routing Problem with Pickup and Delivery</i> in which a heterogeneous vehicle fleet based at multiple termina...

référence BibTeX
, , , et

This paper presents a survey of the research on the Vehicle Routing Problem with Time Windows (VRPTW), an extension of the Capacitated Vehicle Routing Probl...

référence BibTeX