{"id":"https://openalex.org/W2157144058","doi":"https://doi.org/10.1109/hpcsim.2012.6266963","title":"Accelerating 2-opt and 3-opt local search using GPU in the travelling salesman problem","display_name":"Accelerating 2-opt and 3-opt local search using GPU in the travelling salesman problem","publication_year":2012,"publication_date":"2012-07-01","ids":{"openalex":"https://openalex.org/W2157144058","doi":"https://doi.org/10.1109/hpcsim.2012.6266963","mag":"2157144058"},"language":"en","primary_location":{"id":"doi:10.1109/hpcsim.2012.6266963","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcsim.2012.6266963","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 International Conference on High Performance Computing & Simulation (HPCS)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5080202677","display_name":"Kamil Rocki","orcid":null},"institutions":[{"id":"https://openalex.org/I74801974","display_name":"The University of Tokyo","ror":"https://ror.org/057zh3y96","country_code":"JP","type":"education","lineage":["https://openalex.org/I74801974"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Kamil Rocki","raw_affiliation_strings":["Graduate School of Information Science and Technology, CREST, JST, University of Tokyo, Bunkyo, Tokyo, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Information Science and Technology, CREST, JST, University of Tokyo, Bunkyo, Tokyo, Japan","institution_ids":["https://openalex.org/I74801974"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009108314","display_name":"Reiji Suda","orcid":"https://orcid.org/0000-0001-8797-6011"},"institutions":[{"id":"https://openalex.org/I74801974","display_name":"The University of Tokyo","ror":"https://ror.org/057zh3y96","country_code":"JP","type":"education","lineage":["https://openalex.org/I74801974"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Reiji Suda","raw_affiliation_strings":["Graduate School of Information Science and Technology, CREST, JST, University of Tokyo, Bunkyo, Tokyo, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Information Science and Technology, CREST, JST, University of Tokyo, Bunkyo, Tokyo, Japan","institution_ids":["https://openalex.org/I74801974"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I74801974"],"apc_list":null,"apc_paid":null,"fwci":3.7945,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.9343323,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"489","last_page":"495"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8060111999511719},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7782548666000366},{"id":"https://openalex.org/keywords/iterated-local-search","display_name":"Iterated local search","score":0.7538844347000122},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7534803152084351},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.5907270908355713},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.44319936633110046},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4160965085029602},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.34979647397994995},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30874869227409363},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15830686688423157},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.1065426766872406},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.10584515333175659}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8060111999511719},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7782548666000366},{"id":"https://openalex.org/C124145224","wikidata":"https://www.wikidata.org/wiki/Q6094397","display_name":"Iterated local search","level":3,"score":0.7538844347000122},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7534803152084351},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.5907270908355713},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.44319936633110046},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4160965085029602},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34979647397994995},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30874869227409363},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15830686688423157},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.1065426766872406},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.10584515333175659},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hpcsim.2012.6266963","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcsim.2012.6266963","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 International Conference on High Performance Computing & Simulation (HPCS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W81055369","https://openalex.org/W187767610","https://openalex.org/W1463737727","https://openalex.org/W1480464059","https://openalex.org/W1718162526","https://openalex.org/W1928910165","https://openalex.org/W2011039300","https://openalex.org/W2017708378","https://openalex.org/W2117954767","https://openalex.org/W2154929945","https://openalex.org/W2163428398","https://openalex.org/W2324108981","https://openalex.org/W2401610261","https://openalex.org/W3121748795","https://openalex.org/W4242361212","https://openalex.org/W6603304381","https://openalex.org/W6607571859"],"related_works":["https://openalex.org/W2031913815","https://openalex.org/W2083844986","https://openalex.org/W3112607009","https://openalex.org/W2005660029","https://openalex.org/W2887485518","https://openalex.org/W2888088860","https://openalex.org/W1996453501","https://openalex.org/W4394238759","https://openalex.org/W2051877214","https://openalex.org/W1666350026"],"abstract_inverted_index":{"In":[0],"this":[1,179],"paper":[2],"we":[3,143,176],"are":[4,144,157,177],"presenting":[5],"high":[6],"performance":[7],"GPU":[8,55,117],"implementations":[9],"of":[10,80,172],"the":[11,21,59,64,81,90,119,147],"2-opt":[12],"and":[13,39,175],"3-opt":[14],"local":[15,52,91],"search":[16,53,92],"algorithms":[17],"used":[18,95],"to":[19,31,62,67,105,122,131,135],"solve":[20],"Traveling":[22],"Salesman":[23],"Problem.":[24],"The":[25],"main":[26],"idea":[27],"behind":[28],"them":[29],"is":[30,48,87,162],"take":[32],"a":[33,49,71,182],"route":[34],"that":[35,43,76,113,159],"crosses":[36],"over":[37],"itself":[38],"reorder":[40],"it":[41,44,167],"so":[42],"does":[45],"not.":[46],"It":[47],"very":[50],"important":[51],"technique.":[54],"usage":[56],"greatly":[57],"decreases":[58],"time":[60,82,120],"needed":[61,121],"find":[63,123],"best":[65],"edges":[66],"be":[68,127],"swapped":[69],"in":[70,152,170],"route.":[72],"Our":[73,110],"results":[74,111],"show":[75,112],"at":[77],"least":[78],"90%":[79],"during":[83],"Iterated":[84],"Local":[85],"Search":[86],"spent":[88],"on":[89],"itself.":[93],"We":[94,156],"13":[96],"TSPLIB":[97],"problem":[98,151],"instances":[99],"with":[100],"sizes":[101],"ranging":[102],"from":[103,168],"100":[104],"4461":[106],"cities":[107],"for":[108],"testing.":[109],"by":[114],"using":[115,139],"our":[116],"algorithm,":[118],"optimal":[124],"swaps":[125],"can":[126],"decreased":[128],"approximately":[129],"3":[130],"26":[132],"times":[133],"compared":[134],"parallel":[136,154],"CPU":[137],"code":[138],"32":[140],"cores.":[141],"Additionally,":[142],"pointing":[145],"out":[146],"memory":[148,169],"bandwidth":[149],"limitation":[150],"current":[153],"architectures.":[155],"showing":[158],"re-computing":[160],"data":[161],"usually":[163],"faster":[164],"than":[165],"reading":[166],"case":[171],"multi-core":[173],"systems":[174],"proposing":[178],"approach":[180],"as":[181],"solution.":[183]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2013,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}