Our systems are now restored following recent technical disruption, and we’re working hard to catch up on publishing. We apologise for the inconvenience caused. Find out more

Recommended product

Popular links

Popular links


The Vehicle Routing Problem

The Vehicle Routing Problem

The Vehicle Routing Problem

Paolo Toth , Università degli Studi, Bologna, Italy
Daniele Vigo , Università degli Studi, Bologna, Italy
January 2001
This item is not supplied by Cambridge University Press in your region. Please contact Soc for Industrial & Applied Mathematics for availability.
Paperback
9780898715798

Looking for an inspection copy?

This title is not currently available for inspection.

£92.00
GBP
Paperback

    In the field of combinatorial optimization problems, the Vehicle Routing Problem (VRP) is one of the most challenging. Defined more than 40 years ago, the problem involves designing the optimal set of routes for fleets of vehicles for the purpose of serving a given set of customers. Interest in VRP is motivated by its practical relevance as well as its considerable difficulty. The Vehicle Routing Problem covers both exact and heuristic methods developed for the VRP and some of its main variants, emphasizing the practical issues common to VRP. The book is composed of three parts containing contributions from well-known experts. The first part covers basic VRP, known more commonly as capacitated VRP. The second part covers three main variants of VRP: with time windows, backhauls, and pickup and delivery. The third part covers issues arising in real-world VRP applications and includes both case studies and references to software packages.

    Product details

    January 2001
    Paperback
    9780898715798
    385 pages
    253 × 176 × 17 mm
    0.68kg
    This item is not supplied by Cambridge University Press in your region. Please contact Soc for Industrial & Applied Mathematics for availability.

    Table of Contents

    • List of Contributors
    • Preface
    • 1. An Overview of Vehicle Routing Problems
    • Part I. Capacitated Vehicle Routing Problems. 2. Branch-and-Bound Algorithms for the Capacitated VRP
    • 3. Branch-and-Cut Algorithms for the Capacitated VRP
    • 4. Set-Covering-Based Algorithms for the Capacitated VRP
    • 5. Classical Heuristics for the Capacitated VRP
    • 6. Metaheuristics for the Capacitated VRP
    • Part II. Important Variants of the Vehicle Routing Problem. 7. VRP with Time Windows
    • 8. VRP with Backhauls
    • 9. VRP with Pickup and Delivery
    • Part III. Applications and Case Studies. 10. Routing Vehicles in the Real World. Applications in the Solid Waste, Beverage, Food, Dairy, and Newspaper Industries
    • 11. Capacitated Arc Routing Problem with Vehicle-Site Dependencies. The Philadelphia Experience
    • 12. Inventory Routing in Practice
    • 13. Routing Under Uncertainty. An Application in the Scheduling of Field Service Engineers
    • 14. Evolution of Microcomputer-Based Vehicle Routing Software. Case Studies in the United States
    • Index.
      Editors
    • Paolo Toth , Università degli Studi, Bologna, Italy
    • Daniele Vigo , Università degli Studi, Bologna, Italy