Please use this identifier to cite or link to this item:
|Title||Performance Comparison of Simulated Annealing, GA and ACO Applied to TSP|
The travelling salesman problem (TSP) is probably one of the most famous problems in combinatorial optimization. There are many techniques to solve the TSP problem such as Ant Colony Optimization (ACO), Genetic Algorithm (GA) and Simulated Annealing (SA).In this paper, we conduct a comparison study to evaluate the performance of these three algorithms in terms of execution time and shortest distance. JAVA programing is used to implement the algorithms using three benchmarks on the same platform conditions. Among the three algorithms, we found out that the Simulated Annealing has the shortest time in execution(<1s) but for the shortest distance, it comes in the second order. Furthermore, in term of shortest distance between the cities, ACO performs better than GA and SA. However, ACO comes in the last order in term of time execution.
|Published in||International Journal of Intelligent Computing Research (IJICR)|
|Series||Volume: 6, Number: 4|
|Item link||Item Link|
|Files in this item|