Abstract
An augmented compact genetic algorithm (acGA) is presented in this paper. It exhibits all the desirable characteristics of compact genetic algorithm (cGA). While the selection strategy of cGA is similar to (steady-state) tournament selection with replacement (TSR), the proposed algorithm employs a strategy akin to tournament selection without replacement (TS/R). The latter is a common feature of genetic algorithms (GAs) as it is perceived to be effective in keeping the selection noise as low as possible. The proposed algorithm stochastically maintains the progress of convergence even after the probability (distribution) vector (PV) begins transition towards one of the solutions. Experimental results show that the proposed algorithm converges to a similar solution at a faster rate than the cGA.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)
Goldberg, D.E., Deb, K., Clark, J.H.: Genetic Algorithms, Noise, and the Sizing of Populations. Complex Systems 6, 333–362 (1992)
Harik, G., Cantu-Paz, E., Goldberg, D.E., Miller, B.L.: The Gambler’s Ruin Problem, Genetic Algorithms, and the Sizing of Populations. Evolutionary Computation 7(3), 231–253 (1999)
Harik, G., Lobo, F.G., Goldberg, D.E.: The Compact Genetic Algorithm. IEEE Transactions on Evolutionary Computation 3(4), 287–297 (1999)
Schaffer, J.D., Caruana, R.A., Eshelman, L.J., Das, R.: A Study of Control Parameters Affecting Online Performance of Genetic Algorithms for Function Optimization. In: Proceedings of the 3rd International Conference on Genetic Algorithms, pp. 51–59. Morgan Kaufmann, CA (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ahn, C.W., Ramakrishna, R.S. (2004). Augmented Compact Genetic Algorithm. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2003. Lecture Notes in Computer Science, vol 3019. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24669-5_73
Download citation
DOI: https://doi.org/10.1007/978-3-540-24669-5_73
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21946-0
Online ISBN: 978-3-540-24669-5
eBook Packages: Springer Book Archive