Referenced Items are not available for this document.
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
- Meeting Date :
- 06 Jul 1999-09 Jul 1999
- Print ISBN:
- 0-7803-5536-9
- INSPEC Accession Number:
- 6339020
- Conference Location :
- Washington, DC
- Digital Object Identifier :
- 10.1109/CEC.1999.785493
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
