Model and Algorithm for Container Allocation Problem with Random Freight Demands in Synchromodal Transportation

Table 8

Experimental results for large-scale problem: 2338 variables and 1105 constraints (20 times).

Methods	Best; (×10^7)	Average; (×10^7)	Worst; (×10^7)	Time; (×10^1 s)
GA	5.1493	5.0848	4.9471	13.42	—
SA	5.3107	3.7473	1.4473	20.93	—
SAGA	5.4416	5.4158	5.3831	7.58	—
B-and-B	#			#

# represents the exact optimal solution which cannot be obtained through the B-and-B method.