For Week 9, I tackled a classic optimization challenge: the **Traveling Salesperson Problem (TSP)**. The goal is to find the shortest possible route that visits a set of given nodes and returns to the origin.
Solving the traveling salesman problem using the Gurobi Solver, the farthest insertion algorithm, the nearest neighbor algorithm and, finally, using the 2-opt optimization method.
Simulations of Algorithms for AI Lab
Add a description, image, and links to the farthest-insertion topic page so that developers can more easily learn about it.
To associate your repository with the farthest-insertion topic, visit your repo's landing page and select "manage topics."