n = 7
×0.5(1 step / 2 frames)
Đề bài
7 thành phố · depot = 0 (đỏ) · ma trận đối xứng (Euclidean)
| · | 0 | 1 | 2 | 3 | 4 | 5 | 6 |
|---|---|---|---|---|---|---|---|
| 0 | — | 0.18 | 0.53 | 0.17 | 0.47 | 0.73 | 0.38 |
| 1 | 0.18 | — | 0.44 | 0.22 | 0.29 | 0.77 | 0.20 |
| 2 | 0.53 | 0.44 | — | 0.37 | 0.35 | 0.50 | 0.49 |
| 3 | 0.17 | 0.22 | 0.37 | — | 0.42 | 0.57 | 0.40 |
| 4 | 0.47 | 0.29 | 0.35 | 0.42 | — | 0.82 | 0.19 |
| 5 | 0.73 | 0.77 | 0.50 | 0.57 | 0.82 | — | 0.91 |
| 6 | 0.38 | 0.20 | 0.49 | 0.40 | 0.19 | 0.91 | — |
Brute Force
cost—
steps0
algo time—
anim time—
Dynamic Programming (Held–Karp)
cost—
steps0
algo time—
anim time—
Branch & Bound
cost—
steps0
algo time—
anim time—
Greedy (Nearest Neighbor)
cost—
steps0
algo time—
anim time—
Hopfield Neural Net
cost—
steps0
algo time—
anim time—