Robust Scheduling for Berth Allocation and Quay Crane Assignment Problem

<table class="table-group" id="tab3"><tr><td><table class="table"><tr><td class="thead-hr" colspan="3"><hr/></td></tr><tr class="thead"><td align="left"> </td><td align="center">NSGAII</td><td align="center">SPEA2+</td></tr><tr><td class="thead-hr" colspan="3"><hr/></td></tr><tr><td align="left">SPEA2+</td><td align="center">0.00011</td><td align="center">—</td></tr><tr><td align="left">MOGA + SA</td><td align="center">&lt;2<i>e</i> − 16</td><td align="center">&lt;2<i>e</i> − 16</td></tr><tr class="table-tr"><td colspan="3"><hr class="tbody-hr"/></td></tr></table></td></tr></table>

Wilcoxon test over the hypervolumes obtained for a given instance.

Mathematical Problems in Engineering

tab3

Table 3

Table 3: Robust Scheduling for Berth Allocation and Quay Crane Assignment Problem 