首页 | 官方网站   微博 | 高级检索  
     

一种改进的多目标粒子群优化算法
引用本文:周刘喜,张兴华,李纬.一种改进的多目标粒子群优化算法[J].计算机工程与应用,2009,45(33):38-41.
作者姓名:周刘喜  张兴华  李纬
作者单位:南京工业大学,自动化学院,南京,210009
摘    要:提出一种改进的多目标粒子群优化算法,该算法采用精英归档策略,由档案库中的非劣解提供粒子速度更新时的全局最优位置,根据Pareto支配关系来更新粒子的个体最优位置。使用非劣解目标的线密度度量非劣解前端的均匀性,通过删除小密度的非劣解提高非劣解前端的均匀性。针对多目标进化算法理论型指标的不足,设计了应用型评价指标。标准函数的仿真实验结果表明,所提算法能够获得大量的非劣解,快速地收敛于Pareto最优解前端,且分布比较均匀。

关 键 词:粒子群  多目标进化算法  Pareto最优  精英策略  归档技术
收稿时间:2008-7-2
修稿时间:2008-9-27  

Improved multi-objective particle swarm optimization algorithm
ZHOU Liu-xi,ZHANG Xing-hua,LI Wei.Improved multi-objective particle swarm optimization algorithm[J].Computer Engineering and Applications,2009,45(33):38-41.
Authors:ZHOU Liu-xi  ZHANG Xing-hua  LI Wei
Affiliation:College of Automation,Nanjing University of Technology,Nanjing 210009,China
Abstract:An Improved Multi-Objective Particle Swarm Optimization(IMOPSO) algorithm is proposed,in which elitism archived strategy is used,global best position is provided by non-dominated solutions in the archive and individual best position is updated based on Pareto dominance.The algorithm uses objective solutions linear density to measure non-dominated solutions quality and employs the strategy of deleting low density non-dominated solutions to enhance non-dominated solutions uniformity.To overcome the shortcoming of theoretical index in multi-objective evolution algorithm,a practical index is developed.Simulation results on benchmark functions show the proposed method can obtain a lot of non-dominated solutions,rapidly converge to the Pareto front and uniformly spread along the front.
Keywords:particle swarm  multi-objective evolutionary algorithm  Pareto optimal  elitism strategy  archive technique
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号