返回
Distribution-based adaptive bounding genetic algorithm for continuous optimisation problems
DOI:10.1016/j.amc.2006.07.022.png)
摘要
En 中文
A new search-space-updating technique for genetic algorithms is proposed for continuous optimisation problems. Other than gradually reducing the search space during the evolution process with a fixed reduction rate set 'a priori', the upper and the lower boundaries for each variable in the objective function are dynamically adjusted based on its distribution statistics. To test the effectiveness, the technique is applied to a number of benchmark optimisation problems in comparison with three other techniques, namely the genetic algorithms with parameter space size adjustment (GAPSSA) technique [A.B. Djurisic, Elite genetic algorithms with adaptive mutations for solving continuous optimization problems - application to modeling of the optical constants of solids, Optics Communications 151 (1998) 147-159], successive zooming genetic algorithm (SZGA) [Y. Kwon, S. Kwon, S. Jin, J. Kim, Convergence enhanced genetic algorithm with successive zooming method for solving continuous optimization problems, Computers and Structures 81 (2003) 1715-1725] and a simple GA. The tests show that for well-posed problems, existing search space updating techniques perform well in terms of convergence speed and solution precision however, for some ill-posed problems these techniques are statistically inferior to a simple GA. All the tests show that the proposed new search space update technique is statistically superior to its counterparts. (c) 2006 Elsevier Inc. All rights reserved.
Keyword:
genetic algorithms
adaptive bounding
continuous optimisation problems
convergence
robustness
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
暂无机构信息
引用论文
Contribution of Social Isolation, Restraint, and Hindlimb Unloading to Changes in Hemodynamic Parameters and Motion Activity in Rats
PLoS ONE
IF0

