By Topic

Multiple vehicle routing with time windows using genetic algorithms

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)
Louis, S.J. ; Dept. of Comput. Sci., Nevada Univ., Reno, NV, USA ; Xiangying Yin ; Zhen Ya Yuan

We use genetic algorithm to attack the vehicle routing problem with time windows. Previous work has shown that although merge crossover works better than traditional cross operators for this problem, it does poorly on problems with non-random customer locations. We modify the merge crossover operator to achieve better performance on problems with clustered customer locations. Our algorithm optimally solved three out of six benchmark problems and came within 0.23% of the optimal on the rest

Published in:

Evolutionary Computation, 1999. CEC 99. Proceedings of the 1999 Congress on  (Volume:3 )

Date of Conference:

1999