Journal of Systems Engineering and Electronics ›› 2011, Vol. 33 ›› Issue (7): 1647-1652.doi: 10.3969/j.issn.1001-506X.2011.07.41

• 软件、算法与仿真 • 上一篇    下一篇

基于粒子群-遗传的混合优化算法

於世为1,2,3, 魏一鸣1,2, 诸克军3   

  1. 1. 北京理工大学管理与经济学院, 北京 100081;
    2. 北京理工大学能源与环境政策研究中心, 北京 100081;
    3. 中国地质大学(武汉)经济管理学院, 湖北 武汉 430074)
  • 出版日期:2011-07-19 发布日期:2010-01-03

Hybrid optimization algorithms based on particle swarm optimization and genetic algorithm

YU Shi-wei1,2,3, WEI Yi-ming1,2, ZHU Ke-jun3   

  1. 1. School of Management and Economics, Beijing Institute of Technology, Beijing 100081, China;
    2. Center for Energy and Environmental Policy Research, Beijing Institute of Technology, Beijing 100081, China;
    3. School of Economics and Management, China University of Geosciences, Wuhan 430074, China
  • Online:2011-07-19 Published:2010-01-03

摘要:

提出了一种基于实数编码的粒子群优化和遗传算法的混合优化算法,该算法首先由粒子群优化进化一定代数后,将最优的M个粒子保留,去掉适应度较差的pop_sizeM个粒子。然后以这最优的M个粒子的位置值为基础,选择复制得到pop_sizeM个个体,并进行交叉、变异等遗传算法运算。最后将保留的M个粒子位置值与遗传算法进化得到新的pop_size M个体合并形成新的粒子种群,进行下一代进化运算。该算法在进化过程中能进行多次信息交换,使两种算法互补性得到更充分的发挥。通过5个函数优化实例与其他多种算法的对比研究,表明该算法收敛性能好,运算速度快,优化能力强。此外,还研究了最优粒子保留规模M以及粒子群优化进化较少代数规模对算法性能的影响。

Abstract:

This paper develops a hybrid optimization algorithms based on particle swarm optimization (PSO) and genetic algorithm (GA). Firstly, the population are evolved a certainty generations by PSO and the best M particles are retained while the other pop_sizeM particles are removed. Secondly, generate pop_sizeM new individuals by implementing selection, 〖JP2〗crossover and mutation operators of GA according to the remaining best M particles. Finally, put the pop_sizeM new individuals into the remaining best M particles to form new population for next generation. The algorithm can exchange information several times during the evolvement process, so that the complement of two algorithms can be more fully exploited. The proposed method is used to deal with 5 functions optimization problems, and the results obtained are compared with existent bibliography, showing an improvement over the published methods. Furthermore, this paper studies the impact of M scale on the algorithm performance.