Gilbert Laporte

The vehicle routing problem: An overview of exact and approximate algorithms

In this paper, some of the main known results relative to the Vehicle Routing Problem are surveyed. The paper is organized as follows: (1) definition; (2) exact algorithms; (3) heuristic algorithms; (4) conclusion.

A unified tabu search heuristic for vehicle routing problems with time windows

This paper presents a unified tabu search heuristic for the vehicle routing problem with time windows and for two important generalizations: the periodic and the multi-depot vehicle routing problems with time windows. The major benefits of the approach are its speed, simplicity and flexibility. The performance of the heuristic is assessed by comparing it to alternative methods on benchmark instances of the vehicle routing problem with time windows. Computational experiments are also reported on new randomly generated instances for each of the two generalizations.

A tabu search heuristic for periodic and multi‐depot vehicle routing problems

We propose a tabu search heuristic capable of solving three well-known routing problems: the periodic vehicle routing problem, the periodic traveling salesman problem, and the multi-depot vehicle routing problem. Computational experiments carried out on instances taken from the literature indicate that the proposed method outperforms existing heuristics for all three problems.

Stochastic vehicle routing

Abstract The purpose of this review article is to provide a summary of the scientific literature on stochastic vehicle routing problems. The main problems are described within a broad classification scheme and the most important contributions are summarized in table form.

The traveling salesman problem: An overview of exact and approximate algorithms

In this paper, some of the main known algorithms for the traveling salesman problem are surveyed. The paper is organized as follows: 1) definition; 2) applications; 3) complexity analysis; 4) exact algorithms; 5) heuristic algorithms; 6) conclusion.

Ambulance location and relocation models

This article traces the evolution of ambulance location and relocation models proposed over the past 30years. The models are classified in two main categories. Deterministic models are used at the planning stage and ignore stochastic considerations regarding the availability of ambulances. Probabilistic models reflect the fact that ambulances operate as servers in a queueing system and cannot always answer a call. In addition, dynamic models have been developed to repeatedly relocate ambulances throughout the day. 2002 Elsevier Science B.V. All rights reserved.

Fifty Years of Vehicle Routing

The Vehicle Routing Problem (VRP) was introduced 50 years ago by Dantzig and Ramser under the title “The Truck Dispatching Problem.” The study of the VRP has given rise to major developments in the fields of exact algorithms and heuristics. In particular, highly sophisticated exact mathematical programming decomposition algorithms and powerful metaheuristics for the VRP have been put forward in recent years. The purpose of this article is to provide a brief account of this development.

A guide to vehicle routing heuristics

Several of the most important classical and modern heuristics for the vehicle routing problem are summarized and compared using four criteria: accuracy, speed, simplicity and flexibility. Computational results are reported.

Planning models for freight transportation

Abstract The objective of this paper is to identify some of the main issues in freight transportation planning and operations, and to present appropriate Operations Research models and methods, as well as computer-based planning tools. The presentation is organized according to the three classical decision-making levels: strategic, tactic, operational. For each case, the problem and main issues are described, followed by a brief literature review and significant methodological and instrumental developments. We conclude with a few development perspectives.

Fleet management and logistics

Preface. Introduction T.G. Crainic, G. Laporte. 1. Exact Solution of the Vehicle Routing Problem P. Toth, D. Vigo. 2. Metaheuristics in Vehicle Routing B.L. Golden, et al. 3. A Unified Framework for Deterministic Time Constrained Vehicle Routing and Crew Scheduling Problems G. Desaulniers, et al. 4. The Inventory Routing Problem A. Campbell, et al. 5. Dynamic Vehicle Routing and Dispatching M. Gendreau, J.-Y. Potvin. 6. On Languages for Dynamic Resource Scheduling Problems W.B. Powell. 7. Solving Stochastic Routing Problems G. Laporte, F.V. Louveaux. 8. Crew Scheduling in Air Transportation G. Desaulniers, et al. 9. Path, Tree and Cycle Location M. Labbe, et al. 10. Parallel Metaheuristics T.G. Crainic, M. Toulouse.