Logistique intelligente (conception d’horaires, chaînes d’approvisionnement, logistique, systèmes manufacturiers)
RetourCahiers du GERAD
781 résultats — page 24 de 40
Conjectures in graph theory have multiple forms and involve graph invariants, graph classes, subgraphs, minors and other concepts in premisses and/or conclu...
référence BibTeX
Computer-assisted and automated conjecture-making in graph theory is reviewed, focusing on the three operational systems GRAPH, Graffiti and AutoGraphiX (AGX...
référence BibTeX
We consider the multiple depot vehicle scheduling problem (MDVSP) and propose a branch-and-bound algorithm for solving it that combines column generation, va...
référence BibTeX
Two ways for bounding <i>n</i>-variables functions over a box, based on interval evalu- ations of first order derivatives, are compared. The optimal Baumann...
référence BibTeX
The shortest path problem with resource constraints consists of finding the minimum cost path between two specified points while respecting constraints on r...
référence BibTeXExact and Heuristic Procedures for the Material Handling Circular Flow Path Design Problem
In this study we develop optimization, decomposition, and heuristic procedures to design a unidirectional loop flow pattern along with the pickup and delive...
référence BibTeX
This paper presents some new heuristics based on variable neighborhood search to solve the vertex weighted <i>k</i>-cardinality tree problem. An efficient l...
référence BibTeX
We consider the bilevel uncapacitated facility location problem with user preferences. It is known that this model may be reformulated as a one-level locati...
référence BibTeX
The multiprocessor scheduling problem with communication delays that we consider in this paper consists of finding a static schedule of an arbitrary task gra...
référence BibTeXDesign of Balanced MBA Student Teams
In some schools and universities, students must sometimes be divided into several teams in such a way that each team provides a good representation of the cl...
référence BibTeXSelected Topics in Column Generation
Dantzig-Wolfe decomposition and column generation, devised for linear programs, is a success story in large scale integer programming. We outline and relate ...
référence BibTeX
We propose a differential game to study retailer’s allocation strategy of shelf-space shares between the manufacturers of two competing brands. Each manufact...
référence BibTeX
A constant fixed cost of establishing a facility is introduced within the framework of minisum facility location in the continuous space. The solution metho...
référence BibTeX
In this exploratory study, a segmentation analysis of a shopping mall’s customers is conducted according to the activities they performed during their visit,...
référence BibTeX
A zone-dependent fixed cost is introduced within the framework of minisum location of facilities in the continuous space. An efficient algorithm for determin...
référence BibTeXAltitude Manpower Planning. An Integrated System that Addresses the Puzzle of Planning a Crew Force
A critical aspect of operating an airline is to continuously maintain adequate staffing levels of qualified crewmembers. The airline must be able to plan sev...
référence BibTeX
The integrated aircraft routing and crew scheduling problem consists in determining a minimum-cost set of aircraft routes and crew pairings such that each fl...
référence BibTeX
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
This paper examines the convergence properties of two well-known heuristics: variable neighborhood search (VNS) and random multistart local search (MLS). Bot...
référence BibTeX
When applying the 2-opt heuristic to the travelling salesman problem, selecting the best improvement at each iteration gives worse results on average than se...
référence BibTeX