{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T18:09:09Z","timestamp":1771524549319,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540285359","type":"print"},{"value":"9783540318989","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11546245_1","type":"book-chapter","created":{"date-parts":[[2010,7,22]],"date-time":"2010-07-22T19:12:11Z","timestamp":1279825931000},"page":"1-11","source":"Crossref","is-referenced-by-count":10,"title":["Comparing Parallelization of an ACO: Message Passing vs. Shared Memory"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Delisle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Gravel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Micha\u00ebl","family":"Krajecki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Caroline","family":"Gagn\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wilson L.","family":"Price","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","volume-title":"Computer and Intractability : A Guide to the Theory of NP-Completeness","author":"M.S. Garey","year":"1979","unstructured":"Garey, M.S., Johnson, D.S.: Computer and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., New York (1979)"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Randall, M., Lewis, A.: A Parallel Implementation of Ant Colony Optimization. Journal of Parallel and Distributed Computing. Academic Press Inc., London\u00a062(2), 1421\u20131432 (2002)","DOI":"10.1006\/jpdc.2002.1854"},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0303-2647(97)01708-5","volume":"43","author":"M. Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.M.: Ant colonies for the Traveling Salesman Problem. BioSystems\u00a043, 73\u201381 (1997)","journal-title":"BioSystems"},{"key":"1_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 Non-linear Optimization","author":"B. Bullnheimer","year":"1998","unstructured":"Bullnheimer, B., Kotsis, G., Strauss, C.: Parallelization Strategies for the Ant System. In: De Leone, R., Murli, A., Pardalos, P., Toraldo, G. (eds.) High Performance Algorithms and Software in Non-linear Optimization, pp. 87\u2013100. Kluwer Academic Publishers, Dordrecht (1998)"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1007\/BFb0056914","volume-title":"Parallel Problem Solving from Nature - PPSN V","author":"T. St\u00fctzle","year":"1998","unstructured":"St\u00fctzle, T.: Parallelization Strategies for Ant Colony Optimization. In: Eiben, A.E., B\u00e4ck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol.\u00a01498, pp. 722\u2013731. Springer, Heidelberg (1998)"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Talbi, E.-G., Roux, O., Fonlupt, C., Robillard, D.: Parallel Ant Colonies for Combinatorial Optimization Problems. In: Rolim, J., Juan, S., Rico, P. (eds.) BioSP3 Workshop on Biologically Inspired Solutions to Parallel Processing Systems, IEEE IPPS\/SPDP 1999 (Int. Parallel Processing Symposium \/ Symposium on Parallel and Distributed Processing). Springer, Heidelberg (1999)","DOI":"10.1007\/BFb0097905"},{"key":"1_CR7","unstructured":"Michel, R., Middendorf, M.: An Ant System for the Shortest Common Supersequence Problem. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in optimization, pp. 51\u201361 (1999)"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1007\/3-540-45591-4_87","volume-title":"Parallel and Distributed Processing","author":"M. Middendorf","year":"2000","unstructured":"Middendorf, M., Reischle, F., Schmeck, H.: Information Exchange in Multi Colony Ant Algorithms. In: Rolim, J.D.P. (ed.) IPDPS-WS 2000. LNCS, vol.\u00a01800, pp. 645\u2013652. Springer, Heidelberg (2000)"},{"key":"1_CR9","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1287\/ijoc.5.1.2","volume":"5","author":"H. Barr","year":"1993","unstructured":"Barr, H., Hickman, B.: Reporting computational experiments with parallel algorithms: Issues, measures and experts\u2019 opinions. ORSA Journal of Computing\u00a05, 2\u201318 (1993)","journal-title":"ORSA Journal of Computing"},{"key":"1_CR10","unstructured":"Delisle, P., Gravel, M., Krajecki, M., Gagn\u00e9, C., Price, W.L.: A Shared Memory Parallel Implementation of Ant Colony Optimization. Working Paper. Universit\u00e9 du Qu\u00e9bec \u00e0 Chicoutimi (2005)"}],"container-title":["Lecture Notes in Computer Science","Hybrid Metaheuristics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11546245_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:39:32Z","timestamp":1605641972000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11546245_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540285359","9783540318989"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11546245_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}