{"id":"https://openalex.org/W2889209553","doi":"https://doi.org/10.3233/978-1-61499-882-2-221","title":"GPU-Based Iterative Hill Climbing Algorithm to Solve Symmetric Traveling Salesman Problem","display_name":"GPU-Based Iterative Hill Climbing Algorithm to Solve Symmetric Traveling Salesman Problem","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2889209553","doi":"https://doi.org/10.3233/978-1-61499-882-2-221","mag":"2889209553"},"language":"en","primary_location":{"id":"doi:10.3233/978-1-61499-882-2-221","is_oa":false,"landing_page_url":"https://doi.org/10.3233/978-1-61499-882-2-221","pdf_url":null,"source":{"id":"https://openalex.org/S4210175178","display_name":"Advances in parallel computing","issn_l":"0927-5452","issn":["0927-5452","1879-808X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Advances in Parallel Computing","raw_type":"book-chapter"},"type":"book-chapter","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/A5116320796","display_name":"Talawar Basavaraj","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Talawar Basavaraj","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5030691334","display_name":"Yelmewad Pramod","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yelmewad Pramod","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.11238265,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"221","last_page":"241"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9344000220298767,"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.9344000220298767,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8919912576675415},{"id":"https://openalex.org/keywords/hill-climbing","display_name":"Hill climbing","score":0.6571094393730164},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5733628273010254},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4334666430950165},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3850295841693878},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30525219440460205}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8919912576675415},{"id":"https://openalex.org/C135450995","wikidata":"https://www.wikidata.org/wiki/Q820272","display_name":"Hill climbing","level":2,"score":0.6571094393730164},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5733628273010254},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4334666430950165},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3850295841693878},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30525219440460205}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3233/978-1-61499-882-2-221","is_oa":false,"landing_page_url":"https://doi.org/10.3233/978-1-61499-882-2-221","pdf_url":null,"source":{"id":"https://openalex.org/S4210175178","display_name":"Advances in parallel computing","issn_l":"0927-5452","issn":["0927-5452","1879-808X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Advances in Parallel Computing","raw_type":"book-chapter"},{"id":"mag:2889209553","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/tophpc/tophpc2017.html#TalawarY17","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W1525389557","https://openalex.org/W2361554335","https://openalex.org/W2164188042","https://openalex.org/W2359992618","https://openalex.org/W1979597421","https://openalex.org/W2495211334","https://openalex.org/W2537710285","https://openalex.org/W2352224959","https://openalex.org/W2088274154"],"abstract_inverted_index":{"Traveling":[0],"Salesman":[1],"Problem":[2],"(TSP)":[3],"is":[4],"an":[5],"NP-hard":[6],"combinatorial":[7],"optimization":[8],"problem.":[9],"Approximation":[10],"algorithms":[11],"have":[12,65],"been":[13,66],"used":[14],"to":[15,24,68],"reduce":[16],"the":[17,42,61],"worst-case":[18],"factorial":[19],"time":[20,27,54],"complexity":[21],"of":[22,49],"TSP":[23],"non-deterministic":[25],"polynomial":[26],"successfully.":[28],"However,":[29],"approximation":[30,50],"methods":[31,51],"result":[32],"in":[33,71,78],"a":[34],"sub-optimal":[35],"solution":[36],"as":[37],"they":[38],"do":[39],"not":[40],"cover":[41],"search":[43],"space":[44],"adequately.":[45],"Further,":[46],"CPU":[47],"implementations":[48],"are":[52],"too":[53],"consuming":[55],"for":[56],"large":[57],"input":[58],"instances.":[59],"On":[60],"other":[62],"hand,":[63],"GPUs":[64],"shown":[67],"be":[69],"effective":[70],"exploiting":[72],"data":[73],"and":[74],"memory":[75],"level":[76],"parallelism":[77],"large,":[79],"complex":[80],"problems.":[81]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2018-09-07T00:00:00"}