{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:10:14Z","timestamp":1761293414898,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2016,5,23]],"date-time":"2016-05-23T00:00:00Z","timestamp":1463961600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003696","name":"Electronics and Telecommunications Research Institute (KR)","doi-asserted-by":"publisher","award":["165ZS1410"],"award-info":[{"award-number":["165ZS1410"]}],"id":[{"id":"10.13039\/501100003696","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003708","name":"Korea Institute of Science and Technology Information (KR)","doi-asserted-by":"publisher","award":["2016 PLSI"],"award-info":[{"award-number":["2016 PLSI"]}],"id":[{"id":"10.13039\/501100003708","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2016,11]]},"DOI":"10.1007\/s11227-016-1748-1","type":"journal-article","created":{"date-parts":[[2016,5,24]],"date-time":"2016-05-24T06:56:00Z","timestamp":1464072960000},"page":"4399-4414","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["GPU-based parallel genetic approach to large-scale travelling salesman problem"],"prefix":"10.1007","volume":"72","author":[{"given":"Semin","family":"Kang","sequence":"first","affiliation":[]},{"given":"Sung-Soo","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Jongho","family":"Won","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2796-194X","authenticated-orcid":false,"given":"Young-Min","family":"Kang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,5,23]]},"reference":[{"issue":"6","key":"1748_CR1","first-page":"96","volume":"3","author":"ZH Ahmed","year":"2010","unstructured":"Ahmed ZH (2010) Genetic algorithm for the traveling salesman problem using sequential constructive crossover operator. Int J Biom Bioinform 3(6):96","journal-title":"Int J Biom Bioinform"},{"key":"1748_CR2","doi-asserted-by":"crossref","unstructured":"Arabnia HR (1995) A distributed stereocorrelation algorithm. In: Proceedings of computer communications and networks, pp 479\u2013482","DOI":"10.1109\/ICCCN.1995.540163"},{"issue":"3","key":"1748_CR3","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/BF00130109","volume":"10","author":"HR Arabnia","year":"1996","unstructured":"Arabnia HR, Bhandarkar SM (1996) Parallel stereocorrelation on a reconfigurable multi-ring network. J Supercomput 10(3):243\u2013270","journal-title":"J Supercomput"},{"key":"1748_CR4","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195099713.001.0001","volume-title":"Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms","author":"T B\u00e4ck","year":"1996","unstructured":"B\u00e4ck T (1996) Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms. Oxford University Press, Oxford"},{"issue":"1","key":"1748_CR5","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF00203625","volume":"64","author":"W Banzhaf","year":"1990","unstructured":"Banzhaf W (1990) The molecular traveling salesman. Biol Cybern 64(1):7\u201314","journal-title":"Biol Cybern"},{"issue":"3","key":"1748_CR6","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1016\/0377-2217(95)00077-1","volume":"93","author":"S Chatterjee","year":"1996","unstructured":"Chatterjee S, Carrera C, Lynch LA (1996) Genetic algorithms and traveling salesman problems. Eur J Oper Res 93(3):490\u2013510","journal-title":"Eur J Oper Res"},{"key":"1748_CR7","doi-asserted-by":"crossref","unstructured":"Chitty DM (2007) A data parallel approach to genetic programming using programmable graphics hardware. In: Proceedings of the 9th annual conference on genetic and evolutionary computation. ACM, New York, pp 1566\u20131573","DOI":"10.1145\/1276958.1277274"},{"key":"1748_CR8","doi-asserted-by":"crossref","unstructured":"De Jong KA, Spears WM (1991) An analysis of the interacting roles of population size and crossover in genetic algorithms. In: Parallel problem solving from nature. Springer, Berlin, pp 38\u201347","DOI":"10.1007\/BFb0029729"},{"issue":"1","key":"1748_CR9","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1080\/01969729308961697","volume":"24","author":"DB Fogel","year":"1993","unstructured":"Fogel DB (1993) Applying evolutionary programming to selected traveling salesman problems. Cybern Syst 24(1):27\u201336","journal-title":"Cybern Syst"},{"key":"1748_CR10","volume-title":"Genetic algorithms in search, optimization, and machine learning","author":"DE Golberg","year":"1989","unstructured":"Golberg DE (1989) Genetic algorithms in search, optimization, and machine learning. Addison Wesley, Boston"},{"key":"1748_CR11","unstructured":"Grefenstette J, Gopal R, Rosmaita B, Van\u00a0Gucht D (1985) Genetic algorithms for the traveling salesman problem. In: Proceedings of the first international conference on genetic algorithms and their applications. Lawrence Erlbaum, New Jersey, pp 160\u2013168"},{"key":"1748_CR12","doi-asserted-by":"crossref","unstructured":"Hasegawa M, Ikeguchi T, Aihara K (1997) Combination of chaotic neurodynamics with the 2-opt algorithm to solve traveling salesman problems. Phys Rev Lett 79(12):2344\u20132347","DOI":"10.1103\/PhysRevLett.79.2344"},{"key":"1748_CR13","doi-asserted-by":"crossref","unstructured":"He B, Fang W, Luo Q, Govindaraju NK, Wang T (2008) Mars: a mapreduce framework on graphics processors. In: Proceedings of the 17th international conference on parallel architectures and compilation techniques. ACM, New York, pp 260\u2013269","DOI":"10.1145\/1454115.1454152"},{"key":"1748_CR14","doi-asserted-by":"crossref","unstructured":"Hoffman KL, Padberg M, Rinaldi G (2013) Traveling salesman problem. In: Encyclopedia of operations research and management science. Springer, Berlin, pp 1573\u20131578","DOI":"10.1007\/978-1-4419-1153-7_1068"},{"key":"1748_CR15","doi-asserted-by":"crossref","unstructured":"Kang S, Kim SS, Won JH, Kang YM (2015) Bidirectional constructive crossover for evolutionary approach to travelling salesman problem. In: 2015 5th international conference on IT convergence and security (ICITCS). IEEE, pp 1\u20134","DOI":"10.1109\/ICITCS.2015.7292958"},{"issue":"3","key":"1748_CR16","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(77)90012-3","volume":"4","author":"CH Papadimitriou","year":"1977","unstructured":"Papadimitriou CH (1977) The Euclidean travelling salesman problem is np-complete. Theor Comput Sci 4(3):237\u2013244","journal-title":"Theor Comput Sci"},{"key":"1748_CR17","doi-asserted-by":"crossref","unstructured":"Pereira FB, Tavares J, Machado P, Costa E (2002) GVR: a new genetic representation for the vehicle routing problem. In: Artificial intelligence and cognitive science. Springer, Berlin, pp 95\u2013102","DOI":"10.1007\/3-540-45750-X_12"},{"issue":"9","key":"1748_CR18","doi-asserted-by":"crossref","first-page":"3878","DOI":"10.1021\/ct400314y","volume":"9","author":"R Salomon-Ferrer","year":"2013","unstructured":"Salomon-Ferrer R, Gtz AW, Poole D, Le Grand S, Walker RC (2013) Routine microsecond molecular dynamics simulations with AMBER on GPUs. 2. Explicit solvent particle mesh Ewald. J Chem Theory Comput 9(9):3878\u20133888","journal-title":"J Chem Theory Comput"},{"key":"1748_CR19","unstructured":"Sanders J, Kandrot E (2010) CUDA by example: an introduction to general-purpose GPU programming. Addison-Wesley Professional, Boston"},{"key":"1748_CR20","unstructured":"TSP test data. http:\/\/www.math.uwaterloo.ca\/tsp\/data\/index.html . Accessed 25 Nov 2015"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-016-1748-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-016-1748-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-016-1748-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-016-1748-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,30]],"date-time":"2022-06-30T04:54:41Z","timestamp":1656564881000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-016-1748-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,23]]},"references-count":20,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2016,11]]}},"alternative-id":["1748"],"URL":"https:\/\/doi.org\/10.1007\/s11227-016-1748-1","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2016,5,23]]}}}