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

Table 3

The optimal objective and solution time of the SODNDP, SODNDP-RC1, and SODNDP-AARC1 models under different uncertainty levels when 𝐵=100.

𝜃	SODNDP	SODNDP; solution time (sec)	SODNDP-RC1	SODNDP-RC1; solution time (sec)	SODNDP-AARC1	SODNDP-AARC1; solution time (sec)
0.1	4017.0113	0.08	16434.0362	0.06	4505.6073	83.09
0.2			18757.4762	0.06	5001.6873	34.63
0.3			21123.6929	0.06	5497.7673	65.28
0.4			23525.3110	0.06	5993.8473	93.75
0.5			26690.3091	0.06	6489.9273	86.87
0.6			30183.6424	0.05	6986.0073	36.84
0.7			33688.2109	0.06	7482.0873	50.98
0.8			37206.0000	0.05	7978.1673	83.61
0.9			40735.8000	0.06	8474.2473	48.67
1.0			44265.6000	0.03	8970.3273	188.84