Experimental Analysis of Ant System on Travelling Salesman Problem Dataset TSPLIB


  • Kalaipriyan Thirugnanasambandam Madanapalle Institute of Technology and Science
  • Raghav. R.S SASTRA University image/svg+xml
  • Saravanan. D KL Deemed to be University
  • Prabu. U Velagapudi Ramakrishna Siddhartha Engineering College
  • Rajeswari. M Sri Manakula Vinayagar Engineering College




Ant Colony Optimization, Ant System, Travelling Salesman Problem, TSPLIB


INTRODUCTION: Traveling Salesman Problem (TSP) is one of the vast research areas and has been considered as sub problems 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 Colony Optimization.

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, its mean, median, variance and the standard deviation.

RESULTS: And also, the quality of solutions has been made by calculating the percentage of the optimality and the deviation of the solutions from the TSPLIB provides best known solutions. For instances, TSPLIB data sets have been used.

CONCLUSION: Totally, 7 instances have been executed with three different set of parameters for AS and the results are analysed in terms of different parameter settings and performance metrics on each of it. The role of parameters has also been discussed along with the experimental results.


Download data is not yet available.




How to Cite

Thirugnanasambandam K, R.S R, D S, U P, M R. Experimental Analysis of Ant System on Travelling Salesman Problem Dataset TSPLIB. EAI Endorsed Trans Perv Health Tech [Internet]. 2019 Aug. 23 [cited 2024 Apr. 18];5(19):e4. Available from: https://publications.eai.eu/index.php/phat/article/view/1262