Abstract
Meta-heuristic methods are commonly applied to difficult permutation type problems such as the Traveling Salesman Problem (TSP). Genetic Algorithms (GA) and Ant Colony Optimisation (ACO) are two of the most successful methods. However, a GA requires specialist crossover operators for permutation problems to avoid repetition. This paper presents a novel crossover operator, ACOX, inspired by ACO which can essentially combine both meta-heuristic methods. When applied to a range of TSP instances the ACOX crossover method demonstrates considerable improvements over standard GA crossover operators. ACOX is able to achieve solutions within 4% of the optimal for TSP instances of several thousand cities without using any local search methodologies.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
