An optimized algorithm for solving travelling salesman problem using greedy cross over operator
Jay Shankar Prasad, Vinod Jain · International Conference on Computing for Sustainable Global Development · 2016
Travelling Salesman Problem is a NP-hard problem and has many applications in various trades of engineering and technology. It is a class of problems that satisfy some specific constraints. Genetic algorithm uses evolutionary approach to solve Travelling Salesman Problem using some genetic operators such as selection, cross over and mutation. In this paper a new genetic cross over operator using greedy approach has been proposed. The algorithm has been implemented and results are better than existing cross over techniques.