Research Article

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

Table 4

Computational result for I3 problem set.

InstanceGSPPPTA/LPCS SARS IG
OptimalTimeBest objectiveTimeBest objectiveTimeBest objectiveTime to obtain the optimalBest objectiveTime to obtain the optimal

i01140917.92140974.61140912.4714090.5114091.53
i02126115.77126160.75126112.5912610.0512610.11
i03112913.541129135.45112912.6411290.1711290.28
i04130214.481302110.17130212.5913020.0913020.32
i05120717.211207124.70120712.6812070.0712070.07
i06126113.85126178.34126112.5612610.0012610.00
i07127914.601279114.20127912.6312790.4012790.54
i08129914.21129957.06129912.5712990.2912990.71
i09144416.51144496.47144412.5814440.2114440.57
i10121314.16121399.41121312.6112130.1112130.18
i11136814.13136999.34136812.5813681.1113683.29
i12132515.60132580.69132512.5613251.4913253.90
i13136013.87136089.94136012.6113600.0413600.07
i14123315.60123373.95123312.6712330.0512330.09
i15129513.52129574.19129513.8012950.0012950.10
i16136413.681365170.36136414.4613641.8613642.89
i17128313.37128346.58128313.7312830.0212830.07
i18134513.51134584.02134512.7213450.0013450.10
i19136714.591367123.19136713.3913673.6713674.24
i20132816.64132882.30132812.8213281.0013286.37
i21134113.371341108.08134112.6813412.0613414.27
i22132615.241326105.38132612.6213260.5013261.18
i23126613.65126643.72126612.6212660.0612660.12
i24126015.58126078.91126012.6412600.0712600.39
i25137615.80137696.58137612.6213763.6013766.45
i26131815.381318101.11131812.6213180.4513181.33
i27126115.52126182.86126112.6412610.0912610.28
i28135916.22136052.91135912.71135911.41135911.57
i29128015.301280203.36128012.6212801.0712805.25
i30134416.52134471.02134412.5813441.8613442.33

Avg.1306.814.981306.993.991306.812.791306.81.081306.81.95