A review on recent trends for solving travelling salesman problem using genetic algorithm
Rajesh Singh · Global Sci-Tech · 2017
NP-Complete and NP-Hard are toughest problems in computer science and engineering to solve. A lot of research has been done to solve these problems using traditional algorithm. Travelling Salesman Problem belong to NP-Complete set. In recent years many researches tries to solve this problems using soft computing techniques such as genetic algorithm. In this paper author discuss a critical review for solving TSP using genetic algorithm in recent years. A comparative analysis of the performance of different existing algorithms for solving TSP is also discussed. The comparative study will help many authors working in this area.