Abstract
In this paper we propose a memetic algorithm (MA) for the partition graph coloring problem. Given a clustered graph G = (V,E), the goal is to find a subset V * ⊂ V that contains exactly one node for each cluster and a coloring for V * so that in the graph induced by V *, two adjacent nodes have different colors and the total number of used colors is minimal. In our MA we use two distinct solution representations, one for the genetic operators and one for the local search procedure, which are tailored for the corresponding situations, respectively. The algorithm is evaluated on a common benchmark instances set and the computational results show that compared to a state-of-the-art branch and cut algorithm, our MA achieves solid results in very short run-times.
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
Bontoux, B., Artigues, C., Feillet, D.: A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem. Computers and Operations Research 37(11), 1844–1852 (2010)
Brélaz, D.: New methods to color the vertices of a graph. Communication of ACM 22(4), 251–256 (1979)
Demange, M., Monnot, J., Pop, P., Ries, B.: Selective graph coloring in some special classes of graphs. In: Mahjoub, A.R., Markakis, V., Milis, I., Paschos, V.T. (eds.) ISCO 2012. LNCS, vol. 7422, pp. 320–331. Springer, Heidelberg (2012)
Demange, M., Monnot, J., Pop, P., Ries, B.: On the complexity of the selective graph coloring problem in some special classes of graphs. Theoretical Computer Science (in press, 2013)
Frota, Y., Maculan, N., Noronha T.F., Ribeiro, C.C.: Instances for the partition coloring problem, www.ic.uff.br/~celso/grupo/pcp.htm
Frota, Y., Maculan, N., Noronha, T.F., Ribeiro, C.C.: A branch-and-cut algorithm for the partition coloring problem. Networks 55(3), 194–204 (2010)
Glover, F., Parker, M., Ryan, J.: Coloring by tabu branch and bound. DIMACS Series on Discrete Mathematics and Theoretical Computer Science 26, 285–308 (1996)
Gualandi, S., Malucelli, F.: Exact solution of graph coloring problems via constraint programming and column generation. INFORMS Journal on Computing 24(1), 81–100 (2012)
Hoshino, E.A., Frota, Y.A., de Souza, C.C.: A branch-and-price approach for the partition coloring problem. Operations Research Letters 39(2), 132–137 (2011)
Li, G., Simha, R.: The partition coloring problem and its application to wavelength routing and assignment. In: 1st Workshop on Optical Networks (2000)
Lü, Hao, J.: A memetic algorithm for graph coloring. European Journal of Operational Research 203, 241–250 (2010)
Mehrotra, A., Trick, M.A.: A column generation approach for graph coloring. INFORMS Journal on Computing 8, 344–354 (1996)
Moscato, P.: Memetic algorithms: A short introduction. In: Corne, D., et al. (eds.) New Ideas in Optimization, pp. 219–234. McGraw Hill (1999)
Ngueveu, S.U., Prins, C., Calvo, R.W.: An effective memetic algorithm for the cumulative capacitated vehicle routing problem. Computers and Operations Research 37(11), 1877–1885 (2010)
Noronha, T.F., Ribeiro, C.C.: Routing and wavelength assignment by partition colouring. European Journal of Operational Research 171(3), 797–810 (2006)
Pop, P.C.: Generalized network design problems. Modeling and Optimization. De Gruyter Series in Discrete Mathematics and Applications, Germany (2012)
Pop, P.C., Hu, B., Raidl, G.R.: A memetic algorithm for the partition graph coloring problem. In: Extended Abstracts of the 14th International Conference on Computer Aided Systems Theory, Gran Canaria, Spain, pp. 167–169 (2013)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pop, P.C., Hu, B., Raidl, G.R. (2013). A Memetic Algorithm with Two Distinct Solution Representations for the Partition Graph Coloring Problem. In: Moreno-Díaz, R., Pichler, F., Quesada-Arencibia, A. (eds) Computer Aided Systems Theory - EUROCAST 2013. EUROCAST 2013. Lecture Notes in Computer Science, vol 8111. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-53856-8_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-53856-8_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-53855-1
Online ISBN: 978-3-642-53856-8
eBook Packages: Computer ScienceComputer Science (R0)