Comparative analysis of solving traveling salesman problem using artificial intelligence algorithms

This paper aims to provide a comparative study of the different artificial intelligence (AI) algorithms applied to solve the traveling salesman problem (TSP). Four (4) AI algorithms such as genetic algorithm, nearest neighbor, ant colony optimization, and neuro-fuzzy are executed in MatLab software to determine which among these techniques will provide the least execution time to solve a TSP. The objective of comparing and analyzing each AI algorithm as applied to a single problem with the different program execution - is to identify if significant difference in execution time could lead to significant saving in energy consumption. The simulations using MatLab resulted to strong correlation at an R
²
of 0.95 in the average execution time with the number of code lines, but do not give a significant execution time variance as when ANOVA and t-test measures were performed. The result of this paper could be used as a basis in the design phase of software development life cycle to arrive into an energy efficient software application with respect to time needed to execute a program.