A New Search Algorithm for Solving Symmetric Traveling Salesman Problem Based on Gravity
Ali Asghar Rahmani Hosseinabadi · 2012
Abstract: Traveling Salesman Problem (TSP) is a famous and classic operation for combination of optimization problems which is very used. Many complex issues can be modeled as traveling salesman problems. Since TSP is a NP-complete problem, certain algorithms cannot be used for solving it. Hence heuristic methods are common to resolve these issues. This paper presents a new algorithm called TSP-GSA for solving the traveling salesman problem by means of Gravitational Search algorithm or GSA. This algorithm has used 2 parameters out of 4 main parameters of velocity and gravitational force in physics based on random search concepts. The proposed algorithm has been compared with the genetic algorithm [1] and experimental results showed that not only proposed algorithm has better performance but also it takes less time to be solved. Key words: Traveling Salesman Gravitational force Genetic algorithm Velocity Newton law