Research Article Open Access

A STUDY OF GENETIC ALGORITHM TO SOLVE TRAVELLING SALESMAN PROBLEM

Abstract

This paper presents the literature survey review of Travelling Salesman Problem (TSP). TSP belongs to the category of NP-hard problems. A various number of methods have been designed to solve this problem. Genetic Algorithm is one of the best methods which is used to solve various NP-hard problem such as TSP. The natural evolution process is always used by genetic Algorithm to solve the problems. This paper presents a critical survey to solve TSP problem using genetic algorithm methods that are proposed by researchers.

Naveen Kumar, Karambir, Rajiv Kumar

To read the full article Download Full Article