A graphical user interface for evolutionary algorithms
The purpose of Generic Evolutionary Algorithms Programming Library (GEA1) system is to provide researchers with an easy-to-use, widely applicable and extendable programming library which solves real-world optimization problems by means of evolutionary algorithms. It contains algorithms for various e...
Saved in:
Main Author: | |
---|---|
Corporate Author: | |
Format: | Article |
Published: |
2003
|
Series: | Acta cybernetica
16 No. 2 |
Kulcsszavak: | Számítástechnika, Kibernetika, Algoritmus |
Subjects: | |
Online Access: | http://acta.bibl.u-szeged.hu/12727 |
Summary: | The purpose of Generic Evolutionary Algorithms Programming Library (GEA1) system is to provide researchers with an easy-to-use, widely applicable and extendable programming library which solves real-world optimization problems by means of evolutionary algorithms. It contains algorithms for various evolutionary methods, implemented genetic operators for the most common representation forms for individuals, various selection methods, and examples on how to use and expand the library. All these functions assure that GEA can be effectively applied on many problems. GraphGEA is a graphical user interface to GEA written with the GTK API. The numerous parameters of the evolutionary algorithm can be set in appropriate dialog boxes. The program also checks the correctness of the parameters and saving/restoring of parameter sets is also possible. The selected evolutionary algorithm can be executed interactively on the specified optimization problem through the graphical user interface of GraphGEA, and the results and behavior of the EA can be observed on several selected graphs and drawings. While the main purpose of GEA is solving optimization problems, that of GraphGEA is education and analysis. It can be of great help for students understanding the characteristics of evolutionary algorithms and researchers of the area can use it to analyze an EA's behavior on particular problems. |
---|---|
Physical Description: | 337-365 |
ISSN: | 0324-721X |