Abstract
Vehicle routing problems are at the heart of most decision support systems for real-life distribution problems. In vehicle routing problem a set of routes must be determined at lowest total cost for a number of resources (i.e. fleet of vehicles) located at one or several points (e.g. depots, warehouses) in order to efficiently service a number of demand or supply points. In this paper an efficient evolution strategies algorithm is developed for both capacitated vehicle routing problem and for vehicle routing problem with time window constraints. The algorithm is based on a new multi-parametric mutation procedure that is applied within the 1 + 1 evolution strategies algorithm. Computational testing on six real-life problems and 195 benchmark problems demonstrate that the suggested algorithm is efficient and highly competitive, improving or matching the current best-known solution in 42% of the test cases.
| Original language | English |
|---|---|
| Pages (from-to) | 508-517 |
| Number of pages | 10 |
| Journal | Expert Systems with Applications |
| Volume | 32 |
| Issue number | 2 |
| Early online date | 17 Jan 2006 |
| DOIs | |
| Publication status | Published - Feb 2007 |
UN SDGs
This output contributes to the following UN Sustainable Development Goals (SDGs)
-
SDG 16 Peace, Justice and Strong Institutions
Keywords
- Distribution management
- Evolution strategies
- Heuristics
- Vehicle routing problem
Fingerprint
Dive into the research topics of 'A multi-parametric evolution strategies algorithm for vehicle routing problems'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver