A binary encoding supporting both mutation and recombination

Abstract

There has been a long debate on the "most important" operator when applying genetic algorithms. This is very closely related to the favorite binary encoding, namely standard binary or Gray. Rather than confronting both approaches, this article is motivated by the search for an encoding that supports both mutation and recombination. For this purpose an encoding scheme is proposed and evaluated both using metrics and experiments. © 2010 Springer-Verlag.