返回
Hierarchical distributed genetic algorithms
DOI:10.1002/(SICI)1098-111X(199911)14:11<1099::AID-INT3>3.0.CO;2-O.png)
摘要
En 中文
Genetic algorithm behavior is determined by the exploration/exploitation balance kept throughout the run. When this balance is disproportionate,;the premature convergence problem will probably appear, causing a drop in the genetic-algorithm's efficacy. One approach presented for dealing with this problem is the distributed genetic algorithm model. Its basic idea is to keep, in parallel, several subpopulations that are processed by genetic algorithms, with each one being independent from the others Furthermore, a migration operator produces a chromosome exchange between the subpopulations. Making distinctions between the subpopulations of a distributed: genetic algorithm by applying,genetic algorithms with different configurations, we obtain the so-called heterogeneous distributed genetic algorithms. In this paper, we present a hierarchical model of distributed genetic algorithms in which a higher level distributed:genetic algorithm joins different simple distributed genetic algorithms. Furthermore, with the union of the hierarchical structure presented and the idea of the heterogeneous distributed genetic algorithms, we propose a type of heterogeneous hierarchical distributed genetic algorithms, the hierarchical gradual distributed genetic algorithms. Experimental results show that the proposals consistently outperform equivalent sequential genetic algorithms and simple distributed genetic algorithms. (C) 1999 John Wiley & Sons, Inc.
Keyword:
CROSSOVER OPERATORS
DIVERSITY
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.7
论文数:
3.1K
被引数:
8.1K
机构
暂无机构信息
引用论文
Characteristics of the Raman spectra of diamond-like carbon films. Influence of methods of synthesis
Tackling real-coded genetic algorithms: Operators and tools for behavioural analysis解决真实编码的遗传算法: 行为分析的运算符和工具

