Logistique intelligente (conception d’horaires, chaînes d’approvisionnement, logistique, systèmes manufacturiers)
RetourCahiers du GERAD
793 résultats — page 38 de 40
Vehicle Routing with Full Loads
This paper considers a vehicle routing problem with full loads and time limit constraints. This problem can be formulated as an asymmetrical travelling sale...
référence BibTeX
Hydraulic turbine runners are used in electricity generation. These consist of a cylinder around which are welded, at regular spacings, a number of blades w...
référence BibTeX
In this paper the authors describe a heuristic principle for the solution of an important class of problems. Using real-world examples, it is then shown how...
référence BibTeX
Post box collection constitutes a complex and costly operation in most postal services. The authors recently undertook a study aimed at improving this opera...
référence BibTeX
This article examines a constrained shortest path problem which occurs in the design by column generation of vehicle routes constructed to satisfy a set of t...
référence BibTeX
This paper describes a vehicle flow model for a two-echelon location-routing problem involving deliveries from primary to secondary facilities and from secon...
référence BibTeXA Branch-and-Bound Algorithm for the Asymetrical Distance Constrained Vehicle Routing Problem
The aim of this paper is to develop an exact algorithm for the asymmetrical distance constrained vehicle routing problem. The problem is solved by means of ...
référence BibTeX
The single-vehicle dial-a-ride problem with time window constraints for both pick-up and delivery locations, and precedence and capacity constraints, is solv...
référence BibTeX
This paper describes an exact algorithm for a general class of asymmetrical vehicle routing problems. Vehicle routes start and end at a central depot. Visi...
référence BibTeX
Let n facilities be located on a bounded linear market and assume that demand for a homogenous commodity is uniformly distributed along that market. Initial...
référence BibTeX
This paper presents an exact algorithm for a generalized version of the Travelling Salesman Problem which consists of finding the shortest Hamiltonian cirnui...
référence BibTeXAn Optimal Flow Circulation Algorithm for the Asymmetrical Multiple Travelling Salesman Problem
This paper describes an exact algorithm for the asymmetrical multiple travelling salesman problem. The problem is solved by branch and bound and a flow circ...
référence BibTeX
Cet article traite d'un problème de plus court chemin sous contraintes. Il s'agit du chemin d'un véhicule complétant un sous-ensemble de demandes de transpo...
référence BibTeX
This paper deals with the optimal location of post boxes in an urban or in a rural environment. The problem consists of selecting sites for post boxes which...
référence BibTeX
This paper presents an integer linear programming formulation for the symmetrical capacitated vehicle routing problem (CVRP). This formulation includes degr...
référence BibTeX
Cet article décrit dive3rs types d'horaires de travail en vigueur dans les entreprises et les services publics, ainsi que les principales méthodes de recherc...
référence BibTeX
This paper examines a family of permutation problems on 0-1 matrices. These problems arise in scheduling and in archaeological seriation. Three exact algor...
référence BibTeX
This paper presents a survey of exact algorithms for various types of vehicle routing problems. Algorithms are divided into three main categories: direct s...
référence BibTeXLe traitement des exigences rigides et souples dans certains problèmes d'optimisation combinatoire
Le présent article décrit des méthodes algorithmiques de traitement des exigences rigides et souples dans certains problèmes complexes d'optimisation combina...
référence BibTeX
This paper presents some preliminary results from an ongoing study of the impact of various operating scenarios on the construction and quality of reoutes in...
référence BibTeX