{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T12:05:02Z","timestamp":1773662702708,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Heuristics"],"published-print":{"date-parts":[[2002,5]]},"DOI":"10.1023\/a:1015057701750","type":"journal-article","created":{"date-parts":[[2002,12,28]],"date-time":"2002-12-28T22:07:59Z","timestamp":1041113279000},"page":"305-320","source":"Crossref","is-referenced-by-count":120,"title":["Multi Colony Ant Algorithms"],"prefix":"10.1007","volume":"8","author":[{"given":"Martin","family":"Middendorf","sequence":"first","affiliation":[]},{"given":"Frank","family":"Reischle","sequence":"additional","affiliation":[]},{"given":"Hartmut","family":"Schmeck","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"403305_CR1","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0167-6377(94)90065-5","volume":"16","author":"K.D. Boese","year":"1994","unstructured":"Boese, K.D., A.B. Kahng, and S. Muddu. (1994). \u201cNew Adaptive Multistart Techniques for Combinatorial Global Optimizations.\u201d Operations Research Letters 16, 101\u2013113.","journal-title":"Operations Research Letters"},{"key":"403305_CR2","unstructured":"Bolondi, M. and M. Bondaza. (1993). \u201cParallelizzazione di un algoritmo per la risoluzione del problema del comesso viaggiatore.\u201d Master's Thesis, Politecnico di Milano."},{"key":"403305_CR3","first-page":"25","volume":"7","author":"B. Bullnheimer","year":"1999","unstructured":"Bullnheimer, B., R.F. Hartl, and C. Strauss. (1999). \u201cA New Rank Based Version of the Ant System\u2014A Computational Study.\u201d CEJOR 7, 25\u201338.","journal-title":"CEJOR"},{"key":"403305_CR4","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/978-1-4613-3279-4_6","volume-title":"High Performance Algorithms and Software in Nonlinear Optimization","author":"B. Bullnheimer","year":"1998","unstructured":"Bullnheimer, B., G. Kotsis, and C. Strauss. (1998). \u201cParallelization Strategies for the Ant System.\u201d In R. De Leone et al. (eds.), High Performance Algorithms and Software in Nonlinear Optimization, Applied Optimization, Vol. 24. Dordrecht: Kluwer, pp. 87\u2013100."},{"key":"403305_CR5","unstructured":"Cal\u00e9gari, P.R. (1999). \u201cParallelization of Population-Based Evolutionary Algorithms for Combinatorial Optimization Problems.\u201d Ph.D. Thesis, D\u00e9partment D'Informatique, \u00c9cole Polytechnique F\u00e9d\u00e9rale De Lausanne."},{"key":"403305_CR6","first-page":"39","volume":"34","author":"A. Colorni","year":"1994","unstructured":"Colorni, A., M. Dorigo, V. Maniezzo, and M. Trubian. (1994). \u201cAnt System for Job Shop Scheduling.\u201d Belgian Journal Operations Research 34, 39\u201353.","journal-title":"Belgian Journal Operations Research"},{"key":"403305_CR7","unstructured":"Dorigo, M. (1992). \u201cOptimization, Learning and Natural Algorithms.\u201d Ph.D. Thesis, Dipartimento di Elettronica, Politecnico di Milano. (in Italian)."},{"key":"403305_CR8","unstructured":"Dorigo, M. (1993). \u201cParallel Ant System: An Experimental Study.\u201d Unpub. manuscript."},{"key":"403305_CR9","first-page":"11","volume-title":"New Ideas in Optimization","author":"M. Dorigo","year":"1999","unstructured":"Dorigo, M. and G. Di Caro. (1999). \u201cThe Ant Colony Optimization Meta-Heuristic.\u201d In D. Corne, M. Dorigo, and F. Glover (eds.), New Ideas in Optimization. New York: McGraw-Hill, pp. 11\u201332."},{"key":"403305_CR10","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M. Dorigo","year":"1996","unstructured":"Dorigo, M., V. Maniezzo, and A. Colorni. (1996). \u201cThe Ant System: Optimization by a Colony of Cooperating Agents.\u201d IEEE Trans. Sys., Man, Cybernetics\u2014B 26, 29\u201341.","journal-title":"IEEE Trans. Sys., Man, Cybernetics\u2014B"},{"key":"403305_CR11","first-page":"252","volume-title":"Proceedings of ML-95, Twelfth Intern. Conf. on Machine Learning","author":"L.M. Gambardella","year":"1995","unstructured":"Gambardella, L.M. and M. Dorigo. (1995). \u201cAnt-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem.\u201d In Proceedings of ML-95, Twelfth Intern. Conf. on Machine Learning. San Mateo, CA: Morgan Kaufmann, pp. 252\u2013260."},{"key":"403305_CR12","unstructured":"Gambardella, L.M., E.D. Taillard, and G. Agazzi. (1999b). \u201cMACS-VRPT: A Multiple Ant Colony System with for Vehicle Routing Problems with Time Windows.\u201d In D. Corne, M. Dorigo, and F. Glover (eds.), New Ideas in Optimization. McGraw-Hill, 63\u201376."},{"key":"403305_CR13","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1057\/palgrave.jors.2600676","volume":"50","author":"L.M. Gambardella","year":"1999","unstructured":"Gambardella, L.M., E.D. Taillard, and M. Dorigo. (1999a). \u201cAnt Colonies for the Quadratic Assignment Problem.\u201d Journal of the Operational Research Society 50, 167\u2013176.","journal-title":"Journal of the Operational Research Society"},{"key":"403305_CR14","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1023\/A:1018912715283","volume":"90","author":"U. Kohlmorgen","year":"1999","unstructured":"Kohlmorgen, U., H. Schmeck, and K. Haase. (1999). \u201cExperiences with Fine-Grained Parallel Genetic Algorithms.\u201d Ann. Oper. Res. 90, 203\u2013219.","journal-title":"Ann. Oper. Res."},{"key":"403305_CR15","unstructured":"Kr\u00fcger, F., M. Middendorf, and D. Merkle. (1998). \u201cStudies on a Parallel Ant System for the BSP Model.\u201d Unpub. manuscript."},{"key":"403305_CR16","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1109\/69.806935","volume":"11","author":"V. Maniezzo","year":"1999","unstructured":"Maniezzo, V. and A. Colorni. (1999). \u201cThe Ant System Applied to the Quadratic Assignment Problem.\u201d IEEE Trans. Knowledge and Data Engineering 11, 769\u2013778.","journal-title":"IEEE Trans. Knowledge and Data Engineering"},{"key":"403305_CR17","first-page":"893","volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2000)","author":"D. Merkle","year":"2000","unstructured":"Merkle, D., M. Middendorf, and H. Schmeck. (2000). \u201cAnt Colony Optimization for Resource-Constrained Project Scheduling.\u201d In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2000). San Mateo, CA: Morgan Kaufmann, pp. 893\u2013900."},{"key":"403305_CR18","first-page":"51","volume-title":"New Ideas in Optimization","author":"R. Michels","year":"1999","unstructured":"Michels, R. and M. Middendorf. (1999). \u201cAn Ant System for the Shortest Common Supersequence Problem.\u201d In D. Corne, M. Dorigo, and F. Glover (eds.), New Ideas in Optimization. New York: McGraw-Hill, pp. 51\u201361."},{"key":"403305_CR19","series-title":"LNCS","first-page":"645","volume-title":"Parallel and Distributed Computing","author":"M. Middendorf","year":"2000","unstructured":"Middendorf, M., F. Reischle, and H. Schmeck. (2000). \u201cInformation Exchange in Multi Colony Ant Algorithms.\u201d In J. Rolim (ed.), Parallel and Distributed Computing, Proceedings of the 15 IPDPS 2000 Workshops, Third Workshop on Biologically Inspired Solutions to Parallel Processing Problems (BioSP3), Mai 1\u20135, 2000, Cancun, Mexico, LNCS, Vol. 1800. Berlin: Springer-Verlag, pp. 645\u2013652."},{"key":"403305_CR20","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"722","DOI":"10.1007\/BFb0056914","volume-title":"Parallel Problem Solving from Nature\u2014PPSN V","author":"T. St\u00fctzle","year":"1998","unstructured":"St\u00fctzle, T. (1998). \u201cParallelization Strategies for Ant Colony Optimization.\u201d In A.E. Eiben, T. B\u00e4ck, M. Schoenauer, and H.-P. Schwefel (eds.), Parallel Problem Solving from Nature\u2014PPSN V, LNCS, Vol. 1498. Berlin: Springer-Verlag, pp. 722\u2013731."},{"key":"403305_CR21","first-page":"33","volume-title":"New Ideas in Optimization","author":"T. St\u00fctzle","year":"1999","unstructured":"St\u00fctzle, T. and M. Dorigo. (1999). \u201cACO Algorithms for the Quadratic Assignment Problem.\u201d In D. Corne, M. Dorigo, and F. Glover (eds.), New Ideas in Optimization. New York: McGraw-Hill, pp. 33\u201350."},{"key":"403305_CR22","first-page":"245","volume-title":"Proc. of the International Conf. on Artificial Neutral Networks and Genetic Algorithms","author":"T. St\u00fctzle","year":"1997","unstructured":"St\u00fctzle, T. and H.H. Hoos. (1997). \u201cImprovements on the Ant System: Introducing MAX(MIN) Ant System.\u201d In G. D. Smith et al. (eds.), Proc. of the International Conf. on Artificial Neutral Networks and Genetic Algorithms. Berlin: Springer-Verlag, pp. 245\u2013249."},{"key":"403305_CR23","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"19","author":"T. St\u00fctzle","year":"2000","unstructured":"St\u00fctzle, T. and H.H. Hoos. (2000). \u201cMAX(MIN) Ant System.\u201d Future Generation Computer Systems 19, 889\u2013914.","journal-title":"Future Generation Computer Systems"},{"key":"403305_CR24","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BFb0097905","volume-title":"Parallel and Distributed Processing, 11 IPPS\/SPDP'99 Workshops","author":"E.-G. Talbi","year":"1999","unstructured":"Talbi, E.-G., O. Roux, C. Fonlupt, and D. Robillard. (1999). \u201cParallel Ant Colonies for Combinatorial Optimization Problems.\u201d In J. Rolim et al. (eds.), Parallel and Distributed Processing, 11 IPPS\/SPDP'99 Workshops, LNCS, Vol. 1586. Berlin: Springer, pp. 239\u2013247."},{"key":"403305_CR25","first-page":"33","volume":"1","author":"D. Whitley","year":"1999","unstructured":"Whitley, D., S. Rana, and R.B. Heckendorn. (1999). \u201cThe Island Model Genetic Algorithm: On Separability, Population Size and Convergence.\u201d Journal of Computing and Information Technology\u2014CIT 7 1, 33\u201347. http:\/\/www.iwr.uni-heidelberg.de\/iwr\/comopt\/soft\/TSPLIB\/TSPLIB.html http:\/\/www.imm.dtu.dk\/sk\/qaplib\/","journal-title":"Journal of Computing and Information Technology\u2014CIT 7"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1015057701750.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1015057701750\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1015057701750.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T11:09:31Z","timestamp":1747652971000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1015057701750"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,5]]}},"alternative-id":["403305"],"URL":"https:\/\/doi.org\/10.1023\/a:1015057701750","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,5]]}}}