A Distributed Parallel Genetic Local Search with Tree-Based Migration on Irregular Network Topologies
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E87-A No.6 pp.1377-1385
- Publication Date
- 2004/06/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Section on Papers Selected from 2003 International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC 2003))
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Yiyuan GONG, Morikazu NAKAMURA, Takashi MATSUMURA, Kenji ONAGA, "A Distributed Parallel Genetic Local Search with Tree-Based Migration on Irregular Network Topologies" in IEICE TRANSACTIONS on Fundamentals,
vol. E87-A, no. 6, pp. 1377-1385, June 2004, doi: .
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e87-a_6_1377/_p
Copy
@ARTICLE{e87-a_6_1377,
author={Yiyuan GONG, Morikazu NAKAMURA, Takashi MATSUMURA, Kenji ONAGA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Distributed Parallel Genetic Local Search with Tree-Based Migration on Irregular Network Topologies},
year={2004},
volume={E87-A},
number={6},
pages={1377-1385},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={June},}
Copy
TY - JOUR
TI - A Distributed Parallel Genetic Local Search with Tree-Based Migration on Irregular Network Topologies
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1377
EP - 1385
AU - Yiyuan GONG
AU - Morikazu NAKAMURA
AU - Takashi MATSUMURA
AU - Kenji ONAGA
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E87-A
IS - 6
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - June 2004
AB - 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.
ER -
English
