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

基于结构多样性的快速再优化

Fast Re-Optimization via Structural Diversity

Benjamin Doerr, Carola Doerr, Frank Neumann

摘要:

当一个问题实例被一个小的修改所干扰时,人们希望通过建立在前一个已知的好的解决方案上来为新实例找到一个好的解决方案。通过严格的数学分析,我们表明,进化算法,尽管通常是强大的问题求解器,可以有意想不到的困难来解决这样的重新优化问题。当以最优值的随机汉明邻居开始时,(1+1)进化算法需要$Ω(n^2)$时间来优化LeadingOnes基准函数,这与以随机选择的解决方案开始时的渐进优化时间相同。因此,重新优化一个结构良好的解决方案没有明显的优势。然后,我们提出了一种克服这些困难的方法。正如我们的数学分析所揭示的,这种不期望的行为的原因是,在优化过程中,结构良好的解决方案可以很容易地被结构更差的解决方案所取代。我们提出了一个简单的多样性机制,防止这种行为,从而减少重新优化时间为领先者$O(γδn)$,其中$γ$是人口规模所使用的多样性机制和$δ\le γ$的汉明距离的新的最佳从以前的解决方案。我们同样快速重新优化时间的线性函数的优化,不断变化的约束条件和最小生成树问题。

英文摘要:

When a problem instance is perturbed by a small modification, one would hope to find a good solution for the new instance by building on a known good solution for the previous one. Via a rigorous mathematical analysis, we show that evolutionary algorithms, despite usually being robust problem solvers, can have unexpected difficulties to solve such re-optimization problems. When started with a random Hamming neighbor of the optimum, the (1+1) evolutionary algorithm takes $Ω(n^2)$ time to optimize the LeadingOnes benchmark function, which is the same asymptotic optimization time when started in a randomly chosen solution. There is hence no significant advantage from re-optimizing a structurally good solution. We then propose a way to overcome such difficulties. As our mathematical analysis reveals, the reason for this undesired behavior is that during the optimization structurally good solutions can easily be replaced by structurally worse solutions of equal or better fitness. We propose a simple diversity mechanism that prevents this behavior, thereby reducing the re-optimization time for LeadingOnes to $O(γδn)$, where $γ$ is the population size used by the diversity mechanism and $δ\le γ$ the Hamming distance of the new optimum from the previous solution. We show similarly fast re-optimization times for the optimization of linear functions with changing constraints and for the minimum spanning tree problem.

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

↑