{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/an-empirical-analysis-of-approximation","title":"An Empirical Analysis of Approximation Algorithms for the Euclidean Traveling Salesman Problem","arxiv_id":"1705.09058","date":"2017-05-25","proceeding":null,"authors":["Yihui He","Ming Xiang"],"abstract":"With applications to many disciplines, the traveling salesman problem (TSP)\nis a classical computer science optimization problem with applications to\nindustrial engineering, theoretical computer science, bioinformatics, and\nseveral other disciplines. In recent years, there have been a plethora of novel\napproaches for approximate solutions ranging from simplistic greedy to\ncooperative distributed algorithms derived from artificial intelligence. In\nthis paper, we perform an evaluation and analysis of cornerstone algorithms for\nthe Euclidean TSP. We evaluate greedy, 2-opt, and genetic algorithms. We use\nseveral datasets as input for the algorithms including a small dataset, a\nmediumsized dataset representing cities in the United States, and a synthetic\ndataset consisting of 200 cities to test algorithm scalability. We discover\nthat the greedy and 2-opt algorithms efficiently calculate solutions for\nsmaller datasets. Genetic algorithm has the best performance for optimality for\nmedium to large datasets, but generally have longer runtime. Our\nimplementations is public available.","url_abs":"http://arxiv.org/abs/1705.09058v1","url_pdf":"http://arxiv.org/pdf/1705.09058v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"an-empirical-analysis-of-approximation","repo_url":"https://github.com/yihui-he/TSP","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"traveling-salesman-problem","task_name":"Traveling Salesman Problem"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"yihui-he/TSP","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"cdf7267e488fdb3ae4331871e3492bc800db2a66ae536b61c672fef81bd18e25","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}