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

解多目标优化问题的新粒子群存档算法
引用本文:刘淳安,何广平,雍龙泉.解多目标优化问题的新粒子群存档算法[J].陕西理工学院学报(自然科学版),2005,21(3):84-86,89.
作者姓名:刘淳安  何广平  雍龙泉
作者单位:1. 宝鸡文理学院,数学系,陕西,宝鸡,721007
2. 陕西理工学院,数学与计算机科学系,陕西,汉中,723001
基金项目:宝鸡文理学院院级科研计划项目(JK2439)
摘    要:通过把Pareto优与粒子群优化(PSO)算法相结合,利用给出的粒子的序值定义对粒子群中的粒子进行分离存档,给出了一种求解多目标优化问题的新粒子群存档算法。为了提高算法的全局收敛性,对PSO算法中的惯性因子ω执行自适应调节。数据实验比较表明该算法能找到问题数量更多、分布更广、更均匀的Pareto最优解。

关 键 词:多目标优化  粒子群  Pareto最优解  存档算法
文章编号:1002-3410(2005)03-0084-03
收稿时间:2005-04-04
修稿时间:2005-04-04

A new particle swarm archive algorithm for multi-objective optimization
LIU Chun-an,HE Guang-ping,YONG Long-quan.A new particle swarm archive algorithm for multi-objective optimization[J].Journal of Shananxi University of Technology:Natural Science Edition,2005,21(3):84-86,89.
Authors:LIU Chun-an  HE Guang-ping  YONG Long-quan
Abstract:By the combination of pareto optimization and particle swarm optimization(PSO) algorithm,a new particle swarm achieve algorithm for multi-objective optimization is proposed,in which the particles are put into an achieve according to the definition of the rank of the particle.In ordering to improve its global convergence,the inertia weight of PSO algorithm has adjusted automatically.The numerical experiment shows that this algorithm can find more and wider Pareto-optimal solutions than the original one.
Keywords:multi-objective optimization  particle swarm  pareto optimal solution  archive algorithm  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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