The Comparison of Genetic Algorithm and Ant Colony Optimization in Completing Travelling Salesman Problem

Abstract

Traveling Salesman Problem abbreviated as TSP, is a NP-hard problem that is often applied in various applications. TSP is a polynomial problem, so the solution is exponential. One way to improve the resolution of NP-hard problems is to use probabilistic algorithms such as genetic algorithms, ant colony optimization algorithms, and others. In this study genetic algorithm (GA) was applied with ordered crossover method and reciprocal mutation method. And also use the ant colony algorithm (ACO). This research will compare the performance of the two algorithms. The data used are 10, 20, ..., 100 cities, so the result shows that the ant colony algorithm is able to find a shorter distance than the genetic algorithm, but the genetic algorithm shows a better speed of completion than the ant colony algorithm.