Abstract
The asymmetric traveling salesman problem (ATSP) appears in various applications. Although there are several heuristic approaches to its solution, the problem is still a difficult combinatorial optimization problem. This work proposes a novel hybrid approach specialized for the ATSP. The proposed method incorporates an improved genetic algorithm (IGA) and some optimization strategies that contribute to its effectiveness. In the IGA, both the crossover operation and the mutation operation are improved by selecting the optimum from a set of solutions. Three strategies: immigration, local optimization and global optimization are established based on several empirical optimization strategies to improve the evolution of the IGA. Computational experiments are conducted on 16 ATSP instances available in the TSPLIB (traveling salesman problem library). The comparative study shows that our proposed approach outperforms several other published algorithms.
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 callMore From: Engineering Applications of Artificial Intelligence
Disclaimer: 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.
