An interactive Python tool to visualize and compare heuristic algorithms solving the Traveling Salesperson Problem (TSP). Ideally demonstrates the behavior of Hill Climbing, Genetic Algorithm, and Ant Colony Optimization
Evolver - Examining the Travelling Salesman Problem using the Berlin52 set, Final Year Project, NUI Maynooth, 2003
A high-performance distributed MPI solver for the Traveling Salesman Problem using Parallel Tempering. Features O(1) distance lookups and a synchronized deadlock-free communication protocol. Achieves 20.7x speedup and global optimality on the Berlin52 dataset in <0.4s.
Add a description, image, and links to the berlin52 topic page so that developers can more easily learn about it.
To associate your repository with the berlin52 topic, visit your repo's landing page and select "manage topics."