{"id":"https://openalex.org/W2292701987","doi":null,"title":"Greedy randomized adaptive search procedure for traveling salesman problem","display_name":"Greedy randomized adaptive search procedure for traveling salesman problem","alternate_titles":[],"publication_year":2006,"publication_date":"2006-08-16","ids":{"openalex":"https://openalex.org/W2292701987","mag":"2292701987"},"language":"en","primary_location":{"id":"pmh:oai:oaktrust.library.tamu.edu:1969.1/3735","doi":null,"is_oa":true,"landing_page_url":"https://hdl.handle.net/1969.1/3735","pdf_url":"https://oaktrust.library.tamu.edu/bitstreams/16d7dfe2-1f5d-4ac6-8a95-10df95df20c3/download","source":{"id":"https://openalex.org/S4306400291","display_name":"OakTrust (Texas A&M University Libraries)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I91045830","host_organization_name":"Texas A&M University","host_organization_lineage":["https://openalex.org/I91045830"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Thesis"},"parent_works":[],"lineage":["https://openalex.org/W2292701987"],"child_works_count":0,"type":"dissertation","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://oaktrust.library.tamu.edu/bitstreams/16d7dfe2-1f5d-4ac6-8a95-10df95df20c3/download","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5077403603","display_name":"Seung Ho Lee","orcid":"https://orcid.org/0000-0002-1739-7740","observed_orcids":["https://orcid.org/0000-0002-1739-7740"]},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"Seung Ho Lee","raw_affiliation_strings":["Industrial Engineering, Texas A&M University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Industrial Engineering, Texas A&M University","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5077403603"],"corresponding_institution_ids":["https://openalex.org/I91045830"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":5,"reviewed_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.54830002784729,"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.54830002784729,"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.44429999589920044,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.002199999988079071,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/traveling-salesman-problem","display_name":"traveling salesman problem","score":0.9869999885559082},{"id":"https://openalex.org/keywords/greedy-randomized-adaptive-search-procedure","display_name":"greedy randomized adaptive search procedure","score":0.8880000114440918},{"id":"https://openalex.org/keywords/grasp","display_name":"GRASP","score":0.699999988079071},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.628000020980835},{"id":"https://openalex.org/keywords/path-relinking","display_name":"path relinking","score":0.8360000252723694},{"id":"https://openalex.org/keywords/nearest-neighbor-heuristic","display_name":"nearest neighbor heuristic","score":0.7720000147819519},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.8370000123977661}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7851271629333496},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.5878543853759766},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5816932320594788},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5320701599121094},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46156802773475647},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.4301585853099823},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3754553198814392}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:oaktrust.library.tamu.edu:1969.1/3735","doi":null,"is_oa":true,"landing_page_url":"https://hdl.handle.net/1969.1/3735","pdf_url":"https://oaktrust.library.tamu.edu/bitstreams/16d7dfe2-1f5d-4ac6-8a95-10df95df20c3/download","source":{"id":"https://openalex.org/S4306400291","display_name":"OakTrust (Texas A&M University Libraries)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I91045830","host_organization_name":"Texas A&M University","host_organization_lineage":["https://openalex.org/I91045830"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Thesis"},{"id":"mag:2292701987","doi":null,"is_oa":false,"landing_page_url":"https://oaktrust.library.tamu.edu/handle/1969.1/3735","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:oaktrust.library.tamu.edu:1969.1/3735","doi":null,"is_oa":true,"landing_page_url":"https://hdl.handle.net/1969.1/3735","pdf_url":"https://oaktrust.library.tamu.edu/bitstreams/16d7dfe2-1f5d-4ac6-8a95-10df95df20c3/download","source":{"id":"https://openalex.org/S4306400291","display_name":"OakTrust (Texas A&M University Libraries)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I91045830","host_organization_name":"Texas A&M University","host_organization_lineage":["https://openalex.org/I91045830"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Thesis"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2292701987.pdf","grobid_xml":"https://content.openalex.org/works/W2292701987.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W1486115220","https://openalex.org/W1984604031","https://openalex.org/W2011039300","https://openalex.org/W2017708378","https://openalex.org/W2018689801","https://openalex.org/W2022179164","https://openalex.org/W2042986967","https://openalex.org/W2090275183","https://openalex.org/W2091299439","https://openalex.org/W2099861483","https://openalex.org/W2102076751","https://openalex.org/W2106378689","https://openalex.org/W2117226423","https://openalex.org/W2130055503","https://openalex.org/W2159073853","https://openalex.org/W2956015669","https://openalex.org/W2997776631","https://openalex.org/W3041730809","https://openalex.org/W4212899374"],"related_works":["https://openalex.org/W2025924944","https://openalex.org/W2306415163","https://openalex.org/W2351199977","https://openalex.org/W2080831875","https://openalex.org/W2975880639","https://openalex.org/W2739378952","https://openalex.org/W1984036937","https://openalex.org/W2055393744","https://openalex.org/W2592478754","https://openalex.org/W2518927172"],"abstract_inverted_index":{"In":[0],"this":[1],"thesis":[2],"we":[3,29],"use":[4],"greedy":[5],"randomize":[6],"adaptive":[7],"search":[8,45,50],"procedure":[9],"(GRASP)":[10],"to":[11,23,73],"solve":[12],"the":[13,25,31,34,38,60,68,75],"traveling":[14],"salesman":[15],"problem":[16],"(TSP).":[17],"Starting":[18],"with":[19],"nearest":[20],"neighbor":[21,49],"method":[22,36],"construct":[24],"initial":[26,39],"TSP":[27,76],"tour,":[28],"apply":[30],"2-opt":[32,44],"and":[33,51],"path-relinking":[35],"for":[37],"tour":[40],"improvement.":[41],"To":[42],"increase":[43],"speed,":[46],"fixed-radius":[47],"near":[48],"don0t":[52],"\u2212":[53],"look":[54],"bit":[55],"techniques":[56],"are":[57],"introduced.":[58],"For":[59],"same":[61],"reason":[62],"a":[63,88],"new":[64],"efficient":[65],"data":[66],"structure,":[67],"reverse":[69],"array,":[70],"is":[71],"proposed":[72],"represent":[74],"tour.":[77],"Computational":[78],"results":[79],"show":[80],"that":[81],"GRASP":[82],"gives":[83],"fairly":[84],"good":[85],"solutions":[86],"in":[87],"short":[89],"time.":[90]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2292701987","counts_by_year":[{"year":2018,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2016-06-24T00:00:00"}
