| Resumen |
In this paper a coarse-grain execution model for
evolutionary algorithms is proposed and used for solving
numerical optimization problems. This model does not use
migration as the solution dispersion mechanism, in its place a
more efficient population-merging mechanism is used that
dynamically reduces the population size as well as the total
number of parallel evolving populations (i.e. islands). Even more
relevant is the fact that the proposed model eliminates the need
to set up an interconnection topology among islands. Extensive
numerical experimentation, using genetic algorithms over a
well-known set of typo problems, shows the proposed model to
be faster and more accurate than the traditional one. |
