Axe 2 : Aide à la décision prise dans les systèmes complexes
RetourCahiers du GERAD
1401 résultats — page 60 de 71
In recent years, several advances have been made towards the solution of stochastic vehicle routing problems (SVRPs). In particular, the Integer <i>L</i>-Sh...
référence BibTeX
This article describes a heuristic and two exact algorithms for several classes of vehicle routing problems defined on tree networks. These include capacita...
référence BibTeX
This article describes a method for solving the crew rostering problem in air transportation. This problem consists of constructing personalized schedules ...
référence BibTeX
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
A decomposition method for global optimization, when some of the problem variables are integer, is presented. Potential solutions for a specific problem ar...
référence BibTeX
This article describes the results of a study aimed at improving linen delivery operations in a large teaching hospital in Montreal. Improvements over the p...
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
Consider a set <i>L</i> of potential locations for <i>p</i> facilities and a set <i>U</i> of locations of given users. The <i>p</i>-median problem is to loc...
référence BibTeXPath, Tree and Cycle Location
<i>Extensive facilities</i> are structures that are too large to be considered as single points. In the first part of this paper we propose integer program...
référence BibTeX
Multi-commodity flow models are well known and have been widely used in the design of packet-switched networks. They have also been used as approximations ...
référence BibTeX
We study the set of lower bounds which have been proposed for the numbering of a complete graph. We first show that the computation of most of them can be ...
référence BibTeX
We consider a managerial economics problem of controlling pollution caused by decentralised agents. We build a mathematical model for a local government ai...
référence BibTeXCovering a Graph with Cycles
This article describes a lower bounding procedure and heuristics for the <i>Cycle Cover Problem</i> which consists of determining a least cost cover of an u...
référence BibTeX
Good heuristic solutions for large Multisource Weber problems can be obtained by solving related <i>p</i>-median problems in which potential locations of th...
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
An econometric model is developed and used to estimate price promotion effects on sales for the yogourt category in a Quebec market. More specifically, the...
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
This paper contains some 80 annotated references on the vehicle routing problem. The titles are organized as follows: 1) the classical VRP with capacity an...
référence BibTeX