Normal view MARC view ISBD view

The vehicle routing problem

By: Toth, Paolo.
Material type: materialTypeLabelBookSeries: SIAM monographs on discrete mathematics and applications. Publisher: Philadelphia Society for Industrial and Applied Mathematics 2002Description: xviii, 367 p., ill. ; 27 cm.ISBN: 9780898715798.Subject(s): Transportation problems (Programming)DDC classification: 388.310285 Summary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
    average rating: 0.0 (0 votes)
Item type Current location Item location Call number Status Date due Barcode
Books Vikram Sarabhai Library
Slot 877 (0 Floor, East Wing) 388.310285 V3 (Browse shelf) Available 170096

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.

There are no comments for this item.

Log in to your account to post a comment.

Powered by Koha