GLS Optimization Algorithm for Solving Travelling Salesman Problem
Nourolhoda Alemi Neissi, Masoud Mazloom · 2009
Travelling salesman problem (TSP) is well known as one of the combinatorial optimization problems. There are many approaches for finding solution to the TSP. In this paper we used combination of local search heuristics and genetic algorithm (GLS) that has been shown to be an efficient algorithm for finding near optimal to the TSP. We also evaluate the run time behavior and fitness of our approach and compare it with other methods. A reasonable result is obtained and the proposed algorithm is able to get to a better solution in less time.