Issues on the optimisation of evolutionary algorithms code

Authors:
P. Collet;J. Louchet;E. Lutton
Affiliations:
CMAP, Ecole Polytech., Palaiseau, France;Dept. of Comput. Archit. & Technol., Granada Univ., Spain;Dept. of Comput. Archit. & Technol., Granada Univ., Spain
Venue:
CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Year:
2002

Citing 0
Cited 2

Differential evolution using a neighborhood-based mutation operator

IEEE Transactions on Evolutionary Computation
Threshold selection, mitosis and dual mutation in cooperative co-evolution: application to medical 3D tomography

PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I

Quantified Score

Hi-index	0.00

Visualization

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?.