This document summarizes a research paper that proposes using a genetic algorithm to solve the travelling salesman problem (TSP). It begins by defining the TSP and explaining that it is NP-hard. The document then reviews various existing approaches that have used genetic algorithms and other metaheuristics to solve TSP. It proposes a genetic algorithm with tournament selection, two-point crossover, and interchange mutation operators. The algorithm is tested on sample problems with 15 cities and is shown to find optimal or near-optimal solutions. In conclusion, the document argues that genetic algorithms can efficiently find good solutions to TSP, especially when combined with knowledge from heuristic methods.