Logistique intelligente (conception d’horaires, chaînes d’approvisionnement, logistique, systèmes manufacturiers)
RetourCahiers du GERAD
793 résultats — page 24 de 40
The fractional aircraft market is the fastest growing segment of the business aircraft industry. A fractional aircraft operation is complex - essentially an...
référence BibTeX
The algebraic connectivity <i>a(G)</i> of a graph <i>G = (V,E)</i> is the second smallest eigenvalue of its Laplacian matrix. Using the AutoGraphiX (AGX) sys...
référence BibTeX
Ce document présente un modèle intégrateur de la logistique inverse. Le modèle est générique et peut servir à différents types d’entreprises. Le contexte du...
référence BibTeXStabilization in Column Generation
Column Generation (CG) algorithms are instrumental in many areas of applied optimization, where Linear Programs with an enormous number of columns need to ...
référence BibTeX
We describe an approach that computes an optimal primal basic solution given an optimal vector of dual multipliers. It consists in restricting the dual prob...
référence BibTeX
This article presents a formulation for the job shop problem based on the Dantzig- Wolfe decomposition with a subproblem for each machine. Each subproblem i...
référence BibTeX
In most vehicle routing and crew scheduling applications solved by column generation, the subproblem corresponds to a shortest path problem with resource con...
référence BibTeXA Primer in Column Generation
We give a didactic introduction to the use of the column generation technique in linear and in particular in integer programming. We touch on both, the relev...
référence BibTeX
This paper proposes a generalization of the proximal point algorithm using both penalty and trust region concepts. Finite convergence is established while as...
référence BibTeX
This article reviews some of the best metaheuristics proposed in recent years for the Vehicle Routing Problem. These are based on local search, on populatio...
référence BibTeX
The uniting feature of combinatorial optimization and extremal graph theory is that in both areas one should find extrema of a function defined in most...
référence BibTeX
The problem of determining a shortest loop incident to each cell of a block layout is considered. A compact formulation is developed for this problem and a ...
référence BibTeX
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