Lwin, Hnin Thant
(Eleventh International Conference On Computer Applications (ICCA 2013), 2013-02-26)
The Travelling Salesman Problem (TSP) is one of the hardest and the most fundamental problems in Computer Science. Although several techniques have been used in the past to reduce the running time of TSP, Genetic algorithms ...