This book is dedicated to metaheuristics as applied to vehicle routing problems. Several implementations are given as illustrative examples, along with applications to several typical vehicle routing problems.
As a first step, a general presentation intends to make the reader more familiar with the related field of logistics and combinatorial optimization. This preamble is completed with a description of significant heuristic methods classically used to provide feasible solutions quickly, and local improvement moves widely used to search for enhanced solutions. The overview of these fundamentals allows appreciating the core of the work devoted to an analysis of metaheuristic methods for vehicle routing problems. Those methods are exposed according to their feature of working either on a sequence of single solutions, or on a set of solutions, or even by hybridizing metaheuristic approaches with others kind of methods.
Notations and Abbreviations ix
Introduction xiii
Chapter 1. General Presentation of Vehicle Routing Problems 1
1.1. Logistics management and combinatorial optimization 1
1.1.1. History of logistics 2
1.1.2. Logistics as a science 5
1.1.3. Combinatorial optimization 5
1.2. Vehicle routing problems 6
1.2.1. Problems in transportation optimization 6
1.2.2. Vehicle routing problems in other contexts 7
1.2.3. Characteristics of vehicle routing problems 7
1.2.4. The capacitated vehicle routing problem 11
1.3. Conclusion 13
Chapter 2. Simple Heuristics and Local Search Procedures 15
2.1. Simple heuristics 16
2.1.1. Constructive heuristics 16
2.1.2. Two-phase methods 19
l3¿