一种基于多样性信息和收敛度的多目标粒子群优化算法

doi:10.3969/j.issn.0372-2112.2018.02.009

电子学报 ›› 2018, Vol. 46 ›› Issue (2): 315-324.DOI: 10.3969/j.issn.0372-2112.2018.02.009

一种基于多样性信息和收敛度的多目标粒子群优化算法

韩红桂^1,2, 卢薇^1,2, 乔俊飞^1,2

1. 北京工业大学信息学部, 北京 100124;
2. 计算智能与智能系统北京市重点实验室, 北京 100124

收稿日期:2016-08-07 修回日期:2016-11-07 出版日期:2018-02-25
- 作者简介:
- 韩红桂,男,1983年8月出生,江苏泰州人.北京工业大学教授、博士生导师.主要研究领域为城市污水处理过程智能优化控制、计算智能与智能系统等.E-mail:rechardhan@bjut.edu.cn;卢薇,女,1993年8月出生,山东日照人.2015年本科毕业于菏泽学院,并于2015年进入北京工业大学信息学部,现为硕士研究生.主要研究领域为污水处理过程智能优化和神经网络.E-mail:luweiwei@emails.bjut.edu.cn
- 基金资助:
- 国家自然科学基金 (No.61622301，No.61533002）; 中国博士后科学基金 (No.2014M550017）; 教育部博士点基金 (No.20131103110016）; 北京市教育委员会项目 (No.km201410005001，No.KZ201410005002）

A Multiobjective Particle Swarm Optimization Algorithm Based on the Diversity Information and Convergence Degree

HAN Hong-gui^1,2, LU Wei^1,2, QIAO Jun-fei^1,2

1. Department of Information, Beijing University of Technology, Beijing 100124, China;
2. Beijing Key Laboratory of Computational Intelligence and Intelligent System, Beijing 100124, China

Received:2016-08-07 Revised:2016-11-07 Online:2018-02-25 Published:2018-02-25
- Supported by:
- National Natural Science Foundation of China (No.61622301, No.61533002); China Postdoctoral Science Foundation (No.2014M550017); Ph.D. Programs Foundation of Ministry of Education of China (No.20131103110016); Project of Beijing Municipal Education Commission (No.km201410005001, No.KZ201410005002)

摘要/Abstract

摘要： 为了提高多目标粒子群算法优化解的多样性和收敛性，提出了一种基于多样性信息和收敛度的多目标粒子群优化算法（Multiobjective Particle Swarm Optimization based on the Diversity Information and Convergence Degree，dicdMOPSO）.首先，利用非支配解多样性信息评估知识库中最优解的分布状态，设计出一种全局最优解选择机制，平衡了种群的进化过程，提高了非支配解的多样性和收敛性；其次，基于种群多样性信息设计出一种飞行参数调整机制，增强了粒子的全局探索能力和局部开发能力，获得了多样性和收敛性较好的种群.最后，将dicdMOPSO应用于标准测试函数测试，实验结果表明，dicdMOPSO与其他多目标算法相比不仅获得了多样性较高的可行解，而且能够较快的收敛到Pareto前沿.

关键词: 智能优化算法, 多目标粒子群优化, 种群多样性信息, 非支配解多样性信息, 收敛度

Abstract: To improve the diversity and convergence of optimal solutions in multiobjective particle swarm optimization (MOPSO) algorithm, a multiobjective particle swarm optimization algorithm, based on the diversity information and convergence degree, named dicdMOPSO, is developed in this paper. Firstly, a global optimal solution selection mechanism, based on the distribution of optimal solutions in the knowledge base with the diversity information of non-dominated solutions,is introduced to balance the evolutionary process of population to improve the diversity and convergence of non-dominated solutions. Then, to enhance global exploration and local exploitation abilities of particles, a flight parameter adjustment mechanism is proposed to obtain the particles with better diversity and convergence by using the population diversity information. Finally, the experiment results demonstrate that, compared with other multiobjective algorithms, this proposed dicdMOPSO algorithm can not only obtain the optimal solutions with better diversity, but also be faster to catch the Pareto front.

Key words: intelligent optimization algorithm, multiobjective particle swarm optimization, population diversity information, diversity information of non-dominated solutions, convergence degree

中图分类号:

TP18

韩红桂, 卢薇, 乔俊飞. 一种基于多样性信息和收敛度的多目标粒子群优化算法[J]. 电子学报, 2018, 46(2): 315-324.

HAN Hong-gui, LU Wei, QIAO Jun-fei . A Multiobjective Particle Swarm Optimization Algorithm Based on the Diversity Information and Convergence Degree[J]. Acta Electronica Sinica, 2018, 46(2): 315-324.

参考文献

[1] LI H,LANDA-SILVA D. An adaptive evolutionary multi-objective approach based on simulated annealing[J]. Evo-lutionary Computation,2011,19(4):561-595.
[2] MARTIN D,ROSETE A,ALCALA-FDEZ J,et al. A new multiobjective evolutionary algorithm for mining a reduced set of interesting positive and negative quantitative associa-tion rules[J]. IEEE Transactions on Evolutionary Compu-tation,2014,18(1):54-69.
[3] JARA E C. Multi-objective optimization by using evolu-tionary algorithms:The-optimality criteria[J]. IEEE Trans-actions on Evolutionary Computation, 2014, 18(2):167-179.
[4] ZHANG X, TIAN Y, CHENG R, et al. An efficient ap-proach to nondominated sorting for evolutionary multiob-jective optimization[J]. IEEE Transactions on Evolution-ary Computation,2015,19(2):201-213.
[5] 邵鹏,吴志健,周炫余,等. 基于折射原理反向学习模型的改进粒子群算法[J]. 电子学报,2015,43(11):2137-2144. SHAO Peng, WU Zhi-jian, ZHOU Xuan-yu, et al. Im-proved particle swarm optimization algorithm based on op-posite learning of refraction[J]. Acta Electronica Sinica, 2015,43(11):2137-2144. (in Chinese)
[6] 李迎秋,迟玉红,温涛. 一种基于动态边界的粒子群优化算法[J]. 电子学报,2013,41(5):865-870. LI Ying-qiu,CHI Yu-hong,WEN Tao. A dynamic bounda-ry based particle swarm optimization[J]. Acta Electronica Sinica,2013,41(5):865-870. (in Chinese)
[7] DEB K,PRATAP A,AGARWAL S,et al. A fast and elitist multiobjective genetic algorithm:NSGA-Ⅱ[J]. IEEE Transactions on Evolutionary Computation, 2002, 6(2):182-197.
[8] 申元霞,曾传华,王喜凤,等. 并行协作骨干粒子群优化算法[J]. 电子学报,2016,44(7):1643-1648. SHEN Yuan-xia,ZENG Chuan-hua,WANG Xi-feng,et al. A parallel-cooperative bare-bone particle swarm optimiza-tion algorithm[J]. Acta Electronica Sinica,2016,44(7):1643-1648. (in Chinese)
[9] HELWIG S, BRANKE J, MOSTAGHIM S. Experimental analysis of bound handling techniques in particle swarm optimization[J]. IEEE Transactions on Evolutionary Com-putation,2013,17(2):259-271.
[10] PEHLIVANOGLU Y V. A new particle swarm optimiza-tion method enhanced with a periodic mutation strategy and neural networks[J]. IEEE Transactions on Evolution-ary Computation,2013,17(3):436-452.
[11] COELLO C A C,PULIDO G T,LECHUGA M S. Han-dling multiple objectives with particle swarm optimization[J]. IEEE Transactions on Evolutionary Computation, 2004,8(3):256-279.
[12] WANG Y, YANG Y. Particle swarm optimization with preference order ranking for multi-objective optimization[J]. Information Sciences,2009,179(12):1944-1959.
[13] TSAI S J,SUN T Y,LIU C C,et al. An improved multi-objective particle swarm optimizer for multi-objective problems[J]. Expert Systems with Applications,2010,37(8):5872-5886.
[14] MUKHOPADHYAY A,MAULIK U,BANDYOPADHYAY S,et al. A survey of multiobjective evolutionary algorithms for data mining:Part I[J]. IEEE Transactions on Evolution-ary Computation,2014,18(1):4-19.
[15] KNOWLES J D,CORNE D W. Approximating the non-dominated front using the Pareto archived evolution strate-gy[J]. Evolutionary Computation, 2000, 8(2):149-172.
[16] OMRAN M,ENGELBRECHT A P,SALMAN A. Particle swarm optimization method for image clustering[J]. In-ternational Journal of Pattern Recognition and Artificial Intelligence,2005,19(3):297-321.
[17] ZHANG Q,LI H. MOEA/D:A multiobjective evolution-ary algorithm based on decomposition[J]. IEEE Transac-tions on Evolutionary Computation, 2007, 11(6):712-731.
[18] HU W,YEN G G. Adaptive multiobjective particle swarm optimization based on parallel cell coordinate system[J]. IEEE Transactions on Evolutionary Computation,2015,19(1):1-18.

一种基于多样性信息和收敛度的多目标粒子群优化算法

A Multiobjective Particle Swarm Optimization Algorithm Based on the Diversity Information and Convergence Degree

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 9

编辑推荐

Metrics

[1]	韩红桂, 阿音嘎, 张璐, 乔俊飞. 自适应分解式多目标粒子群优化算法[J]. 电子学报, 2020, 48(7): 1245-1254.
[2]	褚鼎立, 陈红, 王旭光. 基于自适应权重和模拟退火的鲸鱼优化算法[J]. 电子学报, 2019, 47(5): 992-999.
[3]	赵世杰, 高雷阜, 于冬梅, 徒君. 基于变因子加权学习与邻代维度交叉策略的改进CSA算法[J]. 电子学报, 2019, 47(1): 40-48.
[4]	韩红桂, 武淑君. 基于收敛速度和多样性的多目标粒子群种群规模优化设计[J]. 电子学报, 2018, 46(9): 2263-2269.
[5]	石剑, 刘忠乐, 周敏佳, 文无敌. 一种基于离散Fréchet距离的磁场相似性度量方法[J]. 电子学报, 2018, 46(4): 856-861.
[6]	张新明, 王霞, 康强, 程金凤. GWO与ABC的混合优化算法及其聚类优化[J]. 电子学报, 2018, 46(10): 2430-2442.
[7]	谢承旺, 邹秀芬, 夏学文, 王志杰. 一种多策略融合的多目标粒子群优化算法[J]. 电子学报, 2015, 43(8): 1538-1544.
[8]	邵鹏, 吴志健, 周炫余, 邓长寿. 基于折射原理反向学习模型的改进粒子群算法[J]. 电子学报, 2015, 43(11): 2137-2144.
[9]	孙晨伟, 陶海红, 王莹, 吕红丽. 大型阵列降维-和差多波束形成的联合优化算法[J]. 电子学报, 2013, 41(3): 519-525.