Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/23269
Title: An empirical study of a pure genetic algorithm to solve the capacitated vehicle routing problem
Authors: Wu, Y
Ji, P 
Wang, T
Keywords: Vehicle routing problem
Genetic algorithm
Replacement strategy
Issue Date: 2008
Source: ICIC Express letters, 2008, v. 2, no. 1, p. 41-45 How to cite?
Journal: ICIC Express letters 
Abstract: Despite some successful applications of genetic algorithms (GAs) for solving the capacitated vehicle routing problems, they usually rely on problem-specific components or hybridization with other heuristics for obtaining competitive solutions. These problemspecific and hybridized characteristics complicate the GA implementation for solving reallife problems. In this paper, a pure GA for the capacitated vehicle routing problem is proposed. The performance of the algorithm is improved through using a new replacement strategy, which is simple and not problem specific. Computational results show that the new GA solves the problem efficiently and achieves much better results than another pure GA in literature.
URI: http://hdl.handle.net/10397/23269
ISSN: 1881-803X
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

41
Last Week
2
Last month
Checked on Aug 13, 2017

Google ScholarTM

Check



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.