arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2103.00480cs.NE
收藏

基于分解的多目标遗传编程语义邻域排序

Semantic Neighborhood Ordering in Multi-objective Genetic Programming based on Decomposition

Fergal Stapleton, Edgar Galván

摘要:

遗传编程中的语义多样性在进化搜索中被证明是非常有益的。我们目睹了该领域科学作品数量的激增,首先是在离散空间开始,然后转移到连续空间。然而,绝大多数的这些作品,都集中在单目标遗传编程范例的注意力,与少数例外,专注于进化多目标优化(EMO)。后者的作品使用了众所周知的强大的算法,包括非支配排序遗传算法II和强度帕累托进化算法,两者都深受帕累托优势的概念。这些鼓舞人心的工作使我们在EMO中向前迈出了一步,考虑基于分解的多目标进化算法(MOEA/D)。我们首次展示了如何在遗传编程中促进MOEA/D的语义多样性。

英文摘要:

Semantic diversity in Genetic Programming has proved to be highly beneficial in evolutionary search. We have witnessed a surge in the number of scientific works in the area, starting first in discrete spaces and moving then to continuous spaces. The vast majority of these works, however, have focused their attention on single-objective genetic programming paradigms, with a few exceptions focusing on Evolutionary Multi-objective Optimization (EMO). The latter works have used well-known robust algorithms, including the Non-dominated Sorting Genetic Algorithm II and the Strength Pareto Evolutionary Algorithm, both heavily influenced by the notion of Pareto dominance. These inspiring works led us to make a step forward in EMO by considering Multi-objective Evolutionary Algorithms Based on Decomposition (MOEA/D). We show, for the first time, how we can promote semantic diversity in MOEA/D in Genetic Programming.

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

↑