Abstract
Genetic Algorithms (GAs) have proven to be a useful means of finding optimal or near optimal solutions to hard problems that are difficult to solve by other means. However, determining which crossover and mutation operator is best to use for a specific problem can be a complex task requiring much trial and error. Furthermore, different operators may be better suited to exploring the search space at different stages of evolution. For example, crossover and mutation operators that are more likely to disrupt fit solutions may have a less disruptive effect and better search capacity during the early stages of evolution when the average fitness is low. This paper presents an automated operator selection technique that largely overcomes these deficiencies in traditional GAs by enabling the GA to dynamically discover and utilize operators that happen to perform better at finding fitter solutions during the evolution process. We provide experimental results demonstrating the effectiveness of this approach by comparing the performance of our automatic operator selection technique with a traditional GA.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Holland, J.: Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence, 2nd edn. The University of Michigan Press (1975) 1993 MIT press edition
Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley Publishing, Reading (1989)
Mao, J., Hirasawa, K., Hu, J., Murata, J.: Increasing robustness of genetic algorithm. In: Publishers, M.K. (ed.) Proceedings of the Genetic and Evolutinary Computation Conference, pp. 456–462 (2002)
Suzuki, H., Iwasa, Y.: Crossover accelerates evolution in GAs with a Babel-like tness landscape: Mathematical analyses. Evolutionary Computation Journal 7(3), 275–310 (1999)
Vekaria, K., Clack, C.: Selective crossover in genetic algorithms: An empirical study. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, pp. 438–447. Springer, Heidelberg (1998)
Sebag, M., Schoenauer, M.: Controlling crossover through inductive learning. In: Davidor, Y., Männer, R., Schwefel, H.-P. (eds.) PPSN 1994. LNCS, vol. 866, pp. 209–218. Springer, Heidelberg (1994)
Gerasch, T., Wang, P.: A survey of parallel algorithm for one-dimensional integer knap-sack problems. INFOR 32(3), 163–186 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hilding, F.G., Ward, K. (2005). Automated Operator Selection on Genetic Algorithms. In: Khosla, R., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2005. Lecture Notes in Computer Science(), vol 3684. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11554028_126
Download citation
DOI: https://doi.org/10.1007/11554028_126
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28897-8
Online ISBN: 978-3-540-31997-9
eBook Packages: Computer ScienceComputer Science (R0)