{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:57:32Z","timestamp":1725487052442},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540434320"},{"type":"electronic","value":"9783540460046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46004-7_17","type":"book-chapter","created":{"date-parts":[[2007,7,3]],"date-time":"2007-07-03T01:43:59Z","timestamp":1183427039000},"page":"163-172","source":"Crossref","is-referenced-by-count":9,"title":["Boosting ACO with a Preprocessing Step"],"prefix":"10.1007","author":[{"given":"Christine","family":"Solnon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,14]]},"reference":[{"key":"17_CR1","unstructured":"M. Dorigo and G. Di Caro. the Ant Colony Optimization Meta-Heuristic. In New Ideas in Optimization, McGraw Hill, pages 245\u2013260, 1999."},{"key":"17_CR2","unstructured":"P. Merz and B. Freisleben. Fitness landscapes and memetic algorithm design. In New Ideas in Optimization, McGraw Hill, pages 245\u2013260, 1999."},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T. Stutzle","year":"2000","unstructured":"T. Stutzle and H.H. Hoos. MAX-MIN Ant System. In Journal of Future Generation Computer Systems, 16:889\u2013914, 2000.","journal-title":"Journal of Future Generation Computer Systems"},{"key":"17_CR4","unstructured":"A. Colorni, M. Dorigo and V. Maniezzo. An investigation of some properties of an \u201cAnt algorithm\u201d. In PPSN\u201992, pages 509\u2013520, Elsevier, 1992."},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1142\/S0219525998000119","volume":"1","author":"H. M. Botee","year":"1998","unstructured":"H. M. Botee and E. Bonabeau. Evolving Ant Colony Optimization. In Advanced complex systems, 1:149\u2013159, 1998.","journal-title":"Advanced complex systems"},{"key":"17_CR6","unstructured":"E.P.K. Tsang. Foundations of Constraint Satisfaction. Academic Press, 1993."},{"key":"17_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/3-540-49481-2_24","volume-title":"CP\u201998","author":"E. MacIntyre","year":"1998","unstructured":"E. MacIntyre, P. Prosser, B. Smith and T. Walsh. Random Constraints Satisfaction: theory meets practice. In CP\u201998, volume 1520 of LNCS, Springer-Verlag, pages 325\u2013339, 1998."},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"C. Solnon. Ants can solve Constraint Satisfaction Problems. Research report, 2001.","DOI":"10.1109\/TEVC.2002.802449"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0004-3702(92)90007-K","volume":"58","author":"S. Minton","year":"1992","unstructured":"S. Minton, M.D. Johnston, A.B. Philips and P. Laird. Minimizing Conflicts: a Heuristic Repair Method for Constraint Satistaction and Scheduling Problems. In Artificial Intelligence, 58:161\u2013205, 1992.","journal-title":"Artificial Intelligence"},{"issue":"1","key":"17_CR10","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M. Dorigo","year":"1996","unstructured":"M. Dorigo, V. Maniezzo and A. Colorni. The Ant System: Optimization by a Colony of Cooperating Agents. In IEEE Transactions on Systems, Man, and Cybernetics-Part B, 26(1):29\u201341, 1996.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics-Part B"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"A. Stuber and C. Solnon. Boosting ACO algorithms with data mining technics (in french). In JNPC\u201901, pages 271\u2013282, 2001.","DOI":"10.1201\/9781420042559.axc"}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46004-7_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T01:55:24Z","timestamp":1556589324000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46004-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540434320","9783540460046"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-46004-7_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}