检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李二超[1] 刘辰淼 LI Erchao;LIU Chenmiao(College of Electrical Engineering and Information Engineering,Lanzhou University of Technology,Lanzhou 730050,China)
机构地区:[1]兰州理工大学电气工程与信息工程学院,兰州730050
出 处:《计算机工程与应用》2024年第22期87-104,共18页Computer Engineering and Applications
基 金:国家自然科学基金(62063019);甘肃省自然科学基金(20JR10RA152,22JR5RA241)。
摘 要:为更有效地解决Pareto解集(Pareto set,PS)旋转的动态多目标优化问题,提出PS旋转的分类多策略预测方法(rotation-based forecasting method,RFM)。将PS的旋转类型分为PS中心点旋转、PS原点旋转和非标准旋转;针对以上不同的PS旋转类型,自适应地选择合适的预测模型,建立不同点集的时间序列,为后续进化提供初始种群。引入拉丁超立方策略(Latin hypercube strategy,LHS)生成的随机种群与上述预测种群共同构建新种群,保证种群的多样性。为验证算法的有效性,将RFM算法与DNSGA-II、PPS、SPPS和MMP算法在8个标准的动态测试函数上进行实验对比。实验结果表明,RFM算法取得了6个最优IGD值、7个最优SP值、3个最优MS值,证明了RFM算法可以更有效地解决基于PS旋转的动态多目标优化问题。同时验证了RFM算法的普适性,在FDA系列函数上进行实验对比,实验结果表明,该算法在处理非旋转的动态多目标优化问题中仍具有较优性能。In order to solve the dynamic multi-objective optimization problem of Pareto set(PS)rotation more effectively,this paper proposes a classification multi-strategy prediction method based on PS rotation(RFM).Firstly,the rotation types of PS are divided into PS center point rotation,PS origin rotation and non-standard rotation.Then,the appropriate prediction model is adaptively selected for the above different PS rotation types,and the time series of different point sets is established to provide the initial population for the subsequent evolution.Finally,the random population generated by Latin hypercube strategy(LHS)is introduced to construct a new population together with the above predicted population to ensure the diversity of the population.In order to verify the effectiveness of the algorithm,the RFM algorithm is com-pared with DNSGA-II,PPS,SPPS and MMP algorithms on eight standard dynamic test functions.The experimental results show that the RFM algorithm achieves six optimal IGD values,seven optimal SP values and three optimal MS val-ues,which proves that the RFM algorithm can solve the dynamic multi-objective optimization problem based on PS rota-tion more effectively.At the same time,the generality of the RFM algorithm is verified by experiments on the FDA series of functions.The experimental results show that the algorithm still has better performance in dealing with non-rotating dynamic multi-objective optimization problems.
关 键 词:动态多目标优化 进化算法 分类预测 Pareto解集旋转
分 类 号:TP273[自动化与计算机技术—检测技术与自动化装置]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.117.156.19