Research Article
A Heuristic Procedure for a Ship Routing and Scheduling Problem with Variable Speed and Discretized Time Windows
Table 3
Summary of results of instances of 40 contracts.
| | Instance | CPLEX | Heuristic | | Contracts | Ships | Nodes per window | Optimum found | Only feasible solution | No solution | Average time (sec) | Solution not found | Average time (sec) | GAP
O.F. (%) average |
| | 40 | 5 | 3 | 14 | 0 | 1 | 3.85 | 6 | 21.55 | 5.00 | | 40 | 5 | 6 | 15 | 0 | 0 | 42 | 3 | 82.50 | 8.11 | | 40 | 5 | 15 | 15 | 0 | 0 | 719.40 | 3 | 442.58 | 7.49 | | 40 | 7 | 3 | 15 | 0 | 0 | 8.66 | 0 | 33.93 | 6.27 | | 40 | 7 | 6 | 15 | 0 | 0 | 447.53 | 0 | 137.13 | 7.38 | | 40 | 7 | 15 | 12 | 3 | 0 | 1870.86 | 0 | 645.53 | 7.76 |
|
|
