| Summary: | INTRODUCTION: Traveling Salesman Problem (TSP) is one of the vast research areas and has been considered as subproblems in many fields apart from computer science and also in the field of computer science.OBJECTIVES: This paper deals with the comparison of Ant System Ant System (AS) which is a variant of Ant ColonyOptimization.METHODS: The performance of the Ant System is analysed by applying it on the Travelling Salesman Problem (TSP).The optimal results found on TSP using AS has been analysed with the elapsed time taken to find the optimal results, itsmean, median, variance and the standard deviation.RESULTS: And also, the quality of solutions has been made by calculating the percentage of the optimality and thedeviation of the solutions from the TSPLIB provides best known solutions. For instances, TSPLIB data sets have beenused.CONCLUSION: Totally, 7 instances have been executed with three different set of parameters for AS and the results areanalysed in terms of different parameter settings and performance metrics on each of it. The role of parameters has alsobeen discussed along with the experimental results.
|
|---|
