首页> 外文会议>Chinese Control and Decision Conference >A Bi-population Multi-objective Algorithm for Continuous Multi-objective Optimization Problem
【24h】

A Bi-population Multi-objective Algorithm for Continuous Multi-objective Optimization Problem

机译:一种用于连续多目标优化问题的双人口多目标算法

获取原文

摘要

The decomposition based multi-objective evolution algorithm (MOEA) had been successfully applied into solving many kinds of multi-objective optimization problems. MOEA/D is the most classical MOEA based on decomposition approach, which has received an increasing interesting from computational intelligent in the past few years. In the MOEA/D, a multi-objective optimization problem would be decomposed into a set of scalar single-objective subproblems and then the evolutionary algorithm is utilized to address these subproblems simultaneously. In order to improve the quality and distribution of the nondominated solutions, the differential evolution is used to evolve the external archive based on the Pareto rule, where the global and local evolution is designed to improve the quality and distribution, adaptively. A set of experiments are carried out to investigate the strength and weakness of our proposed algorithm on a series of benchmark test problems in comparison with the original MOEA/D.
机译:基于分解的多目标演进算法(MOEA)已成功应用于解决多种多目标优化问题。 MOEA / D是基于分解方法的最古典的MOEA,这已经从过去几年中获得了从计算智能的越来越多的兴趣。在MOEA / D中,多目标优化问题将被分解成一组标量单目标子问题,然后使用进化算法同时解决这些子问题。为了提高Nondomination Solutions的质量和分布,差分演进用于基于Pareto规则演变外部档案,其中全球和本地演进旨在自适应地提高质量和分布。进行了一组实验,以研究我们所提出的算法在与原始MoEA / D相比的一系列基准测试问题上的强度和弱点。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号