{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:42:06Z","timestamp":1725896526735},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642344121"},{"type":"electronic","value":"9783642344138"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-34413-8_30","type":"book-chapter","created":{"date-parts":[[2012,10,1]],"date-time":"2012-10-01T01:58:57Z","timestamp":1349056737000},"page":"372-377","source":"Crossref","is-referenced-by-count":6,"title":["Parallel GPU Implementation of Iterated Local Search for the Travelling Salesman Problem"],"prefix":"10.1007","author":[{"given":"Audrey","family":"Del\u00e9vacq","sequence":"first","affiliation":[]},{"given":"Pierre","family":"Delisle","sequence":"additional","affiliation":[]},{"given":"Micha\u00ebl","family":"Krajecki","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","unstructured":"Del\u00e9vacq, A., Delisle, P., Gravel, M., Krajecki, M.: Parallel ant colony optimization on graphics processing units. In: PDPTA 2010, pp. 196\u2013202. CSREA Press (2010)"},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1023\/A:1009624916728","volume":"3","author":"I. Hong","year":"1997","unstructured":"Hong, I., Kahng, A., Moon, B.: Improved large-step markov chain variants for the symmetric tsp. Journal of Heuristics\u00a03, 63\u201381 (1997)","journal-title":"Journal of Heuristics"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Johnson, D., McGeoch, L.: The Travelling Salesman Problem: A Case Study in Local Optimization. In: Aarts, E.H.L., Lenstra, J.K. (eds.) Local Search in Combinatorial Optimization, pp. 215\u2013310. John Wiley & Sons (1997)","DOI":"10.2307\/j.ctv346t9c.13"},{"key":"30_CR4","doi-asserted-by":"publisher","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","volume":"44","author":"S. Lin","year":"1965","unstructured":"Lin, S.: Computer solutions of the traveling salesman problem. Bell System Technical Journal\u00a044, 2245\u20132269 (1965)","journal-title":"Bell System Technical Journal"},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"Louren\u00e7o, H., Martin, O., St\u00fctzle, T.: Iterated local search: framework and applications. In: Handbook of Metaheuristics, pp. 363\u2013397. Springer (2010)","DOI":"10.1007\/978-1-4419-1665-5_12"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"Luong, T., Loukil, L., Melab, N., Talbi, E.: A gpu-based iterated tabu search for solving the quadratic 3-dimensional assignment problem. In: AICCSA, pp. 1\u20138 (2010)","DOI":"10.1109\/AICCSA.2010.5587019"},{"issue":"4","key":"30_CR7","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1142\/S0129626410000260","volume":"20","author":"T. Luong","year":"2010","unstructured":"Luong, T., Melab, N., Talbi, E.: Neighborhood structures for gpu-based local search algorithms. Parallel Processing Letters\u00a020(4), 307\u2013324 (2010)","journal-title":"Parallel Processing Letters"},{"key":"30_CR8","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF02601639","volume":"63","author":"O. Martin","year":"1996","unstructured":"Martin, O., Otto, S.: Combining simulated annealing with local search heuristics. Annals of Operations Research\u00a063, 57\u201375 (1996)","journal-title":"Annals of Operations Research"},{"key":"30_CR9","unstructured":"NVIDIA Corporation: CUDA : Computer Unified Device Architecture Programming Guide 4.0 (2011), \n                    \n                      http:\/\/www.nvidia.com"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"St\u00fctzle, T., Hoos, H.: Analysing the run-time behaviour of iterated local search for the traveling salesman problem. In: Essays and Surveys in Metaheuristics, pp. 21\u201343. Springer (2001)","DOI":"10.1007\/978-1-4615-1507-4_26"},{"key":"30_CR11","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/BF02430365","volume":"1","author":"M. Verhoeven","year":"1995","unstructured":"Verhoeven, M., Aarts, E.: Parallel local search. J. Heuristics\u00a01, 43\u201365 (1995)","journal-title":"J. Heuristics"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34413-8_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T21:14:59Z","timestamp":1558300499000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34413-8_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642344121","9783642344138"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34413-8_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}