Абстрактный

Open Loop Travelling Salesman Problem using Genetic Algorithm

AKSHATHA .P.S, VASUDHA VASHISHT, TANUPRIYA CHOUDHURY

Genetic algorithm is an optimization technique based on crossover and mutation operators using a survival of the fittest idea. They have been used successfully in a variety of different problems. Travelling salesman problem is one of the commonly studied optimization problem. In the travelling salesman problem we wish to find a tour of all nodes in a weighted graph so that the total weight is minimized. In this paper a single salesman travels to each of the cities but does not close the loop by returning to the city he started from and each city is visited by the salesman exactly once.