Tackling real-coded genetic algorithms: Operators and tools for behavioural analysis

Abstract. Genetic algorithms play a significant role, as search techniques for handling com-plex spaces, in many fields such as artificial intelligence, engineering, robotic, etc. Genetic algorithms are based on the underlying genetic process in biological organisms and on the natural evolution principles of populations. These algorithms process a population of chromo-somes, which represent search space solutions, with three operations: selection, crossover and mutation. Under its initial formulation, the search space solutions are coded using the binary alphabet. However, the good properties related with these algorithms do not stem from the use of this alphabet; other coding types have been considered for the representation issue, such as real coding, which would seem particularly natural when tackling optimization problems of parameters with variables in continuous domains. In this paper we review the features of real-coded genetic algorithms. Different models of genetic operators and some mechanisms available for studying the behaviour of this type of genetic algorithms are revised and compared. Key words: genetic algorithms, real coding, continuous search spaces Abbreviations: GAs – genetic algorithms; BCGA – binary-coded genetic algorithm; RCGA – real-coded genetic algorith