{"about":{"site":"https://codewithpapers.app","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.","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"},"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"},"arxiv_metadata":null,"syntology_extracted_results":null}