Abstract
The vehicle routing problem is a class of problems that frequently occurs in the field of transportation logistics. In this work, we tackle very-large scale problem instances with time windows. Among other techniques, metaheuristics are frequently used to solve large-scale instances close to optimality. We present an island-model genetic algorithm variant and apply several techniques such as offspring selection and adaptive constraint relaxation. To validate our approach, we perform test runs on benchmark instances with 1000 customers and compare the results to the currently best-known solutions.
Original language | English |
---|---|
Title of host publication | LINDI 2011 - 3rd IEEE International Symposium on Logistics and Industrial Informatics, Proceedings |
Pages | 27-31 |
Number of pages | 5 |
DOIs | |
Publication status | Published - 2011 |
Event | 3rd IEEE International Symposium on Logistics and Industrial Informatics (LINDI 2011) - Budapest, Hungary Duration: 25 Aug 2011 → 27 Aug 2011 http://conf.uni-obuda.hu/lindi2011/ |
Publication series
Name | LINDI 2011 - 3rd IEEE International Symposium on Logistics and Industrial Informatics, Proceedings |
---|
Conference
Conference | 3rd IEEE International Symposium on Logistics and Industrial Informatics (LINDI 2011) |
---|---|
Country/Territory | Hungary |
City | Budapest |
Period | 25.08.2011 → 27.08.2011 |
Internet address |
Keywords
- island-model genetic algorithm
- offspring selection
- Vehicle routing problem