A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
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 founddoi:10.21817/ijet/2017/v9i2/170902188 fatcat:lhyk6vfbsjahfnjnb3cxhoz57q