Research Article
The Ordered Clustered Travelling Salesman Problem: A Hybrid Genetic Algorithm
Table 2
The reduced cost matrix.
| Vertex | 1 | 2 | 3 | 4 | 5 | 6 | 7 |
| 1 | 999* | 67 | 91 | 0 | 27 | 46 | 0 | 2 | 22 | 999* | 66 | 25 | 68 | 0 | 0 | 3 | 86 | 0 | 999* | 10 | 23 | 21 | 23 | 4 | 0 | 34 | 0 | 999* | 48 | 33 | 38 | 5 | 44 | 30 | 0 | 31 | 999* | 34 | 39 | 6 | 6 | 32 | 68 | 9 | 0 | 999* | 31 | 7 | 18 | 0 | 12 | 35 | 21 | 29 | 999* |
|
|
(*Elements are left as 999).
|