Abstract

Various combinatorial optimization problems like Traveling Salesman Problem are solved using numerous nature inspired optimization techniques. In this paper, Magnetic Opti- mization Algorithm and Ant Colony Optimization techniques are described for solving Traveling Salesman Problem. In magnetic optimization algorithm, each magnetic agent or particle in MOA is represented by a candidate solution of Traveling Salesman Problem. The magnetic force between the particles strength is inversely proportion to distance calculated by TSP. Particles with higher magnetic force, attract relatively lower magnetic force particles. The process is repeated until a stopping condition is satisfied, and the best found solution will be considered the solution with lowest distance. The Ant Colony Optimization (ACO) is an evolutionary techniques to solve TSP. The quality of the solution is further compared with the optimal solution and computation time.