By Topic

Improving the Performance of Genetic Algorithm in Capacitated Vehicle Routing Problem using Self Imposed Constraints

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

3 Author(s)
Ursani, Z. ; Sch. of Inf. Technol. & Electr. Eng., New South Wales Univ., Canberra, ACT ; Sarker, R. ; Abbass, H.A.

The capacitated vehicle routing problem (CVRP) is a well known member of the family of NP hard problems. In the past few decades, a number of heuristics was introduced to solve this problem but no heuristic can claim to work well in all possible scenarios. In the literature, genetic algorithm (GA) even lags behind the other heuristics. In this paper, we reveal some of the reasons for the inferior performance of GA, and propose a number of mechanisms to improve its performance. A number of test problems are solved to demonstrate the usefulness of the algorithm.

Published in:

Computational Intelligence in Scheduling, 2007. SCIS '07. IEEE Symposium on

Date of Conference:

1-5 April 2007