arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1806.05248cond-mat.dis-nn
收藏

健身景观的覆盖编码

Cover-Encodings of Fitness Landscapes

Konstantin Klemm, Anita Mehta, Peter F. Stadler

摘要:

解决离散优化问题的传统方法是在适当定义的成本或适应度景观上使用局部搜索。然而,这样的方法是有限的减慢时发生的局部极小值,这是一个典型的崎岖的景观遇到逮捕的搜索过程的进展。解决优化问题的另一种方法是使用启发式近似来估计全局成本最小值。在这里,我们提出了这两种方法的组合,通过使用覆盖编码映射,映射过程从一个更大的搜索空间的原始搜索空间的子集。其关键思想是在合适的算法的帮助下构建覆盖编码映射,该算法选出接近最优的解决方案,并在更大的搜索空间上产生不再表现出捕获局部极小值的景观。我们目前的旅行推销员,号码划分,最大匹配和最大集团的问题覆盖编码映射,我们的方法的实际可行性证明了模拟自适应行走在相应的编码景观,找到这些问题的全局最小值。

英文摘要:

The traditional way of tackling discrete optimization problems is by using local search on suitably defined cost or fitness landscapes. Such approaches are however limited by the slowing down that occurs when the local minima that are a feature of the typically rugged landscapes encountered arrest the progress of the search process. Another way of tackling optimization problems is by the use of heuristic approximations to estimate a global cost minimum. Here we present a combination of these two approaches by using cover-encoding maps which map processes from a larger search space to subsets of the original search space. The key idea is to construct cover-encoding maps with the help of suitable heuristics that single out near-optimal solutions and result in landscapes on the larger search space that no longer exhibit trapping local minima. We present cover-encoding maps for the problems of the traveling salesman, number partitioning, maximum matching and maximum clique; the practical feasibility of our method is demonstrated by simulations of adaptive walks on the corresponding encoded landscapes which find the global minima for these problems.

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

↑