Meta-heuristic Algorithm For Solving Travelling Salesman Problem

The travelling salesman problem (TSP) is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science. It asks the following question: given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city? Hower, today there are not exact algorithms to solve it in general case. Therefore, heuristic and approximation algorithms are especially interested. This paper proposes a new meta-heuristic algorithm based on local search for solving traveling salesman problem. This algorithm has been installed, tested on standard data sets taken from TSPLIB and obtained with quite good results