基于多种群分解预测的动态多目标引力搜索算法  

Dynamic multi-objective gravitational searching algorithm based on multi-population decomposition prediction

作　　者：刁鹏飞 李树森[2] 姜雪松[1] DIAO Peng-fei;LI Shu-sen;JIANG Xue-song(College of Engineering and Technology,Northeast Forestry University,Harbin 150001,China;College of Mechanic and Electronic Engineering,Northeast Forestry University,Harbin 150001,China;Jiangsu Province Jinxiang Transmission Equipment Co.Ltd,Huai’an 223001,China)

机构地区：[1]东北林业大学工程技术学院,哈尔滨150001 [2]东北林业大学机电工程学院,哈尔滨150001 [3]江苏省金象传动设备股份有限公司,江苏淮安223001

出　　处：《控制与决策》2021年第12期2910-2918,共9页Control and Decision

基　　金：中央高校基本科研业务费专项资金项目(2572018BL04).

摘　　要：为提高算法求解动态多目标问题的寻优性能,提出一种多种群分解预测动态多目标算法.首先,提出进化向量生成策略,即基于偏好目标的解生成一组均匀分布的平行向量,并采用引力搜索算法优化每个子问题,保证其对应解的精度和分布的均匀性;其次,设计插值生成策略,即根据进化向量子问题的解在目标空间中的取值,通过线性插值的方式生成更多非支配解,保证解集的多样性和均匀性;再次,在环境变化后,根据相邻子问题的解存在相近性预测生成搜索种群,提高算法的寻优速度.与5个对比算法在10个标准动态测试函数上进行对比分析,实验结果表明采用所提出算法求解动态多目标问题具有较好的分布性和收敛性.In order to improve the non-dominant solution set with better convergence and distributivity of dynamic multi-objective problems,a multi-population decomposition prediction algorithm is proposed.Firstly,an evolutionary vector adaptive generation strategy is proposed,which generates a set of uniform evolutionary vectors based on the solutions of preference sub-problems to ensure the convergence and distribution of the Pareto set.Then,the new non-dominant solution is obtained based on the location of the solution of the subproblem in the target space.Thirdly,a predictive model is adopted to initialize the subpopulation to improve the optimum speed and performance of the algorithm.The experimental results show that compared with five existing algorithms,the proposed algorithm has obvious advantages in convergence and distribution over ten standard dynamic multi-objective problems..

关 键 词：动态多目标 基于分解技术的多目标算法 多种群预测 引力搜索算法 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]