arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2001.06980cs.AIcs.NE
收藏

采用随机部分更新策略的MOEA/D

MOEA/D with Random Partial Update Strategy

University of Tsukuba(筑波大学);University of Brasilia(巴西利亚大学);Aston University(阿斯顿大学)

Yuri Lavinas, Claus Aranha, Marcelo Ladeira, Felipe Campelo

摘要:

最近的研究表明,资源分配的MOEA/D的上下文中,一些子问题比其他的更重要,并专注于最相关的,可以不断提高该算法的性能。这些研究的共同特点是在任何给定的算法迭代中只更新一小部分人口。在这项工作中,我们研究了一个新的,更简单的部分更新策略,其中一个随机子集的解决方案是选择在每次迭代。实验比较了使用这种新的资源分配方法的MOEA/D与标准MOEA/D-DE和基于相对改进的资源分配的MOEA/D的性能。结果表明,使用MOEA/D与这种新的部分更新策略的结果在改善HV和IGD值,和一个更高比例的非支配的解决方案,特别是在每次迭代的更新解决方案的数量减少。

英文摘要:

Recent studies on resource allocation suggest that some subproblems are more important than others in the context of the MOEA/D, and that focusing on the most relevant ones can consistently improve the performance of that algorithm. These studies share the common characteristic of updating only a fraction of the population at any given iteration of the algorithm. In this work we investigate a new, simpler partial update strategy, in which a random subset of solutions is selected at every iteration. The performance of the MOEA/D using this new resource allocation approach is compared experimentally against that of the standard MOEA/D-DE and the MOEA/D with relative improvement-based resource allocation. The results indicate that using the MOEA/D with this new partial update strategy results in improved HV and IGD values, and a much higher proportion of non-dominated solutions, particularly as the number of updated solutions at every iteration is reduced.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑