《计算机应用》唯一官方网站 ›› 2023, Vol. 43 ›› Issue (7): 2226-2236.DOI: 10.11772/j.issn.1001-9081.2022060843

• 先进计算 • 上一篇    

基于权重向量聚类的动态多目标进化算法

李二超(), 程艳丽   

  1. 兰州理工大学 电气工程与信息工程学院,兰州 730050
  • 收稿日期:2022-06-10 修回日期:2022-09-05 接受日期:2022-09-06 发布日期:2022-09-23 出版日期:2023-07-10
  • 通讯作者: 李二超
  • 作者简介:李二超(1980—),男,河北保定人,教授,博士,主要研究方向:人工智能、多目标优化、机器人控制;
    程艳丽(1995—),女,甘肃平凉人,硕士研究生,主要研究方向:动态多目标优化。
  • 基金资助:
    国家自然科学基金资助项目(62063019);甘肃省自然科学基金资助项目(20JR10RA152)

Dynamic multi-objective optimization algorithm based on weight vector clustering

Erchao LI(), Yanli CHENG   

  1. College of Electrical Engineering and Information Engineering,Lanzhou University of Technology,Lanzhou Gansu 730050,China
  • Received:2022-06-10 Revised:2022-09-05 Accepted:2022-09-06 Online:2022-09-23 Published:2023-07-10
  • Contact: Erchao LI
  • About author:LI Erchao, born in 1980, Ph. D., professor. His research interests include artificial intelligence, multi-objective optimization, robot control.
    CHENG Yanli, born in 1995, M. S. candidate. Her research interests include dynamic multi-objective optimization.
  • Supported by:
    National Natural Science Foundation of China(62063019);Natural Science Foundation of Gansu Province(20JR10RA152)

摘要:

实际生活中存在许多的动态多目标优化问题(DMOP)。对于此类问题,当环境发生改变时,就要求动态多目标进化算法(DMOEA)能快速和准确地跟踪新环境下的帕累托前沿(PF)或帕累托最优解集(PS)。针对现有算法的种群预测性能差的问题,提出一种基于权重向量聚类预测的动态多目标进化算法(WVCP)。该算法首先在目标空间中生成均匀的权重向量,并对种群中的个体进行聚类,再根据聚类情况分析种群的分布性。其次,对聚类个体的中心点建立时间序列。对同一权重向量,针对不同的聚类情况采取相应的应对策略对个体进行补充,若相邻时刻均存在聚类中心,则采用差分模型预测新环境下的个体;若某一时刻不存在聚类中心,则用相邻权重向量聚类中心的质心作为该时刻的聚类中心,再运用差分模型预测个体。这样不仅可以有效地解决种群分布性差的问题,还可以提高预测的准确性。最后,引入个体补充策略,以充分地利用历史信息。为验证WVCP算法的性能,把它与四种代表性算法进行了仿真对比。实验结果表明,所提算法能够很好地解决DMOP。

关键词: 动态多目标进化算法, 权重向量, 聚类, 差分模型, 种群预测

Abstract:

There are many Dynamic Multiobjective Optimization Problems (DMOPs) in real life. For such problems, when the environment changes, Dynamic Multi-Objective Evolutionary Algorithm (DMOEA) is required to track the Pareto Front (PF) or Pareto Set (PS) quickly and accurately under the new environment. Aiming at the problem of poor performance of the existing algorithms on population prediction, a dynamic multi-objective optimization algorithm based on Weight Vector Clustering Prediction (WVCP) was proposed. Firstly, the uniform weight vectors were generated in the target space, and the individuals in the population were clustered. According to the clustering results, the distribution of the population was analyzed. Secondly, a time series was established for the center points of clustered individuals. For the same weight vector, the corresponding coping strategies were adopted to supplement individuals according to different clustering situations. If there were cluster centers at all adjacent moments, the difference model was used to predict individuals in the new environment. If there was no cluster center at a certain moment, the centroid of the cluster centers of adjacent weight vectors was used as the cluster center at that moment, and then the difference model was used to predict individuals. In this way, the problem of poor population distribution was solved effectively, and the accuracy of prediction was improved at the same time. Finally, the introduction of individual supplement strategy was beneficial to make full use of historical information. In order to verify the performance of the proposed algorithm, simulation comparison of this algorithm and four representative algorithms was carried out. Experimental results show that the proposed algorithm can solve DMOPs well.

Key words: Dynamic Multi-Objective Evolutionary Algorithm (DMOEA), weight vector, clustering, difference model, population prediction

中图分类号: