Travelling Salesman Problem Solution
Find the shortest route that visits all cities exactly once and returns to the starting point using various optimization algorithms including heuristics and metaheuristics.
Algorithm Selection
Choose the algorithm to solve the Travelling Salesman Problem
Nearest Neighbor: Starts from a city and always moves to the nearest unvisited city. Fast but may not find the optimal solution.
Complexity: O(n²)
Cities (5)
Add cities with their X and Y coordinates. These coordinates represent the city's position in a 2D plane, and the solver calculates distances between cities based on these values.
No Solution Yet
Configure your cities and select an algorithm to solve the TSP
• Add at least 3 cities
• Choose an algorithm
• Click "Solve TSP"