Table 4 Obtained optimal or near-optimal solutions for case study 1
Runs | The optimal or near-optimal solutions | Penalty costs | Running time (s) |
|---|---|---|---|
1 | {2, 3, 10, 8, 4, 7, 9, 1, 5, 6} | 7 | 1.756 |
2 | {2, 3, 10, 8, 4, 7, 9, 6, 5, 1} | 7 | 1.679 |
3 | {2, 3, 10, 8, 4, 7, 9, 5, 1, 6} | 7 | 1.794 |
4 | {2, 3, 10, 8, 4, 7, 9, 5, 6, 1} | 7 | 2.146 |
5 | {3, 2, 10, 8, 4, 7, 9, 6, 5, 1} | 7 | 2.182 |