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

Table 3

Capacity and demands information.

Freight type	Total available capacity (TEU) in the planning horizon: 40000
	Dalian		Zhengzhou		Chongqing
	Scenario 1	Scenario 2	Scenario 1	Scenario 2	Scenario 1	Scenario 2
1	2400	2200	3800	3500	3800	3200
2	3200	3100	4500	4100	2700	2300
3	2500	2300	3200	2900	3400	3100
4	4400	4200	1900	1500	3500	3000
Transportation mode	The requested bottom supply of capacity for each transportation mode to each destination
Road	3000		4000		3000
Rail	4000		5000		4000
River	3000		3000		4000