J4

• 计算机科学 • 上一篇    下一篇

求解约束优化问题的一种新的进化算法

张利彪1, 周春光1, 刘小华1, 马铭1, 吕 英华1,2, 马志强1,2   

  1. 1. 吉林大学计算机科学与技术学院, 长春 130012; 2. 东北师范大学计算机科学系, 长春 130024
  • 收稿日期:2004-01-09 修回日期:1900-01-01 出版日期:2004-10-26 发布日期:2004-10-26
  • 通讯作者: 周春光

A novel evolutionary algorithm for solving constrained optimization problems

ZHANG Li-biao1, ZHOU Chun-guang1, LIU Xiao-hua1 , MA Ming1, L Ying-hua1,2, MA Zhi-qiang1,2   

  1. 1. College of Computer Science and Technology, Jilin University, Changchun 130012, China;2. Department of Computer Science, Northeast Normal University, Changchun 130024, China
  • Received:2004-01-09 Revised:1900-01-01 Online:2004-10-26 Published:2004-10-26
  • Contact: ZHOU Chun-guang

摘要: 针对约束优化问题引入半可行域的概念, 提出竞争选择的新规则, 并改进了基于竞争选择和惩罚函数的进化算法的适应度函数; 结合粒子群优化(PSO)算法本身的特点, 设计了选择算子对半可行域进行操作, 从而得到一个利用PSO算法求解约束优化问题的新的进化算法. 实验证明了算法的有效性.

关键词: 约束优化问题, 粒子群优化算法, 可行域, 竞争选择

Abstract: Aiming at the constrained optimization probl ems, we introduced the concept of semi-feasible region, proposed a novel rule of tournament selection, and improved the fitness function of evolutionary algorithm which is based on tournament selection and penalty function. Making use of characteristics of Particle Swarm Optimization (PSO), we designed a selection operator for the semi-feasible region and proposed a novel evolutionary algorithm for solving constrained optimization problems. Numerical experiments demonstrate the effectiveness of the proposed algorithm.

Key words: constrained optimization problems, particle swarm optimization, feasible region, tournament selection

中图分类号: 

  • TP301