Ant Colony Optimization for solving the TSP symetric with parallel processing

This paper describes the symmetric travelling salesman problem (TSP) with 22 and 1060 cities with Euclidean distances and its solution with different ACO variants using parallel processing. We implemented the algorithms Elitist Ant System (EAS) and Rank Based Ant System (ASrank) with parallel processing to find optimal results for TSP.