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

Table 4

The total travel cost and runtimes of the SODNDP, SODNDP-RC1, and SODNDP-AARC1 models under different available budgets when 𝜃=0.5.

𝐵	SODNDP	SODNDP solution time (sec)	SODNDP-RC1	SODNDP-RC1; solution time (sec)	SODNDP-AARC1	SODNDP-AARC1; solution time (sec)
10	4304.0727	0.05	27806.2868	0.06	6784.4727	25.30
20	4271.3455	0.06	27575.3434	0.06	6751.7455	34.95
30	4238.6182	0.06	27344.4000	0.06	6719.0182	29.41
40	4205.8909	0.06	27113.4566	0.06	6686.2909	67.55
50	4173.1636	0.08	26914.0258	0.05	6653.5636	26.08
60	4140.4364	0.06	26716.6065	0.05	6620.8364	32.89
70	4107.7091	0.06	26706.6727	0.06	6588.1091	59.81
80	4074.9818	0.05	26701.2182	0.05	6555.3818	68.64
90	4044.1811	0.06	26695.7636	0.06	6522.6545	79.20