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

Table 6

The computational results.

Sets											Time (×10^1)	Best (×10^1)	Average (×10^7)
1	0.3	0.7	120	60	80	0.09	5000	0.7	90	12	7.64	1.9200	1.9100	1.18%
2	0.1	0.9	50	30	50	0.13	2000	0.9	100	10	2.36	1.9088	1.8837	1.75%
3	0.2	0.8	110	60	70	0.12	5000	0.9	110	12	11.07	1.9138	1.9031	1.50%
4	0.3	0.7	60	30	50	0.14	5000	0.9	80	13	2.63	1.9020	1.8655	2.10%
5	0.2	0.7	120	60	80	0.11	5000	0.8	110	10	8.96	1.9127	1.9082	1.55%
6	0.1	0.8	80	40	60	0.14	3000	0.9	100	14	6.58	1.9133	1.8772	1.52%
7	0.1	0.8	50	50	70	0.12	3000	0.9	120	10	3.91	1.9119	1.8991	1.59%
8	0.1	0.8	110	30	50	0.07	4000	0.8	120	12	3.59	1.9092	1.8718	1.73%
9	0.4	0.9	80	60	80	0.14	5000	0.7	80	15	8.31	1.9160	1.8923	1.38%
10	0.4	0.8	80	60	80	0.14	4000	0.8	110	15	11.31	1.9164	1.9010	1.36%
Average												1.9124	1.8901