Abstract
The EASEA1 language (EAsy Specification of Evolutionary Algorithms) was created in order to allow scientists to concentrate on evolutionary algorithm design rather than implementation. EASEA currently supports two C++ libraries (GALib and EO) and a JAVA library for the DREAM. The aim of this paper is to assess the quality of EASEA-generated code through an extensive test procedure comparing the implementation for EO and GALib of the same test functions.
Research funded by the European Commission IST Programme 1999-12679 (Future and Emerging Technologies).
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
P. Stearns, ALex& AYacc home page: http://www.bumblebeesoftware.com, Bumblebee Software Ltd.
M. Wall, GAlib home page: http://www.mit.edu/people/moriken/doc/galib.
B. Paechter, T. Baeck, M. Schoenauer, A.E. Eiben, J.J. Merelo, and T. C. Fogarty, “A Distributed Resource Evolutionary Algorithm Machine,” Proc. of CEC 2000.
I. Landrieu, B. Naudts, “An Object Model for Search Spaces and their Transformations,” EA’99 conference, Springer Verlag LNCS 1829, France, 1999.
B. Leblanc and E. Lutton, “Bitwise regularity and GA-hardness”, ICEC 98, May 5–9, Anchorage, Alaska.
E. Lutton and J. Lévy Véhel, “Hölder functions and Deception of Genetic Algorithms”, IEEE trans. on Evolutionary computation, Vol 2, No 2, pp. 56–72, 1998.
Z. Michalewicz, “Genetic Algorithms + Data Structures = Evolution Programs”, Springer Verlag, 1992.
N. J. Radcliffe, “Forma Analysis and Random Respectful Recombination,” ICGA’91, pp. 222–229, 1991.
N. J. Radcliffe and P. D. Surry, “Fitness variance of formae and performance prediction,” FOGA’95, pp. 51–72, Morgan Kaufmann publ., 1995.
H.-P. Schwefel, “Collective phenomena in evolutionary systems”, 31st annual meeting int. society for general system research, Vol 2, pp. 1025–1033, Budapest, 1987.
H.-P. Schwefel, “Numerical Optimisation of Computer Models”. John Wiley & Sons, New-York, 1981. 1995— 2nd edition.
P. D. Surry and N. J. Radcliffe, “Formal Algorithms + Formal Representation = Search Strategies,” PPSN’96, Springer Verlag LNCS 1141, pp. 366–375, 1996.
P. D. Surry, “A Prescriptive Formalism for Constructing Domain-Specific Evolutionary Algorithms,” PhD thesis, Univ. of Edinburgh, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lutton, E., Collet, P., Louchet, J. (2002). EASEA Comparisons on Test Functions: GALib versus EO. In: Collet, P., Fonlupt, C., Hao, JK., Lutton, E., Schoenauer, M. (eds) Artificial Evolution. EA 2001. Lecture Notes in Computer Science, vol 2310. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46033-0_18
Download citation
DOI: https://doi.org/10.1007/3-540-46033-0_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43544-0
Online ISBN: 978-3-540-46033-6
eBook Packages: Springer Book Archive