Gilbert Laporte
BackCahiers du GERAD
149 results — page 7 of 8
An 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...
BibTeX reference
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...
BibTeX reference
This paper presents an integer linear programming formulation for the symmetrical capacitated vehicle routing problem (CVRP). This formulation includes degr...
BibTeX reference
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...
BibTeX reference
This paper examines a family of permutation problems on 0-1 matrices. These problems arise in scheduling and in archaeological seriation. Three exact algor...
BibTeX reference
This paper presents a survey of exact algorithms for various types of vehicle routing problems. Algorithms are divided into three main categories: direct s...
BibTeX referenceLe 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...
BibTeX reference
This paper examines some properties of generalized subtour elimination constraints and connectivity constraints used in a variety of routing problems.
BibTeX reference
People who attend several meetings on the same day often have unusable pieces of free time between meetings. These can be reduced or eliminated through bett...
BibTeX reference
In some universities, complete course schedules are made available to students at the time of registration. Typically these schedules give the room number, ...
BibTeX reference
In location-routing problems, the objective is to locate one or many depots within a set of sites (representing customer locations or cities) and to construc...
BibTeX reference
The aim of this paper is to develop an exact algorithm for the asymmetrical capacitated vehicle routing problem, i.e. the multiple travelling salesman proble...
BibTeX reference
Ce rapport décrit un modèle de planification tactique pour l'amélioration de l'industrie du camionnage au Canada. après une brève description du problème, o...
BibTeX referenceFinding the Shortest Hamiltonian Circuit Through n Clusters: A Lagrangean Relaxation Approach
This paper deals with a generalized version of the Travelling Salesman Problem which consists of finding the shortest Hamiltonian circuit through n clusters,...
BibTeX reference
This paper describes algorithmic approaches for dealing with fuzziness in some highly structured combinatorial problems. A general framework is described an...
BibTeX reference
This paper describes an integer linear programming algorithm for vehicle routing problems involving capacity and distance constraints. The method uses const...
BibTeX reference
This paper provides an integer linear programming formulation and an exact algorithm for a class of multidepot vehicle routing problems. This formulation co...
BibTeX reference
This paper provides integer linear programming formulations for three types of vehicle routing problems. Appropriate relaxations of these formulations lend ...
BibTeX reference
This paper provides an integer linear programming formulation for a class of multidepot vehicle routing problems. This formulation contains degree constrain...
BibTeX reference