Abstract
Genetic algorithms are adaptive heuristic search algorithms which have been successfully used in a number of applications and their performance are mainly influenced by selection operator. In this paper three variants of polygamous selection, a special case of elitism where the best individual of the population act as one parent for mating with other chromosomes in all crossover operations, are proposed, their performances are compared along with other selection approaches such as roulette wheel, rank, annealed etc.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Holland, J.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)
Goldberg, D.E.: Genetic Algorithms in Search, Optimisation and Machine Learning. Addison Wesley Longman, Inc. (1989) ISBN 0-201-15767-5
Paxton, R.J.: Male Mating Behaviour and Mating Systems of Bees: an Overview. Apidologie 36, 145–156 (2005), Article published by EDP Sciences, http://dx.doi.org/10.1051/apido:2005007
Gu, M., Yang, F.: An Improved Genetic Algorithm Based on Polygymy. In: Proceedings of Third International Symposium on Intelligent Information Technology and Security Informatics, pp. 371–373 (2010) ISBN: 978-0-7695-4020-7
Al Jaddan, O., Rajamani, L., Rao, C.R.: Improved Selection Operator for GA. Journal of Theoretical and Applied Information Technology, 269–277 (2005)
Sivanandam, S.N., Deepa, S.N.: Introduction to Genetic Algorithms. Springer, Heidelberg (2007) ISBN 9783540731894
Affenzeller, M., Winkler, S., Wagner, S.: Genetic Algorithms and Genetic Programming: Modern Concepts and Practical Applications. Chapman-Hall, CRC (2009) ISBN 1584886293
Rechenberg, I.: Evolutionsstrategie – Optimierung technischer Systeme nach Prinzipien der biologischen Evolution (PhD thesis). Fromman-Holzboog Verlag, Stuttgart (1973)
De Jong, K.A.: An Analysis of the Behavior of a Class of Genetic Adaptive Systems (Doctoral dissertation, University of Michigan) Dissertation Abstracts International 36(10), 5140B University Microfilms No. 76/9381 (1975)
Schwefel, H.P.: Numerical Optimization of Computer Models. John Wiley & Sons, NewYork (1981)
Goldberg, D.E., Deb, K.: A Comparative Analysis of Selection Schemes Used in Genetic Algorithms. In: Foundations of Genetic Algorithms, vol. I, pp. 69–93. Morgan Kaufmann (1991)
Fogel, D.B.: Evolutionary Computation. In: Toward a New Philosophy of Machine Intelligence. IEEE Press, Piscataway (1995)
Kumar, R., Jyotishree: Blending Roulette Wheel Selection & Rank Selection in Genetic Algorithms. In: Proceedings of International Conference on Machine Learning and Computing, vol. 4, pp. 197–202. IEEE Catalog Number CFP1127J-PRT (2011) ISBN 978-1-4244-9252-7
Baker, J.E.: Adaptive Selection Methods for Genetic Algorithms. In: Proceedings of International Conference on Genetic Algorithms and Their Applications (ICGA1), pp. 101–111 (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kumar, R., Jyotishree (2012). Novel Approach to Polygamous Selection in Genetic Algorithms. In: Satapathy, S.C., Avadhani, P.S., Abraham, A. (eds) Proceedings of the International Conference on Information Systems Design and Intelligent Applications 2012 (INDIA 2012) held in Visakhapatnam, India, January 2012. Advances in Intelligent and Soft Computing, vol 132. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27443-5_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-27443-5_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27442-8
Online ISBN: 978-3-642-27443-5
eBook Packages: EngineeringEngineering (R0)