{"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/improving-tsp-solutions-using-ga-with-a-new","title":"Improving TSP Solutions Using GA with a New Hybrid Mutation Based on Knowledge and Randomness","arxiv_id":"1801.07233","date":"2018-01-22","proceeding":null,"authors":["Esra'a Alkafaween","Ahmad B. A. Hassanat"],"abstract":"Genetic algorithm (GA) is an efficient tool for solving optimization problems\nby evolving solutions, as it mimics the Darwinian theory of natural evolution.\nThe mutation operator is one of the key success factors in GA, as it is\nconsidered the exploration operator of GA. Various mutation operators exist to\nsolve hard combinatorial problems such as the TSP. In this paper, we propose a\nhybrid mutation operator called \"IRGIBNNM\", this mutation is a combination of\ntwo existing mutations, a knowledge-based mutation, and a random-based\nmutation. We also improve the existing \"select best mutation\" strategy using\nthe proposed mutation. We conducted several experiments on twelve benchmark\nSymmetric traveling salesman problem (STSP) instances. The results of our\nexperiments show the efficiency of the proposed mutation, particularly when we\nuse it with some other mutations. Keyword: Knowledge-based mutation, Inversion\nmutation, Slide mutation, RGIBNNM, SBM.","url_abs":"http://arxiv.org/abs/1801.07233v1","url_pdf":"http://arxiv.org/pdf/1801.07233v1.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":"improving-tsp-solutions-using-ga-with-a-new","repo_url":"https://github.com/RDaniel99/TravellingSalesmanProblem","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"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":"RDaniel99/TravellingSalesmanProblem","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":"5f69b30e5a582ac4c549e44ba1be1a7332401f24a30b7d04148d519992fee6d2","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}