{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T03:11:58Z","timestamp":1725851518714},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319314709"},{"type":"electronic","value":"9783319314716"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-31471-6_16","type":"book-chapter","created":{"date-parts":[[2016,3,19]],"date-time":"2016-03-19T02:35:28Z","timestamp":1458354928000},"page":"205-218","source":"Crossref","is-referenced-by-count":3,"title":["A Distributed Hybrid Algorithm for the Graph Coloring Problem"],"prefix":"10.1007","author":[{"given":"Ines","family":"Sghir","sequence":"first","affiliation":[]},{"given":"Jin-Kao","family":"Hao","sequence":"additional","affiliation":[]},{"given":"Ines","family":"Ben Jaafar","sequence":"additional","affiliation":[]},{"given":"Khaled","family":"Gh\u00e9dira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,20]]},"reference":[{"issue":"2","key":"16_CR1","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/S0377-2217(02)00832-9","volume":"151","author":"C Avanthay","year":"2003","unstructured":"Avanthay, C., Hertz, A., Zufferey, N.: A variable neighborhood search for graph coloring. Eur. J. Oper. Res. 151(2), 379\u2013388 (2003)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"16_CR2","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1016\/j.cor.2006.05.014","volume":"35","author":"I Blochliger","year":"2008","unstructured":"Blochliger, I., Zufferey, N.: A graph coloring heuristic using partial solutions and a reactive Tabu scheme. Comput. Oper. Res. 35(3), 960\u2013975 (2008)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"16_CR3","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D Br\u00e9laz","year":"1979","unstructured":"Br\u00e9laz, D.: New methods to color the vertices of a graph. Commun. ACM 22(4), 251\u2013256 (1979)","journal-title":"Commun. ACM"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Chalupa, D.: Population-based and learning-based metaheuristic algorithms for the graph coloring problem. In: Krasnogor, N., Lanzi, P.L. (eds.) GECCO, pp. 465\u2013472. ACM (2011)","DOI":"10.1145\/2001576.2001641"},{"key":"16_CR5","unstructured":"Chiarandini, M., St\u00fctzle, T.: An application of iterated local search to graph coloring. In: Johnson, D.S., Mehrotra, A., Trick, M. (eds.) Proceedings of the Computational Symposium on Graph Coloring and its Generalizations, pp. 112\u2013125, Ithaca, New York, USA (2002)"},{"key":"16_CR6","volume-title":"Metaheuristics 1998: Theory and Applications, Chap. 3","author":"R Dorne","year":"1998","unstructured":"Dorne, R., Hao, J.K.: Tabu search for graph coloring, T-coloring and set T-colorings. In: Osman, I.H., et al. (eds.) Metaheuristics 1998: Theory and Applications, Chap. 3. Kluver Academic Publishers, Boston (1998)"},{"key":"16_CR7","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.-K.: 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. 1498, pp. 745\u2013754. Springer, Heidelberg (1998)"},{"key":"16_CR8","series-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","volume-title":"Cliques, Coloring, And Satisfiability: Second DIMACS Implementation Challenge","year":"1996","unstructured":"Johnson, D.S., Trick, M. (eds.): Cliques, Coloring, And Satisfiability: Second DIMACS Implementation Challenge. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 26. American Mathematical Society, Boston (1996)"},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/BF02125407","volume":"63","author":"C Fleurent","year":"1996","unstructured":"Fleurent, C., Ferland, J.A.: Genetic and hybrid algorithms for graph coloring. Ann. Oper. Res. 63, 437\u2013461 (1996)","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"16_CR10","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. J. Comb. Optim. 3(4), 379\u2013397 (1999)","journal-title":"J. Comb. Optim."},{"issue":"2","key":"16_CR11","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/j.dam.2006.07.017","volume":"156","author":"P Galinier","year":"2008","unstructured":"Galinier, P., Hertz, A., Zufferey, N.: An adaptive memory algorithm for the K-colouring problem. Discrete Appl. Math. 156(2), 267\u2013279 (2008)","journal-title":"Discrete Appl. Math."},{"key":"16_CR12","series-title":"Intelligent Systems Reference Library","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/978-3-642-30504-7_20","volume-title":"Handbook of Optimization","author":"P Galinier","year":"2013","unstructured":"Galinier, P., Hamiez, J.-P., Hao, J.-K., Porumbel, D.: Recent advances in graph vertex coloring. In: Zelinka, I., Snasel, V., Abraham, A. (eds.) Handbook of Optimization. ISRL, vol. 38, pp. 505\u2013528. Springer, Heidelberg (2013)"},{"issue":"1","key":"16_CR13","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/s10852-012-9175-7","volume":"12","author":"Y Guo","year":"2013","unstructured":"Guo, Y., Goncalves, Y., Hsu, T.: A multi-agent based self-adaptive genetic algorithm for the long-term car pooling problem. J. Math. Model. Algorithms Oper. Res. 12(1), 45\u201366 (2013)","journal-title":"J. Math. Model. Algorithms Oper. Res."},{"issue":"16\u201317","key":"16_CR14","doi-asserted-by":"publisher","first-page":"2397","DOI":"10.1016\/j.dam.2012.06.007","volume":"160","author":"JK Hao","year":"2012","unstructured":"Hao, J.K., Wu, Q.: Improving the extraction and expansion method for large graph coloring. Discrete Appl. Math. 160(16\u201317), 2397\u20132407 (2012)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"16_CR15","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF02239976","volume":"39","author":"A Hertz","year":"1987","unstructured":"Hertz, A., de Werra, D.: Using Tabu search techniques for graph coloring. Computing 39(4), 345\u2013351 (1987)","journal-title":"Computing"},{"issue":"13","key":"16_CR16","doi-asserted-by":"publisher","first-page":"2551","DOI":"10.1016\/j.dam.2008.03.022","volume":"156","author":"A Hertz","year":"2008","unstructured":"Hertz, A., Plumettaz, M., Zufferey, N.: Variable space search for graph coloring. Discrete Appl. Math. 156(13), 2551\u20132560 (2008)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"16_CR17","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1287\/opre.39.3.378","volume":"39","author":"D Johnson","year":"1991","unstructured":"Johnson, D., Aragon, C., McGeoch, L., Schevon, C.: Optimization by simulated annealing: an experimental evaluation; Part II, graph coloring and number partitioning. Oper. Res. 39(3), 378\u2013406 (1991)","journal-title":"Oper. Res."},{"issue":"1","key":"16_CR18","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/j.ejor.2009.07.016","volume":"203","author":"Z L\u00fc","year":"2010","unstructured":"L\u00fc, Z., Hao, J.K.: A memetic algorithm for graph coloring. Eur. J. Oper. Res. 203(1), 241\u2013250 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"16_CR19","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1287\/ijoc.1070.0245","volume":"20","author":"E Malaguti","year":"2008","unstructured":"Malaguti, E., Monaci, M., Toth, P.: A metaheuristic approach for the vertex coloring problem. INFORMS J. Comput. 20(2), 302\u2013316 (2008)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"16_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1111\/j.1475-3995.2009.00696.x","volume":"17","author":"E Malaguti","year":"2010","unstructured":"Malaguti, E., Toth, P.: A survey on vertex coloring problems. Int. Trans. Oper. Res. 17(1), 1\u201334 (2010)","journal-title":"Int. Trans. Oper. Res."},{"key":"16_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/978-3-319-16468-7_15","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"L Moalic","year":"2015","unstructured":"Moalic, L., Gondran, A.: The new memetic algorithm HEAD for graph coloring: an easy way for managing diversity. In: Ochoa, G., Chicano, F. (eds.) EvoCOP 2015. LNCS, vol. 9026, pp. 173\u2013183. Springer, Heidelberg (2015)"},{"issue":"4","key":"16_CR22","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1016\/j.cor.2009.06.024","volume":"37","author":"D Porumbel","year":"2010","unstructured":"Porumbel, D., Hao, J.K., Kuntz, P.: A search space \u201ccartography\u201d for guiding graph coloring heuristics. Comput. Oper. Res. 37(4), 769\u2013778 (2010)","journal-title":"Comput. Oper. Res."},{"issue":"10","key":"16_CR23","doi-asserted-by":"publisher","first-page":"1822","DOI":"10.1016\/j.cor.2010.01.015","volume":"37","author":"D Porumbel","year":"2010","unstructured":"Porumbel, D., Hao, J.K., Kuntz, P.: An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring. Comput. Oper. Res. 37(10), 1822\u20131832 (2010)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"16_CR24","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1023\/A:1014496509129","volume":"34","author":"S Prestwich","year":"2002","unstructured":"Prestwich, S.: Coloration neighbourhood search with forward checking. Ann. Math. Artif. Intell. 34(4), 327\u2013340 (2002)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"23","key":"16_CR25","doi-asserted-by":"publisher","first-page":"9252","DOI":"10.1016\/j.eswa.2015.07.070","volume":"42","author":"I Sghir","year":"2015","unstructured":"Sghir, I., Hao, J.K., Ben Jaafar, I., Gh\u00e9dira, K.: A multi-agent based optimization method applied to the quadratic assignment problem. Expert Syst. Appl. 42(23), 9252\u20139263 (2015)","journal-title":"Expert Syst. Appl."},{"key":"16_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/978-3-642-22000-5_57","volume-title":"Agent and Multi-Agent Systems: Technologies and Applications","author":"O Titiloye","year":"2011","unstructured":"Titiloye, O., Crispin, A.: Graph coloring with a distributed hybrid quantum annealing algorithm. In: O\u2019Shea, J., Nguyen, N.T., Crockett, K., Howlett, R.J., Jain, L.C. (eds.) KES-AMSTA 2011. LNCS, vol. 6682, pp. 553\u2013562. Springer, Heidelberg (2011)"},{"key":"16_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/978-3-540-72397-4_25","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"MA Trick","year":"2007","unstructured":"Trick, M.A., Yildiz, H.: A large neighborhood search heuristic for graph coloring. In: Van Hentenryck, P., Wolsey, L.A. (eds.) CPAIOR 2007. LNCS, vol. 4510, pp. 346\u2013360. Springer, Heidelberg (2007)"},{"key":"16_CR28","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/j.cor.2011.04.002","volume":"39","author":"Q Wu","year":"2012","unstructured":"Wu, Q., Hao, J.K.: Coloring large graphs based on independent set extraction. Comput. Oper. Res. 39, 283\u2013290 (2012)","journal-title":"Comput. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Artificial Evolution"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-31471-6_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T19:15:52Z","timestamp":1559416552000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-31471-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319314709","9783319314716"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-31471-6_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}