<p><P>The vehicle routing problem (VRP) is one of the most famous combinatorial optimization problems. In simple terms, the goal is to determine a set of routes with overall minimum cost that can satisfy several geographical scattered demands. Biological inspired computation is a field devoted to th
Bio-inspired Algorithms for the Vehicle Routing Problem
โ Scribed by Jean-Yves Potvin (auth.), Francisco Babtista Pereira, Jorge Tavares (eds.)
- Publisher
- Springer-Verlag Berlin Heidelberg
- Year
- 2009
- Tongue
- English
- Leaves
- 223
- Series
- Studies in Computational Intelligence 161
- Edition
- 1
- Category
- Library
No coin nor oath required. For personal study only.
โฆ Synopsis
The vehicle routing problem (VRP) is one of the most famous combinatorial optimization problems. In simple terms, the goal is to determine a set of routes with overall minimum cost that can satisfy several geographical scattered demands. Biological inspired computation is a field devoted to the development of computational tools modeled after principles that exist in natural systems. The adoption of such design principles enables the production of problem solving techniques with enhanced robustness and flexibility, able to tackle complex optimization situations.
The goal of the volume is to present a collection of state-of-the-art contributions describing recent developments concerning the application of bio-inspired algorithms to the VRP. Over the 9 chapters, different algorithmic approaches are considered and a diverse set of problem variants are addressed. Some contributions focus on standard benchmarks widely adopted by the research community, while others address real-world situations.
โฆ Table of Contents
Front Matter....Pages -
A Review of Bio-inspired Algorithms for Vehicle Routing....Pages 1-34
A GRASP ร Evolutionary Local Search Hybrid for the Vehicle Routing Problem....Pages 35-53
An Evolutionary Algorithm for the Open Vehicle Routing Problem with Time Windows....Pages 55-75
Using Genetic Algorithms for Multi-depot Vehicle Routing....Pages 77-99
Hybridizing Problem-Specific Operators with Meta-heuristics for Solving the Multi-objective Vehicle Routing Problem with Stochastic Demand....Pages 101-129
Exploiting Fruitful Regions in Dynamic Routing Using Evolutionary Computation....Pages 131-149
EVITA: An Integral Evolutionary Methodology for the Inventory and Transportation Problem....Pages 151-172
A Memetic Algorithm for a Pick-Up and Delivery Problem by Helicopter....Pages 173-190
When the Rubber Meets the Road: Bio-inspired Field Service Scheduling in the Real World....Pages 191-213
Back Matter....Pages -
โฆ Subjects
Appl.Mathematics/Computational Methods of Engineering; Software Engineering; Operations Research/Decision Theory
๐ SIMILAR VOLUMES
This tutorial introduces readers to several variants of routing problems with profits. In these routing problems each node has a certain profit, and not all nodes need to be visited. Since the orienteering problem (OP) is by far the most frequently studied problem in this category of routing problem
<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
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
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