{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T20:17:16Z","timestamp":1760645836514},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2011,4,20]],"date-time":"2011-04-20T00:00:00Z","timestamp":1303257600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1007\/s11590-011-0327-x","type":"journal-article","created":{"date-parts":[[2011,4,19]],"date-time":"2011-04-19T01:28:22Z","timestamp":1303176502000},"page":"963-973","source":"Crossref","is-referenced-by-count":23,"title":["Optimization by ant algorithms: possible roles for an individual ant"],"prefix":"10.1007","volume":"6","author":[{"given":"Nicolas","family":"Zufferey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,4,20]]},"reference":[{"issue":"4","key":"327_CR1","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1109\/CI-M.2006.248054","volume":"1","author":"M. Dorigo","year":"2006","unstructured":"Dorigo M., Birattari M., Stuetzle T.: Ant colony optimization\u2013artificial ants as a computational intelligence technique. IEEE Comput. Intell. Mag. 1(4), 28\u201339 (2006)","journal-title":"IEEE Comput. Intell. Mag."},{"key":"327_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-5362-2","volume-title":"Handbook of Applied Optimization","author":"P. Pardalos","year":"2002","unstructured":"Pardalos P., Resende M.: Handbook of Applied Optimization. Oxford University Press, Oxford (2002)"},{"issue":"1","key":"327_CR3","doi-asserted-by":"crossref","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":"327_CR4","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1057\/palgrave.jors.2600357","volume":"48","author":"D. Costa","year":"1997","unstructured":"Costa D., Hertz A.: Ants can colour graphs. J. Oper. Res. Soc. 48, 295\u2013305 (1997)","journal-title":"J. Oper. Res. Soc."},{"key":"327_CR5","unstructured":"Hertz, A., Zufferey, N.: A new ant colony algorithm for graph coloring. In: Pelta, Krasnogor (eds.) Proceedings of the Workshop on Nature Inspired Cooperative Strategies for Optimization, NICSO 2006, June29\u201330, pp. 51\u201360. Granada, Spain (2006)"},{"key":"327_CR6","doi-asserted-by":"crossref","first-page":"819","DOI":"10.1057\/jors.2009.27","volume":"61","author":"M. Plumettaz","year":"2010","unstructured":"Plumettaz M., Schindl D., Zufferey N.: Ant local search and its efficient adaptation to graph colouring. J. Oper. Res. Society 61, 819\u2013826 (2010). doi: 10.1057\/jors.2009.27","journal-title":"J. Oper. Res. Society"},{"key":"327_CR7","first-page":"251","volume":"22","author":"D. Br\u00e9laz","year":"1979","unstructured":"Br\u00e9laz D.: New Methods to ColorVertices of a Graph. Commun. Assoc. Comput. Mach. 22, 251\u2013256 (1979)","journal-title":"Commun. Assoc. Comput. Mach."},{"issue":"2","key":"327_CR8","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/s10898-009-9477-0","volume":"47","author":"M. Schluter","year":"2010","unstructured":"Schluter M., Gerdts M.: The oracle penalty method. J. Glob. Optim. 47(2), 293\u2013325 (2010)","journal-title":"J. Glob. Optim."},{"key":"327_CR9","doi-asserted-by":"crossref","first-page":"960","DOI":"10.1016\/j.cor.2006.05.014","volume":"35","author":"I. Bloechliger","year":"2008","unstructured":"Bloechliger I., Zufferey N.: A graph coloring heuristic using partial solutions and a reactive Tabu scheme. Comput. Oper. Res. 35, 960\u2013975 (2008)","journal-title":"Comput. Oper. Res."},{"key":"327_CR10","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/j.ejor.2009.07.016","volume":"203","author":"Z. Lu","year":"2010","unstructured":"Lu Z., Hao J.K.: A memetic algorithm for graph coloring. Eur. J. Oper. Res. 203, 241\u2013250 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"327_CR11","doi-asserted-by":"crossref","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."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-011-0327-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-011-0327-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-011-0327-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T13:11:28Z","timestamp":1559394688000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-011-0327-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4,20]]},"references-count":11,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["327"],"URL":"https:\/\/doi.org\/10.1007\/s11590-011-0327-x","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,4,20]]}}}