Distributed C/MPI parallel-tempering TSP solver with TSPLIB validation and a repeated 1–24 process strong-scaling benchmark.

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