Ant Colony Optimization (ACO) is a meta-heuristic for solving combinatorial optimization problems. Among the social behavior inspired algorithms, Ant colony algorithm has proved to be better one. In this master thesis, I propose a comparison between ACO algorithm and Genetic algorithm in solving Multiple Travelling Salesmen Problem. The main objective of the algorithms is to minimize the cost function. The design of algorithm is to be made by MATLAB software and the results are analyzed using the same.
These two algorithms and their different variants have been studied and tested on many conditions. They have been compared through the analysis of more than one graph and different configurations. The results obtained have helped us to have a better understanding of the problem and provide indications and suggestions for further research.