A modular hybrid Ant Colony Approach for solving traveling salesman problem

DOI: 10.5176/978-981-08-7240-3_I-43

Authors: Sudip Kumar Sahana and Dr.(Mrs).Aruna Jain

Abstract:

To solve the well known traveling salesman problem(TSP) a combined approach of Ant Colony Optimization (ACO) and Genetic Algorithm (GA) are considered over here primarily. A number of solutions are given by the researchers in the past few decades even using a hybrid approach of ACO and GA to achieve the optimization. But our work gives the optimal solution for the said problem by using the modular hybrid approach of ACO and GA in addition to some heuristic approach. We have incorporated GA in ACO module, hence each iteration calls the GA within ACO module results in a higher amount of pheromone deposited in the optimal path in the global pheromone update. Hence the convergence is quicker and solution is optimal.