Minimizing the Total Service Time of Discrete Dynamic Berth Allocation Problem by an Iterated Greedy Heuristic

<table class="table-group" id="tab8"><tr><td><table class="table"><tr><td class="thead-hr" colspan="4"><hr/></td></tr><tr class="thead"><td align="left">IG vs.</td><td align="center">PTA/LP</td><td align="center">CS</td><td align="center">SA<sub>RS</sub></td></tr><tr><td class="thead-hr" colspan="4"><hr/></td></tr><tr><td align="left">Difference</td><td align="center">2.5212</td><td align="center">0.7791</td><td align="center">0.0000</td></tr><tr><td align="left">Degree of freedom</td><td align="center">29</td><td align="center">29</td><td align="center">29</td></tr><tr><td align="left"><svg height="8.35422pt" id="M216" style="vertical-align:-0.2130003pt" version="1.1" viewbox="-0.0498162 -8.14122 4.73688 8.35422" width="4.73688pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.0135,0,0,-0.0135,0,0)"><path d="M324 430H196L233 583L223 592L145 529L120 430H54L29 396L31 388H111L56 126C33 15 54 -12 77 -12C137 -12 214 57 250 95L233 119C208 92 155 59 138 59C126 59 120 70 131 125L186 390L298 394L324 430Z" id="g113-117"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="341" vert-adv-y="341"></glyph.data></g></svg>-value</td><td align="center">13.2444</td><td align="center">6.5597</td><td align="center">0.0000</td></tr><tr><td align="left">One-tailed significance</td><td align="center">&lt;0.0001</td><td align="center">&lt;0.0001</td><td align="center">0.5000</td></tr><tr class="table-tr"><td colspan="4"><hr class="tbody-hr"/></td></tr></table></td></tr></table>

Paired <svg height="8.35422pt" id="M215" style="vertical-align:-0.2130003pt" version="1.1" viewbox="-0.0498162 -8.14122 4.73688 8.35422" width="4.73688pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.0135,0,0,-0.0135,0,0)"><path d="M324 430H196L233 583L223 592L145 529L120 430H54L29 396L31 388H111L56 126C33 15 54 -12 77 -12C137 -12 214 57 250 95L233 119C208 92 155 59 138 59C126 59 120 70 131 125L186 390L298 394L324 430Z" id="g113-117"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="341" vert-adv-y="341"></glyph.data></g></svg>-tests on the average RER for I3 problem set.

The Scientific World Journal

tab8

Table 8

Table 8: Minimizing the Total Service Time of Discrete Dynamic Berth Allocation Problem by an Iterated Greedy Heuristic 