Research Article
A Heuristic Procedure for a Ship Routing and Scheduling Problem with Variable Speed and Discretized Time Windows
Table 2
Summary of results of instances of 30 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 |
| | 30 | 4 | 3 | 13 | 0 | 2 | 1 | 3 | 4.80 | 4.79 | | 30 | 4 | 6 | 13 | 0 | 2 | 4.84 | 2 | 15.92 | 5.36 | | 30 | 4 | 15 | 13 | 0 | 2 | 171.84 | 2 | 93.15 | 5.53 | | 30 | 5 | 3 | 15 | 0 | 0 | 1.13 | 0 | 7.06 | 4.34 | | 30 | 5 | 6 | 15 | 0 | 0 | 12.73 | 0 | 26.53 | 5.49 | | 30 | 5 | 15 | 15 | 0 | 0 | 140.60 | 0 | 151.40 | 5.49 |
|
|
