{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:54:02Z","timestamp":1743022442045,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319038582"},{"type":"electronic","value":"9783319038599"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03859-9_18","type":"book-chapter","created":{"date-parts":[[2013,12,9]],"date-time":"2013-12-09T12:54:34Z","timestamp":1386593674000},"page":"216-225","source":"Crossref","is-referenced-by-count":6,"title":["Candidate Set Parallelization Strategies for Ant Colony Optimization on the GPU"],"prefix":"10.1007","author":[{"given":"Laurence","family":"Dawson","sequence":"first","affiliation":[]},{"given":"Iain A.","family":"Stewart","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","series-title":"CCIS","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-642-33308-8_6","volume-title":"Information and Software Technologies","author":"A. Blazinskas","year":"2012","unstructured":"Blazinskas, A., Misevicius, A.: Generating high quality candidate sets by tour merging for the traveling salesman problem. In: Skersys, T., Butleris, R., Butkiene, R. (eds.) ICIST 2012. CCIS, vol.\u00a0319, pp. 62\u201373. Springer, Heidelberg (2012)"},{"issue":"1","key":"18_CR2","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.jpdc.2012.01.002","volume":"73","author":"J.M. Cecilia","year":"2013","unstructured":"Cecilia, J.M., Garc\u00eda, J.M., Nisbet, A., Amos, M., Ujaldon, M.: Enhancing data parallelism for ant colony optimization on GPUs. J. Parallel Distrib. Comput.\u00a073(1), 42\u201351 (2013)","journal-title":"J. Parallel Distrib. Comput."},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Dawson, L., Stewart, I.: Improving Ant Colony Optimization performance on the GPU using CUDA. In: 2013 IEEE Congress on Evolutionary Computation (CEC), pp. 1901\u20131908 (2013)","DOI":"10.1109\/CEC.2013.6557791"},{"issue":"1","key":"18_CR4","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.jpdc.2012.01.003","volume":"73","author":"A. Del\u00e8vacq","year":"2013","unstructured":"Del\u00e8vacq, A., Delisle, P., Gravel, M., Krajecki, M.: Parallel ant colony optimization on graphics processing units. J. Parallel Distrib. Comput.\u00a073(1), 52\u201361 (2013)","journal-title":"J. Parallel Distrib. Comput."},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Deng, M., Zhang, J., Liang, Y., Lin, G., Liu, W.: A novel simple candidate set method for symmetric tsp and its application in max-min ant system. In: Advances in Swarm Intelligence, pp. 173\u2013181. Springer (2012)","DOI":"10.1007\/978-3-642-30976-2_21"},{"key":"18_CR6","unstructured":"Dorigo, M.: Ant Colony Optimization - Public Software, \n                      http:\/\/iridia.ulb.ac.be\/~mdorigo\/ACO\/aco-code\/public-software.html\n                     (last accessed July 31, 2013)"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Dorigo, M., St\u00fctzle, T.: Ant Colony Optimization. MIT Press (2004)","DOI":"10.7551\/mitpress\/1290.001.0001"},{"key":"18_CR8","unstructured":"NVIDIA: CUDA C Programming Guide, \n                      http:\/\/docs.nvidia.com\/cuda\/cuda-c-programming-guide\/index.html\n                     (last accessed July 31, 2013)"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Rais, H.M., Othman, Z.A., Hamdan, A.R.: Reducing iteration using candidate list. In: International Symposium on Information Technology, ITSim 2008, vol.\u00a03, pp. 1\u20138. IEEE (2008)","DOI":"10.1109\/ITSIM.2008.4632052"},{"key":"18_CR10","first-page":"243","volume-title":"Proceedings of the Third International Workshop on Ant Algorithms, ANTS 2002","author":"M. Randall","year":"2002","unstructured":"Randall, M., Montgomery, J.: Candidate set strategies for ant colony optimisation. In: Proceedings of the Third International Workshop on Ant Algorithms, ANTS 2002, pp. 243\u2013249. Springer, London (2002)"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Uchida, A., Ito, Y., Nakano, K.: An efficient gpu implementation of ant colony optimization for the traveling salesman problem. In: 2012 Third International Conference on Networking and Computing (ICNC), pp. 94\u2013102 (2012)","DOI":"10.1109\/ICNC.2012.22"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03859-9_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,19]],"date-time":"2023-01-19T17:07:33Z","timestamp":1674148053000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-03859-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319038582","9783319038599"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03859-9_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}