{"id":"https://openalex.org/W2007199597","doi":"https://doi.org/10.5555/314464.314489","title":"New results on the old k-opt algorithm for the TSP","display_name":"New results on the old k-opt algorithm for the TSP","alternate_titles":[],"publication_year":1994,"publication_date":"1994-01-23","ids":{"openalex":"https://openalex.org/W2007199597","doi":"https://doi.org/10.5555/314464.314489","mag":"2007199597"},"language":"en","primary_location":{"id":"mag:2007199597","doi":"https://doi.org/10.5555/314464.314489","is_oa":false,"landing_page_url":"http://www.seas.gwu.edu/~simhaweb/champalg/tsp/papers/ChandraKOPT_TSP.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306420974","display_name":"Symposium on Discrete Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Symposium on Discrete Algorithms","raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W2007199597"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"indexed_in":[],"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/A5080102544","display_name":"Barun Chandra","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I40347166","display_name":"University of Chicago","ror":"https://ror.org/024mw5h28","country_code":"US","type":"education","lineage":["https://openalex.org/I40347166"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Barun Chandra","raw_affiliation_strings":["Dept. of Comput. Sci., Univ. of Chicago, Chicago, IL"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Comput. Sci., Univ. of Chicago, Chicago, IL","institution_ids":["https://openalex.org/I40347166"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087578885","display_name":"Howard J. Karloff","orcid":"https://orcid.org/0000-0003-4490-2324","observed_orcids":["https://orcid.org/0000-0003-4490-2324"]},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Howard Karloff","raw_affiliation_strings":["College of Computing, Georgia Tech, Atlanta, Georgia#TAB#"],"raw_orcid":"https://orcid.org/0000-0003-4490-2324","affiliations":[{"raw_affiliation_string":"College of Computing, Georgia Tech, Atlanta, Georgia#TAB#","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079365209","display_name":"Craig A. Tovey","orcid":"https://orcid.org/0000-0002-1274-909X","observed_orcids":["https://orcid.org/0000-0002-1274-909X"]},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Craig A. Tovey","raw_affiliation_strings":["School of ISyE and College of Computing, Georgia Tech, Atlanta, Georgia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of ISyE and College of Computing, Georgia Tech, Atlanta, Georgia","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.6113,"has_fulltext":false,"cited_by_count":38,"citation_normalized_percentile":{"value":0.78686327,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"150","last_page":"159"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.3991999924182892,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.3991999924182892,"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"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.396699994802475,"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.1670999974012375,"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/traveling-salesman-problem","display_name":"traveling salesman problem","score":0.9919999837875366},{"id":"https://openalex.org/keywords/k-opt-local-search","display_name":"k-opt local search","score":0.9309999942779541},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.7229999899864197},{"id":"https://openalex.org/keywords/worst-case-performance-guarantees","display_name":"worst-case guarantees","score":0.6940000057220459},{"id":"https://openalex.org/keywords/probabilistic-analysis","display_name":"probabilistic analysis","score":0.8169999718666077}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8918963074684143},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6816789507865906},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6693179607391357},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.5979339480400085},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5498079657554626},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5132060050964355},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5036048293113708},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.4106547236442566},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3689734935760498},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19864192605018616},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.05888906121253967},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"mag:2007199597","doi":"https://doi.org/10.5555/314464.314489","is_oa":false,"landing_page_url":"http://www.seas.gwu.edu/~simhaweb/champalg/tsp/papers/ChandraKOPT_TSP.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306420974","display_name":"Symposium on Discrete Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Symposium on Discrete Algorithms","raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.52.8674","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.52.8674","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.cs.umd.edu/pub/faculty/khuller/858/howard.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W307896644","https://openalex.org/W1510730180","https://openalex.org/W2041167985","https://openalex.org/W2045173407","https://openalex.org/W2053913299","https://openalex.org/W2056913425","https://openalex.org/W2081541119","https://openalex.org/W2103981148","https://openalex.org/W2121956325","https://openalex.org/W2145255833"],"related_works":["https://openalex.org/W2079868147","https://openalex.org/W7095122223","https://openalex.org/W7099637566","https://openalex.org/W7100710022","https://openalex.org/W2047057401","https://openalex.org/W2139059344","https://openalex.org/W3016568908","https://openalex.org/W7075645263","https://openalex.org/W2042354886","https://openalex.org/W2907190735"],"abstract_inverted_index":{"Local":[0,72],"search":[1,49,73],"with":[2,53,65,74,110,156],"k-change":[3,75,127],"neighborhoods":[4,76],"is":[5,68,77,108,117,131,139],"perhaps":[6,78],"the":[7,16,42,51,57,60,63,79,88],"oldest":[8,80],"and":[9,38,46,62,81,101,136,147,161],"most":[10,82],"widely":[11,83],"used":[12,84],"heuristic":[13,85],"method":[14,86],"for":[15,26,50,87],"traveling":[17,89],"salesman":[18,90],"problem,":[19],"yet":[20],"almost":[21],"no":[22],"theoretical":[23],"performance":[24,43],"guarantees":[25],"it":[27,67],"were":[28],"previously":[29],"known.":[30],"This":[31],"paper":[32],"develops":[33],"several":[34],"results,":[35],"some":[36,39],"worst-case":[37],"probabilistic,":[40],"on":[41,164],"of":[44,59,105],"2-":[45],"k-opt":[47,153],"local":[48],"TSP,":[52],"respect":[54],"to":[55,119],"both":[56],"quality":[58],"solution":[61],"speed":[64],"which":[66],"obtained.":[69],"1":[70],"Introduction":[71],"problem":[91],"[13,":[92],"17].":[93],"Given":[94],"a":[95,102,113],"graph":[96],"G":[97,106],"=":[98],"(V;":[99],"E)":[100],"tour":[103,114,160,166],"T":[104,115,123,129,134,137,146],"(\"tour\"":[107],"synonymous":[109],"\"Hamiltonian":[111],"cycle\"),":[112],"0":[116,130,138],"said":[118],"be":[120],"obtained":[121,140],"from":[122,145],"by":[124,141,167],"an":[125,157],"improving":[126,170],"if":[128],"shorter":[132],"than":[133],",":[135],"removing":[142],"k":[143,149,171],"edges":[144],"adding":[148],"new":[150],"edges.":[151],"The":[152],"algorithm":[154],"starts":[155],"arbitrary":[158],"initial":[159],"incrementally":[162],"improves":[163],"this":[165],"making":[168],"successive":[169],"...":[172]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2007199597","counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-17T12:49:18.490984","created_date":"2016-06-24T00:00:00"}
