Viewing: Algorithm Visualization
Route Order
None
Interactive Optimization & Heuristic Benchmarking Lab
None
Distances are computed using cyclic Euclidean metric. Brute force enumerates n! permutations (n ≤ 10). 2-opt applies first-improvement local search.
| Method | Distance | Time Taken | Gap vs Optimal | Complexity | Iterations | Match |
|---|---|---|---|---|---|---|
| User | - | - | - | - | - | — |
| Greedy | - | - | - | O(n²) | - | — |
| 2-opt (Local Search) | - | - | - | O(n²) | - | — |
| Brute Force | - | - | - | O(n!) | - | ✓ Optimal |