Abstract

In this paper, an improved 2-optimization(2-opt) and Ant Colony Optimization (ACO) Hybrid Algorithm is proposed to solve the Traveling Salesman Problem (TSP). The improved scheme of ACO is to define the indirect expectation heuristic and introduce it into the calculation method of transition probability, which will reduce the effect of pheromone on ant selecting path and increase the path's diversity of ACO. In this way, the deficiency of ACO in convergence to local optimal solution will be made up. Considering of the stronger local search ability, 2-opt algorithm is used to optimize existing solutions, and the better solution is obtained. Finally, the performance of the proposed algorithm is evaluated by the classical TSP problem.

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 call

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.