Solving the Traveling Salesman Problem Using Ant Colony Metaheuristic, A Review
HIS, pp. 421-430, 2016.
This paper presents a software application allowing to solve and compare the key metaheuristic approaches for solving the Traveling Salesman Problem (TSP). The focus is based on Ant Colony Optimization (ACO) and its major hybridization schema. In this work, the hybridization ACO algorithm with local search approach and the impact of param...More
Full Text (Upload PDF)
PPT (Upload PPT)