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

论MOEA/D中总体规模和子问题选择的综合影响

On the Combined Impact of Population Size and Sub-problem Selection in MOEA/D

University of Lille(里尔大学);Inria(法国国家信息与自动化研究所);University of Exeter(埃克塞特大学);City University Hong Kong(香港城市大学)

Geoffrey Pruvost, Bilel Derbel, Arnaud Liefooghe, Ke Li, Qingfu Zhang

摘要:

本文旨在理解和改进基于分解的多目标进化算法的工作原理。我们审查的设计完善的MOEA/D框架,以支持子问题选择的不同策略的顺利整合,同时强调在每一代的人口规模和后代的数量的作用。通过对广泛的多目标组合NK景观进行全面的实证分析,我们提供了新的见解,这些参数的组合效果的基础搜索过程中的任何时候的性能。特别是,我们表明,即使是一个简单的随机策略选择子问题随机优于现有的复杂的战略。我们还研究了这种策略的灵敏度相对于目标问题的粗糙度和目标空间维度。

英文摘要:

This paper intends to understand and to improve the working principle of decomposition-based multi-objective evolutionary algorithms. We review the design of the well-established Moea/d framework to support the smooth integration of different strategies for sub-problem selection, while emphasizing the role of the population size and of the number of offspring created at each generation. By conducting a comprehensive empirical analysis on a wide range of multi-and many-objective combinatorial NK landscapes, we provide new insights into the combined effect of those parameters on the anytime performance of the underlying search process. In particular, we show that even a simple random strategy selecting sub-problems at random outperforms existing sophisticated strategies. We also study the sensitivity of such strategies with respect to the ruggedness and the objective space dimension of the target problem.

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

↑