By Topic

A distributed parallel genetic local search in distributed computing environments

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Gong, Y. ; Ryukyus Univ., Japan ; Nakamura, M. ; Matsumura, T.

We propose a parallel and distributed computation of genetic local search with irregular topology in distributed environments. The scheme we propose is implemented with tree network topologies 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 improved. We evaluate the proposed algorithm in a grid simulation environment implemented on a PC-cluster. We test our algorithm on four types topologies: star, line, balanced binary tree and sided binary tree, and find that the topology's depth and the number of independent search nodes influences on the evolution process. Furthermore, we observe in the experiment 'Reset' mechanism of the population after convergence is so useful in grid computing environments.

Published in:

Evolutionary Computation, 2003. CEC '03. The 2003 Congress on  (Volume:2 )

Date of Conference:

8-12 Dec. 2003