{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T04:27:02Z","timestamp":1778300822157,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540441397","type":"print"},{"value":"9783540457121","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45712-7_63","type":"book-chapter","created":{"date-parts":[[2008,5,6]],"date-time":"2008-05-06T16:28:06Z","timestamp":1210091286000},"page":"651-661","source":"Crossref","is-referenced-by-count":13,"title":["Model-Based Search for Combinatorial Optimization: A Comparative Study"],"prefix":"10.1007","author":[{"given":"Mark","family":"Zlochin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Dorigo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,10,4]]},"reference":[{"key":"63_CR1","doi-asserted-by":"crossref","unstructured":"S. Baluja and R. Caruana. Removing the genetics from the standard genetic algorithm. In Proceedings of ICML\u201995, pages 38\u201346. Morgan Kaufmann Publishers, Palo Alto, CA, 1995.","DOI":"10.1016\/B978-1-55860-377-6.50014-1"},{"key":"63_CR2","unstructured":"C. Blum, A. Roli, and M. Dorigo. HC-ACO: The hyper-cube framework for Ant Colony Optimization. In Proceedings of MIC\u20192001, volume 2, pages 399\u2013403, Porto, Portugal, 2001."},{"key":"63_CR3","unstructured":"J. S. de Bonet, C. L. Isbell, and P. Viola. MIMIC: Finding optima by estimating probability densities. In Proceedings of NIPS\u201997, pages 424\u2013431. MIT Press, Cambridge, MA, 1997."},{"key":"63_CR4","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1613\/jair.530","volume":"9","author":"G. Caro Di","year":"1998","unstructured":"G. Di Caro and M. Dorigo. AntNet: Distributed stigmergetic control for communications networks. Journal of Arti.cial Intelligence Research, 9:317\u2013365, 1998.","journal-title":"Journal of Arti.cial Intelligence Research"},{"key":"63_CR5","unstructured":"M. Dorigo. Ottimizzazione, Apprendimento Automatico ed Algoritmi Basati su Metafora Naturale. PhD thesis, Dipartimento di Elettronica, Politecnico di Milano, Milan, Italy, 1992."},{"key":"63_CR6","first-page":"11","volume-title":"New Ideas in Optimization","author":"M. Dorigo","year":"1999","unstructured":"M. Dorigo and G. Di Caro. The Ant Colony Optimization meta-heuristic. In D. Corne, M. Dorigo, and F. Glover, editors, New Ideas in Optimization, pages 11\u201332. McGraw Hill, London, UK, 1999."},{"issue":"1","key":"63_CR7","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M. Dorigo","year":"1997","unstructured":"M. Dorigo and L. M. Gambardella. Ant Colony System: A cooperative learning approach to the traveling salesman problem. IEEE Trans. on Evol. Comp., 1(1):53\u201366, 1997.","journal-title":"IEEE Trans. on Evol. Comp."},{"key":"63_CR8","doi-asserted-by":"crossref","unstructured":"M. Dorigo, M. Zlochin, N. Meuleau, and M. Birattari. Updating ACO pheromones using Stochastic Gradient Ascent and Cross-Entropy methods. In Proceedings of EvoWorkshops 2002, pages 21\u201330. Springer Verlag, Berlin, Germany, 2002.","DOI":"10.1007\/3-540-46004-7_3"},{"issue":"4","key":"63_CR9","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1109\/4235.797971","volume":"3","author":"G. R. Harik","year":"1999","unstructured":"G. R. Harik, F. G. Lobo, and D. E. Goldberg. The compact genetic algorithm. IEEE Trans. on Evol. Comp., 3(4):287\u2013297, 1999.","journal-title":"IEEE Trans. on Evol. Comp."},{"key":"63_CR10","unstructured":"H. H. Hoos and T. St\u00fctzle. Randomly generated benchmark problems for MAXSAT. Technical Note, Department of Computer Science, University of British Columbia, March 2001."},{"key":"63_CR11","doi-asserted-by":"crossref","unstructured":"P. Larra\u00f1aga and J.A. Lozano. Estimation of Distribution Algorithms. A New Tool for Evolutionary Computation. Kluwer Academic Publishers, 2001.","DOI":"10.1007\/978-1-4615-1539-5"},{"issue":"2","key":"63_CR12","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1162\/106454602320184202","volume":"8","author":"N. Meuleau","year":"2002","unstructured":"N. Meuleau and M. Dorigo. Ant colony optimization and stochastic gradient descent. Artificial Life, 8(2):103\u2013121, 2002.","journal-title":"Artificial Life"},{"key":"63_CR13","unstructured":"N. Monmarch\u00e9, E. Ramat, G. Dromel, M. Slimane, and G. Venturini. On the similarities between AS, BSC and PBIL: toward the birth of a new meta-heuristic. Technical Report 215, Laboratoire d'Informatique, Universit\u00e9 de Tours, 1999."},{"key":"63_CR14","unstructured":"M. Pelikan, D. E. Goldberg, and E. Cant\u00fa-Paz. BOA: The Bayesian optimization algorithm. In Proceedings of GECCO\u201999, volume I, pages 525\u2013532. Morgan Kaufmann Publishers, San Francisco, CA, 1999."},{"key":"63_CR15","doi-asserted-by":"crossref","unstructured":"J. Quinlan. Combining instance-based and model-based learning. In Proceedings of the Twelfth International Conference on Machine Learning (ML-93), pages 236\u2013243. Morgan Kaufmann Publishers, San Mateo, CA, 1993.","DOI":"10.1016\/B978-1-55860-307-3.50037-X"},{"key":"63_CR16","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1214\/aoms\/1177729586","volume":"22","author":"H. Robbins","year":"1951","unstructured":"H. Robbins and S. Monro. A stochastic approximation method. Annals of Mathematical Statistics, 22:400\u2013407, 1951.","journal-title":"Annals of Mathematical Statistics"},{"key":"63_CR17","unstructured":"A. Roli, C. Blum, and M. Dorigo. ACO for maximal constraint satisfaction problems. In Proceedings of MIC\u20192001, volume 1, pages 187\u2013191, Porto-Portugal, 2001."},{"issue":"2","key":"63_CR18","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1023\/A:1010091220143","volume":"1","author":"R. Y. Rubinstein","year":"1999","unstructured":"R. Y. Rubinstein. The cross-entropy method for combinatorial and continuous optimization. Methodology and Computing in Applied Probability, 1(2):127\u2013190, 1999.","journal-title":"Methodology and Computing in Applied Probability"},{"issue":"8","key":"63_CR19","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T. St\u00fctzle","year":"2000","unstructured":"T. St\u00fctzle and H. H. Hoos. MAX-MIN Ant System. Future Generation Computer Systems, 16(8):889\u2013914, 2000.","journal-title":"Future Generation Computer Systems"},{"key":"63_CR20","unstructured":"M. Zlochin, M. Birattari, N. Meuleau, and M. Dorigo. Model-based search for combinatorial optimization. Technical Report TR\/IRIDIA\/2001-15, IRIDIA, Universit\u00e9 Libre de Bruxelles, 2001."}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2014 PPSN VII"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45712-7_63","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T00:35:07Z","timestamp":1557534907000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45712-7_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441397","9783540457121"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-45712-7_63","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}