Gilbert Laporte
BackCahiers du GERAD
149 results — page 6 of 8
In this paper, the problem of optimally locating the numbers around a dart board is investigated. The objective considered is risk maximization. Under diffe...
BibTeX reference
This paper considers a flexible manufacturing system for several products, each requiring a number of sequential non-preemptive tasks, some of which may be...
BibTeX reference
This paper shows how the subtour elimination constraints developed by Miller, Tucker and Zemlin for the traveling salesman problem can be improved and exten...
BibTeX reference
In this paper, we present general formulations for the stochastic vehicle routing problem with capacity restrictions in which the <i>m</i> vehicle tours hav...
BibTeX reference
Given a weighted graph with profits associated with the vertices, the selective travelling salesman problem (or orienteering problem) consists of selecting ...
BibTeX reference
This paper describes a family of stochastic location-routing problems which consist of simultaneously locating a depot among a set of potential sites, of det...
BibTeX reference
In this paper we analyze the problem of finding the trading area for a facility on a linear market. Given the objective of maximizing profit, we first build...
BibTeX reference
This paper examines a class of asymmetrical multi-depot vehicle routing problems and location-routing problems, under capacity or maximum cost restrictions. ...
BibTeX reference
In this paper, an extension of the classical scheduling problem is considered. It is assumed that tasks are processed on parallel processors, available at d...
BibTeX referenceLocation-Routing Problems
Location-routing problems involve simultaneously locating a number of facilities among candidate sites and establishing delivery routes to a set of users in ...
BibTeX referenceVehicle 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...
BibTeX reference
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...
BibTeX reference
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...
BibTeX reference
Post box collection constitutes a complex and costly operation in most postal services. The authors recently undertook a study aimed at improving this opera...
BibTeX reference
This paper describes a vehicle flow model for a two-echelon location-routing problem involving deliveries from primary to secondary facilities and from secon...
BibTeX referenceA 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 ...
BibTeX reference
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...
BibTeX reference
This paper considers the archeological seriation problem defined over incidence matrices. Two procedures adapted from interchange algorithms for the travell...
BibTeX reference
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...
BibTeX reference
This paper presents an exact algorithm for a generalized version of the Travelling Salesman Problem which consists of finding the shortest Hamiltonian cirnui...
BibTeX reference