首页> 外文会议>International conference on evolutionary multi-criterion optimization >An Online Machine Learning-Based Prediction Strategy for Dynamic Evolutionary Multi-objective Optimization
【24h】

An Online Machine Learning-Based Prediction Strategy for Dynamic Evolutionary Multi-objective Optimization

机译:基于在线机器学习的动态进化多目标优化预测策略

获取原文

摘要

Due to the impact of environmental changes, dynamic evolutionary multi-objective optimization algorithms need to track the time-varying Pareto optimal solution set of dynamic multi-objective optimization problems (DMOPs) as soon as possible by effectively mining historical data. Since online machine learning can help algorithms dynamically adapt to new patterns in the data in machine learning community, this paper introduces Passive-Aggressive Regression (PAR, a common online learning technology) into dynamic evolutionary multi-objective optimization research area. Specifically, a PAR-based prediction strategy is proposed to predict the new Pareto optimal solution set of the next environment. Furthermore, we integrate the proposed prediction strategy into the multi-objective evolutionary algorithm based on decomposition with a differential evolution operator (MOEA/D-DE) to handle DMOPs. Finally, the proposed prediction strategy is compared with three state-of-the-art prediction strategies under the same dynamic MOEA/D-DE framework on CEC2018 dynamic optimization competition problems. The experimental results indicate that the PAR-based prediction strategy is promising for dealing with DMOPs.
机译:由于环境变化的影响,通过有效采矿历史数据,动态进化的多目标优化算法需要跟踪动态多目标优化问题(DMOPS)的时变帕圈出最佳解决方案集。由于在线机器学习可以帮助算法动态地适应机器学习界中数据中的新模式,因此本文介绍了被动激进的回归(PAR,一个普通的在线学习技术)到动态进化的多目标优化研究区域。具体地,提出了基于基于基于的预测策略来预测下一个环境的新帕累托最优解决方案集。此外,我们将所提出的预测策略集成到基于与差分演进操作员(MOEA / D-DE)的分解的多目标进化算法中,以处理DMOPS。最后,在CEC2018动态优化竞争问题上的相同动态MOEA / D-DE框架下,将所提出的预测策略与三个最先进的预测策略进行比较。实验结果表明,基于体律的预测策略是对处理DMOPS的承诺。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号