The authors had conducted a research on five algorithms which is Ant Colony Optimization, Hill Climbing Algorithm, Nearest Neighbor Algorithm, Recursive Brute Force Algorithm and Simulated Annealing Algorithm. The reason of the authors compared five algorithms is identify the features of the algorithms and generate the best result for solving the Travel Salesman Problem. The platform utilized for comparison of the five optimization algorithms is using Intelli J with the programming language Java. In this paper, the authors had discussed about the definition of the five algorithms, how to implement in the Travel Salesman Problem and generate the result as well as the advantages and disadvantages.
Volume 12 | 07-Special Issue
Pages: 877-883
DOI: 10.5373/JARDCS/V12SP7/20202178