摘要
针对现有遗传算法处理带约束优化问题时存在的缺点,基于小生境技术提出一种新的开放式遗传算法,证明它一定能收敛到全局最优解。该算法避免罚因子的选择问题,具有很强的通用性,对问题本身和约束基本没有要求,实施起来十分方便,可以充分发挥GA的优势。通过两个小生境相互作用机制,使GA群体搜索的特点得到很好的利用,保证群体的多样性,加速搜索速度。仿真实例说明了它的有效性。
Taking biosphere and adaptive mathematic models into account, a new Open Genetic Algorithm （OGA） based on NICHE was proposed, which overcome the defects of current genetic algorithm in solving constrained optimization problems. The convergence of global optimal solution of OGA was verified. Firstly, OGA does not need to confirm penalty coefficient, so it is strongly adaptable; secondly, OGA almost does not request the problems and the constraint, so it is easy to apply, which shows the advantage of GA; finally, in order to make good use of the population search characteristics of GA, ensure the diversity of population, and accelerate the search speed, OGA adopted the interaction mechanism between two NICHEs. Experiments show the algorithm is effective.
出处
《计算机应用》
CSCD
北大核心
2007年第4期960-962,965,共4页
journal of Computer Applications
关键词
开放式遗传算法
约束优化问题
小生境
open genetic algorithm
constrained optimization problem
NICHE
