Abstract
Evolutionary algorithms are not straightforward to implement and the lack of any specialised language forces users to reinvent the wheel every time they want to write a new program. Over the last years, evolutionary libraries have appeared, trying to reduce the amount of work involved in writing such algorithms from scratch, by offering standard engines, strategies and tools. Unfortunately, most of these libraries are quite complex to use, and imply a deep knowledge of object programming and C++. To further reduce the amount of work needed to implement a new algorithm, without however throwing down the drain all the man-years already spent in the development of such libraries, we have designed EASEA (acronym for EAsy Specification of Evolutionary Algorithms): a new high-level language dedicated to the specification of evolutionary algorithms. EASEA compiles .ez files into source files in a target language, containing function calls to a chosen existing library. The resulting source file is in turn compiled and linked with the library to produce an executable file implementing the evolutionary algorithm specified in the original .ez file.
EASEA v0.4 is available at: http://www-rocq.inria.fr/EVO-Lab/ .
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
EASEA v0.4 home page: http://www-rocq.inria.fr/EVD-Lab/ .
EVONET home page: http://www.evonet.polytechnique.fr .
J. J. Merelo, EO home page: http://fast.to/EO , Granada University.
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,” Artificial Evolution conference, EA’99 France, 1999.
N. J. Radcliffe, “Forma Analysis and Random Respectful Recombination,” ICGA’91, proceedings pp222–229, 1991.
N. J. Radcliffe and P. D. Surry, “Fitness variance of formae and performance prediction,” FOGA’95, pp51–72, Morgan Kaufmann publ., 1995.
P. D. Surry and N. J. Radcliffe, “Formal Algorithms + Formal Representation = Search Strategies,” PPSN’96, proceedings 1141 pp366–375, 1996.
P. D. Surry, “A Prescriptive Formalism for Constructing Domain-Specific Evolutionary Algorithms,” PhD thesis, University of Edinburgh, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Collet, P., Lutton, E., Schoenauer, M., Louchet, J. (2000). Take It EASEA. In: Schoenauer, M., et al. Parallel Problem Solving from Nature PPSN VI. PPSN 2000. Lecture Notes in Computer Science, vol 1917. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45356-3_87
Download citation
DOI: https://doi.org/10.1007/3-540-45356-3_87
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41056-0
Online ISBN: 978-3-540-45356-7
eBook Packages: Springer Book Archive