The Vehicle Routing Problem 9780898715798, 0898715792

In the field of combinatorial optimization problems, the Vehicle Routing Problem (VRP) is one of the most challenging. D

319 100 699KB

English Pages 386 Year 2001

Report DMCA / Copyright

DOWNLOAD PDF FILE

Table of contents :
The Vehicle Routing Problem......Page 2
SIAM Monographs on Discrete Mathematics and Applications......Page 3
ISBN 0-89871-579-2......Page 5
List of Contributors......Page 6
Contents......Page 10
Preface......Page 18
1 An Overview of Vehicle Routing Problems......Page 20
Part I Capacitated Vehicle Routing Problem......Page 46
2 Branch-and-Bound Algorithms for the Capacitated VRP......Page 48
3 Branch-and-Cut Algorithms for the Capacitated VRP......Page 72
4 Set-Covering-Based Algorithms for the Capacitated VRP......Page 104
5 Classical Heuristics for the Capacitated VRP......Page 128
6 Metaheuristics for the Capacitated VRP......Page 148
Part II Important Variants of the Vehicle Routing Problem......Page 174
7 VRP with Time Windows......Page 176
8 VRP with Backhauls......Page 214
9 VRP with Pickup and Delivery......Page 244
Part III Applications and Case Studies......Page 262
10 Routing Vehicles in the Real World: Applications in the Solid Waste, Beverage, Food, Dairy, and Newspaper Industries......Page 264
11 Capacitated Arc Routing Problem with Vehicle-Site Dependencies: The Philadelphia Experience......Page 306
12 Inventory Routing in Practice......Page 328
13 Routing Under Uncertainty: An Application in the Scheduling of Field Service Engineers......Page 350
14 Evolution of Microcomputer-Based Vehicle Routing Software: Case Studies in the United States......Page 372
Index......Page 382

The Vehicle Routing Problem
 9780898715798, 0898715792

  • 0 0 0
  • Like this paper and download? You can publish your own PDF file online for free in a few minutes! Sign Up
File loading please wait...
Recommend Papers