K. Kojima, M. Ishigame, and S. Makino (Japan)
Layered Sever-Client topology, Parallel Distributed Genetic Algorithm, Large Problem
In most of the popular implementation of Parallel GAs the whole population is divided into a set of subpopulations, each subpopulation executes GA independently and some individuals are migrated at fixed intervals on a ring topology. In these studies, the migrations usually occur ‘synchronously’ among subpopulations. Therefore, CPUs are not used efficiently and the communication do not occur efficiently either. A few studies tried asynchronous migration but it is hard to implement and to set proper parameter values. The aim of our research is to develop a migration method which is easy to implement, which is easy to set parameter values, and which reduces communication traffic. In our previous research, we proposed Elite Migration on the Server-Client topology and Layered Server-Client topology. In this paper, we consider the effectiveness of Layered Server-Client topology on Large Problem, especially on TSP with 2392 cities.
Important Links:
Go Back
