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

进化优化的逼近能力及其在最小集合覆盖中的应用

On the approximation ability of evolutionary optimization with application to minimum set cover

Yang Yu, Xin Yao, Zhi-Hua Zhou

摘要:

进化算法(Evolutionary Algorithms,EAs)是一种受自然进化启发的启发式算法。在实践中,它们经常被用来获得满意的解。在本文中,我们研究了一个在很大程度上未被探索的问题:在如何接近的解决方案是一个最佳的解决方案方面的EAs的近似性能。我们研究了EA框架命名为简单EA与孤立的人口(SEIP),可以实现为一个单一的或多目标EA。我们分析了SEIP的近似性能,使用部分比率,它表征的近似比,可以保证。具体来说,我们分析SEIP使用一个集覆盖问题,这是NP难的。我们发现,在一个简单的配置,SEIP有效地实现了$H_n$ -逼近比,渐近下限,无界集覆盖问题。我们还发现,SEIP有效地实现了$(H_k-\frac{k-1}/{8k^9})$ -近似比,目前最好的实现结果,为k-集覆盖问题。此外,对于一个实例类的k-集覆盖问题,我们揭示了如何SEIP,使用一位或逐位变异,可以克服困难,限制了贪心算法。

英文摘要:

Evolutionary algorithms (EAs) are heuristic algorithms inspired by natural evolution. They are often used to obtain satisficing solutions in practice. In this paper, we investigate a largely underexplored issue: the approximation performance of EAs in terms of how close the solution obtained is to an optimal solution. We study an EA framework named simple EA with isolated population (SEIP) that can be implemented as a single- or multi-objective EA. We analyze the approximation performance of SEIP using the partial ratio, which characterizes the approximation ratio that can be guaranteed. Specifically, we analyze SEIP using a set cover problem that is NP-hard. We find that in a simple configuration, SEIP efficiently achieves an $H_n$-approximation ratio, the asymptotic lower bound, for the unbounded set cover problem. We also find that SEIP efficiently achieves an $(H_k-\frac{k-1}/{8k^9})$-approximation ratio, the currently best-achievable result, for the k-set cover problem. Moreover, for an instance class of the k-set cover problem, we disclose how SEIP, using either one-bit or bit-wise mutation, can overcome the difficulty that limits the greedy algorithm.

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

↑