Theoretical research and practical applications in the ?eld of vehicle routing started in 1959 with the truck dispatching problem posed by Dantzig and Ramser [1]: ?nd the. optimum routing of a ?eet of gasoline delivery trucks between a bulk terminal and a large number of service stations supplied by the terminal. Using a method based on a linear programming formulation, their hand calculations produced a near-optimal solution with four routes to aproblemwithtwelve service stations. The authorsproclaimed:Nopractical applications of the method have been made as yet. In the nearly 50 years since the Dantzig and Ramser paper appeared, work in the ?eld has exploded dramatically. Today, a Google Scholar search of the words vehicle routing problem (VRP) yields more than 21,700 entries. The June 2006 issue of OR/MS Today provided a survey of 17 vendors of commercial routing software whose packages are currently capable of solving average-size problems with 1,000 stops, 50 routes, and two-hour hard-time windows in two to ten minutes [2]. In practice, vehicle routing may be the single biggest success story in operations research. For example, each day 103,500 drivers at UPS follow computer-generated routes. The drivers visit 7. 9 million customers and handle an average of 15. 6 million packages [3].

Hersteller:
Springer Verlag GmbH
juergen.hartmann@springer.com
Tiergartenstr. 17
DE 69121 Heidelberg

Routing a heterogeneous fleet of vehicles.- A decade of capacitated arc routing.- Inventory routing.- The period vehicle routing problem and its extensions.- The split delivery vehicle routing problem: a survey.- Challenges and advances in a priori routing.- Metaheuristics for the vehicle routing problem and its extensions.- Parallel solution methods for vehicle routing problems.- Recent developments in dynamic vehicle routing systems.- Online vehicle routing problems: a survey.- Modeling and solving the capacitated vehicle routing problems on trees.- Using a genetic algorithm to solve the generalized orienteering problem.- An integer linear programming local search for capacitated vehicle routing problems.- Robust branch-cut-and-price algorithms for vehicle routing problems.- Recent models and algorithms for one-to-one pickup and delivery problems.- One-to-many-to-one single vehicle pickup and delivery problems.- Challenges and opportunities in attended home delivery.- Chvatal-Gomory rank-1 cuts used in a Dantzig-Wolfe decomposition of the vehicle routing problem with time windows.- Vehicle routing problems with inter-tour resource constraints.- From single-objective to multi-objective vehicle problems: motivations, case studies, and methods.- Vehicle routing for small package delivery and pickup services.- Advances in meter reading: heuristic solution of the close enough traveling salesman problem over a street network.- Multiperiod planning and routing on a rolling horizon for field force optimization logistics.- Health care logistics, emergency preparedness, and disaster relief: new challenges for routing problems with a focus on the Austrian situation.- Vehicle routing problems and container terminal operations - an update of research.