arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2604.04083cs.NEcs.AI
收藏

精英交叉算法中的父代选择机制

Parent Selection Mechanisms in Elitist Crossover-Based Algorithms

University of Passau(帕绍大学)

Andre Opris, Denis Antipov

AI总结:

本文提出了一种精英交叉算法的父代选择策略,通过优先选择最大距离的父代进行交叉,以解决Jump_k问题并改进时间复杂度。

摘要:

父代选择方法在进化计算中被广泛用于加速优化过程,但其理论优势仍不明确。本文通过提出一种适用于$(μ+1)$遗传算法(GA)的父代选择策略,优先选择最大距离的父代进行交叉,来填补这一空白。我们证明,通过适当选择种群大小,所得到的算法在解决Jump_k问题上具有$O(k4^kn\log(n))$的期望时间复杂度。该界显著小于任何不使用显式多样性保持机制且使用常数交叉概率的$(μ+1)$GA的最佳已知界$O(nμ\log(μ)+n\log(n)+n^{k-1})$。为建立这一结果,我们引入了一个新的多样性度量,该度量同时捕捉了种群中个体对之间的最大距离以及达到这一距离的对数。我们的分析主要创新点在于依赖交叉作为创造和维持多样性机制,而不是仅在最后一步将已经多样化的个体进行组合。我们的分析所揭示的见解有助于更深入地理解交叉在遗传算法种群动态中的作用。

英文摘要:

Parent selection methods are widely used in evolutionary computation to accelerate the optimization process, yet their theoretical benefits are still poorly understood. In this paper, we address this gap by proposing a parent selection strategy for the $(μ+1)$ genetic algorithm (GA) that prioritizes the selection of maximally distant parents for crossover. We show that, with an appropriately chosen population size, the resulting algorithm solves the Jump$_k$ problem in $O(k4^kn\log(n))$ expected time. This bound is significantly smaller than the best known bound of $O(nμ\log(μ)+n\log(n)+n^{k-1})$ for any $(μ+1)$~GA using no explicit diversity-preserving mechanism and a constant crossover probability. To establish this result, we introduce a novel diversity metric that captures both the maximum distance between pairs of individuals in the population and the number of pairs achieving this distance. The main novelty of our analysis is that it relies on crossover as a mechanism for creating and maintaining diversity throughout the run, rather than using crossover only in the final step to combine already diversified individuals. The insights provided by our analysis contribute to a deeper theoretical understanding of the role of crossover in the population dynamics of genetic algorithms.

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

↑