By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Vonolfen, S. ; Sch. of Inf., Commun. & Media, Upper Austria Univ. of Appl. Sci., Hagenberg, Austria ; Affenzeller, M. ; Beham, A. ; Wagner, S.

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.

Published in:

Logistics and Industrial Informatics (LINDI), 2011 3rd IEEE International Symposium on

Date of Conference:

25-27 Aug. 2011