Abstract
Genetic Algorithms (GA) are a set of algorithms that use biological evolution as inspiration to solve search problems. One of the difficulties found when working with GA are the several parameters that have to be set and the many details that can be tunned in the GA. Usually it leads to the execution of several experiments in order to study how the GA behaves under different circumstances. In general it requires several computational resources and time to code the same algorithm with slight differences several times. In this paper we propose a framework based on agent technology able to parallelize the experiment and to split it into several components. It is complemented with a description of how this framework can be used in the evolution of regular expressions.
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.
References
Barrero, D.F., Camacho, D., R-Moreno, M.D.: Automatic Web Data Extraction Based on Genetic Algorithms and Regular Expressions. In: Data Mining and Multiagent Integration, August 2009. Springer, Heidelberg (2009)
Barrero, D.F., R-Moreno, M.D., López, D.R., García, Ó.: Searchy: A metasearch engine for heterogeneus sources in distributed environments. In: Proceedings of the International Conference on Dublin core and Metadata Applications, Madrid, Spain, September 2005, pp. 261–265 (2005)
Chu, D., Rowe, J.E.: Crossover operators to control size growth in linear GP and variable length GAs. In: Wang, J. (ed.) 2008 IEEE World Congress on Computational Intelligence, Hong Kong, June 1-6. IEEE Computational Intelligence Society. IEEE Press, Los Alamitos (2008)
Deb, K.: Binary and floating-point function optimization using messy genetic algorithms. PhD thesis, Tuscaloosa, AL, USA (1991)
Goldberg, D., Deb, K., Korb, B.: Messy genetic algorithms: motivation, analysis, and first results. Complex Systems 3(3), 493–530 (1989)
Harvey, I.: The saga cross: the mechanics of recombination for species with variablelength genotypes. In: Manner, R., Manderick, B. (eds.) Parallel Problem, pp. 269–278. North-Holland, Amsterdam (1992)
Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection (Complex Adaptive Systems). The MIT Press, Cambridge (1992)
O’Neill, M., Ryan, C.: Grammatical evolution. IEEE Transactions on Evolutionary Computation 5(4), 349–358 (2001)
Parekh, R., Honavar, V.: Grammar inference, automata induction, and language acquisition. In: Handbook of Natural Language Processing, pp. 727–764. Marcel Dekker, New York (1998)
Rana, S.: The distributional biases of crossover operators. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 549–556. Morgan Kaufmann Publishers, San Francisco (1999)
Sakakibara, Y.: Recent advances of grammatical inference. Theor. Comput. Sci. 185(1), 15–45 (1997)
Spears, W.M.: Crossover or mutation. In: Foundations of Genetic Algorithms 2, pp. 221–237. Morgan Kaufmann, San Francisco (1993)
Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Transactions on Information Theory 23(3), 337–343 (1977)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barrero, D.F., Camacho, D., R-Moreno, M.D. (2009). A Framework for Agent-Based Evaluation of Genetic Algorithms. In: Papadopoulos, G.A., Badica, C. (eds) Intelligent Distributed Computing III. Studies in Computational Intelligence, vol 237. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03214-1_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-03214-1_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03213-4
Online ISBN: 978-3-642-03214-1
eBook Packages: EngineeringEngineering (R0)