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

Authors: Hua Sun; Ziyou Gao; Fangxia Zhao
Journal: Discrete Dynamics in Nature and Society
 (2014)

---

## Abstract

This paper develops an adjustable robust optimization approach for a network design problem explicitly incorporating traffic dynamics and demand uncertainty. In particular, a cell transmission model based network design problem of linear programming type is considered to describe dynamic traffic flows, and a polyhedral uncertainty set is used to characterize the demand uncertainty. The major contribution of this paper is to formulate such an adjustable robust network design problem as a tractable linear programming model and justify the model which is less conservative by comparing its solution performance with the robust solution from the usual robust model. The numerical results using one network from the literature demonstrate the modeling advantage of the adjustable robust optimization and provided strategic managerial insights for enacting capacity expansion policies under demand uncertainty.


---

## Body

## 1. Introduction

Over the past three decades, network design problem (NDP) has been pervasively studied and applied in the different fields, such as transportation, production, distribution, and communication. The different research field is corresponding to different sets of objectives, decision variables, and resource constraints, implying different behavioral and system assumptions, and possessing varying parameters and data requirements and capabilities in terms of representing the network supplies and demands [1]. NDP models have been extensively used as a decision-making tool and provide the guidelines for enacting the capacity expansion policies. In transportation, network design models in general aim at maximizing the social benefit (or minimizing the total travel costs) through implementing an optimal capacity expansion policy in the network.However, traditional NDP models for transportation networks assume that the demand or/and capacity are deterministic. Obviously, this is unrealistic, because the real-life transportation network systems are surrounded by a number of uncertainties, both from the supply side and demand side. Evaluation of network performance without accounting for demand uncertainty can potentially lead to biased investment decisions [2]. Therefore, recently, NDPs under uncertainty have drawn increasing attentions. Chen et al. [3] provided a state-of-the-art review of the transportation network design problem under uncertainty.However, the vast body of the literature in the past has focused on the static NDPs [4–6]. Lin et al. [7] pointed out the three drawbacks of the static NDP models when compared with the dynamic NDP (DNDP) models. Therefore, to overcome these deficiencies, a variety of recent papers have focused on dynamic NDP models [7–11]. In dynamic NDP models, dynamic traffic assignment (DTA) models are used to model the time-dependent variation of traffic flows and travel behaviors and characterize the transportation network flow pattern. Janson [12] and Waller [13] showed that the DTA-based NDP model is more desirable than the static model. According to their formulations, DTA-based NDP models can be classified into two categories: single-level models and bilevel models [7]. The focus of this paper is on the application adjustable robust optimization (ARO) for the single-level dynamic NDP under demand uncertainty, where the single-level structure is adopted because it can provide an easier way to manipulate affinely adjustable robust counterpart (AARC) and make adjustable robust dynamic NDP (ARDNDP) to be computationally tractable.There is an increasing body of relevant literature on the DTA-based NDP under uncertainty [1, 2, 10, 14–18]. The common feature of these studies is that the cell transmission model (CTM) [19, 20] is adopted to model the time-varying traffic flows propagation, and the traffic demand is assigned to the network by either the dynamic system-optimal (SO) [21] or user-optimal (UO) [10] principle. The approaches of addressing uncertainty in above-mentioned studies mainly are stochastic programming (SP) and robust optimization (RO). However, these approaches suffer from deficiencies related to lack of data availability or are overly conservative, which seriously limit their applicability in traffic management and control.In this paper, we employ the ARO approach to develop the single-level CTM-based system-optimal NDP model. Given the fact that the single-level CTM-based NDP model has a linear programming formulation, we use the ARO method [22] to formulate the ARDNDP, which overcomes the limitation of stochastic optimization and usual robust optimization [23–27]. Specifically, not only is there no such assumption that the probability distribution of uncertain demand is known but also it is less conservative than robust dynamic NDP in our model. Similar to robust optimization approach, we only need to simply specify a closed set to limit the demand uncertainty, which is readily implemented in most applications. The adjustable robust counterpart (ARC) of system-optimal DNDP (SODNDP) can be reformulated as the computationally tractable affinely adjustable robust counterpart (AARC) of SODNDP by using prescribed uncertainty set and the affine decision rule.We emphasize the main contributions of this paper at a glance below.We provide an ARO framework for the SO DTA-based ARDNDP. Note that we describe the ARDNDP model only for single-destination, system-optimal networks. However, this is unrealistic. How to extend the basic ARCC formulation method to the multidestination problem case is our future research direction.An appealing feature of our AARC is that it is less conservative than the usual RC. Moreover, AARC is still a linear programming model. So, in general, it is computationally tractable and can be solved in polynomial time by a few well-known solution algorithms.Our numerical example demonstrates the value of ARO in the context of dynamic NDP. The computation viability is demonstrated for the proposed modeling framework. The numerical analysis for the impact of investment budget bound and the demand uncertainty level on the network design solution justifies the solution robustness and flexibility.The remaining part of this paper is structured as follows. Section2 provides a discussion of the relevant literature. In Section 3, we describe the formulation given by [21] as a CTM-based deterministic dynamic NDP. Section 4 proposes an affinely adjustable robust counterpart formulation of the dynamic NDP under demand uncertainty by using the affine decision rule. In Section 5, we develop a traditional robust counterpart formulation of the dynamic NDP under demand uncertainty. Numerical experiments and results analysis are elaborated in Section 6. Finally, Section 7 concludes the paper and proposes the potential future extensions.


## 2. Literature Review

Dynamic NDP is at the core of many transportation planning problems and has been extensively studied in the literature. Although a great amount of attention has been paid to the deterministic dynamic NDP in the past years, increasing efforts are focusing on incorporating uncertainty in the dynamic NDP because the researchers have realized that input data and parameters have the inherently uncertain nature and uncertain input data and parameters may have a drastic impact on the optimality and the feasibility of the solution. Therefore, various modeling techniques are applied to cope with uncertainty, which mainly include Monte-Carlo sampling approach, chance-constrained programming (CCP), a two-stage stochastic programming with recourse (SLP2), scenario-based robust optimization, and set-based robust optimization. Karoonsoontawong and Waller [15] applied Monte-Carlo bounding techniques to solve the stochastic SO and UO dynamic NDP. They showed that it is more beneficial to solve a stochastic model than a deterministic model. Waller and Ziliaskopoulos [14] formulated the CCP and SLP2 models of single-level CTM-based SO NDP under demand uncertainty. Ukkusuri and Waller [10] introduced the CTM-based single-level UO versions of CCP and SLP2 and compared them with the corresponding SO versions. Karoonsoontawong and Waller [17] proposed a SLP2 model of CTM-based bilevel NDP. Karoonsoontawong and Waller [18] further developed a SLP2 model of CTM-based bilevel combined NDP and signal setting design (SSD). The above-mentioned CTM-based NDP models were, however, developed by the Monte-Carlo sampling, CCP, or SLP2 approach and it is necessary for the modeler users to know the probability distributions of the uncertain input data and parameters in order to use these models. In fact, the distributions may be unavailable (inaccurate) in reality because we may have no (insufficient) data to calibrate the distributions. Therefore, robust optimization was introduced recently to address the limitations of CTM-based NDPs or DTA. According to Chung et al. [1], robust optimization can be roughly classified into two groups: (
1
) scenario-based robust optimization and (
2
) set-based robust optimization.Mulvey et al. [28] developed a scenario-based RO approach for general linear programming. Karoonsoontawong and Waller [16] used this approach to propose the CTM-based bilevel NDP model with exact solution methods and developed three metaheuristics for multiorigin multidestination large problem: simulated annealing, genetic algorithm, and random search. Karoonsoontawong and Waller [17] adopted the same approach to formulate CTM-based single-level SO and UO versions of NDP models and bilevel NDP model and compared them. Karoonsoontawong and Waller [18] presented a bilevel scenario-based robust model for the CTM-based combined NDP and SSD. Similar to Monte-Carlo sampling, CCP, and SLP2, the scenario-based RO approach also need to know the probability of each scenario in advance. In additional, the numerous scenarios used in accurately representing the uncertainty can lead to large, computationally challenging problems and the solution obtained may be sensitive to possible uncertainty outcomes.To overcome the limitation of Monte-Carlo sampling, CCP, SLP2, and scenario-based RO approaches, the set-based RO approach has been applied to cope with uncertain input data and parameters. Unlike Monte-Carlo sampling, CCP, SLP2, and scenario-based RO approaches, the set-based RO approach [23–27] does not require the assumption that the probability distributions of the uncertain input data and parameters are known, while the uncertain input data and parameters are assumed to belong to a bounded and convex set. Therefore, recently, the set-based RO has been applied to not only static NDP [29–31] but also CTM-based dynamic NDP or DTA. In CTM-based dynamic NDP or DTA, Chung et al. [1] applied the set-based RO approach to formulate a single-level robust NDP model under demand uncertainty, in which the demand uncertainty is assumed to belong to a box set. Yao et al. [32] used the polyhedral, box, and ellipsoid as uncertain set to develop the CTM-based system-optimal DTA (SODTA). Chung et al. [33] used the set-based RO approach to develop dynamic congestion pricing under dynamic user equilibrium. They proposed a bilevel cellular particle swarm optimization (BSCPO) algorithm to solve the corresponding robust counterpart and compared it with bilevel simulated annealing (BSA) and cutting plane-based simulated annealing (CPSA) algorithms. They showed that the BSCPO algorithm proposed outperforms these two alternative algorithms through test results. However, the robust solutions obtained in the above set-based RO studies are overly conservative. Therefore, Ben-Tal proposed an adjustable robust optimization formulation (ARO) for general linear programming that can alleviate the conservatism of robust solutions obtained through the usual RO approach. Ben-Tal et al. [34] applied the ARO methodology to solve the CTM-based SODTA under demand uncertainty. The polyhedral set is adopted as the uncertain demand set, and the affinely adjustable robust counterpart (AARC) was reformulated as linear programming by using the affine decision rule and duality theory. In this paper, we extend ARO approach to the CTM-based SO NDP model and provide guidance for making capacity expansion plans under uncertainty in context of transportation network design problem.


## 3. Deterministic Model

In this section, we present the deterministic version of the CTM-based single-level SO dynamic NDP model, which provides the basic modeling platform and functional form the ARDNDP model we will introduce in the next section. For discussion convenience, we present the notation used throughout these models (see Notations).The CTM-based single-level SO dynamic DNP (SODNDP) model aims at minimizing the total travel cost, which is the sum of the product of the number of vehicles in each cell in each time interval and the corresponding travel cost. To penalty unmet demand by the end of time horizonT, the travel cost in cell i at time t, c
i
t, is set as follows:
(1)
c
i
t
=
{
1
i
∈
C
∖
C
s
,
t
≠
T
M
i
∈
C
∖
C
s
,
t
=
T
,
where M is a sufficiently large positive number to represent the penalty cost, which can be interpreted as the cost of a vehicle that cannot arrive at the destination by the end of time horizon T. Use of the penalty cost has the effect of minimizing the number of vehicles staying in the network by the end of the time horizon T. By assuming SO principle and the linear relationship between investment and capacity increase and using the notation in Notations, the deterministic CTM-based single-level SODNDP can be formulated as the following linear programming [9]:SODNDP:(2)
min
⁡
x
,
y
,
b
∑
t
∈
ℑ
∑
i
∈
C
∖
C
s
c
i
t
x
i
t
(3)
subject
to
x
i
t
-
x
i
t
-
1
-
∑
k
∈
C
a
k
i
y
k
i
t
-
1
+
∑
j
∈
C
a
i
j
y
i
j
t
-
1
=
d
i
t
-
1
,
22222222222222222222222222222.2
∀
i
∈
C
R
,
t
∈
ℑ
,
(4)
x
i
t
-
x
i
t
-
1
-
∑
k
∈
C
a
k
i
y
k
i
t
-
1
+
∑
j
∈
C
a
i
j
y
i
j
t
-
1
=
0
,
2222222222222222222
∀
i
∈
C
∖
C
R
∪
C
S
,
t
∈
ℑ
,
(5)
∑
j
∈
C
a
i
j
y
i
j
t
≤
x
i
t
,
∀
i
∈
C
∖
C
S
,
t
∈
ℑ
,
(6)
∑
k
∈
C
a
k
i
y
k
i
t
≤
δ
i
t
(
N
i
t
+
χ
i
b
i
-
x
i
t
)
,
222222222222.2
∀
i
∈
C
∖
C
R
∪
C
S
,
t
∈
ℑ
,
(7)
∑
k
∈
C
a
k
i
y
k
i
t
≤
Q
i
t
+
ϕ
i
b
i
,
2222222.2
∀
i
∈
C
∖
C
R
∪
C
S
,
t
∈
ℑ
,
(8)
∑
j
∈
C
a
i
j
y
i
j
t
≤
Q
i
t
+
ϕ
i
b
i
,
2222222.2
∀
i
∈
C
∖
C
S
,
t
∈
ℑ
,
(9)
x
i
0
=
x
^
i
,
∀
i
∈
C
∖
C
S
,
(10)
y
i
j
0
=
0
,
∀
(
i
,
j
)
∈
C
×
C
,
(11)
x
i
t
≥
0
,
∀
i
∈
C
∖
C
S
,
t
∈
ℑ
,
(12)
y
i
j
t
≥
0
,
∀
(
i
,
j
)
∈
C
×
C
,
t
∈
ℑ
,
(13)
b
i
≥
0
,
∀
i
∈
C
∖
C
S
,
(14)
∑
i
∈
C
∖
C
s
b
i
≤
B
.
The objective function of SONDP presents the total travel cost, which provides an optimistic estimate or lower bound of total cost as it simplifies the original CTM model by Daganzo [19, 20] and allows vehicle holding [35]. Both constraints (3) and (4) are the flow conservation constraints in cell i at time interval t. Because only the source cells generate demand, the right-hand side of (3) is set as d
i
t
-
1 and the right-hand side of (4) is equal to 0. Constraint (5) bounds the total outflow rate of a cell by its current occupancy. Constraint (6) represents that the total inflow rate of a cell is bounded by its remaining capacity. Constraints (7) and (8) ensure that the total inflow and outflow rate of a cell are limited by the expandable inflow and outflow capacity, respectively. The remaining constraints, from (9) to (13), report the initial conditions and nonnegativity conditions. Constraint (14) guarantees that the total cost of expansion is within the available budget.


## 4. Affinely Adjustable Robust Formulation

In this section, we firstly develop the adjustable robust counterpart (ARC) of the SODNDP model, which incorporates the demand uncertainty into a linear programming problem via the ARO approach. However, the formulation of ARC is intractable since it is a semi-infinite program. Then, we reformulate the ARC of SODNDP as a tractable linear programming by using the affine decision rules proposed by Ben-Tal et al. [22]. In the SODNDP, constraint (3) is the only set of constraints related to demand generation. Constraint (3) can be reformulated as the following inequality constraint [1, 36]:
(15)
x
i
t
-
x
i
t
-
1
-
∑
k
∈
C
a
k
i
y
k
i
t
-
1
+
∑
j
∈
C
a
i
j
y
i
j
t
-
1
≥
d
i
t
-
1
,
222222222222222222212
∀
i
∈
C
R
,
t
∈
ℑ
.
We can easily identify the optimal solution to the problem without constraint (15) which is zero for all x and y. The introduction of constraint (15) makes zero no longer the optimal solution to the problem. Thus, constraint (15) is always binding at the optimal solution and it can replace constraint (3). Note that the vehicle holding phenomenon can also happen in this model since constraint (15) is always binding and two equations are equivalent in this model. Similarly, constraint (4) can be replaced by the following inequality constraint:
(16)
x
i
t
-
x
i
t
-
1
-
∑
k
∈
C
a
k
i
y
k
i
t
-
1
+
∑
j
∈
C
a
i
j
y
i
j
t
-
1
≥
0
,
222222222222
∀
i
∈
C
∖
C
R
∪
C
S
,
t
∈
ℑ
.
Next, we assume that uncertain demand d
i
t
-
1 belongs to a prescribed uncertainty set. A box uncertainty set is used to bound demand uncertainty in Chung et al. [1]. However, Ben-Tal et al. [34] pointed out that the box uncertainty set is overly conservative and adopted the polyhedral set as uncertain demand set. Similar to Ben-Tal et al. [34], we choose the following polyhedral set as the uncertainty set:
(17)
d
i
t
∈
U
=
{
∑
t
∈
ℑ
d
i
t
≤
D
i
,
∀
i
∈
C
R
d
i
t
:
(
1
-
θ
)
d
-
i
t
≤
d
i
t
≤
(
1
+
θ
)
d
-
i
t
,
∀
i
∈
C
R
,
t
∈
ℑ
,
∑
t
∈
ℑ
d
i
t
≤
D
i
,
∀
i
∈
C
R
}
,
where d
-
i
t is the nominal demand and θ is the demand uncertainty level. Next, we use the adjustable robust optimization methods to formulate the adjustable robust counterpart of SODNDP. Then, we haveSODNDP-ARC:(18)
min
⁡
b
max
⁡
d
min
⁡
x
,
y
∑
t
∈
ℑ
∑
i
∈
C
∖
C
s
c
i
t
x
i
t
,
subject
to
x
i
t
-
x
i
t
-
1
-
∑
k
∈
C
a
k
i
y
k
i
t
-
1
222222222222
+
∑
j
∈
C
a
i
j
y
i
j
t
-
1
≥
d
i
t
-
1
,
222222222222
∀
i
∈
C
R
,
t
∈
ℑ
,
∀
d
i
t
∈
U
,
(19)
x
i
t
-
x
i
t
-
1
-
∑
k
∈
C
a
k
i
y
k
i
t
-
1
222222222222
+
∑
j
∈
C
a
i
j
y
i
j
t
-
1
≥
0
22222222222
∀
i
∈
C
∖
C
R
∪
C
S
,
t
∈
ℑ
,
∑
j
∈
C
a
i
j
y
i
j
t
≤
x
i
t
2222222221
∀
i
∈
C
∖
C
S
,
t
∈
ℑ
,
∑
k
∈
C
a
k
i
y
k
i
t
≤
δ
i
t
(
N
i
t
+
χ
i
b
i
-
x
i
t
)
222222222222222
∀
i
∈
C
∖
C
R
∪
C
S
,
t
∈
ℑ
,
∑
k
∈
C
a
k
i
y
k
i
t
≤
Q
i
t
+
ϕ
i
b
i
22222222222
∀
i
∈
C
∖
C
R
∪
C
S
,
t
∈
ℑ
,
∑
j
∈
C
a
i
j
y
i
j
t
≤
Q
i
t
+
ϕ
i
b
i
222222222222
∀
i
∈
C
∖
C
S
,
t
∈
ℑ
,
x
i
0
=
x
^
i
∀
i
∈
C
∖
C
S
,
y
i
j
0
=
0
,
∀
(
i
,
j
)
∈
C
×
C
,
x
i
t
≥
0
,
∀
i
∈
C
∖
C
S
,
t
∈
ℑ
,
y
i
j
t
≥
0
,
∀
(
i
,
j
)
∈
C
×
C
,
t
∈
ℑ
,
b
i
≥
0
,
∀
i
∈
C
∖
C
S
,
∑
i
∈
C
∖
C
s
b
i
≤
B
.
Ben-Tal et al. [22] showed that the ARC is more flexible than the RC; however, in most cases the ARC is computationally intractable (NP-hard). To address this difficulty, Ben-Tal et al. [22] proposed the affine decision rules; that is, adjustable variables are restricted to be affine function of the uncertain data. Here, we use the affine decision rules proposed by Ben-Tal et al. [22] to make ARC computationally tractable. Then,
(20)
x
i
t
=
η
i
t
-
1
+
∑
s
∈
C
R
∑
τ
∈
I
t
η
i
t
s
τ
d
s
τ
,
y
i
j
t
=
π
i
j
t
-
1
+
∑
s
∈
C
R
∑
τ
∈
I
t
π
i
j
t
s
τ
d
s
τ
,
where y
i
j
t is adjustable control variable, x
i
t is state variable, η
i
t
-
1
,
π
i
j
t
-
1
,
η
i
t
s
τ, and π
i
j
t
s
τ are nonadjustable variables, and I
t
=
{
0,1
,
2
,
…
,
t
-
1
}. By substituting the state and control variable, we have the following SODNP-AARC formulation:SODNP-AARC:(21)
min
⁡
η
,
π
,
b
,
z
z
,
s
.
t
.
∑
t
∈
ℑ
∑
i
∈
C
∖
C
s
c
i
t
(
η
i
t
-
1
+
∑
s
∈
C
R
∑
τ
∈
I
t
η
i
t
s
τ
d
s
τ
)
≤
z
,
∀
d
s
τ
∈
U
,
(
η
i
t
-
1
+
∑
s
∈
C
R
∑
τ
∈
I
t
η
i
t
s
τ
d
s
τ
)
-
(
η
i
t
-
1
-
1
+
∑
s
∈
C
R
∑
τ
∈
I
t
-
1
η
i
t
-
1
s
τ
d
s
τ
)
-
∑
k
∈
C
a
k
i
(
π
k
i
t
-
1
-
1
+
∑
s
∈
C
R
∑
t
∈
I
t
-
1
π
k
i
t
-
1
s
τ
d
s
τ
)
+
∑
j
∈
C
a
i
j
(
π
i
j
t
-
1
+
∑
s
∈
C
R
∑
t
∈
I
t
π
i
j
t
s
τ
d
s
τ
)
≥
d
i
t
-
1
,
222222222222222222
∀
i
∈
C
R
,
t
∈
ℑ
,
d
i
t
∈
U
,
(
η
i
t
-
1
+
∑
s
∈
C
R
∑
τ
∈
I
t
η
i
t
s
τ
d
s
τ
)
-
(
η
i
t
-
1
-
1
+
∑
s
∈
C
R
∑
τ
∈
I
t
-
1
η
i
t
-
1
s
τ
d
s
τ
)
-
∑
k
∈
C
a
k
i
(
π
k
i
t
-
1
-
1
+
∑
s
∈
C
R
∑
t
∈
I
t
-
1
π
k
i
t
-
1
s
τ
d
s
τ
)
+
∑
j
∈
C
a
i
j
(
π
i
j
t
-
1
+
∑
s
∈
C
R
∑
t
∈
I
t
π
i
j
t
s
τ
d
s
τ
)
≥
0
,
∀
i
∈
C
∖
C
R
∪
C
S
,
t
∈
ℑ
,
d
i
t
∈
U
,
∑
j
∈
C
a
i
j
(
π
i
j
t
-
1
+
∑
s
∈
C
R
∑
τ
∈
I
t
π
i
j
t
s
τ
d
s
τ
)
≤
(
η
i
t
-
1
+
∑
s
∈
C
R
∑
τ
∈
I
t
η
i
t
s
τ
d
s
τ
)
,
2222
∀
i
∈
C
∖
C
S
,
t
∈
ℑ
,
d
i
t
∈
U
,
∑
k
∈
C
a
k
i
(
π
k
i
t
-
1
+
∑
s
∈
C
R
∑
τ
∈
I
t
π
k
i
t
s
τ
d
s
τ
)
≤
δ
i
t
(
N
i
t
+
χ
i
b
i
-
(
η
i
t
-
1
+
∑
s
∈
C
R
∑
τ
∈
I
t
η
i
t
s
τ
d
s
τ
)
)
,
22222222222222
∀
i
∈
C
∖
C
R
∪
C
S
,
t
∈
ℑ
,
d
i
t
∈
U
,
∑
k
∈
C
a
k
i
(
π
k
i
t
-
1
+
∑
s
∈
C
R
∑
τ
∈
I
t
π
k
i
t
s
τ
d
s
τ
)
≤
Q
i
t
+
ϕ
i
b
i
,
222222.222222
∀
i
∈
C
∖
C
R
∪
C
S
,
t
∈
ℑ
,
d
i
t
∈
U
,
∑
k
∈
C
a
k
i
(
π
k
i
t
-
1
+
∑
s
∈
C
R
∑
τ
∈
I
t
π
k
i
t
s
τ
d
s
τ
)
≤
Q
i
t
+
ϕ
i
b
i
,
∀
i
∈
C
∖
C
S
,
t
∈
ℑ
,
d
i
t
∈
U
,
η
i
0
-
1
=
x
^
i
,
∀
i
∈
C
∖
C
S
,
π
i
j
0
-
1
=
0
,
∀
(
i
,
j
)
∈
C
×
C
,
η
i
t
-
1
+
∑
s
∈
C
R
∑
τ
∈
I
t
η
i
t
s
τ
d
s
τ
≥
0
,
∀
i
∈
C
∖
C
S
,
t
∈
ℑ
,
d
~
i
t
∈
U
,
π
i
j
t
-
1
+
∑
s
∈
C
R
∑
t
∈
I
t
π
i
j
t
s
τ
d
s
τ
≥
0
,
2
.
∀
(
i
,
j
)
∈
C
×
C
,
t
∈
ℑ
,
d
~
i
t
∈
U
,
∑
i
∈
C
∖
C
s
b
i
≤
B
,
b
i
≥
0
,
∀
i
∈
C
∖
C
S
.
It can be seen from the above formulation that SODNP- AARC is intractable since it is a semi-infinite program, and it can be reformulated as a tractable optimization problem as shown in Theorem 1.Theorem 1.
Given a polyhedral uncertainty setU, the affinely adjustable robust counterpart of the SODNDP becomes the following linear programming and thus computationally tractable. Note that λ is a set of dual variables and the numerical indexes are used for notational simplicity:
SODNDP-AARC1:(22)
min
⁡
b
,
z
,
λ
,
π
,
η
z
,
(23)
s
.
t
.
∑
t
∈
ℑ
∑
i
∈
C
∖
C
s
c
i
t
η
i
t
-
1
-
∑
s
∈
C
R
∑
τ
∈
ℑ
(
1
-
θ
)
λ
s
τ
11
d
-
s
τ
+
∑
s
∈
C
R
∑
τ
∈
ℑ
(
1
+
θ
)
λ
s
τ
12
d
-
s
τ
+
∑
s
∈
C
R
λ
s
13
D
s
≤
z
,
(24)
222212
λ
s
τ
12
-
λ
s
τ
11
+
λ
s
13
=
∑
i
∈
C
∖
C
s
∑
t
=
{
τ
+
1
,
…
,
T
}
c
i
t
η
i
t
s
τ
,
222222222212
∀
s
∈
C
R
,
τ
∈
{
0,1
,
2
,
…
,
T
-
1
}
,
(25)
λ
s
τ
12
-
λ
s
τ
11
+
λ
s
13
=
0
,
∀
s
∈
C
R
,
τ
∈
{
T
}
,
(26)
λ
s
τ
12
,
λ
s
τ
11
,
λ
s
13
≥
0
,
∀
s
∈
C
R
,
τ
∈
ℑ
,
(27)
η
i
t
-
1
-
η
i
t
-
1
-
1
-
∑
k
∈
C
a
k
i
π
k
i
t
-
1
-
1
+
∑
j
∈
C
a
i
j
π
i
j
t
-
1
-
1
+
∑
s
∈
C
R
,
τ
∈
ℑ
λ
i
t
s
τ
21
(
1
-
θ
)
d
-
s
τ
-
∑
s
∈
C
R
,
τ
∈
ℑ
λ
i
t
s
τ
22
(
1
+
θ
)
d
-
s
τ
-
∑
s
∈
C
R
λ
i
t
s
23
D
s
≥
0
,
∀
i
∈
C
R
,
t
∈
ℑ
,
(28)
λ
i
t
s
τ
22
-
λ
i
t
s
τ
21
+
λ
i
t
s
23
=
I
{
τ
=
t
-
1
,
s
=
i
}
-
η
i
t
s
τ
+
(
η
i
t
-
1
s
τ
+
∑
k
∈
C
a
k
i
π
k
i
t
-
1
s
τ
-
∑
j
∈
C
a
i
j
π
i
j
t
-
1
s
τ
)
×
I
{
τ
<
t
-
1
}
,
∀
i
∈
C
R
,
t
∈
ℑ
,
2222222
s
∈
C
R
,
τ
∈
{
0,1
,
…
,
t
-
1
}
,
(29)
λ
i
t
s
τ
22
-
λ
i
t
s
τ
21
+
λ
i
t
s
23
=
0
,
∀
i
∈
C
R
,
t
∈
ℑ
,
s
∈
C
R
,
τ
∈
{
t
,
…
,
T
}
,
(30)
λ
i
t
s
τ
21
,
λ
i
t
s
τ
22
,
λ
i
t
s
23
≥
0
,
∀
i
∈
C
R
,
t
∈
ℑ
,
s
∈
C
R
,
τ
∈
ℑ
,
(31)
η
i
t
-
1
-
η
i
t
-
1
-
1
-
∑
k
∈
C
a
k
i
π
k
i
t
-
1
-
1
+
∑
j
∈
C
a
i
j
π
i
j
t
-
1
-
1
+
∑
s
∈
C
R
,
τ
∈
ℑ
λ
i
t
s
τ
31
(
1
-
θ
)
d
-
s
τ
-
∑
s
∈
C
R
,
τ
∈
ℑ
λ
i
t
s
τ
32
(
1
+
θ
)
d
-
s
τ
-
∑
s
∈
C
R
λ
i
t
s
33
D
s
≥
0
,
∀
i
∈
C
∖
C
R
∪
C
S
,
t
∈
ℑ
,
(32)
λ
i
t
s
τ
32
-
λ
i
t
s
τ
31
+
λ
i
t
s
33
=
-
η
i
t
s
τ
+
(
η
i
t
-
1
s
τ
+
∑
k
∈
C
a
k
i
π
k
i
t
-
1
s
τ
-
∑
j
∈
C
a
i
j
π
i
j
t
-
1
s
τ
)
×
I
{
τ
<
t
-
1
}
,
∀
i
∈
C
∖
C
R
∪
C
S
,
t
∈
ℑ
,
2222222222222
s
∈
C
R
,
τ
∈
{
0,1
,
…
,
t
-
1
}
,
(33)
λ
i
t
s
τ
32
-
λ
i
t
s
τ
31
+
λ
i
t
s
33
=
0
,
∀
i
∈
C
∖
C
R
∪
C
S
,
222222222222212
t
∈
ℑ
,
s
∈
C
R
,
τ
∈
{
t
,
…
,
T
}
,
(34)
λ
i
t
s
τ
31
,
λ
i
t
s
τ
32
,
λ
i
t
s
33
≥
0
,
∀
i
∈
C
∖
C
R
∪
C
S
,
22222222222222222
t
∈
ℑ
,
s
∈
C
R
,
τ
∈
ℑ
,
(35)
∑
j
∈
C
a
i
j
π
i
j
t
-
1
-
η
i
t
-
1
+
∑
s
∈
C
R
,
τ
∈
ℑ
λ
i
t
s
τ
42
(
1
+
θ
)
d
-
s
τ
-
∑
s
∈
C
R
,
τ
∈
ℑ
λ
i
t
s
τ
41
(
1
-
θ
)
d
-
s
τ
+
∑
s
∈
C
R
λ
i
t
s
43
D
s
≤
0
,
222222222222222222222222
∀
i
∈
C
∖
C
S
,
t
∈
ℑ
,
(36)
λ
i
t
s
τ
42
-
λ
i
t
s
τ
41
+
λ
i
t
s
43
=
∑
j
∈
C
a
i
j
π
i
j
t
s
τ
-
η
i
t
s
τ
,
∀
i
∈
C
∖
C
S
,
t
∈
ℑ
,
s
∈
C
R
,
τ
∈
{
0,1
,
…
,
t
-
1
}
,
(37)
λ
i
t
s
τ
42
-
λ
i
t
s
τ
41
+
λ
i
t
s
43
=
0
,
∀
i
∈
C
∖
C
S
,
22222222221
t
∈
ℑ
,
s
∈
C
R
,
τ
∈
{
t
,
…
,
T
}
,
(38)
λ
i
t
s
τ
41
,
λ
i
t
s
τ
42
,
λ
i
t
s
43
≥
0
,
∀
i
∈
C
∖
C
S
,
2222222222221
t
∈
ℑ
,
s
∈
C
R
,
τ
∈
ℑ
,
(39)
∑
k
∈
C
a
k
i
π
k
i
t
-
1
+
∑
s
∈
C
R
,
τ
∈
ℑ
λ
i
t
s
τ
52
(
1
+
θ
)
d
-
s
τ
-
∑
s
∈
C
R
,
τ
∈
ℑ
λ
i
t
s
τ
51
(
1
-
θ
)
d
-
s
τ
+
∑
s
∈
C
R
λ
i
t
s
53
D
s
≤
δ
i
t
(
N
i
t
+
χ
i
b
i
-
η
i
t
-
1
)
,
111111111111111
∀
i
∈
C
∖
C
R
∪
C
S
,
t
∈
ℑ
,
(40)
λ
i
t
s
τ
52
-
λ
i
t
s
τ
51
+
λ
i
t
s
53
=
∑
k
∈
C
a
k
i
π
k
i
t
s
τ
+
δ
i
t
η
i
t
s
τ
,
111111111111111.1
∀
i
∈
C
∖
C
R
∪
C
S
,
t
∈
ℑ
,
111111111111.11
s
∈
C
R
,
τ
∈
{
0,1
,
…
,
t
-
1
}
,
(41)
λ
i
t
s
τ
52
-
λ
i
t
s
τ
51
+
λ
i
t
s
53
=
0
,
∀
i
∈
C
∖
C
R
∪
C
S
,
1111111111111.1
t
∈
ℑ
,
s
∈
C
R
,
τ
∈
{
t
,
…
,
T
}
,
(42)
λ
i
t
s
τ
51
,
λ
i
t
s
τ
52
,
λ
i
t
s
53
≥
0
,
∀
i
∈
C
∖
C
R
∪
C
S
,
11111111111111111
t
∈
ℑ
,
s
∈
C
R
,
τ
∈
ℑ
,
(43)
∑
k
∈
C
a
k
i
π
k
i
t
-
1
+
∑
s
∈
C
R
,
τ
∈
ℑ
λ
i
t
s
τ
62
(
1
+
θ
)
d
-
s
τ
-
∑
s
∈
C
R
,
τ
∈
ℑ
λ
i
t
s
τ
61
(
1
-
θ
)
d
-
s
τ
+
∑
s
∈
C
R
λ
i
t
s
63
D
s
≤
Q
i
+
ϕ
i
b
i
,
∀
i
∈
C
∖
C
R
∪
C
S
,
t
∈
ℑ
,
(44)
λ
i
t
s
τ
62
-
λ
i
t
s
τ
61
+
λ
i
t
s
63
=
∑
k
∈
C
a
k
i
π
k
i
t
s
τ
,
222222222
∀
i
∈
C
∖
C
R
∪
C
S
,
t
∈
ℑ
,
2222222
s
∈
C
R
,
τ
∈
{
0,1
,
…
,
t
-
1
}
,
(45)
λ
i
t
s
τ
62
-
λ
i
t
s
τ
61
+
λ
i
t
s
63
=
0
,
∀
i
∈
C
∖
C
R
∪
C
S
,
222222222222221
t
∈
ℑ
,
s
∈
C
R
,
τ
∈
{
t
,
…
,
T
}
,
(46)
λ
i
t
s
τ
61
,
λ
i
t
s
τ
62
,
λ
i
t
s
63
≥
0
,
∀
i
∈
C
∖
C
R
∪
C
S
,
22222222222222222
t
∈
ℑ
,
s
∈
C
R
,
τ
∈
ℑ
,
(47)
∑
j
∈
C
a
i
j
π
i
j
t
-
1
+
∑
s
∈
C
R
,
τ
∈
ℑ
λ
i
t
s
τ
72
(
1
+
θ
)
d
-
s
τ
-
∑
s
∈
C
R
,
τ
∈
ℑ
λ
i
t
s
τ
71
(
1
-
θ
)
d
-
s
τ
+
∑
s
∈
C
R
λ
i
t
s
73
D
s
≤
Q
i
+
ϕ
i
b
i
,
22222222222
∀
i
∈
C
∖
C
S
,
t
∈
ℑ
,
(48)
λ
i
t
s
τ
72
-
λ
i
t
s
τ
71
+
λ
i
t
s
73
=
∑
j
∈
C
a
i
j
π
i
j
t
s
τ
,
222222222222.2
∀
i
∈
C
∖
C
S
,
t
∈
ℑ
,
22.22222
s
∈
C
R
,
τ
∈
{
0,1
,
…
,
t
-
1
}
,
(49)
λ
i
t
s
τ
72
-
λ
i
t
s
τ
71
+
λ
i
t
s
73
=
0
,
∀
i
∈
C
∖
C
S
,
t
∈
ℑ
,
2222222222.22222222222
s
∈
C
R
,
τ
∈
{
t
,
…
,
T
}
,
(50)
λ
i
t
s
τ
71
,
λ
i
t
s
τ
72
,
λ
i
t
s
73
≥
0
,
∀
i
∈
C
∖
C
S
,
t
∈
ℑ
,
s
∈
C
R
,
τ
∈
ℑ
,
(51)
η
i
t
-
1
-
∑
s
∈
C
R
,
τ
∈
ℑ
λ
i
t
s
τ
82
(
1
+
θ
)
d
-
s
τ
+
∑
s
∈
C
R
,
τ
∈
ℑ
λ
i
t
s
τ
81
(
1
-
θ
)
d
-
s
τ
-
∑
s
∈
C
R
λ
i
t
s
83
D
s
≥
0
,
∀
i
∈
C
∖
C
S
,
t
∈
ℑ
,
(52)
λ
i
t
s
τ
82
-
λ
i
t
s
τ
81
+
λ
i
t
s
83
=
-
η
i
t
s
τ
,
∀
i
∈
C
∖
C
S
,
222222222
t
∈
ℑ
,
s
∈
C
R
,
τ
∈
{
0,1
,
…
,
t
-
1
}
,
(53)
λ
i
t
s
τ
82
-
λ
i
t
s
τ
81
+
λ
i
t
s
83
=
0
,
∀
i
∈
C
∖
C
S
,
22222222221
t
∈
ℑ
,
s
∈
C
R
,
τ
∈
{
t
,
…
,
T
}
,
(54)
λ
i
t
s
τ
81
,
λ
i
t
s
τ
82
,
λ
i
t
s
83
≥
0
,
∀
i
∈
C
∖
C
S
,
t
∈
ℑ
,
s
∈
C
R
,
τ
∈
ℑ
,
(55)
π
i
j
t
-
1
-
∑
s
∈
C
R
,
τ
∈
ℑ
λ
i
j
t
s
τ
92
(
1
+
θ
)
d
-
s
τ
+
∑
s
∈
C
R
,
τ
∈
ℑ
λ
i
j
t
s
τ
91
(
1
-
θ
)
d
-
s
τ
-
∑
s
∈
C
R
λ
i
t
s
93
D
s
≥
0
,
22222222222222221
∀
(
i
,
j
)
∈
{
a
(
i
,
j
)
=
1
}
,
t
∈
ℑ
,
(56)
λ
i
j
t
s
τ
92
-
λ
i
j
t
s
τ
91
+
λ
i
j
t
s
93
=
-
π
i
j
t
s
τ
,
∀
(
i
,
j
)
∈
{
a
(
i
,
j
)
=
1
}
,
22222222222222222
t
∈
ℑ
,
s
∈
C
R
,
τ
∈
{
0,1
,
…
,
t
-
1
}
,
(57)
λ
i
j
t
s
τ
92
-
λ
i
j
t
s
τ
91
+
λ
i
j
t
s
93
=
0
,
∀
(
i
,
j
)
∈
{
a
(
i
,
j
)
=
1
}
,
22222222222222222222
t
∈
ℑ
,
s
∈
C
R
,
τ
∈
{
t
,
…
,
T
}
,
(58)
λ
i
j
t
s
τ
91
,
λ
i
j
t
s
τ
92
,
λ
i
j
t
s
93
≥
0
,
∀
(
i
,
j
)
∈
{
a
(
i
,
j
)
=
1
}
,
2222222222222222222222
t
∈
ℑ
,
s
∈
C
R
,
τ
∈
ℑ
,
(59)
η
i
0
-
1
=
x
^
i
,
∀
i
∈
C
∖
C
S
,
(60)
π
i
j
0
-
1
=
0
,
∀
(
i
,
j
)
∈
{
a
(
i
,
j
)
=
1
}
,
(61)
∑
i
∈
C
∖
C
s
b
i
≤
B
,
b
i
≥
0
,
∀
i
∈
C
∖
C
S
,
where I
{
τ
=
t
-
1
,
s
=
i
} in the constraint (28) denotes that if τ
=
t
-
1, s
=
i, then I
{
τ
=
t
-
1
,
s
=
i
}
=
1; otherwise I
{
τ
=
t
-
1
,
s
=
i
}
=
0, and I
{
τ
<
t
-
1
} in the constraint (28) denotes that if τ
<
t
-
1, then I
{
τ
<
t
-
1
}
=
1; otherwise I
{
τ
<
t
-
1
}
=
0.Proof.
By applying the following relationship, we can reformulate each constraint affected by demand uncertainty as an equivalent LP problem. For example,(62)
∑
t
∈
ℑ
∑
i
∈
C
∖
C
s
c
i
t
(
η
i
t
-
1
+
∑
s
∈
C
R
∑
τ
∈
I
t
η
i
t
s
τ
d
s
τ
)
≤
z
,
∀
d
s
τ
∈
U
=
{
∑
τ
∈
ℑ
d
s
τ
≤
D
s
,
∀
s
∈
C
R
(
1
-
θ
)
d
-
s
τ
≤
d
s
τ
≤
(
1
+
θ
)
d
-
s
τ
,
∀
s
∈
C
R
,
τ
∈
ℑ
,
2222222222
∑
τ
∈
ℑ
d
s
τ
≤
D
s
,
∀
s
∈
C
R
}
⟺
max
⁡
d
s
τ
∈
U
∑
t
∈
ℑ
∑
i
∈
C
∖
C
s
c
i
t
(
η
i
t
-
1
+
∑
s
∈
C
R
∑
τ
∈
I
t
η
i
t
s
τ
d
s
τ
)
≤
z
.
According to strong duality property, we can derive the equivalent constraint with dual problem of the above problem:
(63)
max
⁡
d
s
τ
∑
t
∈
ℑ
∑
i
∈
C
∖
C
s
c
i
t
(
η
i
t
-
1
+
∑
s
∈
C
R
∑
τ
∈
I
t
η
i
t
s
τ
d
s
τ
)
≤
z
s
.
t
.
(
1
-
θ
)
d
-
s
τ
≤
d
s
τ
≤
(
1
+
θ
)
d
-
s
τ
,
∀
s
∈
C
R
,
τ
∈
ℑ
,
∑
τ
∈
ℑ
d
s
τ
≤
D
s
,
∀
s
∈
C
R
⇕
min
⁡
η
i
t
-
1
,
λ
s
τ
11
,
λ
s
τ
12
,
λ
s
13
∑
i
∈
C
∖
C
S
,
t
∈
ℑ
c
i
t
η
i
t
-
1
-
∑
s
∈
C
R
,
τ
∈
ℑ
(
1
-
θ
)
λ
s
τ
11
d
-
s
τ
+
∑
s
∈
C
R
,
τ
∈
ℑ
(
1
+
θ
)
λ
s
τ
12
d
-
s
τ
+
∑
s
∈
C
R
λ
s
13
D
s
≤
z
,
s
.
t
.
λ
s
τ
12
-
λ
s
τ
11
+
λ
s
13
=
∑
i
∈
C
∖
C
s
∑
t
=
{
τ
+
1
,
…
,
T
}
c
i
t
η
i
t
s
τ
,
∀
s
∈
C
R
,
τ
∈
{
0,1
,
2
,
…
,
T
-
1
}
,
λ
s
τ
12
-
λ
s
τ
11
+
λ
s
13
=
0
,
∀
s
∈
C
R
,
τ
∈
{
T
}
,
λ
s
τ
12
,
λ
s
τ
11
,
λ
s
13
≥
0
,
∀
s
∈
C
R
,
τ
∈
ℑ
,
where λ
s
τ
11, λ
s
τ
12, and λ
s
13 are dual variables. Therefore, we can derive the constraints (23)–(26). Similarity, the other semi-infinite constraints can also write as the equivalent linear constraints.Note that the optimal objective of SODNDP-AARC1 is a guaranteed upper bound value for all realization of uncertain data under the assumption of linear dependency. It also can be interpreted as the optimistic estimate of total cost in worst case, which can be lower than the optimistic estimate from robust counterpart as SODNDP-AARC1 has a larger robust feasible region [22]. Moreover, the decision variables of SODNDP-AARC1 are not adjustable control and state variables but a set of coefficient of affine function of the control variables including π
i
j
t
-
1, π
i
j
t
s
τ, η
i
t
-
1, and η
i
t
s
τ. It implies that the solution of SODNDP-AARC1 is a linear decision rule. Specific values of x
i
t and y
i
j
t are computed after the realization of the demand at time t
-
1 [34].


## 5. Robust Formulation

To demonstrate that the AARC is more flexible, we use the usual RO approach to develop the RC of SODNDP in this section. We note that constraint (11) is redundant since constraints (5) and (12) guarantee the nonnegativity of x
i
t. By using constraints (3), (4), (9), and (10), x
i
t can be represented as follows:
(64)
x
i
t
=
x
^
i
+
∑
τ
=
0
t
-
1
(
∑
k
∈
C
a
k
i
y
k
i
τ
-
∑
j
∈
C
a
i
j
y
i
j
τ
+
d
i
τ
)
,
2222222222222222222
∀
i
∈
C
R
,
t
∈
ℑ
,
x
i
t
=
x
^
i
+
∑
τ
=
0
t
-
1
(
∑
k
∈
C
a
k
i
y
k
i
τ
-
∑
j
∈
C
a
i
j
y
i
j
τ
)
,
2222222222
∀
i
∈
C
∖
C
R
∪
C
S
,
t
∈
ℑ
.
As before, it is also assumed that the demand uncertainty belongs to the uncertain set U. Thus, we can get the following RC of SODNDP:SODNDP-RC:(65)
min
⁡
b
,
y
,
z
z
,
s
.
t
.
∑
t
∈
ℑ
∑
i
∈
C
R
c
i
t
×
(
x
^
i
+
∑
τ
=
0
t
-
1
(
∑
k
∈
C
a
k
i
y
k
i
τ
-
∑
j
∈
C
a
i
j
y
i
j
τ
+
d
i
τ
)
)
+
∑
t
∈
ℑ
∑
i
∈
C
∖
C
R
∪
C
S
c
i
t
×
(
x
^
i
+
∑
τ
=
0
t
-
1
(
∑
k
∈
C
a
k
i
y
k
i
τ
-
∑
j
∈
C
a
i
j
y
i
j
τ
)
)
≤
z
,
∀
d
i
t
∈
U
,
∑
j
∈
C
a
i
j
y
i
j
t
≤
x
^
i
+
∑
τ
=
0
t
-
1
(
∑
k
∈
C
a
k
i
y
k
i
τ
-
∑
j
∈
C
a
i
j
y
i
j
τ
+
d
i
τ
)
,
∀
i
∈
C
R
,
t
∈
ℑ
,
d
i
t
∈
U
,
∑
j
∈
C
a
i
j
y
i
j
t
≤
x
^
i
+
∑
τ
=
0
t
-
1
(
∑
k
∈
C
a
k
i
y
k
i
τ
-
∑
j
∈
C
a
i
j
y
i
j
τ
)
,
∀
i
∈
C
∖
C
R
∪
C
S
,
t
∈
ℑ
,
∑
k
∈
C
a
k
i
y
k
i
t
≤
δ
i
t
(
∑
k
∈
C
a
k
i
y
k
i
τ
-
∑
j
∈
C
a
i
j
y
i
j
τ
N
i
t
+
χ
i
b
i
-
x
^
i
-
∑
τ
=
0
t
-
1
(
∑
k
∈
C
a
k
i
y
k
i
τ
-
∑
j
∈
C
a
i
j
y
i
j
τ
)
)
,
∀
i
∈
C
∖
C
R
∪
C
S
,
t
∈
ℑ
,
∑
k
∈
C
a
k
i
y
k
i
t
≤
Q
i
t
+
ϕ
i
b
i
,
∀
i
∈
C
∖
C
R
∪
C
S
,
t
∈
ℑ
,
∑
j
∈
C
a
i
j
y
i
j
t
≤
Q
i
t
+
ϕ
i
b
i
,
∀
i
∈
C
∖
C
S
,
t
∈
ℑ
,
y
i
j
0
=
0
,
∀
(
i
,
j
)
∈
C
×
C
,
y
i
j
t
≥
0
,
∀
(
i
,
j
)
∈
C
×
C
,
t
∈
ℑ
,
∑
i
∈
C
∖
C
s
b
i
≤
B
,
b
i
≥
0
,
∀
i
∈
C
∖
C
S
.It is obvious that RC is also a semi-infinite problem and has infinitely many constraints. Similar to Theorem1, we can convert it into the following tractable equivalent deterministic problem:SODNDP-RC1:(66)
min
⁡
b
,
y
,
μ
,
z
z
,
s
.
t
.
∑
t
∈
ℑ
∑
i
∈
C
∖
C
S
c
i
t
×
(
x
^
i
+
∑
τ
=
0
t
-
1
(
∑
k
∈
C
a
k
i
y
k
i
τ
-
∑
j
∈
C
a
i
j
y
i
j
τ
)
)
-
∑
s
∈
C
R
,
τ
∈
ℑ
μ
s
τ
11
(
1
-
θ
)
d
-
s
τ
+
∑
s
∈
C
R
,
τ
∈
ℑ
μ
s
τ
12
(
1
+
θ
)
d
-
s
τ
+
∑
s
∈
C
R
μ
s
13
D
s
≤
z
,
μ
s
τ
12
-
μ
s
τ
11
+
μ
s
13
=
∑
t
=
{
τ
+
1
,
…
,
T
}
c
s
t
,
∀
s
∈
C
R
,
τ
∈
{
0,1
,
2
,
…
,
T
-
1
}
,
μ
s
τ
12
-
μ
s
τ
11
+
μ
s
13
=
0
,
∀
s
∈
C
R
,
τ
∈
{
T
}
,
μ
s
τ
11
,
μ
s
τ
12
,
μ
s
13
≥
0
,
∀
s
∈
C
R
,
τ
∈
ℑ
,
∑
j
∈
C
a
i
j
y
i
j
t
≤
x
^
i
+
∑
τ
=
0
t
-
1
(
∑
k
∈
C
a
k
i
y
k
i
τ
-
∑
j
∈
C
a
i
j
y
i
j
τ
)
+
∑
s
∈
C
R
∑
τ
∈
ℑ
μ
i
t
s
τ
21
(
1
-
θ
)
d
-
s
τ
-
∑
s
∈
C
R
∑
τ
∈
ℑ
μ
i
t
s
τ
22
(
1
+
θ
)
d
-
s
τ
-
∑
s
∈
C
R
μ
i
t
s
23
D
s
,
∀
i
∈
C
R
,
t
∈
ℑ
,
μ
i
t
s
τ
22
-
μ
i
t
s
τ
21
+
μ
i
t
s
23
+
I
{
i
=
s
,
τ
<
t
}
=
0
,
∀
i
∈
C
R
,
t
∈
ℑ
,
s
∈
C
R
,
τ
∈
ℑ
,
μ
i
t
s
τ
21
,
μ
i
t
s
τ
22
,
μ
i
t
s
23
≥
0
,
∀
i
∈
C
R
,
t
∈
ℑ
,
s
∈
C
R
,
τ
∈
ℑ
,
∑
j
∈
C
a
i
j
y
i
j
t
≤
x
^
i
+
∑
τ
=
0
t
-
1
(
∑
k
∈
C
a
k
i
y
k
i
τ
-
∑
j
∈
C
a
i
j
y
i
j
τ
)
,
∀
i
∈
C
∖
C
R
∪
C
S
,
t
∈
ℑ
,
∑
k
∈
C
a
k
i
y
k
i
t
≤
δ
i
t
(
∑
τ
=
0
t
-
1
(
∑
k
∈
C
a
k
i
y
k
i
τ
-
∑
j
∈
C
a
i
j
y
i
j
τ
)
N
i
t
+
χ
i
b
i
-
x
^
i
-
∑
τ
=
0
t
-
1
(
∑
k
∈
C
a
k
i
y
k
i
τ
-
∑
j
∈
C
a
i
j
y
i
j
τ
)
)
∀
i
∈
C
∖
C
R
∪
C
S
,
t
∈
ℑ
,
∑
k
∈
C
a
k
i
y
k
i
t
≤
Q
i
t
+
ϕ
i
b
i
,
∀
i
∈
C
∖
C
R
∪
C
S
,
t
∈
ℑ
,
∑
j
∈
C
a
i
j
y
i
j
t
≤
Q
i
t
+
ϕ
i
b
i
,
∀
i
∈
C
∖
C
S
,
t
∈
ℑ
,
y
i
j
0
=
0
,
∀
(
i
,
j
)
∈
C
×
C
,
y
i
j
t
≥
0
,
∀
(
i
,
j
)
∈
C
×
C
,
t
∈
ℑ
,
∑
i
∈
C
∖
C
s
b
i
≤
B
,
b
i
≥
0
,
∀
i
∈
C
∖
C
S
,
where μ is a set of dual variables and the numerical indexes are used for notational simplicity.


## 6. Numerical Example

The purpose of presenting the numerical example in this section is twofold:(
1
) to demonstrate the validity of SODNDP-AARC1 and (
2
) to illustrate the flexibility of the SODNDP-AARC1 by comparing it with SODNDP-RC1. One example network shown in Figure 1 is selected to test the proposed model. This network consists of 20 nodes and 25 links. The links in the center of the network are the freeway links, while the outer link and crosslink are the arterial links. The characteristics of network include length, speed limit, and jam density of the roads. By using this network information and setting 6 seconds as the length of a time interval, the corresponding cell network representation is constructed. This cell network is composed of 62 cells and 67 cell connectors. There are three source cells (cells 54, 55, and 56) and one sink cell (cell 59). The other is either freeway cell or arterial cells. Expected the sink cell 59, the other cells are considered for capacity expansion. The characteristics of the cells in the test network are shown in Table 1.Table 1
Characteristic of the cells.
Cell
Source cells
Sink cells
Freeway cells
Arterial cells
N
i
t
∞
∞
20
10
Q
i
t
∞
∞
12
3
δ
i
t
1
1
1
1
x
^
i
0
0
0
0Figure 1
Test network [40].The planning horizonT and cost coefficient c
i
t except the one at the end of planning horizon are assumed to be 105 and 1, respectively. c
i
T is set to 10 to penalize the unmet demand. The model parameters δ and ϕ are assumed to be unity; that is, δ
i
t
=
ϕ
i
=
1, for all i
∈
C
,
t
∈
ℑ. Travel demand is only generated at the three source cells and time 0. The nominal demand is set to 63.6. That is, d
i
0
=
63.6, for all i
∈
C
R; the total demand is D
i
=
2
∑
d
i
t, for all i
∈
C
R
. The SODNDP-AARC1 and SODNDP-RC1 problems are solved with GUROBI using GAMS [37] on a PC with Intel processor 2.8 GHz and 4 GB of memory.Table2 reports the optimal solution of the SODNDP, SODNDP-AARC1, and SODNDP-RC1 models under different uncertainty levels when the available budget B
=
100. It can be seen from Table 2 that the optimal solution of the SODNDP-AARC1 model has remained unchanged under different uncertainty levels, while the optimal solution of the SODNDP-RC1 model keeps changing. It is clear that the adjustable robust capacity expansion plans are more stable. Tables 3 and 4 list the total travel cost and solution time of the SODNDP, SODNDP-AARC1, and SODNDP-RC1 models under different uncertainty levels and available budgets. As shown in Tables 3 and 4, the total travel cost from the nominal solution, robust solution, and adjustable robust solution increases with the rise of uncertainty level θ when B
=
100. On the other hand, the total travel cost from the nominal solution, robust solution, and adjustable robust solution decreases with the increase of available budget B when θ
=
0.5. This is because the feasible region of all three models reduces with the rise of uncertainty level θ; on the contrary, the feasible region of all three models enlarges with the increase of available budget B. At the same time, the optimal objective value of the SODNDP-RC1 model is far greater not only than the SODNDP model but also than the SODNDP-AARC1 model, while the optimal objective value of SODNDP- AARC1 model is only slightly greater than SODNDP model. This shows that the SODNDP-RC1 model is overly conservative, while SODNDP-AARC1 model is more flexible than the SODNDP-RC1 model. Moreover, the solution time of the SODNDP model and SODNDP-RC1 model is almost the same, and the solution time of the SODNDP-AARC1 model is longer than the other two models. It is due to the fact that the SODNDP-AARC1 model has more variables and constraints.Table 2
The optimal solution of the SODNDP, SODNDP-RC1, and SODNDP-AARC1 whenB
=
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.091Table 3
The optimal objective and solution time of the SODNDP, SODNDP-RC1, and SODNDP-AARC1 models under different uncertainty levels whenB
=
100.
θ
SODNDP
SODNDPsolution time (sec)
SODNDP-RC1
SODNDP-RC1solution time (sec)
SODNDP-AARC1
SODNDP-AARC1solution 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.84Table 4
The total travel cost and runtimes of the SODNDP, SODNDP-RC1, and SODNDP-AARC1 models under different available budgets whenθ
=
0.5.
B
SODNDP
SODNDP solution time (sec)
SODNDP-RC1
SODNDP-RC1solution time (sec)
SODNDP-AARC1
SODNDP-AARC1solution 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.20Figure2 depicts the total travel cost from the nominal solution, robust solution, and adjustable solution and the relative improvement of the total travel cost of the robust solution against adjustable solution under different uncertainty levels and available budgets. The relative improvement in this paper is defined as
(67)
RI
=
z
R
-
z
A
R
z
R
,
where z
R is the total travel cost from the robust solution and z
A
R is the total travel cost from the adjustable robust solution. As shown in Figure 2, the total travel cost from both the robust solution and adjustable robust solution decreases with the increase of available budget B but increases with an increasing value of the uncertainty level θ. However, the total travel cost from the adjustable robust solution is far lower than the robust solution under any circumstances. This also shows that the adjustable solution is less conservative than the robust solution. When the uncertainty level θ
≥
0.7, the total travel cost from the robust solution basically remains unchanged with the increase of available budget B, which means that the increase of available budget has no much effect on the improvement of traffic congestion. This implies that some investments are wasted, and this case does not appear in the SODNDP-AARC1 model. Moreover, the relative improvement of the total travel cost of the robust solution against adjustable solution is monotonically decreasing function with respect to the available budget B and is monotonically increasing function with respect to the uncertainty level θ. When the uncertainty level θ
≥
0.5, the relative improvement range of the total travel cost of the robust solution against adjustable solution becomes larger, and it almost reaches 80% when the uncertainty level θ equals 1. Thus, the SODNDP-AARC1 model is less conservative than the SODNDP-RC1 model; therefore, it becomes more attractive.The optimal objective value of the SODNDP-RC1 and SODNDP-AARC1 models, and the relative improvement of the optimal objective value of the SODNDP-RC1 against SODNDP-AARC1 under different available budgets and uncertainty levels.
(a)
The optimal travel cost of the SODNDP-RC1
(b)
The optimal travel cost of the SODNDP-AARC1
(c)
The relative improvement of the optimal objective value of the SODNDP-RC1 against SODNDP-AARC1To compare the operating behaviors of the three capacity expansion plans, nominal, robust, and adjustable robust, we randomly generated 100 travel demand vectors in which the demand of each O-D pair satisfies the normal distribution whose mean isd
-
i
t and standard deviation is 0.5
d
-
i
t. For each random vector d
i
t, for all i
∈
C
R, the total travel cost from the nominal, robust, and adjustable robust capacity expansion plans is computed. The mean, standard deviation, and maximum of the total travel cost associated with nominal, robust, and adjustable robust capacity expansion plans are shown in Table 5. It can be seen that the mean, standard deviation, and maximum of the total travel cost from the nominal, robust, and adjustable robust capacity expansion plans all decrease as the available budget B increases. The mean and maximum of the total travel cost from the robust capacity expansion plans reduce when the uncertainty level θ increases, and standard deviation of the total travel cost from the robust capacity expansion plans increases when the uncertainty level θ increases. On the other hand, the mean, standard deviation, and maximum of the total travel cost from adjustable robust capacity expansion plans remain unchanged for all uncertainty levels. This is because the adjustable robust capacity expansion plans are the same under different uncertainty levels. In addition, the mean of the total travel cost from the adjustable robust capacity expansion plans is greater than that of the robust capacity expansion plans; however, in all case, the standard deviation and maximum of the total travel cost from the adjustable robust capacity expansion plans are less than or equal to those of the robust capacity expansion plans.Table 5
Comparison of simulation results.
B
Mean
Standard deviation
Maximum
SODNDP
SODNDP-RC1
SODNDP-AARC1
SODNDP
SODNDP-RC1
SODNDP-AARC1
SODNDP
SODNDP-RC1
SODNDP-AARC1
θ
=
0.1
10
4610.0
4610.0
4610.0
1367.1
1367.1
1367.1
7614.0
7614.0
7614.0
20
4575.5
4575.5
4575.5
1362.2
1362.2
1362.2
7581.3
7581.3
7581.3
30
4551.3
4551.3
4551.3
1357.5
1357.5
1357.5
7548.6
7548.6
7548.6
40
4527.7
4527.7
4527.7
1352.1
1352.1
1352.1
7515.8
7515.8
7515.8
50
4505.0
4505.0
4505.0
1346.9
1346.9
1346.9
7483.1
7483.1
7483.1
60
4483.4
4483.4
4483.4
1340.8
1340.8
1340.8
7450.3
7450.3
7450.3
70
4463.1
4458.5
4463.1
1334.1
1338.3
1334.1
7417.6
7421.4
7417.6
80
4443.5
4431.7
4443.5
1327.5
1337.7
1327.5
7384.9
7394.2
7384.9
90
4421.8
4405.3
4424.6
1322.9
1336.5
1320.7
7354.1
7367.1
7352.2
100
4395.2
4378.9
4406.7
1322.1
1335.1
1313.7
7326.9
7339.9
7314.9
θ
=
0.2
10
4610.0
4610.0
1367.1
1367.1
7614.0
7614.0
20
4575.5
4575.5
1362.2
1362.2
7581.3
7581.3
30
4551.3
4551.3
1357.5
1357.5
7548.6
7548.6
40
4527.7
4527.7
1352.2
1352.1
7515.9
7515.8
50
4500.8
4505.0
1351.7
1346.9
7488.7
7483.1
60
4473.9
4483.4
1351.3
1340.8
7461.5
7450.3
70
4447.3
4463.1
1350.3
1334.1
7434.4
7417.6
80
4420.8
4443.5
1349.1
1327.5
7407.2
7384.9
90
4394.7
4424.6
1347.3
1320.7
7380.0
7352.2
100
4368.5
4406.7
1345.5
1313.7
7352.9
7314.9
θ
=
0.3
10
4610.0
4610.0
1367.1
1367.1
7614.0
7614.0
20
4575.5
4575.5
1363.7
1362.2
7583.2
7581.3
30
4548.1
4551.3
1363.3
1357.5
7556.0
7548.6
40
4521.3
4527.7
1362.6
1352.1
7528.8
7515.8
50
4494.7
4505.0
1361.7
1346.9
7501.7
7483.1
60
4468.2
4483.4
1360.5
1340.8
7474.5
7450.3
70
4441.7
4463.1
1359.1
1334.1
7447.3
7417.6
80
4415.3
4443.5
1357.7
1327.5
7420.1
7384.9
90
4390.2
4424.6
1356.1
1320.7
7394.1
7352.2
100
4368.0
4406.7
1354.4
1313.7
7370.9
7314.9The optimal objective value of the SODNDP-RC1 and SODNDP-AARC1 models is denoted asz
*
(
b
R
) and z
*
(
b
A
R
), respectively. Moreover, the optimal objective value of the SODNDP model is denoted as z
*
(
b
N
), where it is computed based on the nominal demand d
i
t. Among the 100 travel demand vectors (d
i
t), we compare total cost from the nominal, robust, and adjustable robust capacity expansion plans against z
*
(
b
N
), z
*
(
b
R
), and z
*
(
b
A
R
), respectively. Figure 3 depicts the optimal objective value of the SODNDP, SODNDP-RC1, and SODNDP-AARC1 models, z
*
(
b
N
), z
*
(
b
R
), and z
*
(
b
A
R
), under different available budgets and uncertainty levels. Figure 4 shows the percentages for which ∑
t
∈
ℑ
,
i
∈
C
∖
C
s
c
i
t
x
i
t
(
d
,
b
N
)
≤
z
*
(
b
N
), ∑
t
∈
ℑ
,
i
∈
C
∖
C
s
c
i
t
x
i
t
(
d
,
b
R
)
≤
z
*
(
b
R
) and ∑
t
∈
ℑ
,
i
∈
C
∖
C
s
c
i
t
x
i
t
(
d
,
b
A
R
)
≤
z
*
(
b
A
R
) under different available budgets and uncertainty levels. As shown in Figures 3 and 4, on average, approximately 38% or 38 random demands out of the 100 yields total travel cost no larger than z
*
(
b
N
). In other words, the nominal total travel cost is 38% reliable. One the other hand, the average reliability of the robust total travel cost is 100% under different uncertainty levels, and the average reliability of the adjustable robust total travel cost is 50% when uncertainty level θ
=
0.1. Although the average reliability of the robust total travel cost is higher than that of the adjustable total travel cost, the robust total travel cost is far greater than the adjustable robust total travel cost, which demonstrates that the robust capacity expansion plans are overly conservative. In addition, the average reliability of the adjustable robust total travel cost is monotonically increasing with the rise of uncertainty level θ. The average reliability of the adjustable robust total travel cost is 80% when uncertainty level θ
=
0.3. The average reliability of the adjustable robust total travel cost is slightly lower than that of the robust total travel cost; however, the adjustable robust capacity expansion plans yield lower total travel cost. Thus, it is continuing to suggest that the adjustable robust capacity expansion plans are more flexible.Figure 3
The optimal objective value of the SODNDP, SODNDP-RC1, and SODNDP-AARC1 models.Figure 4
Reliability of the total cost estimate associated with nominal, robust, and adjustable robust capacity expansion plans.


## 7. Conclusion and Further Research

This paper applied the adjustable robust optimization methodology to the CTM-based single-level system-optimal dynamic NDP (DNDP) under demand uncertainty. We assumed that the uncertain demand belongs to a polyhedral set and used the adjustable robust optimization methodology to formulate the AARC of DNDP. In addition, the RC of DNDP was formulated by using the usual robust optimization approach, which was compared against the AARC of DNDP. Numerical example results show that the adjustable robust capacity expansion plans are more flexible and significantly less conservative than the usual robust capacity expansion plans.Several directions for future research are worth noting. Firstly, in this paper, the used LP based CTM model allows vehicle holding [35], which may be unrealistic. Secondly, ARO approach can be applied to alternative deterministic mathematical formulation [38] to overcome this problem. In addition, an extension to consider unbounded uncertainty set with globalized robust optimization [39] is another interesting research direction.



---

*Source: 739656-2014-02-17.xml*