用于全局优化的混合正交遗传算法  

Hybrid Orthogonal Genetic Algorithm for Global Optimization

作　　者：江中央[1] 蔡自兴[1] 王勇[1] 

机构地区：[1]中南大学信息科学与工程学院,长沙410083

出　　处：《计算机工程》2009年第4期204-206,209,共4页Computer Engineering

基　　金：国家自然科学基金资助项目(60404021);国家基础研究基金资助项目(A1420060159)

摘　　要：为提高正交遗传算法收敛速度和搜索精度,在正交遗传算法的基础上引入局部搜索策略,提出一种新的聚类局部搜索算子。利用正交算子初始化种群,保证初始群体分布的均匀性和多样性。通过正交算子在全局范围内进行全局搜索,使算法能在全局范围内收敛。采用聚类局部搜索算子对群体进行局部搜索,以增强算法的收敛速度和搜索精度。对7个高维的Benchmark函数进行测试,仿真实验结果表明,与其他算法相比,该算法具有更好的搜索精度、收敛速度和全局寻优的能力。In order to improve convergent speed and search precision of orthogonal genetic algorithm, a local search scheme is introduced into orthogonal genetic algorithm and a new clustering local search operator is proposed. The orthogonal operator is used to generate an initial population of points that are scattered uniformly over the feasible solution space, so that it can maintain diversity of the initial population. The orthogonal operator is used for a global search tO guarantee the global convergence, a new clustering local search operator is adopted to make a local search in order to improve the convergence speed and the search precision. The new approach is tested on seven benchmark functions with high dimensions. Compared with other algorithms, the new algorithm has better search precision, convergent speed and capacity of global search.

关 键 词：正交遗传算法 局部搜索 全局优化 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]