Metaheuristics for robust graph coloring

Authors:
Fan Wang;Zhou Xu
Affiliations:
Business School, Sun Yat-sen University, Guangzhou, China;Department of Logistics and Maritime Studies, Faculty of Business, The Hong Kong Polytechnic University, Hong Kong, Hong Kong
Venue:
Journal of Heuristics
Year:
2013

Citing 13
Cited 0

Using tabu search techniques for graph coloring

Computing
Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning

Operations Research
A still better performance guarantee for approximate graph coloring

Information Processing Letters
A GRASP for Coloring Sparse Graphs

Computational Optimization and Applications
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A Taxonomy of Evolutionary Algorithms in Combinatorial Optimization

Journal of Heuristics
Greedy and Local Search Heuristics for Unconstrained Binary Quadratic Programming

Journal of Heuristics
A New Genetic Local Search Algorithm for Graph Coloring

PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Register allocation & spilling via graph coloring

SIGPLAN '82 Proceedings of the 1982 SIGPLAN symposium on Compiler construction
A survey of local search methods for graph coloring

Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
A graph coloring heuristic using partial solutions and a reactive tabu scheme

Computers and Operations Research
An adaptive memory algorithm for the k-coloring problem

Discrete Applied Mathematics
Graph colouring approaches for a satellite range scheduling problem

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies a robust graph coloring problem, which is a variant of the classical graph coloring problem, where penalties are charged for non-adjacent vertices that are assigned the same color. The problem can be formulated as an unconstrained quadratic programming problem, and has many applications in industry. Since the problem is known to be strongly NP-complete, we develop a number of metaheuristics for it, which are based on various encoding schemes, neighborhood structures, and search algorithms. Extensive experiments suggest that our metaheuristics with a partition based encoding scheme and an improvement graph based neighborhood outperform other methods tested in our study.