A new neighborhood based on improvement graph for robust graph coloring problem

Authors:
Songshan Guo;Ying Kong;Andrew Lim;Fan Wang
Affiliations:
Dept of Computer Science, Zhongshan (Sun Yat-sen) University, Guangzhou, China;Dept of Computer Science, Zhongshan (Sun Yat-sen) University, Guangzhou, China;Dept of Industrial Engineering and Engineering Management, Hong Kong University of Science and Technology, Hong Kong;Dept of Industrial Engineering and Engineering Management, Hong Kong University of Science and Technology, Hong Kong
Venue:
AI'04 Proceedings of the 17th Australian joint conference on Advances in Artificial Intelligence
Year:
2004

Citing 5
Cited 1

A generalized implicit enumeration algorithm for graph coloring

Communications of the ACM - Lecture notes in computer science Vol. 174
Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning

Operations Research
“Squeaky Wheel” optimization

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
New methods to color the vertices of a graph

Communications of the ACM
Register allocation & spilling via graph coloring

SIGPLAN '82 Proceedings of the 1982 SIGPLAN symposium on Compiler construction

A branch-and-price algorithm for the robust graph coloring problem

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.