The travelling salesman problem (TSP) asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city and returns to the origin city?" It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science. - Wikipedia
- Change parameters like No. of cities, Population Size and Mutation Rate
- Compare Genetic Algorithm with Brute Force (Complete Search) that runs in O(N!) time