arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1301.6092math.CO
收藏

图着色问题中的中性性

Neutrality in the Graph Coloring Problem

Marie-Eleonore Marmion, Aymeric Blot, Laetitia Jourdan, Clarisse Dhaenens

摘要:

图的着色问题是文献中经常研究的问题。许多见解的许多相邻的解决方案具有相同的适应值,但据我们所知,没有深入的分析,这种中立性进行了文献。在本文中,我们量化的中立性的一些困难的情况下,图着色问题。这种中立属性必须被检测出来,因为它会影响搜索过程。实际上,局部最优可能属于表示局部搜索法的障碍的平台。在这项工作中,我们还旨在指出在搜索过程中利用中立性的利益。因此,一个通用的本地搜索致力于中性问题,NILS,在几个硬的情况下进行。

英文摘要:

The graph coloring problem is often investigated in the literature. Many insights about many neighboring solutions with the same fitness value are raised but as far as we know, no deep analysis of this neutrality has ever been conducted in the literature. In this paper, we quantify the neutrality of some hard instances of the graph coloring problem. This neutrality property has to be detected as it impacts the search process. Indeed, local optima may belong to plateaus that represents a barrier for local search methods. In this work, we also aim at pointing out the interest of exploiting neutrality during the search. Therefore, a generic local search dedicated to neutral problems, NILS, is performed on several hard instances.

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

↑