Solve the Traveling Salesman Problem across 30 major Pakistani cities with multiple algorithms
Implement and compare Nearest Neighbor, Brute Force, and Held-Karp algorithms for solving TSP.
Compare execution times, solution quality, and complexity across different algorithmic approaches.
Uses 30 major Pakistani cities with authentic GPS coordinates for practical route optimization.
Choose your starting city and watch algorithms build optimal routes in real-time.
Optimized implementation with efficient distance calculations and memory management.
Well-documented code demonstrating algorithm design patterns and complexity analysis.
Currently Selected: Karachi
Greedy heuristic that selects the closest unvisited city at each step. Fast but may not be optimal. Click Play to watch it explore the map of Pakistan!
Exhaustively examines all possible permutations to guarantee the optimal solution. Watch it explore all paths across Pakistan!
Optimal algorithm using dynamic programming with better scalability than brute force. See the optimal solution being built across Pakistan!
This project uses authentic geographic data of 30 major cities across Pakistan. Each city includes precise latitude and longitude coordinates from the Pakistan coordinate system, enabling accurate distance calculations for route optimization.
The dataset covers all regions of Pakistan from northern mountain cities like Islamabad to southern coastal areas like Karachi, providing a comprehensive geographic diversity for TSP analysis.