A distributed parallel genetic local search with tree-based migration on irregular network topologies
In this paper we propose a parallel and distributed computation of genetic local search with irregular topology in distributed environments. The scheme we propose in this paper is implemented with a tree topology established on an irregular network where each computing element carries out genetic local search on its own chromosome set and communicates with its parent when the best solution of each generation is updated. We evaluate the proposed algorithm by a simulation system implemented on a PC-cluster. We test our algorithm on four types topologies: star, line, balanced binary tree and sided binary tree, and investigate the influence of communication topology and delay on the evolution process.
genetic local search migration irregular network topology communication tree grid computing