Skip to Main content Skip to Navigation

EASEA : un langage de spécification pour les algorithmes évolutionnaires

Abstract : Evolutionary algorithms are not straightforward to implement and the lack of any specialised language forces users to write their algorithms in C, C++ or JAVA. However, most evolutionary algorithms follow a similar design, and the only really specific part is the code representing the problem to be solved. Therefore, it seems that nothing, in theory, could prevent a user from being able to design and run his evolutionary algorithm from a Graphic User Interface, without any other programming effort than the function to be optimised. Writing such a GUI rapidly poses the problem of saving and reloading the evolutionary algorithm on which the user is working, and translating the information into compilable code. This very much sounds like a specifying language and its compiler. The EASEA software was created on this purpose, and to our knowledge, it is the first and only usable compiler of a language specific to evolutionary algorithms. This reprot describes how EASEA has been designed and the problems which needed to be solved to achieve its implementation.
Document type :
Complete list of metadata
Contributor : Marc Schoenauer Connect in order to contact the contributor
Submitted on : Thursday, November 24, 2005 - 4:26:05 PM
Last modification on : Wednesday, May 11, 2022 - 12:06:06 PM
Long-term archiving on: : Friday, April 2, 2010 - 11:09:43 PM


  • HAL Id : inria-00000849, version 1



Pierre Collet, Marc Schoenauer, Evelyne Lutton, Jean Louchet. EASEA : un langage de spécification pour les algorithmes évolutionnaires. [Research Report] RR-4218, INRIA. 2001, pp.17. ⟨inria-00000849⟩



Record views


Files downloads