{"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/a-hybrid-genetic-algorithm-for-the-traveling","title":"A Hybrid Genetic Algorithm for the Traveling Salesman Problem with Drone","arxiv_id":"1812.09351","date":"2018-12-21","proceeding":null,"authors":["Quang Minh Ha","Yves Deville","Quang Dung Pham","Minh Hoàng Hà"],"abstract":"This paper addresses the Traveling Salesman Problem with Drone (TSP-D), in\nwhich a truck and drone are used to deliver parcels to customers. The objective\nof this problem is to either minimize the total operational cost (min-cost\nTSP-D) or minimize the completion time for the truck and drone (min-time\nTSP-D). This problem has gained a lot of attention in the last few years since\nit is matched with the recent trends in a new delivery method among logistics\ncompanies. To solve the TSP-D, we propose a hybrid genetic search with dynamic\npopulation management and adaptive diversity control based on a split\nalgorithm, problem-tailored crossover and local search operators, a new restore\nmethod to advance the convergence and an adaptive penalization mechanism to\ndynamically balance the search between feasible/infeasible solutions. The\ncomputational results show that the proposed algorithm outperforms existing\nmethods in terms of solution quality and improves best known solutions found in\nthe literature. Moreover, various analyses on the impacts of crossover choice\nand heuristic components have been conducted to analysis further their\nsensitivity to the performance of our method.","url_abs":"http://arxiv.org/abs/1812.09351v1","url_pdf":"http://arxiv.org/pdf/1812.09351v1.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":"a-hybrid-genetic-algorithm-for-the-traveling","repo_url":"https://github.com/ovidiuchile/AEA2019","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"diversity","task_name":"Diversity"},{"task_slug":"management","task_name":"Management"},{"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":"ovidiuchile/AEA2019","kind":"listed","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":"da8a9efbf227ffb90ae564cef8a19fbbae7f260d1782ab04d44d8939e212f9fa","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}