François Soumis
RetourCahiers du GERAD
170 résultats — page 6 de 9
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
This paper classifies research contributions on decomposition approach for solving mathematical programming problems. More than 60 papers are presented with...
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
The purpose of this paper is to develop optimal tool partitioning policies and strip sequencing strategies for a class of flexible manufacturing problems. ...
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
This paper formulates the problem of maximal closure on a graph with resource constraints as an integer programming problem with binary variables, and propo...
référence BibTeX
Cet article présente une étude comparative des algorithmes de flot maximum pour la résolution du problème de fermeture maximale sur un graphe. Plusieurs ap...
référence BibTeX
We study the problem of finding a shortest collision-free path for a point car-like robot maneuvering around polygonal obstacles in a room bounded by a poly...
référence BibTeX
We study the problem of minimizing the peak load in single-command cycle shared storage policies. The peak load is the maximum of the daily material handlin...
référence BibTeX
The multi-depot vehicle scheduling problem with time windows consists of scheduling a fleet of vehicles to cover a set of tasks at minimum cost. Each task i...
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
Nous nous penchons sur la modélisation et le traitement de problèmes d'entreposage du type partagé. Nous supposons que l'entrepôt est à charge unitaire et q...
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