A New Neighborhood Based on Improvement Graph for Robust Graph Coloring Problem

In this paper, we propose a new neighborhood structure based on the improvement graph for solving the Robust Graph Coloring Problem, an interesting extension of classical graph coloring. Different from the traditional neighborhood where the color of only one vertex is modified, the new neighborhood involves several vertices. In addition, the questions of how to select the modified vertices and how to modify them are modelled by an improvement graph and solved by a Dynamic Programming method. The experimental results clearly show that our new improvement graph based k-exchange cycle neighborhood improves the accuracy significantly, especially for large scale heuristic search.

• Type: Conference
• Year: 2004
• Where: AUSAI
• Authors: Songshan Guo, Ying Kong, Andrew Lim, Fan Wang
• Keywords: Artificial Intelligence, AUSAI 2004, Graph Coloring, Graph Coloring Problem, Improvement Graph