Please use this identifier to cite or link to this item:
|Title:||Cooperating memes for vehicle routing problems||Authors:||Chen, X.
Vehicle routing problems
|Issue Date:||Nov-2011||Citation:||Chen, X.,Ong, Y.S.,Lim, M.H.,Ping, Y.S. (2011-11). Cooperating memes for vehicle routing problems. International Journal of Innovative Computing, Information and Control 7 (11) : 6483-6506. ScholarBank@NUS Repository.||Abstract:||To date, algorithms that are designed for solving different Vehicle Routing Problem (VRP) benchmarks usually incorporate domain driven biases of various forms. This makes an algorithm effective and efficient for some VRP benchmark sets but not necessarily on others. This paper presents a memetic algorithm for Capacitated Vehicle Routing Problems (CVRPs), which is specially designed for applying intense local search methods or merries. The main contribution of this work is a VRP domain-specific cooperating multi-strategy individual learning procedure. The MA finds high-quality solutions by using cooperating individual learning strategies or merries, each having different learning roles and search features. Experiments on several sets of VRP benchmarks of various problem characteristics showed that the algorithm is better or more competitive when compared with a number of state-of-the-art memetic algorithms and metaheuristics for CVRPs. © 2011 ICIC INTERNATIONAL.||Source Title:||International Journal of Innovative Computing, Information and Control||URI:||http://scholarbank.nus.edu.sg/handle/10635/82099||ISSN:||13494198|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Oct 27, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.