International Journal of Engineering and Technology

Travelling Salesman Problem represents a class of problems in computer science. This problem has many application areas in science and engineering. Genetic Algorithm is used to solve these problems and the performance of genetic algorithm depends on its operators. In this paper new greedy genetic algorithm has been proposed to solve TSP. The proposed greedy genetic algorithm is applied and tested on some standard TSP problems; the obtained results are compared with existing methods and found better in terms of path length. The proposed greedy genetic algorithm search deeper in the search space and find better solutions as compared to existing algorithms. The proposed algorithm finds solutions which are approximately 5% better than the existing algorithm.