{"id":"https://openalex.org/W2151944609","doi":"https://doi.org/10.1145/2716282.2716287","title":"Rethinking the parallelization of random-restart hill climbing: a case study in optimizing a 2-opt TSP solver for GPU execution","display_name":"Rethinking the parallelization of random-restart hill climbing: a case study in optimizing a 2-opt TSP solver for GPU execution","publication_year":2015,"publication_date":"2015-02-03","ids":{"openalex":"https://openalex.org/W2151944609","doi":"https://doi.org/10.1145/2716282.2716287","mag":"2151944609"},"language":"en","primary_location":{"id":"doi:10.1145/2716282.2716287","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2716282.2716287","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 8th Workshop on General Purpose Processing using GPUs","raw_type":"proceedings-article"},"type":"article","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/A5055794856","display_name":"Molly A. O'Neil","orcid":null},"institutions":[{"id":"https://openalex.org/I13511017","display_name":"Texas State University","ror":"https://ror.org/05h9q1g27","country_code":"US","type":"education","lineage":["https://openalex.org/I13511017"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Molly A. O'Neil","raw_affiliation_strings":["Texas State University, USA"],"affiliations":[{"raw_affiliation_string":"Texas State University, USA","institution_ids":["https://openalex.org/I13511017"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103125276","display_name":"Martin Burtscher","orcid":"https://orcid.org/0000-0001-7717-3354"},"institutions":[{"id":"https://openalex.org/I13511017","display_name":"Texas State University","ror":"https://ror.org/05h9q1g27","country_code":"US","type":"education","lineage":["https://openalex.org/I13511017"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Martin Burtscher","raw_affiliation_strings":["Texas State University, USA"],"affiliations":[{"raw_affiliation_string":"Texas State University, USA","institution_ids":["https://openalex.org/I13511017"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5055794856"],"corresponding_institution_ids":["https://openalex.org/I13511017"],"apc_list":null,"apc_paid":null,"fwci":4.3144,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.94750159,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"99","last_page":"108"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9965000152587891,"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"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9965000152587891,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9962000250816345,"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.994700014591217,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.8555529117584229},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8402178883552551},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.6327966451644897},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.5979206562042236},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.5938889980316162},{"id":"https://openalex.org/keywords/hill-climbing","display_name":"Hill climbing","score":0.5877129435539246},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5472287535667419},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.4265744686126709},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22936272621154785},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10902494192123413},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.0844106674194336},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08206698298454285}],"concepts":[{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.8555529117584229},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8402178883552551},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6327966451644897},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.5979206562042236},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.5938889980316162},{"id":"https://openalex.org/C135450995","wikidata":"https://www.wikidata.org/wiki/Q820272","display_name":"Hill climbing","level":2,"score":0.5877129435539246},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5472287535667419},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.4265744686126709},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22936272621154785},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10902494192123413},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0844106674194336},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08206698298454285},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2716282.2716287","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2716282.2716287","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 8th Workshop on General Purpose Processing using GPUs","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7675534818","display_name":null,"funder_award_id":"1144466, 1141022, 1217231, 1406304, 1438963","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W4960211","https://openalex.org/W81055369","https://openalex.org/W187767610","https://openalex.org/W201710633","https://openalex.org/W272982077","https://openalex.org/W1463737727","https://openalex.org/W1480464059","https://openalex.org/W1492640216","https://openalex.org/W1998699473","https://openalex.org/W2011039300","https://openalex.org/W2021066071","https://openalex.org/W2054630393","https://openalex.org/W2071828883","https://openalex.org/W2098903349","https://openalex.org/W2106378689","https://openalex.org/W2109237118","https://openalex.org/W2128283661","https://openalex.org/W2138782497","https://openalex.org/W2142171423","https://openalex.org/W2153311885","https://openalex.org/W2154929945","https://openalex.org/W2157144058","https://openalex.org/W2345179437","https://openalex.org/W2436525433","https://openalex.org/W2533998425","https://openalex.org/W4232836277","https://openalex.org/W4233359534","https://openalex.org/W6687525517","https://openalex.org/W7053162197"],"related_works":["https://openalex.org/W1525389557","https://openalex.org/W2361554335","https://openalex.org/W2359992618","https://openalex.org/W2164188042","https://openalex.org/W4297427155","https://openalex.org/W3136451934","https://openalex.org/W3025823153","https://openalex.org/W3200006077","https://openalex.org/W2975368677","https://openalex.org/W2170228269"],"abstract_inverted_index":{"Random-restart":[0],"hill":[1,26],"climbing":[2,27],"is":[3,37,48,60],"a":[4,64,85,115,139],"common":[5],"approach":[6],"to":[7,33,106,127,131,156],"combinatorial":[8],"optimization":[9],"problems":[10],"such":[11],"as":[12,112,114],"the":[13,51,55,76,82,89,122],"traveling":[14],"salesman":[15],"problem":[16,42],"(TSP).":[17],"We":[18,87],"present":[19],"and":[20,75,94,102],"evaluate":[21],"an":[22,146],"implementation":[23,36,66,148],"of":[24,39,92],"random-restart":[25],"with":[28,63],"2-opt":[29,77,109,134],"local":[30],"search":[31],"applied":[32],"TSP.":[34],"Our":[35,119],"capable":[38],"addressing":[40],"large":[41],"sizes":[43],"at":[44],"high":[45],"throughput.":[46],"It":[47,143],"based":[49],"on":[50,97,138,150],"key":[52],"insight":[53],"that":[54],"GPU\u2019s":[56],"hierarchical":[57,65],"hardware":[58],"parallelism":[59],"best":[61],"exploited":[62],"strategy,":[67],"where":[68],"independent":[69],"climbs":[70],"are":[71,79],"parallelized":[72,80],"between":[73],"blocks":[74],"evaluations":[78],"across":[81],"threads":[83],"within":[84],"block.":[86],"analyze":[88],"performance":[90,105],"impact":[91],"this":[93],"other":[95],"optimizations":[96],"our":[98],"heuristic":[99],"TSP":[100,110],"solver":[101],"compare":[103],"its":[104],"existing":[107,123],"GPU-based":[108],"solvers":[111],"well":[113],"parallel":[116],"CPU":[117,152],"implementation.":[118],"code":[120],"outperforms":[121,145],"implementations":[124],"by":[125,154],"up":[126,130,155],"3X,":[128],"evaluating":[129],"60":[132],"billion":[133],"moves":[135],"per":[136],"second":[137],"single":[140],"K40":[141],"GPU.":[142],"also":[144],"OpenMP":[147],"run":[149],"20":[151],"cores":[153],"8X.":[157]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}