Please use this identifier to cite or link to this item: http://hdl.handle.net/1783.1/2232

Locus Oriented Adaptive Genetic Algorithm: Application to the Zero/One Knapsack Problem

Authors Ma, Chun Wai HKUST affiliated (currently or previously).
Szeto, Kwok Yip View this author's profile
Issue Date 2004
Source Proceeding of The 5th International Conference on Recent Advances in Soft Computing, RASC2004 , 2004, p. 410-415
Summary The biological observation of the difference in the mutation rates of allele on different loci is implemented in genetic algorithm so that the mutation rate is both time and locus dependent. The performance of this new locus oriented adaptive genetic algorithm (LOAGA) is evaluated on the test problem of zero/one knapsack for various sizes. It is found that LOAGA can solve the single constraint zero/one knapsack with high speed, high success rate, and small memory requirement. A heuristic argument is given to show how the statistical information inside the population can be used to tune the mutation rate at individual locus, resulting in higher overall performance.
Conference The 5th International Conference on Recent Advances in Soft Computing, RASC2004, Nottingham, UK, 16-18 December 2004
Subjects
Language English
Format Conference paper
Access Find@HKUST
Files in this item:
File Description Size Format
MaSzetoRASC20040813.pdf 87812 B Adobe PDF