Abstract
In this paper, we combine a powerful representation for graph colouring problems with different heuristic strategies for colour assignment. Our novel strategies employ heuristics that exploit information about the partial colouring in an aim to improve performance. An evolutionary algorithm is used to drive the search. We compare the different strategies to each other on several very hard benchmarks and on generated problem instances, and show where the novel strategies improve the efficiency.
This is a preview of subscription content, log in via an institution to check access.
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
Jensen, T., Toft, B.: Graph Coloring Problems. Wiley-Interscience Series in Discrete Mathematics and Optimization. John Wiley & Sons, Inc, Chichester (1995)
Russell, S., Norvig, P.: Artificial Intelligence: A Modern Approach, 2nd edn. Prentice Hall Series in Artificial Intelligence, Englewood Cliffs (1995)
Schumacher, C., Vose, M., Whitley, L.: The no free lunch and problem description length. In: Spector, L., Goodman, E.D., Wu, A., Langdon, W.B., Voigt, H.M., Gen, M., Sen, S., Dorigo, M., Pezeshk, S., Garzon, M.H., Burke, E. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2001), pp. 565–570. Morgan Kaufmann, San Francisco (2001)
Wolpert, D., Macready, W.: No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation 1, 67–82 (1997)
Culberson, J.: On the futility of blind search: An algorithmic view of ”No Free Lunch”. Evolutionary Computation 69, 109–128 (1998)
Glover, F., Kochenberger, W., Gary, A.: Handbook of Metaheuristics. International Series in Operations Research and Management Science, vol. 57. Kluwer, Dordrecht (2003)
Burke, E., Kendall, G., Soubeiga, E.: A tabu-search hyper-heuristic for timetabling and rostering. Journal of Heuristics 9, 451–470 (2003)
Juhos, I., Tóth, A., van Hemert, J.: Binary merge model representation of the graph colouring problem. In: Gottlieb, J., Raidl, G. (eds.) Evolutionary Computation in Combinatorial Optimization, pp. 124–134 (2004)
Cheeseman, P., Kanefsky, B., Taylor, W.M.: Where the Really Hard Problems Are. In: Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, IJCAI 1991, Sidney, Australia, pp. 331–337 (1991)
Bäck, T., Fogel, D., Michalewicz, Z. (eds.): Handbook of Evolutionary Computation. Oxford University Press, Oxford (1997)
Johnson, D., Trick, M.: Cliques, Coloring, and Satisfiability. American Mathematical Society, dimacs (1996)
Leighton, F.T.: A graph colouring algorithm for large scheduling problems. J. Res. National Bureau Standards 84, 489–503 (1979)
Fotakis, D., Likothanassis, S., Stefanakos, S.: An evolutionary annealing approach to graph coloring. In: Boers, E.J.W., Gottlieb, J., Lanzi, P.L., Smith, R.E., Cagnoni, S., Hart, E., Raidl, G.R., Tijink, H. (eds.) EvoIASP 2001, EvoWorkshops 2001, EvoFlight 2001, EvoSTIM 2001, EvoCOP 2001, and EvoLearn 2001. LNCS, vol. 2037, pp. 120–129. Springer, Heidelberg (2001)
Brélaz, D.: New methods to color the vertices of a graph. Communications of the acm 22, 251–256 (1979)
Culberson, J.: Iterated greedy graph coloring and the difficulty landscape. Technical Report tr 92-07, University of Alberta, Dept. of Computing Science (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Juhos, I., Tóth, A., van Hemert, J.I. (2005). Heuristic Colour Assignment Strategies for Merge Models in Graph Colouring. In: Raidl, G.R., Gottlieb, J. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2005. Lecture Notes in Computer Science, vol 3448. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31996-2_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-31996-2_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25337-2
Online ISBN: 978-3-540-31996-2
eBook Packages: Computer ScienceComputer Science (R0)