Abstract
In this paper, the neutrality of some hard instances of the graph coloring problem (GCP) is quantified. This neutrality property has to be detected as it impacts the search process. Indeed, local optima may belong to plateaus that represent a barrier for local search methods. Then, 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. © 2013 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Marmion, M. E., Blot, A., Jourdan, L., & Dhaenens, C. (2013). Neutrality in the graph coloring problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7997 LNCS, pp. 125–130). https://doi.org/10.1007/978-3-642-44973-4_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
