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.
Originalsprache | Englisch |
---|---|
Titel | LINDI 2011 - 3rd IEEE International Symposium on Logistics and Industrial Informatics, Proceedings |
Seiten | 27-31 |
Seitenumfang | 5 |
DOIs | |
Publikationsstatus | Veröffentlicht - 2011 |
Veranstaltung | 3rd IEEE International Symposium on Logistics and Industrial Informatics (LINDI 2011) - Budapest, Ungarn Dauer: 25 Aug. 2011 → 27 Aug. 2011 http://conf.uni-obuda.hu/lindi2011/ |
Publikationsreihe
Name | LINDI 2011 - 3rd IEEE International Symposium on Logistics and Industrial Informatics, Proceedings |
---|
Konferenz
Konferenz | 3rd IEEE International Symposium on Logistics and Industrial Informatics (LINDI 2011) |
---|---|
Land/Gebiet | Ungarn |
Ort | Budapest |
Zeitraum | 25.08.2011 → 27.08.2011 |
Internetadresse |