The influence of data implementation in the performance of evolutionary algorithms

Authors:
Enrique Alba;Edgardo Ferretti;Juan M. Molina
Affiliations:
Universidad de Málaga, Spain;L.I.D.I.C., Universidad Nacional de San Luis, Argentina;Universidad de Málaga, Spain
Venue:
EUROCAST'07 Proceedings of the 11th international conference on Computer aided systems theory
Year:
2007

Citing 4
Cited 0

A connectionist machine for genetic hillclimbing

A connectionist machine for genetic hillclimbing
Java Virtual Machine Specification

Java Virtual Machine Specification
Experimental Evaluation of Heuristic Optimization Algorithms: A Tutorial

Journal of Heuristics
Representations for Genetic and Evolutionary Algorithms

Representations for Genetic and Evolutionary Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we study the differences in performance among different implementations, in Java, of the data structures used in an evolutionary algorithm (EA). Typical studies on EAs performance deal only with different abstract representations of the data and pay no attention to the fact that each data representation has to be implemented in a concrete programming language which, in general, offers several possibilities, with differences in time consumed, that may be worthy of consideration.