The Travelling Salesperson Problem is a famous problem in computer science. The gist of it is as follows: "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, … Continue reading Visualizing a Genetic Algorithm Attempting to Solve the Travelling Salesperson Problem