{"id":"https://openalex.org/W2022179164","doi":"https://doi.org/10.1007/978-1-4020-9688-4_3","title":"An analysis of several heuristics for the\u00a0traveling salesman problem","display_name":"An analysis of several heuristics for the\u00a0traveling salesman problem","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2022179164","doi":"https://doi.org/10.1007/978-1-4020-9688-4_3","mag":"2022179164"},"language":"en","primary_location":{"id":"doi:10.1007/978-1-4020-9688-4_3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-1-4020-9688-4_3","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamental Problems in 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/A5009388396","display_name":"Daniel J. Rosenkrantz","orcid":"https://orcid.org/0000-0002-7044-0197"},"institutions":[{"id":"https://openalex.org/I1332737386","display_name":"General Electric (United States)","ror":"https://ror.org/013msgt25","country_code":"US","type":"company","lineage":["https://openalex.org/I1332737386"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Daniel J. Rosenkrantz","raw_affiliation_strings":["General Electric Research and Development Center, Schenectady, NY, 12345, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"General Electric Research and Development Center, Schenectady, NY, 12345, USA","institution_ids":["https://openalex.org/I1332737386"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052202085","display_name":"Richard E. Stearns","orcid":"https://orcid.org/0000-0001-5058-1999"},"institutions":[{"id":"https://openalex.org/I1332737386","display_name":"General Electric (United States)","ror":"https://ror.org/013msgt25","country_code":"US","type":"company","lineage":["https://openalex.org/I1332737386"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Richard E. Stearns","raw_affiliation_strings":["General Electric Research and Development Center, Schenectady, NY, 12345, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"General Electric Research and Development Center, Schenectady, NY, 12345, USA","institution_ids":["https://openalex.org/I1332737386"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109259127","display_name":"Philip Lewis","orcid":null},"institutions":[{"id":"https://openalex.org/I1332737386","display_name":"General Electric (United States)","ror":"https://ror.org/013msgt25","country_code":"US","type":"company","lineage":["https://openalex.org/I1332737386"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Philip M. Lewis","raw_affiliation_strings":["General Electric Research and Development Center, Schenectady, NY, 12345, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"General Electric Research and Development Center, Schenectady, NY, 12345, USA","institution_ids":["https://openalex.org/I1332737386"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5009388396"],"corresponding_institution_ids":["https://openalex.org/I1332737386"],"apc_list":null,"apc_paid":null,"fwci":112.0894,"has_fulltext":false,"cited_by_count":784,"citation_normalized_percentile":{"value":0.99962049,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"45","last_page":"69"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9997000098228455,"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.9997000098228455,"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.9987999796867371,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.8691213726997375},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.7530414462089539},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7482042908668518},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6391603946685791},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6317515969276428},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.54786217212677},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.5357666611671448},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5153645873069763},{"id":"https://openalex.org/keywords/christofides-algorithm","display_name":"Christofides algorithm","score":0.48822787404060364},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.45631417632102966},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.4204520285129547},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.3512139320373535},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33388978242874146},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.26597991585731506},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2598956823348999},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.06463372707366943}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8691213726997375},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.7530414462089539},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7482042908668518},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6391603946685791},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6317515969276428},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.54786217212677},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5357666611671448},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5153645873069763},{"id":"https://openalex.org/C138600008","wikidata":"https://www.wikidata.org/wiki/Q498144","display_name":"Christofides algorithm","level":4,"score":0.48822787404060364},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.45631417632102966},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.4204520285129547},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.3512139320373535},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33388978242874146},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.26597991585731506},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2598956823348999},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06463372707366943},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-1-4020-9688-4_3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-1-4020-9688-4_3","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamental Problems in Computing","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1965680834","https://openalex.org/W1968766664","https://openalex.org/W1975442866","https://openalex.org/W1991529799","https://openalex.org/W2007572995","https://openalex.org/W2017927472","https://openalex.org/W2037455079","https://openalex.org/W2042986967","https://openalex.org/W2056898464","https://openalex.org/W2106378689","https://openalex.org/W2119606130","https://openalex.org/W2148673189","https://openalex.org/W2167890858","https://openalex.org/W2401610261","https://openalex.org/W2541420071","https://openalex.org/W3118260104","https://openalex.org/W4252166328","https://openalex.org/W4255306344"],"related_works":["https://openalex.org/W4200179302","https://openalex.org/W1595757466","https://openalex.org/W4389782626","https://openalex.org/W2766731260","https://openalex.org/W3210931532","https://openalex.org/W2620231896","https://openalex.org/W1645834615","https://openalex.org/W87675801","https://openalex.org/W2171568915","https://openalex.org/W2055574289"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":11},{"year":2021,"cited_by_count":38},{"year":2020,"cited_by_count":36},{"year":2019,"cited_by_count":33},{"year":2018,"cited_by_count":27},{"year":2017,"cited_by_count":34},{"year":2016,"cited_by_count":29},{"year":2015,"cited_by_count":31},{"year":2014,"cited_by_count":36},{"year":2013,"cited_by_count":47},{"year":2012,"cited_by_count":35}],"updated_date":"2026-04-26T08:31:28.666265","created_date":"2025-10-10T00:00:00"}