Abstract
A recent and very promising approach for combinatorial optimization is to embed local search into the framework of evolutionary algorithms. In this paper, we present one efficient hybrid algorithms for the graph coloring problem. Here we have considered the hybridization of Boltzmann Machine (BM) of Artificial Neural Network with Genetic Algorithms. Genetic algorithm we have used to generate different coloration of a graph quickly on which we have applied boltzmann machine approach. Unlike traditional approaches of GA and ANN the proposed hybrid algorithm is guranteed to have 100% convergence rate to valid solution with no parameter tuning. Experiments of such a hybrid algorithm are carried out on large DIMACS Challenge benchmark graphs. Results prove very competitive. Analysis of the behavior of the algorithm sheds light on ways to further improvement.
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
Garey, M.R., Johnson, D.S.: Computers And Intractability: A Guide To The Theory Of Np-Completeness. W. H. Freeman and Co., New York (1979)
Baase, S., Gelder, A.V.: Computer Algorithms: Introduction To Design And Analysis. Addison-Wesley, Reading (1999)
Wood, D.C.: A technique for coloring a graph applicable to large scale time-tabling problems. Computer Journal 12, 317–319 (1969)
Leighton, F.T.: A graph coloring algorithm for large scheduling problems. Journal of Research of the National Bureau of Standards 84(6), 489–505 (1979)
Chow, F.C., Hennessy, J.L.: Register allocation by priority based coloring. In: Proceedings of the ACM SIGPLAN 1984 Symposium on Compiler Construction, New york, pp. 222–232 (1984)
Gamst, A.: Some lower bounds for class of frequency assignment problems. IEEE Transactions on Vehicular Technology 35(1), 8–14 (1986)
Sarma, S.S., Mondal, R., Seth, A.: Some sequential graph coloring algorithms for restricted channel routing. INT. J. Electronics 77(1), 81–93 (1985)
Reeves, C. (ed.): Modern heuristic techniques for combinatorial problems. Orient Longman (1993)
Goodman, S.E., Hedetnieni, S.T.: Introduction to Design and Analysis of Algorithm, MGH (1997)
Kennedy, J., Eberhart, R.C.: A discrete binary version of the particle swarm algorithm. In: Proceedings of the 1997 Conference on Systems, Man, and Cybernetics, pp. 4104–4109. IEEE Service Center (1997)
Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics-Part B 26, 29–41 (1996)
Dorigo, M., Gambardella, L.M.: Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transions on Evolutionary Computation 1, 53–66 (1997)
Blum, C., Aquilera, M.J.B., Roli, A., Sampels, M. (eds.): Hybrid Metaheuristics: An Emerging Approach to Optimization. Studies in Computational Intelligence. Springer, Heidelberg (2008)
Prakasam, P., Toulouse, M., crainic, T.G., Qu, R.: Design of a Multilevel Cooperative Heuristic for the Graph Coloring Problem. Interuniversity Research Centre (2009)
Bouhmala, N., Granmo, O.-C.: Solving Graph Coloring Problems using Learning Automata. Springer Link (2008)
Salari, E., Eshghi, K.: An ACO Alogrithm for the Graph coloring Problem. Int. J. Contemp. Math. Sciences (2008)
Yue, T.-w., Lee, Z.Z.Z.: A Q’tron Neural Network Approach to solve the Graph Coloring Problems. IEEE, Los Alamitos (2007)
Juhos, I., van Hemert, J.I.: Increasing the efficiency of graph colouring algorithms with a representation based on vector operations. Journal of Software (2006)
Blas, D., Jagota, A., Hughey, R.: Energy function –based approaches to graph coloring. IEEE, Los Alamitos (2002)
Liu, W., Zhang, F., Zu, J.: A DNA algorithm for the Graph Coloring Problem. ACS Publication (2002)
Chakraborty, G.: Genetic Algorithm for Graph Coloring Problem. Journal of Tree Dimensional Images (2000)
Jagota, A.: An adaptive, multiple restarts neural network algorithm for graph coloring. European Journal of Operational Research 93, 257–270 (1996)
Schwefel, H.P.: Numerical optimization of Computer models. John Wiley & Sons Ltd., Chichester (1981)
Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 671–680 (1983)
Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Dordrecht (1997)
Dorne, R., Hao, J.: A new genetic local search algorithm for graph coloring. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, pp. 745–754. Springer, Heidelberg (1998)
Tagawa, K., Kanesige, K., Inoue, K., Haneda, H.: Distance Based Hybrid Genetic Algorithm: An Application for The Graph Coloring Problem. In: Proceedings of 1999 Comgress of Evolutionary Computation, vol. 3, p. 2325–2332 (1999)
Galinier, P., Hao, J.K.: Hybrid Evolutionary Algorithms for Graph Coloring. Journal of Combinatorial Optimization 3, 379–397 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Maitra, T., Pal, A.J., Choi, M., Kim, T. (2010). Hybridization of GA and ANN to Solve Graph Coloring. In: Kim, Th., Stoica, A., Chang, RS. (eds) Security-Enriched Urban Computing and Smart Grid. SUComS 2010. Communications in Computer and Information Science, vol 78. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16444-6_64
Download citation
DOI: https://doi.org/10.1007/978-3-642-16444-6_64
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16443-9
Online ISBN: 978-3-642-16444-6
eBook Packages: Computer ScienceComputer Science (R0)