DocumentCode
1634035
Title
Issues on the optimisation of evolutionary algorithms code
Author
Collet, Pierre ; Louchet, Jean ; Lutton, Evelyne
Author_Institution
CMAP, Ecole Polytech., Palaiseau, France
Volume
2
fYear
2002
fDate
6/24/1905 12:00:00 AM
Firstpage
1103
Lastpage
1108
Abstract
The aim of this paper is to show that the common belief, in the evolutionary community, that evaluation time usually takes over 90% of the total time, is far from being always true. In fact, many real-world applications showed a much lower percentage. This raises several questions, one of them being the balance between fitness and operators computational complexity: what is the use of elaborating smart evolutionary operators to reduce the number of evaluations if as a result, the total computation time is increased?
Keywords
computational complexity; evolutionary computation; code optimisation; computation time; computational complexity; evolutionary algorithms; fitness; testbenches; Computational efficiency; Convergence; Evolutionary computation; Fractals; Genetic mutations; Libraries; Performance loss; Scalability; Testing; Time measurement;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 2002. CEC '02. Proceedings of the 2002 Congress on
Conference_Location
Honolulu, HI
Print_ISBN
0-7803-7282-4
Type
conf
DOI
10.1109/CEC.2002.1004397
Filename
1004397
Link To Document