Moving Target Travelling Salesman Problem using Genetic Algorithm

In this paper, the Moving Target Travelling Salesman Problem (MTTSP) is described. In MTTSP, several sites are required to be visited which are moving with constant velocity in different directions. The distance of the sites from origin, velocity and the angle of movement are known in advance. The goal is to find the fastest tour starting and ending at the origin which intercepts all the sites. The method implemented using genetic algorithm approach on the various data sets and the results are compared with greedy approach.