Moving Target Travelling Salesman Problem using Genetic Algorithm

Abstract

Travelling salesman problem (TSP) is a combinatorial optimization problem. It is NP hard problem and TSP is the most intensively studied problem in the area of optimization. But with the increase in the number of cities, the complexity of the problem goes on increasing. In this paper, we have solved Travelling Salesman Problem using Genetic algorithm approach. System starts from a matrix of the calculated Euclidean distances between the cities to be visited by the travelling salesman and randomly chosen city order as the initial population. Then new generations are created repeatedly until the proper path is reached upon reaching a stopping criterion.