摘要
采用确定型计算策略，提出了一种新的群体搜索算法列队竞争算法，用该算法解典型的测试函数时结果表明：该算法具有在复杂搜索空间内迅速搜索到最优解的能力，表现出了极其优秀的特性．
A new population search algorithm,line-up competing algorithm(LCA),is proposed using deterministic compute strategy. In this algorithm M independent and parallel families exist all the time in the course of evolution with the farmilies arranged in a line up in the light of the value of their objective function and allocated correspond search space according to their position in line up,which makes local search and global search balanced. Simultaneously, with the use of contracting search space,the convergence speed can be increased greatly. Solving typical testing functions with proposed algorithm indicates that the algorithm is able to find rapidly global optimization in complex search space.
出处
《湖北工业大学学报》
1999年第Z1期40-46,共7页
Journal of Hubei University of Technology
关键词
全局优化
列队竞争算法
进化算法
global optimization
line up competition algorithm
population search
