arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv cs/0505080cs.AIcs.NAmath.NA
收藏

基于支配关系的交叉算子用于进化多目标算法

Dominance Based Crossover Operator for Evolutionary Multi-objective Algorithms

Olga Roudenko, Marc Schoenauer

AI总结:

本文提出一种基于帕累托支配关系的交配限制策略,结合BLX交叉算子,在NSGA-II框架下通过双目标基准和实际问题的实验验证,加速了种群向帕累托最优集的收敛。

摘要:

尽管进化多目标优化(EMO)研究领域近年来快速发展,但针对寻找帕累托最优集这一特定背景来调整通用变异算子的尝试却很少。唯一的例外是一些考虑潜在交配个体之间距离的交配限制,但相关研究得出了相互矛盾的结论。本文针对进化多目标算法提出了一种基于帕累托支配关系的特定交配限制:非支配个体的交配伙伴将优先从种群中被该个体支配的个体中选择。结合BLX交叉算子,本文提出了两种不同的后代生成方式。该重组方案在著名的NSGA-II框架内,在三个双目标基准问题和一个实际的双目标约束优化问题上进行了验证。在所有问题上均观察到种群向帕累托集前进的速度有所加快。

英文摘要:

In spite of the recent quick growth of the Evolutionary Multi-objective Optimization (EMO) research field, there has been few trials to adapt the general variation operators to the particular context of the quest for the Pareto-optimal set. The only exceptions are some mating restrictions that take in account the distance between the potential mates - but contradictory conclusions have been reported. This paper introduces a particular mating restriction for Evolutionary Multi-objective Algorithms, based on the Pareto dominance relation: the partner of a non-dominated individual will be preferably chosen among the individuals of the population that it dominates. Coupled with the BLX crossover operator, two different ways of generating offspring are proposed. This recombination scheme is validated within the well-known NSGA-II framework on three bi-objective benchmark problems and one real-world bi-objective constrained optimization problem. An acceleration of the progress of the population toward the Pareto set is observed on all problems.

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

↑