Abstract

In this paper we address an extension of a very efficient genetic algorithm (GA) known as Hy3, a physical parallelization of the gradual distributed real-coded GA (GD-RCGA). This search model relies on a set of eight subpopulations residing in a cube topology having two faces for promoting exploration and exploitation. The resulting technique has been shown to yield very accurate results in continuous optimization by using crossover operators tuned to explore and exploit the solutions inside each subpopulation. We introduce here a further extension of Hy3, called Hy4, that uses 16 islands arranged in a hypercube of four dimensions. Thus, two new faces with different exploration/exploitation search capabilities are added to the search performed by Hy3. We analyze the importance of running a synchronous versus an asynchronous version of the models considered. The results indicate that the proposed Hy4 model overcomes the Hy3 performance because of its improved balance between exploration and exploitation that enhances the search. Finally, we also show that the async Hy4 model scales better than the sync one.

Citations