Research Article
Minimizing the Total Service Time of Discrete Dynamic Berth Allocation Problem by an Iterated Greedy Heuristic
Table 2
Information of 15 ships.
| | | | | | |
| 1 | 71 | 300 | 20 | 20 | 40 | 2 | 90 | 300 | 44 | 44 | 88 | 3 | 39 | 300 | 22 | 22 | 44 | 4 | 17 | 300 | 34 | 34 | 68 | 5 | 12 | 300 | 12 | 12 | 24 | 6 | 117 | 300 | 30 | 30 | 60 | 7 | 94 | 300 | 28 | 28 | 56 | 8 | 29 | 300 | 6 | 6 | 12 | 9 | 43 | 300 | 26 | 26 | 52 | 10 | 79 | 300 | 22 | 22 | 44 | 11 | 2 | 300 | 20 | 20 | 40 | 12 | 129 | 300 | 16 | 16 | 32 | 13 | 123 | 300 | 26 | 26 | 52 | 14 | 43 | 300 | 14 | 14 | 28 | 15 | 5 | 300 | 18 | 18 | 36 |
|
|