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
The vehicle routing problem
- Publisher
- Philadelphia : Society for Industrial and Applied Mathematics
- Year
- 2002
- Tongue
- English
- Category
- Library
No coin nor oath required. For personal study only.
โฆ Synopsis
xviii, 367 pages : 27 cm
๐ SIMILAR VOLUMES
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
<p>This book is dedicated to metaheuristics as applied to vehicle routing problems. Several implementations are given as illustrative examples, along with applications to several typical vehicle routing problems. </p> <p>As a first step, a general presentation intends to make the reader more familia
<p>This book is dedicated to metaheuristics as applied to vehicle routing problems. Several implementations are given as illustrative examples, along with applications to several typical vehicle routing problems. </p> <p>As a first step, a general presentation intends to make the reader more familia