Abstract
The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling and crew scheduling. The traditional graph coloring problem focuses on minimizing the number of colors used in the graph. RGCP focuses on the robustness of the coloring so that the coloring is able to handle uncertainty that often occurs in the real world. By that, we mean that given a fixed number of colors we would like to color the graph so that adjacent vertices are assigned different colors with the consideration of the possible appearance of the missing edges. In this paper, we present a new hybrid genetic algorithm (GA), which embeds two kinds of local search algorithms – enumerative search and random search within the GA framework. In addition, we integrate a partition based encoding scheme with a specialized crossover operator into our GA method. We also propose an adaptive scheme that alternates between two local search methods to increase performance. Experimental results show that our new algorithm outperforms the best published results in terms of the quality of solutions and the computing time needed.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brelaz, D.: New Methods to Color Vertices of a Graph. Communications of ACM 22, 251–256 (1979)
Davis, L.: Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York (1991)
Galinier, P., Hao, J.-K.: Hybrid Evolutionary Algorithm for Graph Coloring. Journal of Combinatorial Optimization 3, 379–397 (1999)
Garey, M.R., Johnson, D.S.: Computer and Intractability. Freeman, San Francisco (1979)
Johnson, D.S., Aragon, C.R., McGeoch, L.A., Schevon, C.: Optimization by Simulated Annealing: an Experimental Evaluation; part II. Graph Coloring and Number Partitioning, Operations Research 39(3), 378–406 (1991)
Johnson, D.S., Trick, M.A. (eds.): Proceedings of the 2nd DIMACS Implementation Challenge. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 26. American Mathematical Society, Providence (1996)
Pardalos, P.M., Mavridou, T., Xue, J.: The Graph Coloring Problems: A Bibliographic Survey. In: Du, D.-Z., Pardlos, P. (eds.) Handbook of Combinatorial Optimization, vol. 2, pp. 331–395. Kluwer Academic Publishers, Dordrecht (1996)
Yanez, J., Ramirez, J.: The Robust Coloring Problem. European Journal of Operational Research 148(3), 546–558 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kong, Y., Wang, F., Lim, A., Guo, S. (2003). A New Hybrid Genetic Algorithm for the Robust Graph Coloring Problem. In: Gedeon, T.(.D., Fung, L.C.C. (eds) AI 2003: Advances in Artificial Intelligence. AI 2003. Lecture Notes in Computer Science(), vol 2903. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24581-0_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-24581-0_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20646-0
Online ISBN: 978-3-540-24581-0
eBook Packages: Springer Book Archive