Abstract
This paper adapts parallel master-slave estimation of distribution and genetic algorithms (GAs and EDAs) hybridization. The master selects portions of the search space, and slaves perform, in parallel and independently, a GA that solves the problem on the assigned portion of the search space. The master's work is to progressively narrow the areas explored by the slave's GAs, using parallel dynamic -means clustering to determine the basins of attraction of the search space. Coordination of activities between master and slaves is done in an asynchronous way (i.e. no waiting is entertained among the processes). The proposed asynchronous model has managed to reduce computation time while maintaining the quality of solutions.