- We will send in 10–14 business days.
/images/books/12392730/9781848218116.jpg)
- Author: Nacima LaBadie
- Publisher: Wiley-ISTE
- ISBN-10: 1848218117
- ISBN-13: 9781848218116
- Format: 15.6 x 23.4 x 1.3 cm, hardcover
- Language: English
- SAVE -10% with code: EXTRA
Reviews
Description
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.
As a first step, a general presentation intends to make the reader more familiar with the related field of logistics and combinatorial optimization. This preamble is completed with a description of significant heuristic methods classically used to provide feasible solutions quickly, and local improvement moves widely used to search for enhanced solutions. The overview of these fundamentals allows appreciating the core of the work devoted to an analysis of metaheuristic methods for vehicle routing problems. Those methods are exposed according to their feature of working either on a sequence of single solutions, or on a set of solutions, or even by hybridizing metaheuristic approaches with others kind of methods.
EXTRA 10 % discount with code: EXTRA
The promotion ends in 19d.13:38:30
The discount code is valid when purchasing from 10 €. Discounts do not stack.
- Author: Nacima LaBadie
- Publisher: Wiley-ISTE
- ISBN-10: 1848218117
- ISBN-13: 9781848218116
- Format: 15.6 x 23.4 x 1.3 cm, hardcover
- Language: English English
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.
As a first step, a general presentation intends to make the reader more familiar with the related field of logistics and combinatorial optimization. This preamble is completed with a description of significant heuristic methods classically used to provide feasible solutions quickly, and local improvement moves widely used to search for enhanced solutions. The overview of these fundamentals allows appreciating the core of the work devoted to an analysis of metaheuristic methods for vehicle routing problems. Those methods are exposed according to their feature of working either on a sequence of single solutions, or on a set of solutions, or even by hybridizing metaheuristic approaches with others kind of methods.
Reviews