{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:55:44Z","timestamp":1764996944754},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642293528"},{"type":"electronic","value":"9783642293535"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29353-5_8","type":"book-chapter","created":{"date-parts":[[2012,4,14]],"date-time":"2012-04-14T08:14:18Z","timestamp":1334391258000},"page":"66-74","source":"Crossref","is-referenced-by-count":10,"title":["A Hybrid Artificial Bee Colony Algorithm for Graph 3-Coloring"],"prefix":"10.1007","author":[{"suffix":"Jr.","given":"Iztok","family":"Fister","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Iztok","family":"Fister","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Janez","family":"Brest","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","volume-title":"Local Search in Combinatorial Optimization","author":"E. Aarts","year":"1997","unstructured":"Aarts, E., Lenstra, J.K.: Local Search in Combinatorial Optimization. Princeton University Press, Princeton (1997)"},{"key":"8_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"J.A. Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, Berlin (2008)"},{"issue":"4","key":"8_CR3","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D. Brelaz","year":"1979","unstructured":"Brelaz, D.: New methods to color vertices of a graph. Communications of the ACM\u00a022(4), 251\u2013256 (1979)","journal-title":"Communications of the ACM"},{"key":"8_CR4","unstructured":"Cheeseman, P., Kanefsky, B., Taylor, W.M.: Where the really hard problems are. In: Proceedings of the International Joint Conference on Artificial Intelligence, vol.\u00a01, pp. 331\u2013337. Morgan Kaufmann (1991)"},{"key":"8_CR5","unstructured":"Culberson, J.: Graph Coloring Page, \n                    \n                      http:\/\/www.ncbi.nlm.nih.gov"},{"key":"8_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/b99492","volume-title":"Ant Colony Optimization","author":"M. Dorigo","year":"2004","unstructured":"Dorigo, M., St\u00fctzle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)"},{"key":"8_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-05094-1","volume-title":"Introduction to Evolutionary Computing","author":"A.E. Eiben","year":"2003","unstructured":"Eiben, A.E., Smith, J.E.: Introduction to Evolutionary Computing. Springer, Berlin (2003)"},{"issue":"1","key":"8_CR8","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1023\/A:1009638304510","volume":"4","author":"A.E. Eiben","year":"1998","unstructured":"Eiben, A.E., Hauw, K., Hemert, J.I.: Graph coloring with adaptive evolutionary algorithms. Journal of Heuristics\u00a04(1), 25\u201346 (1998)","journal-title":"Journal of Heuristics"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Fister, I., Brest, J.: Using differential evolution for the graph coloring. In: Proceedings of IEEE SSCI 2011 symposium series on computational intelligence, Piscataway, pp. 150\u2013156 (2011)","DOI":"10.1109\/SDE.2011.5952075"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/BF02125407","volume":"63","author":"C. Fleurent","year":"1996","unstructured":"Fleurent, C., Ferland, J.: Genetic and Hybrid Algorithms for Graph Coloring. Annals of Operations Research\u00a063, 437\u2013464 (1996)","journal-title":"Annals of Operations Research"},{"issue":"4","key":"8_CR11","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1023\/A:1009823419804","volume":"3","author":"P. Galinier","year":"1999","unstructured":"Galinier, P., Hao, J.: Hybrid evolutionary algorithms for graph coloring. Journal of Combinatorial Optimization\u00a03(4), 379\u2013397 (1999)","journal-title":"Journal of Combinatorial Optimization"},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"2547","DOI":"10.1016\/j.cor.2005.07.028","volume":"33","author":"P. Galinier","year":"2006","unstructured":"Galinier, P., Hertz, A.: A survey of local search methods for graph coloring. Computers & Operations Research\u00a033, 2547\u20132562 (2006)","journal-title":"Computers & Operations Research"},{"key":"8_CR13","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 & Co., New York (1979)"},{"issue":"5","key":"8_CR14","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F. Glover","year":"1986","unstructured":"Glover, F.: Future paths for integer programming and links to artificial intelligence. Computers & Operations Research\u00a013(5), 533\u2013549 (1986)","journal-title":"Computers & Operations Research"},{"issue":"4","key":"8_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\u00a039(4), 345\u2013351 (1987)","journal-title":"Computing"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Iacca, G., Neri, F., Mininno, E., Ong, Y.-S., Lim, M.-H.: Ockham\u2019s Razor in Memetic Computing: Three Stage Optimal Memetic Exploration (2011) (in press)","DOI":"10.1016\/j.ins.2011.11.025"},{"issue":"1-4","key":"8_CR17","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s10462-009-9127-4","volume":"31","author":"D. Karaboga","year":"2009","unstructured":"Karaboga, D., Basturk, A.: A survey: algorithms simulating bee swarm intelligence. Artifficial Intelligence Review\u00a031(1-4), 61\u201385 (2009)","journal-title":"Artifficial Intelligence Review"},{"key":"8_CR18","doi-asserted-by":"publisher","first-page":"1942","DOI":"10.1109\/ICNN.1995.488968","volume-title":"Proceedings of the 1995 IEEE International Conference on Neural Networks","author":"J. Kennedy","year":"1995","unstructured":"Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proceedings of the 1995 IEEE International Conference on Neural Networks, vol.\u00a04, pp. 1942\u20131948. IEEE Service Center, Piscataway (1995)"},{"issue":"1","key":"8_CR19","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. European Journal of Operational Research\u00a0203(1), 241\u2013250 (2010)","journal-title":"European Journal of Operational Research"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Malaguti, E., Toth, P.: A survey on vertex coloring problems. International Transactions in Operational Research, 1\u201334 (2009)","DOI":"10.1111\/j.1475-3995.2009.00696.x"},{"issue":"12","key":"8_CR21","doi-asserted-by":"publisher","first-page":"2455","DOI":"10.1016\/j.ins.2009.12.025","volume":"181","author":"Q.K. Pan","year":"2011","unstructured":"Pan, Q.K., Tasgetiren, M.F., Suganthan, P.N., Chua, T.J.: A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem. Information Sciences\u00a0181(12), 2455\u20132468 (2011)","journal-title":"Information Sciences"},{"issue":"1-2","key":"8_CR22","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0012-365X(89)90214-8","volume":"74","author":"A.D. Petford","year":"1989","unstructured":"Petford, A.D., Welsh, D.J.A.: A randomized 3-coloring algorithms. Discrete Mathematic\u00a074(1-2), 253\u2013261 (1989)","journal-title":"Discrete Mathematic"},{"key":"8_CR23","doi-asserted-by":"crossref","DOI":"10.1002\/9780470549124","volume-title":"Engineering Optimization: Theory and Practice","author":"S.S. Rao","year":"2009","unstructured":"Rao, S.S.: Engineering Optimization: Theory and Practice. John Willey & Sons, New Jersey (2009)"},{"issue":"2","key":"8_CR24","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1109\/TAP.2004.823969","volume":"52","author":"J. Robinson","year":"2004","unstructured":"Robinson, J., Rahmat-Samii, Y.: Particle Swarm Optimization in Electro-Magnetics. IEEE on Antennas and Propagation\u00a052(2), 397\u2013407 (2004)","journal-title":"IEEE on Antennas and Propagation"},{"issue":"16","key":"8_CR25","doi-asserted-by":"publisher","first-page":"3459","DOI":"10.1016\/j.ins.2011.04.018","volume":"181","author":"M.F. Tasgetiren","year":"2011","unstructured":"Tasgetiren, M.F., Pan, Q.K., Suganthan, P.N., Chen, A.H.-L.: A discrete artificial bee colony algorithm for the total flowtime minimization and permutation flow shops. Information Sciences\u00a0181(16), 3459\u20133475 (2011)","journal-title":"Information Sciences"},{"issue":"1","key":"8_CR26","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0196-6774(88)90005-3","volume":"9","author":"J.S. Turner","year":"1988","unstructured":"Turner, J.S.: Almost all k-colorable graphs are easy to color. Journal of Algorithms\u00a09(1), 63\u201382 (1988)","journal-title":"Journal of Algorithms"},{"key":"8_CR27","volume-title":"Nature-Inspired Metaheuristic Algorithms","author":"X.-S. Yang","year":"2008","unstructured":"Yang, X.-S.: Nature-Inspired Metaheuristic Algorithms. Luniver Press, Cambridge (2008)"}],"container-title":["Lecture Notes in Computer Science","Swarm and Evolutionary Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29353-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,29]],"date-time":"2020-01-29T20:57:14Z","timestamp":1580331434000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29353-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642293528","9783642293535"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29353-5_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}