zbMATH — the first resource for mathematics

Consideration of the efficiency of Layered Server-Client topology for parallel distributed GA on large problem. (English) Zbl 1157.68524
Gammerman, A. (ed.), Artificial intelligence and applications. Machine learning. As part of the 26th IASTED international multi-conference on applied informatics. Calgary: International Association of Science and Technology for Development (IASTED); Anaheim, CA: Acta Press (ISBN 978-0-88986-710-9/CD-ROM). 266-271 (2008).
Summary: 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.
For the entire collection see [Zbl 1154.68012].
68W10 Parallel algorithms in computer science
68T05 Learning and adaptive systems in artificial intelligence