Gradual distributed real-coded genetic algorithms

Abstract

Abstract-A major problem in the use of genetic algorithms is premature convergence, a premature stagnation of the search caused by the lack of diversity in the population. One approach for dealing with this problem is the distributed genetic algorithm model. Its basic idea is to keep, in parallel, several subpopulations that are processed by genetic algorithms, with each one being independent of the others. Furthermore, a migration mechanism produces a chromosome exchange between the subpopulations. Making distinctions between the subpopulations by applying genetic algorithms with different configurations, we obtain the so-called heterogeneous distributed genetic algorithms. These algorithms represent a promising way for introducing a correct exploration/exploitation balance in order to avoid premature convergence and reach approximate final solutions. This paper presents the gradual distributed real-coded genetic algorithms, a type of heterogeneous distributed real-coded genetic algorithms that apply a different crossover operator to each subpopulation. The importance of this operator on the genetic algorithm's performance allowed us to differentiate between the subpopulations in this fashion. Using crossover operators presented for real-coded genetic algorithms, we implement three instances of gradual distributed real-coded genetic algorithms. Experimental results show that the proposals consistently outperform sequential real-coded genetic algorithms and homogeneous distributed realcoded genetic algorithms, which are equivalent to them and other mechanisms presented in the literature. These proposals offer two important advantages at the same time: better reliability and accuracy.Index Terms-Crossover operator, distributed genetic algorithms, multiresolution, premature convergence, selective pressure.

Multiple Crossover per Couple with Selection of the Two Best Offspring: An Experimental study with the BLX-α Crossover Operator for Real-Coded Genetic Algorithms

“…In this sense, this operator presents a high exploration in the generation of the descendants. The formulation of these problems may be found in [11,13]. These functions defer with respect to some characteristics like continuity, modality or dimensions.…”

Distributed Evolutionary Algorithms Inspired by Membranes in Solving Continuous Optimization Problems

“…Different situations appear in the case of ring and other topologies [4] which are associated with cyclic graph structures. In these situations the corresponding membrane structure is given by a net of membranes, or tissue P systems.…”

“…According to [1], typical examples of communication topologies are: fully connected topology (each subpopulation can communicate with any other subpopulation), linear or ring topology (only neighbour subpopulations can communicate), star topology (all subpopulations communicate through a kernel subpopulation). More specialized communication topologies are hierarchical topologies [5], and hypercube topologies [4]. The fully connected, star and linear topology can be easily described by using hierarchical membrane structures which allows transferring element either in a inner or in the outer membrane (see Figure 1).…”

Distributed evolutionary algorithms with hierarchical evaluation

“…The proposed algorithm is built on the basis of a distributed EA (DEA), (Karakasis and Giannakoglou 2003, Doorly et al 1999, Herrera and Lozano 2000. In DEAs, the evolution takes place simultaneously on a small number of medium-sized sub-populations, the so-called islands or demes.…”