Optimization Approach for Yard Crane Scheduling Problem with Uncertain Parameters in Container Terminals

Table 3

The experiment result comparison of algorithms.

Number of tasks	Number of YCs	Deterministic environment				Uncertain environment with 20 scenarios
		POP rule		FCFS rule		GAPSO
		Obj	CT (s)	Obj	CT (s)	Obj	CT (s)
10	1	78.6	0.01	65.6	0.42	39.4	57.76
10	2	31.6	0.01	14.0	0.28	11.4	63.01
20	2	78.0	0.02	34.4	0.40	31.6	89.37
20	3	24.6	0.02	19.4	0.46	18.6	105.09
30	3	36.2	0.03	30.2	0.55	31.4	151.16
30	4	27.4	0.03	27.0	0.63	28.2	182.87

Note: “Obj” represents the objective function value and “CT” represents computational time.