A study of a parallelized immune coevolutionary algorithm for division-of-labor problems

Recently, a number of parallelized optimization algorithms have been proposed. We have proposed a co-evolutionary immune algorithm (IA) to solve the division-of-labor problems, in particular the n-th agent’s travelling salesman problem (n-TSP). In this article, we extend the co-evolutionary IA for a large-scale n-TSP with (1) an improvement for the search speed through parallelized search on the PC-cluster, and (2) the introduction of a new division-processing “pre-estimated division processing” to improve the search ability. Some computational experiments show the proposed method can obtain better quality solutions for division-of-labor problems, and present an applicable parameter cofinguration.

[1]  Reiko Tanese,et al.  Distributed Genetic Algorithms , 1989, ICGA.

[2]  Thomas C. Peachey,et al.  The Nature of Mutation in Genetic Algorithms , 1995, ICGA.

[3]  L. Darrell Whitley,et al.  Optimization Using Distributed Genetic Algorithms , 1990, PPSN.

[4]  Hayao Miyagi,et al.  The immune distributed competitive problem solver with major histocompatibility complex and immune network , 2000, Smc 2000 conference proceedings. 2000 ieee international conference on systems, man and cybernetics. 'cybernetics evolving to systems, humans, organizations, and their complex interactions' (cat. no.0.

[5]  Theodore C. Belding,et al.  The Distributed Genetic Algorithm Revisited , 1995, ICGA.