摘要
提出了一种全局优化搜索新算法——列队竞争算法．算法在模拟进化过程中，始终保持着独立并行进化的家族，通过家族内部的生存竞争和家族间的地位竞争这两种不同的竞争方式，使群体快速进化到最优或接近最优的区域．根据家族的目标函数值大小排成列队，并按家族在列队中的地位不同获得不同的竞争推动力，使得各个家族在列队中的位置发生动态的变化，从而使得局部搜索与全局搜索达到均衡．数值计算结果表明。
A new global optimization search algorithm, Line up Competition Algorithm(LCA), is proposed There always exist independent and parallel evolutionary families in the course of simulating evolution, Population can evolve rapidly to optimum or near optimum region by using both the struggle for existence inside family and the position competition among families .Families are ranged a line up based on their objective function value, and gain corresponding competition driving force in the light of their position in the line up. That makes the position of every family in line up produce dynamic change , thus reaching the uniform of local and global search The solution of a set of typical test functions with proposed algorithm indicates that the algorithm is able to find rapidly global optimal solution in complex search space.
出处
《应用基础与工程科学学报》
EI
CSCD
1999年第2期215-221,共7页
Journal of Basic Science and Engineering
关键词
全局优化
列队竞争算法
进化算法
Global optimization, line up competition algorithm, evolutionary algorithm
