An empirical time analysis of evolutionary algorithms as C programs. (25th July 2013)

• Record Type: Journal Article
• Authors: Nesmachnow, Sergio; Luna, Francisco; Alba, Enrique
• Is Part Of: Software, practice & experience. Volume 45:Number 1(2015)
• Page Start: 111
• Page End: 142
• Publication Date: 2013-07-25
• Subjects: Computer software -- Periodicals; Computer programming -- Periodicals; Computer programs -- Periodicals; 005.3
• DOI: 10.1002/spe.2217
• Languages: English
• ISSNs: 0038-0644

Abstract

<abstract abstract-type="main" id="spe2217-abs-0001"> <title>SUMMARY</title> <p id="spe2217-para-0001">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 &amp; Sons, Ltd.</p> </abstract>