By Topic

A Parallel EAX-based Algorithm for Minimizing the Number of Routes in the Vehicle Routing Problem with Time Windows

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
$31 $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

2 Author(s)
Blocho, M. ; Silesia Univ. of Technol., Gliwice, Poland ; Czech, Z.J.

A parallel EAX-based algorithm for minimizing the number of routes in the vehicle routing problem with time windows is presented. The main contribution is a novel approach concerning the usage of the edge assembly crossover (EAX) operator during exchanging the best solutions between the processes. The objective of the work is to analyze the speedup, achieved accuracy of solutions and scalability of the MPI implementation. For comparisons the selected Gehring and Homberger's (GH) tests are used. The results of the extensive computational experiments indicate that the new algorithm based on the EAX approach is not only very fast but also very effective. The eight new best-known solutions for the GH benchmarking tests were found by making use of the algorithm.

Published in:

High Performance Computing and Communication & 2012 IEEE 9th International Conference on Embedded Software and Systems (HPCC-ICESS), 2012 IEEE 14th International Conference on

Date of Conference:

25-27 June 2012