Dynamic Network Design Problem under Demand Uncertainty: An Adjustable Robust Optimization Approach

Table 2

The optimal solution of the SODNDP, SODNDP-RC1, and SODNDP-AARC1 when 𝐵=100.

Cell	SODNDP	SODNDP-RC1
𝜃	0	0.1	0.2	0.3	0.4	0.5	0.6	0.7	0.8	0.9	1.0
1	8.883	8.523	8.163	7.663	7.048	7.482	6.489	6.615	0.72	0	0
2	0.762	2.082	3.402	5.235	7.492	5.9	9.539	9.08	9.72	3.36	0
4	8.883	8.523	8.163	7.663	7.048	7.482	6.489	6.615	5.44	0	0
5	0	0	0	0	0	0	0	0	0	0	100
9	0.762	2.082	3.402	5.235	7.492	5.9	9.539	9.08	9.72	3.36	0
10	8.883	8.523	8.163	7.663	7.048	7.482	6.489	6.615	5.44	0	0
12	8.883	8.523	8.163	7.663	7.048	7.482	6.489	6.615	5.44	0	0
14	8.883	8.523	8.163	7.663	7.048	7.482	6.489	6.615	5.44	0	0
17	8.883	8.523	8.163	7.663	7.048	7.482	6.489	6.615	0.72	0	0
18	8.883	8.523	8.163	7.663	7.048	7.482	6.489	6.615	5.44	0	0
20	8.883	8.523	8.163	7.663	7.048	7.482	6.489	6.615	5.44	0	0
26	8.883	8.523	8.163	7.663	7.048	7.482	6.489	6.615	25.88	0	0
27	8.883	8.523	8.163	7.663	7.048	7.482	6.489	6.615	5.44	0	0
34	8.883	8.523	8.163	7.663	7.048	7.482	6.489	6.615	5.44	89.92	0
58	0.762	2.082	3.402	5.235	7.492	5.9	9.539	9.08	9.72	3.36	0
Cell		SODNDP-AARC1
𝜃		0.1	0.2	0.3	0.4	0.5	0.6	0.7	0.8	0.9	1.0
1		9.091	9.091	9.091	9.091	9.091	9.091	9.091	9.091	9.091	9.091
4		9.091	9.091	9.091	9.091	9.091	9.091	9.091	9.091	9.091	9.091
10		9.091	9.091	9.091	9.091	9.091	9.091	9.091	9.091	9.091	9.091
12		9.091	9.091	9.091	9.091	9.091	9.091	9.091	9.091	9.091	9.091
14		9.091	9.091	9.091	9.091	9.091	9.091	9.091	9.091	9.091	9.091
17		9.091	9.091	9.091	9.091	9.091	9.091	9.091	9.091	9.091	9.091
18		9.091	9.091	9.091	9.091	9.091	9.091	9.091	9.091	9.091	9.091
20		9.091	9.091	9.091	9.091	9.091	9.091	9.091	9.091	9.091	9.091
26		9.091	9.091	9.091	9.091	9.091	9.091	9.091	9.091	9.091	9.091
27		9.091	9.091	9.091	9.091	9.091	9.091	9.091	9.091	9.091	9.091
34		9.091	9.091	9.091	9.091	9.091	9.091	9.091	9.091	9.091	9.091