Abstract
There are lots of methods inpired by the natural observations (i.e. fuzzy logic, artificial neural networks, genetic algorithms, simulated annealing algorithms, etc.) This paper proposes a novel crossover operator type inspired by the sexual intercourses of honey bees. The method selects a specific chromosome in present population as queen bee. While the selected queen bee is one parent of crossover, all the remaining chromosomes have the chance to be next parent for crossover in each generation once. For this purposes, we defined three honey bee crossover methods: In the first method, the chromosome with the best fitness score is queen honey bee and it is a fixed parent for crossover in the current generation. The second method handles the chromosome with the worst fitness score. Finally, queen bee is changed sequentially in each generation.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Goldberg, D.: Genetic Algorithm in Search, Optimization and Machine Learning. Addison-Wesley Publishing Company Inc., Massachusetts (1989)
Karcõ, A., Arslan, A.: Bidirectional evolutinary heuristic for the minimum vertex-cover problem. Journal of Computers and Electrical Engineerings 29, 111–120 (2003)
Karcõ, A., Arslan, A.: Uniform Population in Genetic algorithms. İ.Ü. Journal of Electrical & Electronics 2(2), 495–504 (2002)
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
Karcı, A. (2004). Imitation of Bee Reproduction as a Crossover Operator in Genetic Algorithms. In: Zhang, C., W. Guesgen, H., Yeap, WK. (eds) PRICAI 2004: Trends in Artificial Intelligence. PRICAI 2004. Lecture Notes in Computer Science(), vol 3157. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28633-2_141
Download citation
DOI: https://doi.org/10.1007/978-3-540-28633-2_141
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22817-2
Online ISBN: 978-3-540-28633-2
eBook Packages: Springer Book Archive