{"id":"https://openalex.org/W2057569886","doi":"https://doi.org/10.1145/2312005.2312041","title":"Brief announcement","display_name":"Brief announcement","publication_year":2012,"publication_date":"2012-06-25","ids":{"openalex":"https://openalex.org/W2057569886","doi":"https://doi.org/10.1145/2312005.2312041","mag":"2057569886"},"language":"en","primary_location":{"id":"doi:10.1145/2312005.2312041","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2312005.2312041","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures","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 M. Rocki","raw_affiliation_strings":["University of Tokyo, JST CREST, Tokyo, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Tokyo, JST CREST, 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":["University of Tokyo, JST CREST, Tokyo, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Tokyo, JST CREST, 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":0.7589,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.69281622,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"188","last_page":"189"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9933000206947327,"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.9933000206947327,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9771000146865845,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9749000072479248,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/iterated-local-search","display_name":"Iterated local search","score":0.8089945316314697},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7539453506469727},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.7111696600914001},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.706462025642395},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.5740909576416016},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.45636504888534546},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44451650977134705},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.4273649752140045},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.4144953787326813},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41410383582115173},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3336399793624878},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.19833120703697205},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16497090458869934}],"concepts":[{"id":"https://openalex.org/C124145224","wikidata":"https://www.wikidata.org/wiki/Q6094397","display_name":"Iterated local search","level":3,"score":0.8089945316314697},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7539453506469727},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.7111696600914001},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.706462025642395},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.5740909576416016},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.45636504888534546},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44451650977134705},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.4273649752140045},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.4144953787326813},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41410383582115173},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3336399793624878},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.19833120703697205},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16497090458869934},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2312005.2312041","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2312005.2312041","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures","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":5,"referenced_works":["https://openalex.org/W272982077","https://openalex.org/W2011039300","https://openalex.org/W2106378689","https://openalex.org/W2163428398","https://openalex.org/W2324108981"],"related_works":["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/W1666350026","https://openalex.org/W2346455737","https://openalex.org/W3081534731"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3,98],"are":[4,61],"presenting":[5],"high":[6],"performance":[7],"GPU":[8,100,121,167],"implementations":[9],"of":[10,27,40,65,82,113,145],"the":[11,21,45,50,56,83,93,103,110,114,120,125,143,162,166,180,186],"2-opt":[12],"and":[13,35,106],"3-opt":[14],"local":[15,28,94,104,168],"search":[16,29,67,95,105,169],"algorithms":[17,68],"used":[18],"to":[19,101,130,134,172,179],"solve":[20],"Traveling":[22],"Salesman":[23],"Problem.":[24],"This":[25],"type":[26],"optimization":[30,163],"is":[31,90],"a":[32,63,86,150],"very":[33],"effective":[34],"fast":[36],"method":[37],"in":[38],"case":[39],"small":[41],"problem":[42,57,187],"instances.":[43],"However,":[44],"time":[46,84],"spent":[47,91],"on":[48,92,149,176,185],"comparing":[49],"graph":[51],"edges":[52],"grows":[53],"significantly":[54],"with":[55],"size":[58],"growing.":[59],"They":[60],"usually":[62],"part":[64],"global":[66],"such":[69],"as":[70],"Iterated":[71],"Local":[72],"Search":[73],"(ILS).":[74],"Our":[75,116],"results":[76,117],"showed,":[77],"that":[78,107,119,161],"at":[79,142],"least":[80],"90%":[81],"during":[85],"single":[87,151],"ILS":[88],"run":[89],"itself.":[96],"Therefore":[97],"utilized":[99],"parallelize":[102],"greatly":[108],"improved":[109],"overall":[111],"speed":[112,144],"algorithm.":[115],"show":[118,160],"accelerated":[122],"algorithm":[123,164],"finds":[124],"optimal":[126],"swaps":[127],"approximately":[128],"3":[129],"26":[131],"times":[132,174],"compared":[133,178],"parallel":[135],"CPU":[136,182],"code":[137],"using":[138,165],"32":[139],"cores,":[140],"operating":[141],"over":[146],"1.5":[147],"TFLOPS":[148],"GeForce":[152],"GTX":[153],"680":[154],"GPU.":[155],"The":[156],"preliminary":[157],"experimental":[158],"studies":[159],"converges":[170],"10":[171],"50":[173],"faster":[175],"average":[177],"sequential":[181],"version,":[183],"depending":[184],"size.":[188]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2016-06-24T00:00:00"}