{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T14:24:50Z","timestamp":1725805490871},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662450482"},{"type":"electronic","value":"9783662450499"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-45049-9_96","type":"book-chapter","created":{"date-parts":[[2014,9,19]],"date-time":"2014-09-19T10:07:14Z","timestamp":1411121234000},"page":"585-590","source":"Crossref","is-referenced-by-count":2,"title":["Parallel Genetic Algorithm with OpenCL for Traveling Salesman Problem"],"prefix":"10.1007","author":[{"given":"Kai","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Siman","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Li","family":"li","sequence":"additional","affiliation":[]},{"given":"Ming","family":"Qiu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"96_CR1","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(77)90012-3","volume":"4","author":"C.H. Papadimitriou","year":"1977","unstructured":"Papadimitriou, C.H.: The Euclidean Traveling Salesman Problem is NP-complete. Theoretical Computer Science\u00a04(3), 237\u2013244 (1977)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"96_CR2","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BF01586932","volume":"51","author":"M. Grotschel","year":"1991","unstructured":"Grotschel, M., Holland, O.: Solution of Large-Scale Travelling Salesman Problems. Mathematical Programming\u00a051(2), 141\u2013202 (1991)","journal-title":"Mathematical Programming"},{"issue":"1","key":"96_CR3","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.dam.2003.09.013","volume":"145","author":"H. Hern\u00e1ndez-P\u00e9rez","year":"2004","unstructured":"Hern\u00e1ndez-P\u00e9rez, H., Salazar-Gonz\u00e1lez, J.: A Branch-and-Cut Algorithm for a Traveling Salesman Problem with Pickup and Delivery. Discrete Applied Mathematics\u00a0145(1), 126\u2013139 (2004)","journal-title":"Discrete Applied Mathematics"},{"issue":"8","key":"96_CR4","doi-asserted-by":"publisher","first-page":"9","DOI":"10.5120\/15371-3900","volume":"88","author":"M. Anuraj","year":"2014","unstructured":"Anuraj, M., Remya, G.: A Parallel Implementation of Ant Colony Optimization for TSP based on MapReduce Framework. International Journal of Computer Applications\u00a088(8), 9\u201312 (2014)","journal-title":"International Journal of Computer Applications"},{"issue":"6","key":"96_CR5","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/j.ipl.2007.06.016","volume":"104","author":"M. Klaus","year":"2007","unstructured":"Klaus, M.: Simulated Annealing versus Metropolis for a TSP instance. Information Processing Letters\u00a0104(6), 216\u2013219 (2007)","journal-title":"Information Processing Letters"},{"key":"96_CR6","doi-asserted-by":"publisher","first-page":"1209","DOI":"10.1166\/jctn.2013.2830","volume":"10","author":"X. Wang","year":"2013","unstructured":"Wang, X., Song, T., Wang, Z.: MRPGA: Motif Detecting by Modified Random Projection Strategy and Genetic Algorithm. J. Comput. Theor. Nanosci.\u00a010, 1209\u20131214 (2013)","journal-title":"J. Comput. Theor. Nanosci."},{"key":"96_CR7","unstructured":"He, Y., Qiu, Y., Liu, G., Lei, K.: A Parallel Adaptive Tabu Search Approach for Traveling Salesman Problems. In: Proceedings of IEEE International Conference on Natural Language Processing and Knowledge Engineering, pp. 796\u2013801 (2005)"},{"key":"96_CR8","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.swevo.2013.04.003","volume":"12","author":"J. Hofmann","year":"2013","unstructured":"Hofmann, J., Limmer, S., Fey, D.: Performance Investigations of Genetic Algorithms on Graphics Cards. Swarm and Evolutionary Computation\u00a012, 33\u201347 (2013)","journal-title":"Swarm and Evolutionary Computation"},{"key":"96_CR9","doi-asserted-by":"crossref","unstructured":"Lan, Q., Xun, C., Wen, M.: Improving Performance of GPU Specif-ic OpenCLProgram on CPUs. In: Proceedings of 13th International Conference on Parallel and Distributed Computing, Applications and Technologies, pp. 356\u2013360 (2012)","DOI":"10.1109\/PDCAT.2012.81"},{"issue":"12","key":"96_CR10","doi-asserted-by":"publisher","first-page":"834","DOI":"10.1016\/j.parco.2013.08.009","volume":"39","author":"J. Shen","year":"2013","unstructured":"Shen, J., Fang, J., Sips, H., Varbanescu, A.L.: An Application-centric Evaluation of OpenCL on Multi-core CPUs. Parallel Computing\u00a039(12), 834\u2013850 (2013)","journal-title":"Parallel Computing"},{"key":"96_CR11","doi-asserted-by":"crossref","unstructured":"Shi, X., Lu, W., Wang, Z.: Programmable DNA Tile Self-assembly Using a Hierarchical Subtile Strategy. Nanotechnology\u00a025(7), 075602 (2014)","DOI":"10.1088\/0957-4484\/25\/7\/075602"}],"container-title":["Communications in Computer and Information Science","Bio-Inspired Computing - Theories and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-45049-9_96","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T22:55:22Z","timestamp":1558997722000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-45049-9_96"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662450482","9783662450499"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-45049-9_96","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2014]]}}}