Axe 2 : Aide à la décision prise dans les systèmes complexes
RetourCahiers du GERAD
1412 résultats — page 60 de 71
The paper deals with a problem of determining optimal advertising expenditures in a two-member channel of distribution in which the manufacturer invests in ...
référence BibTeX
A new algorithm, which exploits information from both ends of the network, is presented for the bicriterion shortest path problem. The algorithm extends eff...
référence BibTeX
Cet article identifie pour chaque fonction logistique les décisions à prendre et propose une séquence organisée de façon à constituer un processus décisionn...
référence BibTeX
The disjoint bilinear programming problem can be reformulated using two distinct linear maxmin programming problems. There is a simple bijection between the...
référence BibTeX
A new algorithm, based on interval analysis, is proposed for global optimization of constrained nonlinear nonconvex functions of several variables. It expl...
référence BibTeX
We describe a method of channel assignment for cellular telephone systems (in which a limited number of rearrangements are allowed) that gives good performa...
référence BibTeX
This study investigates a new phenomenon of degeneracy in the multi-source Weber problem. This phenomenon relates to the existence of solutions in which one...
référence BibTeX
Systematic change of neighborhood within a possibly randomized local search algorithm yields a simple and effective metaheuristic for combinatorial and glo...
référence BibTeX
This paper addresses the problem of generating valid crew pairings in the context of a regional air carrier. The classical column generation solution appro...
référence BibTeX
The locomotive assignment problem is to provide at minimum cost sufficient motive power to pull all the trains of a time tabled schedule. Optimization metho...
référence BibTeXChopping Graphs
Chopping a graph <i>G</i> means removing one edge from each connected component of <i>G</i> in parallel, and repeating this until no edges remain. The requi...
référence BibTeX
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