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

Item added to bagSorry, there was a problem getting your bag informationItem cannot be purchased with the existing contents of your bagItem unavailable online
✕

was added to your bag.

Please try again.

Sorry, this item cannot be purchased in the same transaction as the existing items in your bag.

Please complete the purchase of the items currently in your bag and then add this item in a separate transaction or visit Shopping Help.

Sorry, this product is not currently available to buy online. Please visit Shopping Help.

View bag and checkout
Remove item
✕

Are you sure you want to remove from your bag?

Recommended product

Popular links

Popular links

The Vehicle Routing Problem

All titles
The Vehicle Routing Problem

The Vehicle Routing Problem

Paolo Toth , Università degli Studi, Bologna, Italy
Daniele Vigo , Università degli Studi, Bologna, Italy
January 1987
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 examination copy?

This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact [email protected] providing details of the course you are teaching.

$142.00
USD
Paperback
    Description

    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 1987
    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.

    Often bought together

    Network Flow Algorithms
    Network Flow Algorithms

    : Paperback

    Network Flow Algorithms
    Network Flow Algorithms

    : Hardback

    Algorithms Illuminated
    Algorithms Illuminated

    : Hardback

    Omnibus Edition

    Graph Algorithms
    Graph Algorithms

    : Hardback

    Often bought together

    cambridge core banner

    Related Journals

    Combinatorics, Probability and Computing
    Combinatorics, Probability and Computing

    : Journal

    Published bimonthly, Combinatorics, Probability & Computing is devoted to the three areas of combinatorics, probability theory and theoretical computer science. Topics covered include classical and algebraic graph theory, extremal set theory, matroid theory, probabilistic methods and random combinatorial structures; combinatorial probability and limit theorems for random combinatorial structures; the theory of algorithms (including complexity theory), randomised algorithms, probabilistic analysis of algorithms, computational learning theory and optimisation.

    Mathematical Structures in Computer Science
    Mathematical Structures in Computer Science

    : Journal

    Mathematical Structures in Computer Science is a journal of theoretical computer science which focuses on the application of ideas from the structural side of mathematics and mathematical logic to computer science. The journal aims to bridge the gap between theoretical contributions and software design, publishing original papers of a high standard and broad surveys with original perspectives in all areas of computing, provided that ideas or results from logic, algebra, geometry, category theory or other areas of logic and mathematics form a basis for the work. The journal welcomes applications to computing based on the use of specific mathematical structures (e.g. topological and order-theoretic structures) as well as on proof-theoretic notions or results. The journal will also accept contributions in new interdisciplinary fields bridging computer science, quantum physics, mathematics and information theory. In particular, papers on quantum information processing and communication, as well as on the related issues in quantum language design will be considered. The journal is also interested in papers on computational modelling of epigenetics phenomena, protein-protein interaction, stochasticity in molecular cascades. Mathematical approches to System Biology will be welcomed, within the broad frame of post-genomic views of embryogenesis and evolution.

    Related Journals

    Also by this Author

    Contents

    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.
      • Show more
    Courses
    Resources
    Additional Information
    About the authors
      Editors
    • Paolo Toth , Università degli Studi, Bologna, Italy
    • Daniele Vigo , Università degli Studi, Bologna, Italy
    Accessibility

    Browse by related subject

     
    ✕

    Sorry, this item cannot be purchased in the same transaction as the existing items in your cart.

    Please complete the purchase of the items currently in your cart and then add this item in a separate transaction or contact

    Customer Services