{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:44:42Z","timestamp":1743065082408,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642164439"},{"type":"electronic","value":"9783642164446"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16444-6_64","type":"book-chapter","created":{"date-parts":[[2010,9,9]],"date-time":"2010-09-09T03:19:29Z","timestamp":1284002369000},"page":"517-523","source":"Crossref","is-referenced-by-count":1,"title":["Hybridization of GA and ANN to Solve Graph Coloring"],"prefix":"10.1007","author":[{"given":"Timir","family":"Maitra","sequence":"first","affiliation":[]},{"given":"Anindya J.","family":"Pal","sequence":"additional","affiliation":[]},{"given":"Minkyu","family":"Choi","sequence":"additional","affiliation":[]},{"given":"Taihoon","family":"Kim","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"64_CR1","volume-title":"Computers And Intractability : A Guide To The Theory Of Np-Completeness","author":"M.R. Garey","year":"1979","unstructured":"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)"},{"key":"64_CR2","volume-title":"Computer Algorithms: Introduction To Design And Analysis","author":"S. Baase","year":"1999","unstructured":"Baase, S., Gelder, A.V.: Computer Algorithms: Introduction To Design And Analysis. Addison-Wesley, Reading (1999)"},{"key":"64_CR3","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1093\/comjnl\/12.4.317","volume":"12","author":"D.C. Wood","year":"1969","unstructured":"Wood, D.C.: A technique for coloring a graph applicable to large scale time-tabling problems. Computer Journal\u00a012, 317\u2013319 (1969)","journal-title":"Computer Journal"},{"issue":"6","key":"64_CR4","doi-asserted-by":"publisher","first-page":"489","DOI":"10.6028\/jres.084.024","volume":"84","author":"F.T. Leighton","year":"1979","unstructured":"Leighton, F.T.: A graph coloring algorithm for large scheduling problems. Journal of Research of the National Bureau of Standards\u00a084(6), 489\u2013505 (1979)","journal-title":"Journal of Research of the National Bureau of Standards"},{"key":"64_CR5","doi-asserted-by":"crossref","unstructured":"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\u2013232 (1984)","DOI":"10.1145\/502949.502896"},{"issue":"1","key":"64_CR6","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1109\/T-VT.1986.24063","volume":"35","author":"A. Gamst","year":"1986","unstructured":"Gamst, A.: Some lower bounds for class of frequency assignment problems. IEEE Transactions on Vehicular Technology\u00a035(1), 8\u201314 (1986)","journal-title":"IEEE Transactions on Vehicular Technology"},{"issue":"1","key":"64_CR7","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1080\/00207219408926037","volume":"77","author":"S.S. Sarma","year":"1985","unstructured":"Sarma, S.S., Mondal, R., Seth, A.: Some sequential graph coloring algorithms for restricted channel routing. INT. J. Electronics\u00a077(1), 81\u201393 (1985)","journal-title":"INT. J. Electronics"},{"key":"64_CR8","unstructured":"Reeves, C. (ed.): Modern heuristic techniques for combinatorial problems. Orient Longman (1993)"},{"key":"64_CR9","unstructured":"Goodman, S.E., Hedetnieni, S.T.: Introduction to Design and Analysis of Algorithm, MGH (1997)"},{"key":"64_CR10","doi-asserted-by":"crossref","unstructured":"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\u20134109. IEEE Service Center (1997)","DOI":"10.1109\/ICSMC.1997.637339"},{"key":"64_CR11","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M. Dorigo","year":"1996","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics-Part B\u00a026, 29\u201341 (1996)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics-Part B"},{"key":"64_CR12","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M. Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.M.: Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transions on Evolutionary Computation\u00a01, 53\u201366 (1997)","journal-title":"IEEE Transions on Evolutionary Computation"},{"key":"64_CR13","series-title":"Studies in Computational Intelligence","volume-title":"Hybrid Metaheuristics: An Emerging Approach to Optimization","year":"2008","unstructured":"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)"},{"key":"64_CR14","unstructured":"Prakasam, P., Toulouse, M., crainic, T.G., Qu, R.: Design of a Multilevel Cooperative Heuristic for the Graph Coloring Problem. Interuniversity Research Centre (2009)"},{"key":"64_CR15","doi-asserted-by":"crossref","unstructured":"Bouhmala, N., Granmo, O.-C.: Solving Graph Coloring Problems using Learning Automata. Springer Link (2008)","DOI":"10.1007\/978-3-540-78604-7_24"},{"key":"64_CR16","unstructured":"Salari, E., Eshghi, K.: An ACO Alogrithm for the Graph coloring Problem. Int. J. Contemp. Math. Sciences (2008)"},{"key":"64_CR17","volume-title":"A Q\u2019tron Neural Network Approach to solve the Graph Coloring Problems","author":"T.-w. Yue","year":"2007","unstructured":"Yue, T.-w., Lee, Z.Z.Z.: A Q\u2019tron Neural Network Approach to solve the Graph Coloring Problems. IEEE, Los Alamitos (2007)"},{"key":"64_CR18","doi-asserted-by":"crossref","unstructured":"Juhos, I., van Hemert, J.I.: Increasing the efficiency of graph colouring algorithms with a representation based on vector operations. Journal of Software (2006)","DOI":"10.4304\/jsw.1.2.24-33"},{"key":"64_CR19","volume-title":"Energy function \u2013based approaches to graph coloring","author":"D. Blas","year":"2002","unstructured":"Blas, D., Jagota, A., Hughey, R.: Energy function \u2013based approaches to graph coloring. IEEE, Los Alamitos (2002)"},{"key":"64_CR20","doi-asserted-by":"crossref","unstructured":"Liu, W., Zhang, F., Zu, J.: A DNA algorithm for the Graph Coloring Problem. ACS Publication (2002)","DOI":"10.1021\/ci025546e"},{"key":"64_CR21","unstructured":"Chakraborty, G.: Genetic Algorithm for Graph Coloring Problem. Journal of Tree Dimensional Images (2000)"},{"key":"64_CR22","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/0377-2217(96)00043-4","volume":"93","author":"A. Jagota","year":"1996","unstructured":"Jagota, A.: An adaptive, multiple restarts neural network algorithm for graph coloring. European Journal of Operational Research\u00a093, 257\u2013270 (1996)","journal-title":"European Journal of Operational Research"},{"key":"64_CR23","volume-title":"Numerical optimization of Computer models","author":"H.P. Schwefel","year":"1981","unstructured":"Schwefel, H.P.: Numerical optimization of Computer models. John Wiley & Sons Ltd., Chichester (1981)"},{"key":"64_CR24","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science\u00a0220, 671\u2013680 (1983)","journal-title":"Science"},{"key":"64_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F. Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Dordrecht (1997)"},{"key":"64_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1007\/BFb0056916","volume-title":"Parallel Problem Solving from Nature - PPSN V","author":"R. Dorne","year":"1998","unstructured":"Dorne, R., Hao, J.: A new genetic local search algorithm for graph coloring. In: Eiben, A.E., B\u00e4ck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol.\u00a01498, pp. 745\u2013754. Springer, Heidelberg (1998)"},{"key":"64_CR27","doi-asserted-by":"crossref","unstructured":"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.\u00a03, p. 2325\u20132332 (1999)","DOI":"10.1109\/CEC.1999.785564"},{"key":"64_CR28","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1023\/A:1009823419804","volume":"3","author":"P. Galinier","year":"1999","unstructured":"Galinier, P., Hao, J.K.: Hybrid Evolutionary Algorithms for Graph Coloring. Journal of Combinatorial Optimization\u00a03, 379\u2013397 (1999)","journal-title":"Journal of Combinatorial Optimization"}],"container-title":["Communications in Computer and Information Science","Security-Enriched Urban Computing and Smart Grid"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16444-6_64","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T17:22:06Z","timestamp":1740504126000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16444-6_64"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642164439","9783642164446"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16444-6_64","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2010]]}}}