基于分解的多目标花朵授粉算法

doi:10.3969/j.issn.1006-2475.2019.07.001

摘要/Abstract

摘要： 在过去几十年里，许多多目标进化算法被广泛应用于解决多目标优化问题，其中一种比较流行的多目标进化算法是基于分解的多目标进化算法(MOEA/D)。花朵授粉算法是一种启发式优化算法，但迄今为止，花朵授粉算法在基于分解的多目标进化算法领域的研究还非常少。本文在基于分解的多目标进化算法的框架下，将花朵授粉算法拓展至多目标优化领域，提出一种基于分解的多目标花朵授粉算法(MOFPA/D)。此外，为了保证非支配解的多样性，本文提出一种基于网格的目标空间分割法，该方法从找到的Pareto最优解集中筛选出一定数量且分布均匀的Pareto最优解。实验结果表明，基于分解的多目标花朵授粉算法在收敛性与多样性方面均优于基于分解的多目标进化算法。

关键词: 多目标优化问题, 基于分解的多目标进化算法, 花朵授粉算法, 非支配解, 基于网格的方法

Abstract: During the past decades, a variety of multi-objective evolutionary algorithms (MOEAs) have been widely used to solve all kinds of multi-objective optimization problems (MOPs). One of the representative MOEAs is the multi-objective evolution algorithm based on decomposition, called MOEA/D. The flower pollination algorithm (FPA) is a meta-heuristic optimization algorithm. However, to our best knowledge, so far there are few papers studying on FPA based on decomposition in the multi-objective optimization field. In this paper, under the framework of MOEA/D, we extend the initial FPA to decomposed-based multi-objective optimization field and further present a multi-objective FPA based on decomposition, called MOFPA/D. In addition, in order to keep the diversity of nondominated solutions in the external archive, we address a novel strategy, named grid-based segmentation of objective space to select some Pareto optimal solutions for output. The simulation results indicate that MOFPA/D is highly competitive with or superior to the initial MOEA/D in terms of solution convergence and diversity.

Key words: multi-objective optimization problems, decomposed-based multi-objective evolutionary algorithm, flower pollination algorithm, nondominated solutions, grid-based approach

中图分类号:

TP391

陈泯融，黄广敬. 基于分解的多目标花朵授粉算法[J]. 计算机与现代化, doi: 10.3969/j.issn.1006-2475.2019.07.001.

CHEN Min-rong, HUANG Guang-jing. A Multi-objective Flower Pollination Algorithm Based on Decomposition[J]. Computer and Modernization, doi: 10.3969/j.issn.1006-2475.2019.07.001.

参考文献

［1］ DEB K, PRATAP A, AGARWAL S, et al. A fast and elitist multiobjective genetic algorithm: NSGA-II［J］. IEEE Transactions on Evolutionary Computation, 2002,6(2):182-197.
［2］ DEB K, JAIN H. An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: Solving problems with box constraints［J］. IEEE Transactions on Evolutionary Computation, 2014,18(4):577-601.
［3］ JAIN H, DEB K. An evolutionary many-objective optimization algorithm using reference-point based nondominated sorting approach, part II:Handling constraints and extending to an adaptive approach［J］. IEEE Transactions on Evolutionary Computation, 2014,18(4):602-622.
［4］ CHEN M R, LU Y Z. A novel elitist multiobjective optimization algorithm: Multiobjective extremal optimization［J］. European Journal of Operational Research, 2008,188(3):637-651.
［5］ LUO J P, LIU Q Q, YANG Y, et al. An artificial bee colony algorithm for multi-objective optimisation［J］. Applied Soft Computing, 2017,50:235-251.
［6］ ZHANG Q F, LI H. MOEA/D: A multiobjective evolutionary algorithm based on decomposition［J］. IEEE Transactions on Evolutionary Computation, 2007,11(6):712-731.
［7］ PENG W, ZHANG Q F. A decomposition-based multi-objective particle swarm optimization algorithm for continuous optimization problems［C］// Proceedings of the 2008 IEEE International Conference on Granular Computing. 2008:534-537.
［8］ ZHANG Q F, LIU W D, LI H. The performance of a new version of MOEA/D on CEC09 unconstrained MOP test instances［C］// Proceedings of the 2009 IEEE Congress on Evolutionary Computation. 2009:203-208.
［9］ LI H, LANDA-SILVA D. An adaptive evolutionary multi-objective approach based on simulated annealing［J］. Evolutionary Computation, 2011,19(4):561-595.〖HJ0.68mm〗
［10］ZHAO S Z, SUGANTHAN P N, ZHANG Q F. Decomposition-based multiobjective evolutionary algorithm with an ensemble of neighborhood sizes［J］. IEEE Transactions on Evolutionary Computation, 2012,16(3):442-446.
［11］JAN M A, KHANUM R A. A study of two penalty-parameterless constraint handling techniques in the framework of MOEA/D［J］. Applied Soft Computing, 2013,13(1):128-148.
［12］KE L J, ZHANG Q F, BATTITI R. MOEA/D-ACO: A multiobjective evolutionary algorithm using decomposition and AntColony［J］. IEEE Transactions on Cybernetics, 2013,43(6):1845-1859.
［13］CHANG P C, CHEN S H, ZHANG Q F, et al. MOEA/D for flowshop scheduling problems［C］// Proceedings of the 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence). 2008:1433-1438.
［14］KONSTANTINIDIS A, ZHANG Q F, YANG K. A subproblem-dependent heuristic in MOEA/D for the deployment and power assignment problem in wireless sensor networks［C］// Proceedings of the 2009 IEEE Congress on Evolutionary Computation. 2009:2740-2747.
［15］ZHANG Q F, LIU W D, TSANG E, et al. Expensive multiobjective optimization by MOEA/D with Gaussian process model［J］. IEEE Transactions on Evolutionary Computation, 2010,14(3):456-474.
［16］SILVA R C P, LI M, RAHMAN T, et al. Surrogate-based MOEA/D for electric motor design with scarce function evaluations［J］. IEEE Transactions on Magnetics, 2017,53(6): Article Sequence Number: 7400704.
［17］YANG X S. Flower pollination algorithm for global optimization［C］// Proceedings of the 2012 International Conference on Unconventional Computing and Natural Computation. 2012:240-249.
［18］YANG X S, DEB S, HE X S. Eagle strategy with flower algorithm［C］// Proceedings of the 2013 International Conference on Advances in Computing, Communications and Informatics. 2013:1213-1217.
［19］ABDEL-RAOUF O, ABDEL-BASET M, EL-HENAWY I. A new hybrid flower pollination algorithm for solving constrained global optimization problems［J］. International Journal of Applied Operational Research, 2014,4(2):1-13.
［20］YANG X S, KARAMANOGLU M, HE X S. Multi-objective flower algorithm for optimization［J］. Procedia Computer Science, 2013,18:861-868.
［21］DAS I, DENNIS J E. A close look at drawbacks of minimizing weighted sums of objectives for Pareto set generation in multicriteria optimization problems［J］. Structure Optimization, 1997,14(1):63-69.
［22］KARABOGA D. An Idea Based on Honey Bee Swarm for Numerical Optimization［R］. Erciyes University, 2005.
［23］KNOWLES J D, CORNE D W. Approximating the nondominated front using the Pareto archived evolution strategy［J］. Evolutionary Computation, 2000,8(2):149-172.
［24］LAUMANNS M, THIELE L, DEB K, et al. Combining convergence and diversity in evolutionary multiobjective optimization［J］. Evolutionary Computation, 2002,10(3):263-282.
［25］ZITZLER E, DEB K, THIELE L. Comparison of multiobjective evolutionary algorithms: Empirical results［J］. Evolutionary Computation, 2000,8(2):173-195.
［26］ZHANG Q F. Professor Qingfu Zhang［DB/OL］. ［2018-05-18］. https://dces.essex.ac.uk/staff/qzhang/.

[1]	付鸿林, 张太红, 杨雅婷, 艾孜麦提·艾瓦尼尔, 马博. 基于生成对抗网络的维语场景文字修改网络[J]. 计算机与现代化, 2024, 0(01): 41-46.
[2]	王秋忆, 周浩, 郑婷婷. 改进RetinaNet的电力设备目标检测方法[J]. 计算机与现代化, 2024, 0(01): 47-52.
[3]	林启钊, 彭志平, 郭棉, 崔得龙. 基于双向多步预测的炉管温度场重构方法[J]. 计算机与现代化, 2024, 0(01): 53-58.
[4]	郑立瑞, 肖晓霞, 邹北骥, 刘彬, 周展. 基于BERT的电子病历命名实体识别[J]. 计算机与现代化, 2024, 0(01): 87-91.
[5]	李颖颖, 黄文培. 基于优化八叉树的场景视锥体裁剪算法[J]. 计算机与现代化, 2024, 0(01): 103-108.
[6]	夏千涵, 何胜煌, 吴元清, 赵乐乐. 基于可学习记忆特征金字塔网络的小样本目标检测[J]. 计算机与现代化, 2023, 0(12): 7-13.
[7]	周成诚, 曾庆军, 杨康, 胡家铭, 韩春伟. 基于高效通道注意力模块的运动想象脑电识别[J]. 计算机与现代化, 2023, 0(12): 19-23.
[8]	曾伟平, 陈俊洪, Muhammad ASIM, 刘文印, 杨振国. 基于多阶段分形组合的点云补全算法[J]. 计算机与现代化, 2023, 0(12): 24-29.
[9]	白晓波, 江梦茜, 王铁山, 邵景峰, 李勃, . 聚类质心与指数递减方法改进的哈里斯鹰算法[J]. 计算机与现代化, 2023, 0(12): 30-35.
[10]	邱凯星, 冯广. 基于双重特征注意力的多标签图像分类模型[J]. 计算机与现代化, 2023, 0(12): 41-47.
[11]	杜康, 郭鲁钰, 徐啟蕾, 单宝明, 张方坤. 基于模型种群分析变量选择的红外光谱建模方法[J]. 计算机与现代化, 2023, 0(12): 48-52.
[12]	刘语珵, 贺奇, 董延华, 王晓宇. 结合时间相关度与课程搭配度的课程推荐方法[J]. 计算机与现代化, 2023, 0(12): 53-58.
[13]	张浩洋, 尹梓名, 乐珺怡, 沈达聪, 束翌俊, 杨自逸, 孔祥勇, 龚伟. 3D-SPRNet: 一种基于并行解码器和双注意力机制的胆囊癌分割模型[J]. 计算机与现代化, 2023, 0(12): 59-66.
[14]	张伯泉, 麦海鹏, 陈嘉敏, 逄锦聚. 基于高灰度值注意力机制的脑白质高信号分割[J]. 计算机与现代化, 2023, 0(12): 67-75.
[15]	张在成, 李健. 改进的神经渲染方法在建筑施工场景中的应用[J]. 计算机与现代化, 2023, 0(12): 76-81.