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

一种用于多目标优化的混合粒子群优化算法
引用本文:徐刚,瞿金平.一种用于多目标优化的混合粒子群优化算法[J].计算机工程与应用,2008,44(33):18-21.
作者姓名:徐刚  瞿金平
作者单位:1. 南昌大学,数学系,南昌,330031
2. 华南理工大学,聚合物新型成型装备国家工程研究中心,广州,510640
摘    要:将粒子群算法与局部优化方法相结合,提出了一种混合粒子群多目标优化算法(HMOPSO)。该算法针对粒子群局部优化性能较差的缺点,引入多目标线搜索与粒子群算法相结合的策略,以增强粒子群算法的局部搜索能力。HMOPSO首先运行PSO算法,得到近似的Pareto最优解;然后启动多目标线搜索,发挥传统数值优化算法的优势,对其进行进一步的优化。数值实验表明,HMOPSO具有良好的全局优化性能和较强的局部搜索能力,同时HMOPSO所得的非劣解集在分散性、错误率和逼近程度等量化指标上优于MOPSO。

关 键 词:多目标优化  粒子群算法  局部搜索  Pareto最优
收稿时间:2008-8-6
修稿时间:2008-9-2  

Hybrid particle swarm optimization algorithm for multi-objective optimization
XU Gang,Qu Jin-ping.Hybrid particle swarm optimization algorithm for multi-objective optimization[J].Computer Engineering and Applications,2008,44(33):18-21.
Authors:XU Gang  Qu Jin-ping
Affiliation:1.Department of Mathematics,Nanchang University,Nanchang 330031,China 2.The National Engineering Research Center of Novel Equipment for Polymer Processing,South China University of Technology,Guangzhou 510640,China
Abstract:Combining particle swarm search with local search,a hybrid multi-objective particle swarm optimization(HMOPSO) algorithm for multi-objective optimization is proposed.Aiming at the defect of local optimization for PSO,HMOPSO introduces multi-objective linearity search as a means of acceleration and refinement of the solutions of particle swarm search to improve search performance.It first runs the PSO in order to obtain approximative Pareto optimal solutions.Once the MOPSO is over,multi-objective linearity search is then run with each previously obtained solution to find a better solution.Simulation results show that HMOPSO,compared with MOPSO,can improve efficiency of optimization and ensure a better convergence,spacing and error ration to the true Pareto optimal front.
Keywords:multi-objective optimization  PSO algorithm  local search  Pareto optimal solution
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号