首页> 外文会议>2011 IEEE International Conference on Systems, Man, and Cybernetics >A memetic algorithm with one-step local search to guide diversity increase in Dynamic Multiobjective problems
【24h】

A memetic algorithm with one-step local search to guide diversity increase in Dynamic Multiobjective problems

机译:具有一步本地搜索的模因算法,用于指导动态多目标问题中的多样性增加

获取原文

摘要

The Multiobjective Evolutionary Algorithms (MOEAs) are often applied to solve difficult optimization problems, but the dynamic case is even more special. During the optimization, if the environment is changed, a dynamic algorithm must temporarily increase the exploration and decrease the exploitation to generate genetic diversity and then be capable of handling the new behavior of the environment. A technique to increase the diversity may impose an extra delay to such an algorithm that needs to be fast because the new changes may arrive at any time. This paper proposes a model that adds a mutation operator based on gradient, which has the purpose of generating guided diversity to respond to changes in the environment, hence it can accelerate the convergence of the algorithm as a whole. The memetic mutation operator was inserted in the SPEA2 to respond more efficiently to the modifications. Simulations of the proposed model (called Gradient Guided SPEA2, GSPEA2) were carried out for the benchmarks FDA1, FDA3, and DIMP1. Considering the metrics VDweighted and MSweighted, performance of SPEA2 with GSPEA2 was compared with other four dynamic MOEAs. Results suggest that this is a promising approach.
机译:多目标进化算法(MOEA)通常用于解决困难的优化问题,但动态情况则更为特殊。在优化过程中,如果环境发生了变化,则动态算法必须暂时增加探索并减少利用,以产生遗传多样性,然后能够处理环境的新行为。增加分集的技术可能会给这种算法带来额外的延迟,因为新的更改可能会随时到达,因此该算法需要快速进行。本文提出了一种基于梯度的变异算子模型,其目的是产生导引的多样性以响应环境的变化,从而可以整体上加快算法的收敛速度。将模因突变算子插入SPEA2中,以更有效地响应修饰。针对基准FDA1,FDA3和DIMP1对提议的模型(称为“梯度引导的SPEA2”,“ GSPEA2”)进行了仿真。考虑到指标VD 加权和MS 加权,将SPEA2和GSPEA2的性能与其他四个动态MOEA进行了比较。结果表明这是一种有前途的方法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号