Extended conference paper
An empirical time analysis of evolutionary algorithms as C programs
Article first published online: 25 JUL 2013
Copyright © 2013 John Wiley & Sons, Ltd.
Software: Practice and Experience
How to Cite
Nesmachnow, S., Luna, F. and Alba, E. (2013), An empirical time analysis of evolutionary algorithms as C programs. Softw: Pract. Exper.. doi: 10.1002/spe.2217
- Article first published online: 25 JUL 2013
- Manuscript Accepted: 4 JUL 2013
- Manuscript Revised: 2 JUL 2013
- Manuscript Received: 10 JUL 2012
- FEDER. Grant Number: TIN2011-28194
- empirical execution time analysis;
- evolutionary algorithms;
- C programming language;
This article presents an empirical study devoted to characterize the computational efficiency behavior of an evolutionary algorithm (usually called canonical) as a C program. The study analyzes the effects of several implementation decisions on the execution time of the resulting evolutionary algorithm. The implementation decisions studied include: memory utilization (using dynamic vs. static variables and local vs. global variables), methods for ordering the population, code substitution mechanisms, and the routines for generating pseudorandom numbers within the evolutionary algorithm. The results obtained in the experimental analysis allow us to conclude that significant improvements in efficiency can be gained by applying simple guidelines to best program an evolutionary algorithm in C. Copyright © 2013 John Wiley & Sons, Ltd.