首页 | 本学科首页   官方微博 | 高级检索  
     

基于混沌的多目标粒子群优化算法
引用本文:钱伟懿,李阿军,杨宁宁.基于混沌的多目标粒子群优化算法[J].计算机工程与设计,2008,29(18).
作者姓名:钱伟懿  李阿军  杨宁宁
作者单位:渤海大学,数学系,辽宁,锦州,121000
摘    要:针对多目标优化问题,提出了一种改进的粒子群算法.该算法为了寻找新解,引入了混沌搜索技术,同时采用了一种新的方法--拥挤距离法定义解的适应度.并采取了精英保留策略,在提高非劣解集多样性的同时,使解集更加趋近于Pareto集.最后,把算法应用到4个典型的多目标测试函数.数值结果表明,该算法能够有效的收敛到Pareto非劣最优目标域,并沿着Pareto非劣目标域有很好的分散性.

关 键 词:粒子群算法  多目标优化  混沌  Pareto解  优化算法

Particle swarm optimization algorithm based on chaotic series for multi-objective optimization problems
QIAN Wei-yi,LIA-jun,YANG Ning-ning.Particle swarm optimization algorithm based on chaotic series for multi-objective optimization problems[J].Computer Engineering and Design,2008,29(18).
Authors:QIAN Wei-yi  LIA-jun  YANG Ning-ning
Affiliation:QIAN Wei-yi,LI A-jun,YANG Ning-ning(Department of Mathematics,Bohai University,Jinzhou 121000,China)
Abstract:An improved particle swarm algorithm for multiobjective optimization problems is proposed.In this algorithm,chaotic series is used for finding new solutions and a new method,crowding distance method,is adopted to define fitness value of the solutions.Mean-while,the strategy of elite holding is quoted.This algorithm not only improves the diversity of solution set but also makes the nondomi-nated solutions approach the Pareto set as close as possible.At last,the algorithm is applied to four classical test fun...
Keywords:particle swarm algorithm  multiobjective optimization  logistic  Pareto solution  optimization algorithm  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号