###
计算机系统应用英文版:2017,26(7):161-166
←前一篇   |   后一篇→
本文二维码信息
码上扫一扫!
基于动态调整的多目标粒子群优化算法
(中国石油大学(华东) 计算机与通信工程学院, 青岛 266580)
Multi Objective Particle Swarm Optimization Based on Dynamic Adjustment
(College of Computer and Communication Engineering, China University of Petroleum, Qingdao 266580, China)
摘要
图/表
参考文献
相似文献
本文已被:浏览 1720次   下载 2741
Received:October 20, 2016    Revised:November 14, 2016
中文摘要: 为了改善多目标粒子群优化算法生成的最终Pareto前端的多样性和收敛性,提出了一种针对多目标粒子群算法进化状态的检测机制.通过对外部Pareto解集的更新情况进行检测,进而评估算法的进化状态,获取反馈信息来动态调整进化策略,使得算法在进化过程中兼顾近似Pareto前端的多样性和收敛性.最后,在ZDT系列测试函数中,将本文算法与其他4种对等算法比较,证明了本文算法生成的最终Pareto前端在多样性和收敛性上均有显著的优势.
Abstract:To improve the diversity and convergence of Pareto front generated by multi objective particle swarm optimization, a detection mechanism for evolutionary state of multi objective particle swarm optimization is presented in this paper. The evolutionary state of the algorithm is assumed by detecting the updating situation of the external Pareto set to get the feedback information to adjust the evolutionary strategy of the algorithm dynamically. It enables the algorithm to take the diversity and convergence of the approximate Pareto front into account in the process of the evolution. Finally, the proposed algorithm shows a good performance compared with other four kinds of equivalence algorithms in the ZDT series test function.
文章编号:     中图分类号:    文献标志码:
基金项目:山东省自然科学基金(ZR2013FL034)
引用文本:
李克文,张永哲.基于动态调整的多目标粒子群优化算法.计算机系统应用,2017,26(7):161-166
LI Ke-Wen,ZHANG Yong-Zhe.Multi Objective Particle Swarm Optimization Based on Dynamic Adjustment.COMPUTER SYSTEMS APPLICATIONS,2017,26(7):161-166