Abstract
This paper describes a novel representation and ordering model that, aided by an evolutionary algorithm, is used in solving the graph k-colouring problem. Its strength lies in reducing the number of neighbors that need to be checked for validity. An empirical comparison is made with two other algorithms on a popular selection of problem instances and on a suite of instances in the phase transition. The new representation in combination with a heuristic mutation operator shows promising results.
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
Tsang, E.: Foundations of Constraint Satisfaction. Academic Press, London (1993)
Johnson, D., Trick, M.: Cliques, Coloring, and Satisfiability. American Mathematical Society, dimacs (1996)
Hertz, A., de Werra, D.: Using tabu search techniques for graph coloring. Computing 39, 345–351 (1987)
Chams, M., Hertz, A., Werra, D.D.: Some experiments with simulated annealing for coloring graphs. European Journal of Operational Research 32, 260–266 (1987)
Vesel, A., Zerovnik, J.: How good can ants color graphs? Journal of computing and Information Technology - cit 8, 131–136 (2000)
Eiben, A., van der Hauw, J., van Hemert, J.: Graph coloring with adaptive evolutionary algorithms. Journal of Heuristics 4, 25–46 (1998)
van Hemert, J.: Comparing classical methods for solving binary constraint satisfaction problems with state of the art evolutionary computation. In: Cagnoni, S., Gottlieb, J., Hart, E., Middendorf, M., Raidl, G.R. (eds.) EvoIASP 2002, EvoWorkshops 2002, EvoSTIM 2002, EvoCOP 2002, and EvoPlan 2002. LNCS, vol. 2279, pp. 81–90. Springer, Heidelberg (2002)
van Hemert, J., Bäck, T.: Measuring the searched space to guide efficiency: The principle and evidence on constraint satisfaction. In: Guervós, J.J.M., Adamidis, P.A., Beyer, H.-G., Fernández-Villacañas, J.-L., Schwefel, H.-P. (eds.) PPSN 2002. LNCS, vol. 2439, pp. 23–32. Springer, Heidelberg (2002)
Marino, A., Damper, R.: Breaking the symmetry of the graph colouring problem with genetic algorithms. In: Whitley, D. (ed.) Late Breaking Papers at the 2000 Genetic and Evolutionary Computation Conference, pp. 240–245 (2000)
Culberson, J.: Iterated greedy graph coloring and the difficulty landscape. Technical Report TR 92-07, University of Alberta, Dept. of Computing Science (1992)
Culberson, J., Gent, I.: Frozen development in graph coloring. Theoretical Computer Science 265, 227–264 (2001)
Keijzer, M., Merelo, J., Romero, G., Schoenauer, M.: Evolving objects library. Internet Publication (2002)
Bäck, T., Fogel, D., Michalewicz, Z. (eds.): Handbook of Evolutionary Computation. Institute of Physics Publishing Ltd., Bristol and Oxford University Press, New York (1997)
Falkenauer, E.: Genetic Algorithms and Grouping Problems. John Wiley, Chichester (1998)
Trick, M.: Easy code for graph coloring. Internet Publication (1995) Last Modified (November 2, 1994)
Brélaz, D.: New methods to color the vertices of a graph. Communications of the acm 22, 251–256 (1979)
Mehrotra, A., Trick, M.A.: A column generation approach for graph coloring. Informs Journal on Computing 8, 344–354 (1996)
Trick, M.: Computational series: Graph coloring and its generalizations (2003), http://mat.gsia.cmu.edu/COLORING03
Juhos, I., Tóth, A., Tezuka, M., Tann, P., van Hemert, J.: A new permutation model for solving the graph k-coloring problem. In: Kalmár Workshop on Logic and Computer Science, pp. 189–199 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Juhos, I., Tóth, A., van Hemert, J.I. (2004). Binary Merge Model Representation of the Graph Colouring Problem. In: Gottlieb, J., Raidl, G.R. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2004. Lecture Notes in Computer Science, vol 3004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24652-7_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-24652-7_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21367-3
Online ISBN: 978-3-540-24652-7
eBook Packages: Springer Book Archive