{"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/evolving-tsp-heuristics-using-multi","title":"Evolving TSP heuristics using Multi Expression Programming","arxiv_id":"1509.02459","date":"2015-09-08","proceeding":null,"authors":["Mihai Oltean","D. Dumitrescu"],"abstract":"Multi Expression Programming (MEP) is an evolutionary technique that may be\nused for solving computationally difficult problems. MEP uses a linear solution\nrepresentation. Each MEP individual is a string encoding complex expressions\n(computer programs). A MEP individual may encode multiple solutions of the\ncurrent problem. In this paper MEP is used for evolving a Traveling Salesman\nProblem (TSP) heuristic for graphs satisfying triangle inequality. Evolved MEP\nheuristic is compared with Nearest Neighbor Heuristic (NN) and Minimum Spanning\nTree Heuristic (MST) on some difficult problems in TSPLIB. For most of the\nconsidered problems the evolved MEP heuristic outperforms NN and MST. The\nobtained algorithm was tested against some problems in TSPLIB. The results\nemphasizes that evolved MEP heuristic is a powerful tool for solving difficult\nTSP instances.","url_abs":"http://arxiv.org/abs/1509.02459v1","url_pdf":"http://arxiv.org/pdf/1509.02459v1.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":"evolving-tsp-heuristics-using-multi","repo_url":"https://github.com/mihaioltean/evolve-tsp-heuristics","is_official":1,"mentioned_in_paper":0,"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":{"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}