Discussion on searching capability of distributed genetic algorithm on the grid
Discussion on searching capability of distributed genetic algorithm on the grid
复制标题
分布式遗传算法网格搜索能力探讨
DOI：
10.1109/cec.2003.1299789
复制
发表时间：
2003
期刊：
影响因子：
--
通讯作者：
M. Miki
中科院分区：
文献类型：
--
作者：
Y. Tanimura;T. Hiroyasu;M. Miki
计算网格是近年来比较流行的一种网格技术。由于网格具有巨大的能量，人们期望像遗传算法（GA）这样的数值优化方法在网格上表现良好。在以往的工作中，只有简单的遗传算法模型应用于网格。本文讨论了分布式遗传算法在网格环境下运行时，所面临的可扩展性、动态变化和异构性等问题。通过数值实验，发现DGA模型在网格上具有以下特点：DGA具有随资源数量变化的可扩展性，且资源数量的动态减少对DGA的搜索结果影响不大.并讨论了异步迁移对系统性能的影响。在此基础上，给出了在网格上实现DGA的指导思想.
The computational grid has become popular recently. Since the grid has the tremendous power, it is expected that the numerical optimization method like genetic algorithms (GA) performs well on the grid. In the former works, only the simple model of GA is applied on the grid. In this paper, when the distributed GA (DGA) is executed on the grid, the considerable issues and problems are discussed for the scalability, dynamic changes and heterogeneity. Through the numerical experiments, it is found that the DGA model has the following features on the grid; DGA has the scalability for searching the solutions with respect to the number of the resources and the results of the DGA are not influenced very much by the dynamic reduction of the number of resources. It is also addressed the affect of the asynchronous migration. As a result, the guideline how to implement the DGA on the grid is described.
DOI：
10.12694/scpe.v3i3.192
发表时间：
2000
期刊：
Parallel Distributed Comput. Pract.
影响因子：
--
作者：
A. Marowka
通讯作者：
A. Marowka