Jacques Desrosiers
RetourCahiers du GERAD
111 résultats — page 4 de 6
This paper describes the Preferential Bidding Problem solved in the airline industry to construct personalized monthly schedules for pilots and officers. T...
référence BibTeX
We propose a common solution approach for different crew scheduling problems arising at the planning and operational levels in the airline industry. Specifi...
référence BibTeX
This paper introduces a strong valid inequality, the 2-path cut, to produce better lower bounds for the Vehicle Routing Problem with Time Windows (VRPTW). ...
référence BibTeXA Unified Framework for Deterministic Time Constrained Vehicle Routing and Crew Scheduling Problems
The need for an integrating framework for vehicle routing and crew scheduling problems has been apparent for some time. While several attempts have been ma...
référence BibTeX
This paper introduces a new type of constraints, related to schedule synchronization, in the problem formulation of aircraft fleet assignment and routing pr...
référence BibTeX
We consider a weekly locomotive scheduling problem encountered at Swedish State Railways. The objective is to find cyclic locomotive schedules, which minim...
référence BibTeX
This paper describes the operational airline crew scheduling problem and represents a first published attempt to solve it. This problem consists of modifyin...
référence BibTeX
La méthode de génération de colonnes est couramment utilisée pour résoudre des problèmes d'optimisation de grande taille. En pratique, on observe fréquemmen...
référence BibTeX
The problem of assigning locomotives to train-segments is very important for railway companies, in view of the high cost of operating locomotives. The prob...
référence BibTeX
This paper presents an optimal dynamic programming algorithm, the first such algorithm in the literature to solve the shortest path problem with time window...
référence BibTeXCrew Pairing at Air France
In the airline industry, crew schedules consist of a number of pairings. These are round trips originating and terminating at the same crew home base compo...
référence BibTeX
The majority of vehicle routing and crew scheduling problems studied up to date in the literature can be formulated by means of a unified model introduced b...
référence BibTeX
In this paper we consider the daily aircraft routing and scheduling problem (DARSP). It consists of determining daily schedules which maximize the anticipat...
référence BibTeX
We present a recent optimization approach that can be applied equally to aircraft routing, crew pairing generation and bidding/rostering problems arising in...
référence BibTeX
There are several routing and scheduling problems faced by airline companies, notably, aircraft scheduling, pairing generation and crew bidding and rosterin...
référence BibTeX
Crew-Opt is a set-covering method that uses column-generation to produce nearly optimal solutions to crew scheduling problems. We presented this method at t...
référence BibTeX
This survey paper describes the significant advances made in time constrained vehicle routing and crew scheduling problems. In terms of solution methodolog...
référence BibTeX
This paper examines whether there is a substantial additional payoff to be derived from using mathematical optimization techniques to globally define a set ...
référence BibTeXA New Branching Strategy for Time Constrained Routing Problems with Application to Backhauling
In this paper we explore a new branching strategy for branch-and-bound approaches based on column generation for the vehicle routing problems with time wind...
référence BibTeX
We propose a new branch-and-bound algorithm for the Satisfiability problem (SAT). A relaxation as well as a decomposition scheme are defined by using polyno...
référence BibTeX