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.