Solving large-scale vehicle routing problem instances using an island-model offspring selection genetic algorithm

Research output: Chapter in Book/Report/Conference proceedingsConference contribution

6 Citations (Scopus)

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 languageEnglish
Title of host publicationLINDI 2011 - 3rd IEEE International Symposium on Logistics and Industrial Informatics, Proceedings
Pages27-31
Number of pages5
DOIs
Publication statusPublished - 2011
Event3rd IEEE International Symposium on Logistics and Industrial Informatics (LINDI 2011) - Budapest, Hungary
Duration: 25 Aug 201127 Aug 2011
http://conf.uni-obuda.hu/lindi2011/

Publication series

NameLINDI 2011 - 3rd IEEE International Symposium on Logistics and Industrial Informatics, Proceedings

Conference

Conference3rd IEEE International Symposium on Logistics and Industrial Informatics (LINDI 2011)
CountryHungary
CityBudapest
Period25.08.201127.08.2011
Internet address

Keywords

  • island-model genetic algorithm
  • offspring selection
  • Vehicle routing problem

Fingerprint Dive into the research topics of 'Solving large-scale vehicle routing problem instances using an island-model offspring selection genetic algorithm'. Together they form a unique fingerprint.

Cite this