# Evolutionary Marginal Cost Pricing Scheme Implementation Based on Stochastic Traffic Flow Information

Authors: Wei Xu; Agachai Sumalee
Journal: Mathematical Problems in Engineering
 (2015)

---

## Abstract

Traditionally, to implement the first-best marginal cost pricing scheme in a traffic network requires the information on the exact demand function or true origin-destination demand, which, however, is rarely available in practice. To overcome this dilemma, the trial-and-error method has been proposed to find the marginal cost toll through an iterative process using the observed traffic volumes. This method guarantees the convergence of tolls and flows to the system optimal state under the assumption of deterministic traffic conditions. However, in reality, the uncertainty of transportation network has been recognized well that induces the variability of link flow and travel time. Therefore, this paper proposes an evolutionary implementation method that iteratively finds the first-best marginal cost toll pattern according to the observed stochastic link flow information and the known travel time functions. The proof of the convergence of the iterative algorithm is presented. The paper also analyzes the effect of the sampling error of the link flow data on the convergence of the algorithm and shows that the biases from the flow observation will not affect the convergence. The numerical tests are provided for the illustration of the algorithm.


---

## Body

## 1. Introduction

The fundamental principle of road pricing, based on the concept of marginal social cost, is to impose the tolls equivalent to the externality incurred by road users to realize the socially optimal flow pattern. For a single road, the optimal toll is shown to be equal tov
·
d
t
(
v
)
/
d
v, where v is the link flow and d
t
(
v
)
/
d
v is the derivative of the link travel time function. This principle is also proven to be applicable to the network case in which it is often referred to as the “first-best” road pricing. To implement this ideal pricing scheme in a traffic network, the information on the exact demand function or true origin-destination (O-D) demand must be obtained. However, this is rarely available in practice in which most of the information on the demand function and O-D demand is often based on statistical estimations. In practice, on the other hand, the traffic volume data are observable and available in most cities. Li [1, 2] verified that the road pricing could go ahead on a trial-and-error basis without demand functions, which was first conjectured by Vickrey [3] and Downs [4]. The toll updating method developed by Li [2] is just for a single road link, and it was soon extended to a general network by Yang et al. [5], which proposed an efficient trial-and-error method to find the first-best pricing through an iterative process using the observed traffic volumes. The approach can guarantee the convergence of the tolls and flows to the system optimal state and successfully avoid the difficulty to acquire demand information. However, it is only proved under the assumption of deterministic traffic environment. In reality, the transportation network contains lots of stochastic factors including weather conditions, traffic incidents, and special events, which contribute to roadway capacity variation and travel demand fluctuation from day to day.Recently, substantial studies have focused on the uncertainty of transportation network. An uncertain traffic environment implies that link flows and travel times are stochastic, and thereby the reliability of route travel time plays an important role in traveler’s route choice behavior. Various reliability-based traffic assignment models were developed in view of the day-to-day demand fluctuations [6, 7] and link capacity variations [8]. A good understanding of the uncertainty is pretty important not only in traffic assignment problem, but also in network design problem (NDP). Patil and Ukkusuri [9] showed that neglecting the network uncertainty would lead to a suboptimal design. Several models that tackle the uncertainty issue in NDPs have been proposed recently in the literature ([10–14], etc.). Chen et al. [15] gave a complete literature review on NDPs with uncertainty. The effects of uncertain demand and supply have also been recognized in a variety of road pricing and tradable credit schemes design ([16–19], etc.). However, few studies pay attention to the question whether one can use the stochastic flow information collected in practice to define the marginal cost toll on a stochastic network.This paper tackles the above research question in which a trial-and-error method is again proposed to iteratively calculate the first-best marginal-cost toll based on the observable stochastic link flows. This paper postulates that the network uncertainty is caused by the stochastic day-to-day travel demand (e.g., [6, 7, 20]). Hence the link traffic flow and link travel time are both stochastic too. Under this stochastic network (SN), the travelers’ route choice decisions are assumed to follow the user equilibrium (UE) principle aiming to minimize their expected travel time. On the other hand, the system optimum (SO) is assumed to minimize the expected total travel time (for the fixed demand case). In order to distinguish them from those under the deterministic network, in this paper, they are referred to as SN-UE and SN-SO, respectively. The paper investigates the relationship between the SN-UE and SN-SO to establish the first-best marginal cost pricing for SN (SN-MCP), which is different from the original MCP in deterministic network. In other words, we cannot obtain the SN-MCP by using the expected values to do substitution. In the newly proposed trial-and-error algorithm, each trial toll is determined by the SN-MCP expression. That algorithm only requires the information on the statistics of the observed link flows and travel time functions. The distribution parameters of stochastic O-D demand are not needed. The paper proves the convergence of the iterative algorithm and also analyzes the effect of the sampling error of the link flow data on the convergence of the algorithm, in which the observation period may not be sufficiently long to deduce the true mean and variance of the link flow. We show that the biases from the flow observation will not affect the convergence of the optimal toll and flow pattern.The outline of the paper is as follows. First, we derive the general formulation of the SN-MCP and show a closed-form formulation/calculation of the SN-MCP for a special case. Then, the trial-and-error algorithm for evolutionary implementation of the marginal cost pricing based on stochastic link traffic volumes is developed. The convergence properties are analyzed and proved. Following this, two numerical examples are examined to demonstrate the validity of the proposed method and exhibit the difference of the SN-MCP and original MCP. Finally, some conclusions are given.


## 2. Marginal Cost Pricing under Stochastic Network

The MCP principle states that travelers using congested roads should pay a toll equal to the difference between the marginal social and private cost in order to minimize the total system cost if demands are fixed or maximize the social welfare if demands are variable. In previous literatures, when all link flows, and thereby all link travel times, are deterministic, the MCP is expressed as follows:(1)
MCP
=
∂
∑
a
∈
A
v
a
t
a
v
a
∂
v
a
-
t
a
v
a
=
v
a
·
d
t
a
v
a
d
v
a
,
where v
a is the amount of traffic flow on link a, t
a
(
v
a
) is the private cost for traversing link a and the derivative of the total system cost, ∑
a
∈
A
v
a
t
a
(
v
a
), with respect to the fact that v
a is the marginal social cost.Now, in this paper, travel demand uncertainty is taken into account. The stochastic demands give rise to stochastic link flows and stochastic link travel times. In this situation, it is obvious that we need to modify the expression of the MCP in (1) to make it well defined. If using capital V
a to represent the stochastic link flow, one argument is that we can simply substitute the expected value of V
a (i.e., E
[
V
a
]) into the original MCP, v
a
·
d
t
a
(
v
a
)
/
d
v
a. In this way, the expression of the original MCP changes to E
[
V
a
]
·
d
t
a
(
E
[
V
a
]
)
/
d
E
[
V
a
]. However, noting that t
a
(
E
[
V
a
]
) is not equal to E
[
t
a
(
V
a
)
] (the mean link travel time) with any nonlinear link travel time function, such a substitution generally cannot provide us the real difference between the marginal social and private cost. In the following analysis, it will be further seen that even if we take E
[
t
a
(
V
a
)
] to replace t
a
(
v
a
) rather than t
a
(
E
[
V
a
]
), that is, the original MCP changes to E
[
V
a
]
·
d
E
[
t
a
(
V
a
)
]
/
d
E
[
V
a
], it is not the real MCP under stochastic network. To obtain the SN-MCP, we next develop the SN-UE and SN-SO models, respectively, and then explore the gap between them.


## 3. Equilibrium Models under Stochastic Network

### 3.1. Notations and Assumptions

Consider a road networkG
=
(
N
,
A
) with N being the set of nodes and A being the set of links, respectively. Let W be the set of all O-D pairs and P
w the set of all paths for O-D pair w
∈
W. In the following, for consistency, random variables are expressed in upper-case letters and lower-case letters are used for the mean values:Q
w:
travel demand between O-D pairw
∈
W;
q
w:
mean travel demand between O-D pairw
∈
W;
ε
w
q:
variance of demand between O-D pairw
∈
W;
F
k
w:
traffic flow on pathk
∈
P
w;
f
k
w:
mean traffic flow on pathk
∈
P
w;
f:
vector of mean path flow,f
=
{
f
k
w
};
ε
k
w
,
f:
variance of traffic flow on pathk
∈
P
w;
V
a:
traffic flow on linka
∈
A;
v
a:
mean traffic flow on linka
∈
A;
v:
vector of mean link flow,v
=
{
v
a
};
ε
a
v:
variance of traffic flow on linka
∈
A;
T
a:
travel time on linka
∈
A;
t
a:
mean travel time on linka
∈
A;
t:
vector of mean link travel time,t
=
{
t
a
};
C
k
w:
travel time on pathk
∈
P
w;
c
k
w:
mean travel time on pathk
∈
P
w;
c:
vector of mean path travel time,c
=
{
c
k
w
};
π
w:
minimum mean travel time between O-D pairw
∈
W;
δ
k
,
a
w:
indicator variable, 1 if pathk
∈
P
w contains link a
∈
A, 0 otherwise;
TT:
total travel time,TT
=
∑
a
∈
A
V
a
T
a.The following basic assumptions are made throughout the paper, which are common in the literature of traffic equilibrium assignment with stochastic demand. (A1)
The O-D travel demands are assumed to be independently distributed.VMR
w is referred to as the variance to mean ratio of the stochastic demand in which VMR
w
=
ε
w
q
/
q
w.
(A2)
The path flow is assumed to be the product of path choice proportion and the O-D travel demand; that is,F
k
w
=
p
k
w
Q
w, where p
k
w
=
f
k
w
/
q
w that can be obtained from the model’s output [21]. Then, it follows from (A1) that F
k
w is also an independent random variable (r.v.) and follows the same statistical distribution as the O-D demand.
(A3)
The VMRs of path flows are assumed to be equal to that of the corresponding O-D demand [7].


### 3.2. SN-UE Model

Due to the uncertainty of travel time travelers may consider the trade-off between the mean and variance of travel time when making their route choice decision [22]. Different travelers with different risk-taking attitude will consider different weight between the mean and variance. If the weight on variance is positive (negative), it indicates that travelers are “risk-averse” (risk-prone). If travelers are concerned with the mean travel time only, that is, the weight on variance is zero, they are regarded as “risk-neutral.” In this study, we consider the case with the risk-neutral traveler only. The case with the risk prone/averse traveler can be extended in future.The SN-UE proposed here is analogous to the Wardropian principle; that is, the equilibrium is reached when no risk-neutral traveler can change his/her route unilaterally to reduce his/her average travel time which he/she experiences from day to day. This SN-UE condition can be mathematically stated as follows:(2)
c
k
w
=
π
w
,
if
f
k
w
>
0
c
k
w
≥
π
w
,
if
f
k
w
=
0
.
∀
k
∈
P
w
,
w
∈
W
.
Such complementary conditions can be further reformulated as a VI problem: for any f
∈
Ω
f, find f
*
∈
Ω
f such that
(3)
f
-
f
*
T
c
*
≥
0
,
where Ω
f is the feasible set of mean path flows defined as follows:
(4)
Ω
f
=
f
∣
f
≥
0
;
∑
k
∈
P
w
f
k
w
=
q
w
,
∀
w
∈
W
.
Note that the link flow is the sum of the flows on all paths using the link, which gives
(5)
v
a
=
E
V
a
=
E
∑
w
∈
W
∑
k
∈
P
w
δ
k
,
a
w
F
k
w
=
∑
w
∈
W
∑
k
∈
P
w
δ
k
,
a
w
E
F
k
w
=
∑
w
∈
W
∑
k
∈
P
w
δ
k
,
a
w
f
k
w
.
In addition, the path travel time is the sum of the travel times on all links comprising the path, which gives
(6)
c
k
w
=
E
C
k
w
=
E
∑
a
∈
A
δ
k
,
a
w
T
a
=
∑
a
∈
A
δ
k
,
a
w
E
T
a
=
∑
a
∈
A
δ
k
,
a
w
t
a
.
More compactly, (5) and (6) can be written as v
=
Δ
f and c
=
Δ
T
t, respectively, where Δ
=
{
δ
k
,
a
w
} is the link-path incidence matrix. Substituting them into (3), we have
(7)
v
-
v
*
T
t
*
≥
0
,
where the feasible region changes to Ω
v as well. Consider
(8)
Ω
v
=
v
∣
v
=
Δ
f
,
f
≥
0
;
∑
k
∈
P
w
f
k
w
=
q
w
,
∀
w
∈
W
.


### 3.3. SN-SO Model

For consistency, we also consider a risk-neutral system manager here first. Let the expected total travel time be the measure of system performance. To achieve the best state, the SN-SO targets to minimize the expected total travel time. Based on Beckmann’s formulation [23], the following mathematical program (MP) for SN-SO is defined:
(9)
min
⁡
v
∈
Ω
v
⁡
E
TT
=
E
∑
a
∈
A
V
a
T
a
.
The optimality conditions of a MP can also be written as a VI problem if the objective function is continuously differentiable and the feasible region is closed and convex [24]. These two conditions are obviously satisfied by MP (9). Therefore, it can be reformulated as a VI problem: for any v
∈
Ω
v, find v
*
∈
Ω
v such that
(10)
v
-
v
*
T
∇
v
E
TT
*
≥
0
,
where ∇
v
E
[
TT
*
]
=
{
∂
E
[
TT
*
]
/
∂
v
a
*
}.


## 3.1. Notations and Assumptions

Consider a road networkG
=
(
N
,
A
) with N being the set of nodes and A being the set of links, respectively. Let W be the set of all O-D pairs and P
w the set of all paths for O-D pair w
∈
W. In the following, for consistency, random variables are expressed in upper-case letters and lower-case letters are used for the mean values:Q
w:
travel demand between O-D pairw
∈
W;
q
w:
mean travel demand between O-D pairw
∈
W;
ε
w
q:
variance of demand between O-D pairw
∈
W;
F
k
w:
traffic flow on pathk
∈
P
w;
f
k
w:
mean traffic flow on pathk
∈
P
w;
f:
vector of mean path flow,f
=
{
f
k
w
};
ε
k
w
,
f:
variance of traffic flow on pathk
∈
P
w;
V
a:
traffic flow on linka
∈
A;
v
a:
mean traffic flow on linka
∈
A;
v:
vector of mean link flow,v
=
{
v
a
};
ε
a
v:
variance of traffic flow on linka
∈
A;
T
a:
travel time on linka
∈
A;
t
a:
mean travel time on linka
∈
A;
t:
vector of mean link travel time,t
=
{
t
a
};
C
k
w:
travel time on pathk
∈
P
w;
c
k
w:
mean travel time on pathk
∈
P
w;
c:
vector of mean path travel time,c
=
{
c
k
w
};
π
w:
minimum mean travel time between O-D pairw
∈
W;
δ
k
,
a
w:
indicator variable, 1 if pathk
∈
P
w contains link a
∈
A, 0 otherwise;
TT:
total travel time,TT
=
∑
a
∈
A
V
a
T
a.The following basic assumptions are made throughout the paper, which are common in the literature of traffic equilibrium assignment with stochastic demand. (A1)
The O-D travel demands are assumed to be independently distributed.VMR
w is referred to as the variance to mean ratio of the stochastic demand in which VMR
w
=
ε
w
q
/
q
w.
(A2)
The path flow is assumed to be the product of path choice proportion and the O-D travel demand; that is,F
k
w
=
p
k
w
Q
w, where p
k
w
=
f
k
w
/
q
w that can be obtained from the model’s output [21]. Then, it follows from (A1) that F
k
w is also an independent random variable (r.v.) and follows the same statistical distribution as the O-D demand.
(A3)
The VMRs of path flows are assumed to be equal to that of the corresponding O-D demand [7].


## 3.2. SN-UE Model

Due to the uncertainty of travel time travelers may consider the trade-off between the mean and variance of travel time when making their route choice decision [22]. Different travelers with different risk-taking attitude will consider different weight between the mean and variance. If the weight on variance is positive (negative), it indicates that travelers are “risk-averse” (risk-prone). If travelers are concerned with the mean travel time only, that is, the weight on variance is zero, they are regarded as “risk-neutral.” In this study, we consider the case with the risk-neutral traveler only. The case with the risk prone/averse traveler can be extended in future.The SN-UE proposed here is analogous to the Wardropian principle; that is, the equilibrium is reached when no risk-neutral traveler can change his/her route unilaterally to reduce his/her average travel time which he/she experiences from day to day. This SN-UE condition can be mathematically stated as follows:(2)
c
k
w
=
π
w
,
if
f
k
w
>
0
c
k
w
≥
π
w
,
if
f
k
w
=
0
.
∀
k
∈
P
w
,
w
∈
W
.
Such complementary conditions can be further reformulated as a VI problem: for any f
∈
Ω
f, find f
*
∈
Ω
f such that
(3)
f
-
f
*
T
c
*
≥
0
,
where Ω
f is the feasible set of mean path flows defined as follows:
(4)
Ω
f
=
f
∣
f
≥
0
;
∑
k
∈
P
w
f
k
w
=
q
w
,
∀
w
∈
W
.
Note that the link flow is the sum of the flows on all paths using the link, which gives
(5)
v
a
=
E
V
a
=
E
∑
w
∈
W
∑
k
∈
P
w
δ
k
,
a
w
F
k
w
=
∑
w
∈
W
∑
k
∈
P
w
δ
k
,
a
w
E
F
k
w
=
∑
w
∈
W
∑
k
∈
P
w
δ
k
,
a
w
f
k
w
.
In addition, the path travel time is the sum of the travel times on all links comprising the path, which gives
(6)
c
k
w
=
E
C
k
w
=
E
∑
a
∈
A
δ
k
,
a
w
T
a
=
∑
a
∈
A
δ
k
,
a
w
E
T
a
=
∑
a
∈
A
δ
k
,
a
w
t
a
.
More compactly, (5) and (6) can be written as v
=
Δ
f and c
=
Δ
T
t, respectively, where Δ
=
{
δ
k
,
a
w
} is the link-path incidence matrix. Substituting them into (3), we have
(7)
v
-
v
*
T
t
*
≥
0
,
where the feasible region changes to Ω
v as well. Consider
(8)
Ω
v
=
v
∣
v
=
Δ
f
,
f
≥
0
;
∑
k
∈
P
w
f
k
w
=
q
w
,
∀
w
∈
W
.


## 3.3. SN-SO Model

For consistency, we also consider a risk-neutral system manager here first. Let the expected total travel time be the measure of system performance. To achieve the best state, the SN-SO targets to minimize the expected total travel time. Based on Beckmann’s formulation [23], the following mathematical program (MP) for SN-SO is defined:
(9)
min
⁡
v
∈
Ω
v
⁡
E
TT
=
E
∑
a
∈
A
V
a
T
a
.
The optimality conditions of a MP can also be written as a VI problem if the objective function is continuously differentiable and the feasible region is closed and convex [24]. These two conditions are obviously satisfied by MP (9). Therefore, it can be reformulated as a VI problem: for any v
∈
Ω
v, find v
*
∈
Ω
v such that
(10)
v
-
v
*
T
∇
v
E
TT
*
≥
0
,
where ∇
v
E
[
TT
*
]
=
{
∂
E
[
TT
*
]
/
∂
v
a
*
}.


## 4. The SN-MCP and Its Calculation

### 4.1. Derivation of the SN-MCP

Comparing (7) and (10), if travelers can realize that their travel cost is ∂
E
[
TT
]
/
∂
v
a but not t
a, the traffic flow pattern of SN-UE and SN-SO will be the same. However, the marginal external cost, that is, the gap between ∂
E
[
TT
]
/
∂
v
a and t
a, is often ignored by travelers. Thus, as in the deterministic network, to force travelers to notice such a cost, a toll that equates the gap on each link is charged.Now we specifically focus on the link travel time function in a polynomial form:(11)
T
a
=
t
a
V
a
=
∑
j
=
0
m
b
j
a
V
a
j
,
∀
a
∈
A
.
The power-law form of the commonly used BPR functions is a special case of (11). For other functional forms, a polynomial Taylor series approximation may be used to obtain the link travel time function in the form of (11).Based on (11), the mean travel time on link a
∈
A is
(12)
E
T
a
=
E
∑
j
=
0
m
b
j
a
V
a
j
=
∑
j
=
0
m
b
j
a
E
V
a
j
,
and the expected total travel time is
(13)
E
TT
=
E
∑
a
∈
A
∑
j
=
0
m
b
j
a
V
a
j
+
1
=
∑
a
∈
A
∑
j
=
0
m
b
j
a
E
V
a
j
+
1
.
Therefore, the SN-MCP can be given as follows:
(14)
SN-MCP
=
∂
E
TT
∂
v
a
-
E
T
a
=
∑
j
=
0
m
b
j
a
∂
E
V
a
j
+
1
∂
v
a
-
E
V
a
j
.
Note that
(15)
E
V
a
j
=
∂
E
V
a
j
E
V
a
∂
v
a
-
E
V
a
∂
E
V
a
j
∂
v
a
.
Then replacing the term E
[
V
a
j
] in (14) with (15), we have
(16)
SN-MCP
=
∑
j
=
0
m
b
j
a
∂
E
V
a
j
+
1
∂
v
a
-
∂
E
V
a
j
E
V
a
∂
v
a
m
m
m
m
m
i
m
n
+
E
V
a
∂
E
V
a
j
∂
v
a
=
v
a
∂
E
T
a
∂
v
a
+
∑
j
=
0
m
b
j
a
∂
E
V
a
j
+
1
∂
v
a
-
∂
E
V
a
j
E
V
a
∂
v
a
=
v
a
∂
E
T
a
∂
v
a
+
∑
j
=
0
m
b
j
a
∂
Cov
V
a
j
,
V
a
∂
v
a
,
where the first term of the right-hand-side (RHS) of (16) is referred to as the average MCP and the second term is what the average MCP ignores. Obviously, as long as the covariance of V
a
j and V
a is a strictly monotone function of v
a, that is, ∂
Cov
[
V
a
j
,
V
a
]
/
∂
v
a
>
0, the average MCP underestimates the real SN-MCP.


### 4.2. Calculation of the SN-MCP for a Special Case

To specifically quantify the SN-MCP, the exact value of each derivative in (16) should be calculated. In this subsection, we show how to derive the closed-form formulation of (16) for a special case with log-normal demands and an assumption of constant VMR across all O-D pairs. The constant VMR assumption is a little too strict in reality, but it will facilitate our following calculation and analysis. In the future study, we will try to relax this assumption.The log-normal distribution is a positive and asymmetric distribution. The assumption that O-D demands follow log-normal distribution was adopted in many studies (see, e.g., [7, 25]). Moreover, Uno et al. [26] used the empirical travel time data to validate the fact that the path travel times in their specific case study follow the log-normal distribution. To obtain the log-normal stochastic travel time in the proposed SN, the assumption of the log-normal O-D demands is required.Note that according to (A2), the path flows follow the log-normal distribution as well. Following Fenton [27], the summation of the log-normal r.v.’s can be still estimated by a log-normal distribution. It shows that the link flow, which is the sum of related path flows, also follows the log-normal distribution, that is, V
a
~
LN
(
μ
a
v
,
σ
a
v
), where the distribution parameters μ
a
v and σ
a
v are as follows:
(17)
μ
a
v
=
ln
⁡
v
a
-
1
2
ln
⁡
1
+
ε
a
v
v
a
2
,
σ
a
v
2
=
ln
⁡
1
+
ε
a
v
v
a
2
.
Any jth moment of the log-normal link flow V
a exists and can be calculated via the moment generating function. The general expression is given by the following:
(18)
E
V
a
j
=
exp
⁡
j
μ
a
v
+
j
2
σ
a
v
2
2
.
In addition to the assumption on statistical distribution of demands, the other assumption that the VMRs of demands are the same for all O-D pairs is required to allow for the closed-form calculation of the proposed SN-MCP, in which E
[
V
a
j
] and Cov
[
V
a
j
,
V
a
] can be derived as a function of the mean link flow v
a.Again utilizing the relationship between the link and path flows, we have(19)
ε
a
v
=
Var
V
a
=
Var
∑
w
∈
W
∑
k
∈
P
w
δ
k
,
a
w
F
k
w
=
∑
w
∈
W
∑
k
∈
P
w
δ
k
,
a
w
2
Var
F
k
w
=
∑
w
∈
W
∑
k
∈
P
w
δ
k
,
a
w
ε
k
w
,
f
.
With (A3) and the constant VMR assumption, ε
k
w
,
f
=
VMR
·
f
k
w. Therefore, it follows from (19) and (5) that the variance of link flow can be further reduced to(20)
ε
a
v
=
VMR
·
∑
w
∈
W
∑
k
∈
P
w
δ
k
,
a
w
f
k
w
=
VMR
·
v
a
.
Now let us combine (17), (18), and (20) together and perform some manipulations; then it yields that
(21)
E
V
a
j
=
v
a
j
1
+
VMR
v
a
j
2
-
j
,
Cov
V
a
j
,
V
a
=
E
V
a
j
+
1
-
E
V
a
j
E
V
a
=
v
a
j
+
1
1
+
VMR
v
a
j
2
+
j
-
v
a
j
+
1
1
+
VMR
v
a
j
2
-
j
.
Using notation s
a
=
1
+
VMR
/
v
a to simplify the formulation, we have
(22)
∂
Cov
V
a
j
,
V
a
∂
v
a
=
j
+
1
v
a
j
s
a
j
2
+
j
-
s
a
j
2
-
j
+
1
-
s
a
2
2
s
a
2
v
a
j
j
2
+
j
s
a
j
2
+
j
-
j
2
-
j
s
a
j
2
-
j
.
Furthermore,
(23)
∂
E
T
a
∂
v
a
=
∑
j
=
0
m
b
j
a
∂
E
V
a
j
∂
v
a
=
∑
j
=
0
m
b
j
a
v
a
j
-
1
s
a
j
2
-
j
j
+
j
2
-
j
·
1
-
s
a
2
2
s
a
2
.
By substituting (22) and (23) into (16), the value of the SN-MCP can be determined as long as the mean link flows under the SN-SO are known. The closed-form formulation can also be derived from other statistical distributions of travel demand. In the numerical test part, the case with normal distribution will be checked as well.


## 4.1. Derivation of the SN-MCP

Comparing (7) and (10), if travelers can realize that their travel cost is ∂
E
[
TT
]
/
∂
v
a but not t
a, the traffic flow pattern of SN-UE and SN-SO will be the same. However, the marginal external cost, that is, the gap between ∂
E
[
TT
]
/
∂
v
a and t
a, is often ignored by travelers. Thus, as in the deterministic network, to force travelers to notice such a cost, a toll that equates the gap on each link is charged.Now we specifically focus on the link travel time function in a polynomial form:(11)
T
a
=
t
a
V
a
=
∑
j
=
0
m
b
j
a
V
a
j
,
∀
a
∈
A
.
The power-law form of the commonly used BPR functions is a special case of (11). For other functional forms, a polynomial Taylor series approximation may be used to obtain the link travel time function in the form of (11).Based on (11), the mean travel time on link a
∈
A is
(12)
E
T
a
=
E
∑
j
=
0
m
b
j
a
V
a
j
=
∑
j
=
0
m
b
j
a
E
V
a
j
,
and the expected total travel time is
(13)
E
TT
=
E
∑
a
∈
A
∑
j
=
0
m
b
j
a
V
a
j
+
1
=
∑
a
∈
A
∑
j
=
0
m
b
j
a
E
V
a
j
+
1
.
Therefore, the SN-MCP can be given as follows:
(14)
SN-MCP
=
∂
E
TT
∂
v
a
-
E
T
a
=
∑
j
=
0
m
b
j
a
∂
E
V
a
j
+
1
∂
v
a
-
E
V
a
j
.
Note that
(15)
E
V
a
j
=
∂
E
V
a
j
E
V
a
∂
v
a
-
E
V
a
∂
E
V
a
j
∂
v
a
.
Then replacing the term E
[
V
a
j
] in (14) with (15), we have
(16)
SN-MCP
=
∑
j
=
0
m
b
j
a
∂
E
V
a
j
+
1
∂
v
a
-
∂
E
V
a
j
E
V
a
∂
v
a
m
m
m
m
m
i
m
n
+
E
V
a
∂
E
V
a
j
∂
v
a
=
v
a
∂
E
T
a
∂
v
a
+
∑
j
=
0
m
b
j
a
∂
E
V
a
j
+
1
∂
v
a
-
∂
E
V
a
j
E
V
a
∂
v
a
=
v
a
∂
E
T
a
∂
v
a
+
∑
j
=
0
m
b
j
a
∂
Cov
V
a
j
,
V
a
∂
v
a
,
where the first term of the right-hand-side (RHS) of (16) is referred to as the average MCP and the second term is what the average MCP ignores. Obviously, as long as the covariance of V
a
j and V
a is a strictly monotone function of v
a, that is, ∂
Cov
[
V
a
j
,
V
a
]
/
∂
v
a
>
0, the average MCP underestimates the real SN-MCP.


## 4.2. Calculation of the SN-MCP for a Special Case

To specifically quantify the SN-MCP, the exact value of each derivative in (16) should be calculated. In this subsection, we show how to derive the closed-form formulation of (16) for a special case with log-normal demands and an assumption of constant VMR across all O-D pairs. The constant VMR assumption is a little too strict in reality, but it will facilitate our following calculation and analysis. In the future study, we will try to relax this assumption.The log-normal distribution is a positive and asymmetric distribution. The assumption that O-D demands follow log-normal distribution was adopted in many studies (see, e.g., [7, 25]). Moreover, Uno et al. [26] used the empirical travel time data to validate the fact that the path travel times in their specific case study follow the log-normal distribution. To obtain the log-normal stochastic travel time in the proposed SN, the assumption of the log-normal O-D demands is required.Note that according to (A2), the path flows follow the log-normal distribution as well. Following Fenton [27], the summation of the log-normal r.v.’s can be still estimated by a log-normal distribution. It shows that the link flow, which is the sum of related path flows, also follows the log-normal distribution, that is, V
a
~
LN
(
μ
a
v
,
σ
a
v
), where the distribution parameters μ
a
v and σ
a
v are as follows:
(17)
μ
a
v
=
ln
⁡
v
a
-
1
2
ln
⁡
1
+
ε
a
v
v
a
2
,
σ
a
v
2
=
ln
⁡
1
+
ε
a
v
v
a
2
.
Any jth moment of the log-normal link flow V
a exists and can be calculated via the moment generating function. The general expression is given by the following:
(18)
E
V
a
j
=
exp
⁡
j
μ
a
v
+
j
2
σ
a
v
2
2
.
In addition to the assumption on statistical distribution of demands, the other assumption that the VMRs of demands are the same for all O-D pairs is required to allow for the closed-form calculation of the proposed SN-MCP, in which E
[
V
a
j
] and Cov
[
V
a
j
,
V
a
] can be derived as a function of the mean link flow v
a.Again utilizing the relationship between the link and path flows, we have(19)
ε
a
v
=
Var
V
a
=
Var
∑
w
∈
W
∑
k
∈
P
w
δ
k
,
a
w
F
k
w
=
∑
w
∈
W
∑
k
∈
P
w
δ
k
,
a
w
2
Var
F
k
w
=
∑
w
∈
W
∑
k
∈
P
w
δ
k
,
a
w
ε
k
w
,
f
.
With (A3) and the constant VMR assumption, ε
k
w
,
f
=
VMR
·
f
k
w. Therefore, it follows from (19) and (5) that the variance of link flow can be further reduced to(20)
ε
a
v
=
VMR
·
∑
w
∈
W
∑
k
∈
P
w
δ
k
,
a
w
f
k
w
=
VMR
·
v
a
.
Now let us combine (17), (18), and (20) together and perform some manipulations; then it yields that
(21)
E
V
a
j
=
v
a
j
1
+
VMR
v
a
j
2
-
j
,
Cov
V
a
j
,
V
a
=
E
V
a
j
+
1
-
E
V
a
j
E
V
a
=
v
a
j
+
1
1
+
VMR
v
a
j
2
+
j
-
v
a
j
+
1
1
+
VMR
v
a
j
2
-
j
.
Using notation s
a
=
1
+
VMR
/
v
a to simplify the formulation, we have
(22)
∂
Cov
V
a
j
,
V
a
∂
v
a
=
j
+
1
v
a
j
s
a
j
2
+
j
-
s
a
j
2
-
j
+
1
-
s
a
2
2
s
a
2
v
a
j
j
2
+
j
s
a
j
2
+
j
-
j
2
-
j
s
a
j
2
-
j
.
Furthermore,
(23)
∂
E
T
a
∂
v
a
=
∑
j
=
0
m
b
j
a
∂
E
V
a
j
∂
v
a
=
∑
j
=
0
m
b
j
a
v
a
j
-
1
s
a
j
2
-
j
j
+
j
2
-
j
·
1
-
s
a
2
2
s
a
2
.
By substituting (22) and (23) into (16), the value of the SN-MCP can be determined as long as the mean link flows under the SN-SO are known. The closed-form formulation can also be derived from other statistical distributions of travel demand. In the numerical test part, the case with normal distribution will be checked as well.


## 5. Trial-and-Error Implementation of SN-MCP

As mentioned, the trial-and-error methods developed before are all based on the assumption of deterministic traffic state. The precise deterministic UE link flows are assumed to be observable and are used to adjust the toll levels in each trial. However, just considering the observation errors, such an assumption cannot be truly realized in practice, not to mention the variability of link flows and travel times due to the stochastic demand. If one observes the link flow on a section of highway between a certain time of day and over a time period (e.g., one month), it is obvious that the collected flow count data are random. Due to the uncertainty of traffic flow information, we cannot arbitrarily pick up one day’s observation data to refer to in the toll updating scheme. Instead the mean of the data collected over a time period is preferred to be utilized. However, it should be noted that when the mean values are used in the toll updating scheme, the MCP determination formula as shown in (16) (i.e., SN-MCP) is different with the original MCP replaced by the mean value. Therefore, in this section, we are intent on revising the trial-and-error procedure presented by Yang et al. [5] to allow it to proceed in the studied SN case as well.Here assume that the stochastic travel demand follows some statistical distribution, but the distribution parameters are unknown and not easy to be estimated. In other words, the mean and variance of each O-D demand are not available. Under this situation, it is impossible to find the equilibrium flow pattern and thereby obtain the marginal-cost tolls by directly solving the related mathematical problem. The obstacle that we meet now is the same as that in the case of deterministic network. To remove the influence of the limited information, we turn to the trial-and-error idea again to propose a method that iteratively calculates the marginal-cost tolls based on the observable stochastic link flows. The detailed implementation procedure is presented below.Step  0  (initialization). Let {
v
a
0
,
a
∈
A
} be an initial set of feasible mean link flows. Set k
=
0.Step 1 (estimate link tolls).
For each linka
∈
A, calculate the current link toll τ
a
(
k
) by
(24)
τ
a
k
=
v
a
k
∂
E
T
a
k
∂
v
a
k
+
∑
j
=
0
m
b
j
a
∂
Cov
V
a
k
j
,
V
a
k
∂
v
a
k
.Step 2 (observe link flows).
After imposition of the link tolls given by (24) on a network, observe and collect the link count data over a period of time. Then, compute the mean and variance of the collected link flows via data fitting. Let {
v
-
a
k
,
a
∈
A
} denote the estimated mean value.Step 3 (check convergence).
If∥
v
-
k
-
v
k
∥
/
∥
v
(
k
)
∥
<
ε, then stop. Otherwise, go to Step 4.Step 4 (update link flows).
Set(25)
v
a
k
+
1
=
v
a
k
+
α
k
v
-
a
k
-
v
a
k
,
a
∈
A
,
and k
:
=
k
+
1; go to Step 1.In the procedure above, “∥
·
∥” denotes the Euclidean norm; ε is a positive number of convergence tolerance; {
α
k
} is a sequence of predetermined step sizes and it must satisfy the following three conditions:
(26)
0
<
α
k
≤
1
,
∑
k
=
1
∞
α
k
=
+
∞
,
∑
k
=
1
∞
α
k
2
<
+
∞
.
A typical sequence of α
k is α
k
=
1
/
k.Remark 1.
In Section4, the SN-MCP given by (24) was specifically quantified for a special case with log-normal demands and an assumption of constant VMR across all O-D pairs. From the previous analysis, it is known that, for that special case, each trial toll pattern in Step 1 could be calculated when the mean link flows and the VMR of O-D demands are available. Since the mean and variance of all stochastic O-D demands are assumed to be unknown in practice, the VMR of O-D demands is unknown as well. However, under the assumptions made before, the VMR of O-D demands could be obtained by calculating the VMR of link flows according to (20). When implementing the above algorithm in reality, both the mean and the variance of each UE link flow can be estimated by the collected link traffic count data. The only question is that the variance to mean ratio (VMR) of each link flow is probably not the same exactly due to random errors. Therefore, in the following numerical experiments, we take the average of all VMRs of link flows as the required constant VMR in the algorithm.Remark 2.
At each iteration of the above algorithm, we will fit a series of observed link flow data into a suitable probability distribution. Then, the parameters of the distribution, that is, the mean and variance of UE link flows, can be obtained. The “dfittool” in MATLAB will be utilized to fit distributions in the following numerical experiments.


### 5.1. Convergence of the Trial-and-Error Implementation

In order to prove the convergence of the above-presented trial-and-error method, we provide the following two important propositions, which are similar to that in Yang et al. [5].Proposition 3.
If∥
v
-
(
k
)
-
v
(
k
)
∥
=
0 at the convergent point, then {
v
a
(
k
)
,
a
∈
A
} is the mean SN-UE link flow pattern and {
τ
a
(
k
)
,
a
∈
A
} is the corresponding optimal link toll pattern.Proof.
According to the above algorithm, after the toll patternτ
(
k
)
=
{
τ
a
(
k
)
,
a
∈
A
} as shown in (24) is implemented, the revealed mean link flow pattern, v
-
(
k
)
=
{
v
-
a
(
k
)
,
a
∈
A
}, is the solution of the following VI problem:
(27)
v
-
v
-
(
k
)
T
t
-
(
k
)
+
τ
(
k
)
≥
0
,
∀
v
∈
Ω
.
If ∥
v
-
(
k
)
-
v
(
k
)
∥
=
0, then v
-
a
(
k
)
=
v
a
(
k
) for all link a. Hence
(28)
t
-
(
k
)
+
τ
(
k
)
=
t
(
k
)
+
τ
(
k
)
=
∇
v
E
TT
(
k
)
,
which means v
-
(
k
), or say v
(
k
), is already the optimal solution of VI problem (10). That is, the toll pattern τ
(
k
) now is the optimal one in the sense of first-best pricing.Proposition 4.
If the mean link travel costt is strongly monotone with respect to the mean link flow v, that is, there exists a positive constant ρ such that, for any distinct v
1
∈
Ω
v and v
2
∈
Ω
v, we have
(29)
t
1
-
t
2
T
v
1
-
v
2
≥
ρ
v
1
-
v
2
2
,
then the vector (
v
-
(
k
)
-
v
(
k
)
) is a feasible descent direction of the objective function of MP (9) at v
(
k
).Proof.
Note that the gradient of objective function (9) is given as follows:
(30)
∇
v
E
TT
(
k
)
=
t
(
k
)
+
τ
(
k
)
.
Therefore,
(31)
v
-
(
k
)
-
v
(
k
)
T
∇
v
E
TT
(
k
)
=
v
-
(
k
)
-
v
(
k
)
T
t
(
k
)
+
τ
(
k
)
=
v
-
(
k
)
-
v
(
k
)
T
t
(
k
)
-
t
-
(
k
)
+
v
-
k
-
v
k
T
t
-
k
+
τ
k
.
From (29), the first term of (31) is less than or equal to -
ρ
∥
v
-
(
k
)
-
v
(
k
)
∥
2. From (27), the second term of (31) is nonpositive. Thus,
(32)
v
-
(
k
)
-
v
(
k
)
T
∇
v
E
TT
(
k
)
≤
-
ρ
v
-
k
-
v
k
2
.
It is obvious that, as long as v
-
(
k
)
≠
v
(
k
), we have (
v
-
(
k
)
-
v
(
k
)
)
T
∇
v
E
[
TT
(
k
)
]
<
0, which indicates that the vector (
v
-
(
k
)
-
v
(
k
)
) is a descent direction.Now let us illustrate that the proposed iterative procedure does converge; that is,v
(
k
)
→
v
* and τ
(
k
)
→
τ
* when k
→
∞. Since the separable link travel time function t
a
(
V
a
) is assumed, the Hessian matrix of objective function (9) must be a diagonal matrix. Let E
a
′′
[
TT
] represent its diagonal element; then
(33)
v
-
(
k
)
-
v
(
k
)
T
∇
v
2
E
TT
v
-
(
k
)
-
v
(
k
)
=
∑
a
∈
A
E
a
′′
TT
v
-
a
k
-
v
a
k
2
.
The RHS of (33) is always bounded for the bounded link travel time functions. Combining this conclusion with Proposition 4 and the conditions for choosing the step size sequence, all convergence requirements regarding the method of successive average (MSA) are satisfied [28]. Thus, the convergence of the proposed trial-and-error algorithm is followed.


### 5.2. Analysis of the Sampling Error on the Trial-and-Error Implementation

As mentioned above, we present a theoretical proof on the convergence of the proposed trial-and-error procedure. All the propositions are shown to hold with the true mean link flows under SN-UE. In real application, however, the true mean link flows also cannot be exactly obtained. The reason is that when the trial-and-error procedure is executed in practice, the link flow data can only be observed and collected over a limited period of time (e.g., one month). Hence, the mean link flows calculated from the limited sampling data are generally not equal to their true values. In other words, at each iteration, only an approximate mean link flow pattern can be used to update the trial tolls. Then a question emerges: will such an approximation affect the convergence of the trial-and-error procedure or the correctness of the convergent result?Fortunately, the iterative algorithm we explored here is in essential the method of successive average. The convergence requirements of such a method can guarantee the sequence of solutions to converge to the minimum even if the search direction is a descent vector only on the average. For example, when the MSA is applied to solve the SUE problem, it sometimes requires a Probit stochastic network loading via using Monte-Carlo simulation to determine the descent direction. If such a technique is resorted, then no matter how many times the simulation procedure is repeated, the resulting averaged link flows are not the actual ones. The direction vectors that are produced by such simulations are thereby random direction. However, even in this case, the MSA algorithm still can converge as long as an unbiased estimate of the direction is utilized.Now we encounter the same situation when simulating the mean values of the link flows. As mentioned before, regardless of how long the observation period is allowed and how many the sampling data are collected, the true mean value cannot be accurately computed but estimated. Therefore, each time after the trial toll charge is imposed on the network, the estimated mean SN-UE link flow patternv
-
(
k
) is in fact a random variable. That is to say, the descent direction vector (
v
-
(
k
)
-
v
(
k
)
) is random as well.Using the simplest step size sequence that satisfies conditions (26), {
α
(
k
)
=
1
/
k
}, then
(34)
v
(
k
+
1
)
=
v
(
k
)
+
1
k
v
-
(
k
)
-
v
(
k
)
.
This relation can be rewritten as follows: as its name, the method of successive average, means:
(35)
v
(
k
+
1
)
=
1
k
∑
l
=
1
k
v
-
(
l
)
.
Thus the variance of each component of v
(
k
+
1
) is given by
(36)
Var
v
a
k
+
1
=
1
k
2
∑
l
=
1
k
Var
v
-
a
l
.
At each iteration, since the revealed link flow v
-
a
(
l
) is always below the sum of all O-D flows, the variance of  v
-
a
(
l
) is bounded by some value; that is, Var
(
v
-
a
(
l
)
)
<
σ
2
<
∞, ∀
l. Therefore,
(37)
Var
v
a
k
+
1
<
1
k
2
∑
l
=
1
k
σ
2
.
Obviously, the RHS of (37) approaches zero as k grows, meaning that the variance of v
a
(
k
+
1
) approaches zero as the algorithm progresses. This further indicates that the variance of trial toll pattern τ
(
k
+
1
) updated by using v
(
k
+
1
) approaches zero too. In terms of these properties, it can be ensured that the convergence of the proposed iterative procedure will not be affected no matter how accurate the simulation is at each iteration.


## 5.1. Convergence of the Trial-and-Error Implementation

In order to prove the convergence of the above-presented trial-and-error method, we provide the following two important propositions, which are similar to that in Yang et al. [5].Proposition 3.
If∥
v
-
(
k
)
-
v
(
k
)
∥
=
0 at the convergent point, then {
v
a
(
k
)
,
a
∈
A
} is the mean SN-UE link flow pattern and {
τ
a
(
k
)
,
a
∈
A
} is the corresponding optimal link toll pattern.Proof.
According to the above algorithm, after the toll patternτ
(
k
)
=
{
τ
a
(
k
)
,
a
∈
A
} as shown in (24) is implemented, the revealed mean link flow pattern, v
-
(
k
)
=
{
v
-
a
(
k
)
,
a
∈
A
}, is the solution of the following VI problem:
(27)
v
-
v
-
(
k
)
T
t
-
(
k
)
+
τ
(
k
)
≥
0
,
∀
v
∈
Ω
.
If ∥
v
-
(
k
)
-
v
(
k
)
∥
=
0, then v
-
a
(
k
)
=
v
a
(
k
) for all link a. Hence
(28)
t
-
(
k
)
+
τ
(
k
)
=
t
(
k
)
+
τ
(
k
)
=
∇
v
E
TT
(
k
)
,
which means v
-
(
k
), or say v
(
k
), is already the optimal solution of VI problem (10). That is, the toll pattern τ
(
k
) now is the optimal one in the sense of first-best pricing.Proposition 4.
If the mean link travel costt is strongly monotone with respect to the mean link flow v, that is, there exists a positive constant ρ such that, for any distinct v
1
∈
Ω
v and v
2
∈
Ω
v, we have
(29)
t
1
-
t
2
T
v
1
-
v
2
≥
ρ
v
1
-
v
2
2
,
then the vector (
v
-
(
k
)
-
v
(
k
)
) is a feasible descent direction of the objective function of MP (9) at v
(
k
).Proof.
Note that the gradient of objective function (9) is given as follows:
(30)
∇
v
E
TT
(
k
)
=
t
(
k
)
+
τ
(
k
)
.
Therefore,
(31)
v
-
(
k
)
-
v
(
k
)
T
∇
v
E
TT
(
k
)
=
v
-
(
k
)
-
v
(
k
)
T
t
(
k
)
+
τ
(
k
)
=
v
-
(
k
)
-
v
(
k
)
T
t
(
k
)
-
t
-
(
k
)
+
v
-
k
-
v
k
T
t
-
k
+
τ
k
.
From (29), the first term of (31) is less than or equal to -
ρ
∥
v
-
(
k
)
-
v
(
k
)
∥
2. From (27), the second term of (31) is nonpositive. Thus,
(32)
v
-
(
k
)
-
v
(
k
)
T
∇
v
E
TT
(
k
)
≤
-
ρ
v
-
k
-
v
k
2
.
It is obvious that, as long as v
-
(
k
)
≠
v
(
k
), we have (
v
-
(
k
)
-
v
(
k
)
)
T
∇
v
E
[
TT
(
k
)
]
<
0, which indicates that the vector (
v
-
(
k
)
-
v
(
k
)
) is a descent direction.Now let us illustrate that the proposed iterative procedure does converge; that is,v
(
k
)
→
v
* and τ
(
k
)
→
τ
* when k
→
∞. Since the separable link travel time function t
a
(
V
a
) is assumed, the Hessian matrix of objective function (9) must be a diagonal matrix. Let E
a
′′
[
TT
] represent its diagonal element; then
(33)
v
-
(
k
)
-
v
(
k
)
T
∇
v
2
E
TT
v
-
(
k
)
-
v
(
k
)
=
∑
a
∈
A
E
a
′′
TT
v
-
a
k
-
v
a
k
2
.
The RHS of (33) is always bounded for the bounded link travel time functions. Combining this conclusion with Proposition 4 and the conditions for choosing the step size sequence, all convergence requirements regarding the method of successive average (MSA) are satisfied [28]. Thus, the convergence of the proposed trial-and-error algorithm is followed.


## 5.2. Analysis of the Sampling Error on the Trial-and-Error Implementation

As mentioned above, we present a theoretical proof on the convergence of the proposed trial-and-error procedure. All the propositions are shown to hold with the true mean link flows under SN-UE. In real application, however, the true mean link flows also cannot be exactly obtained. The reason is that when the trial-and-error procedure is executed in practice, the link flow data can only be observed and collected over a limited period of time (e.g., one month). Hence, the mean link flows calculated from the limited sampling data are generally not equal to their true values. In other words, at each iteration, only an approximate mean link flow pattern can be used to update the trial tolls. Then a question emerges: will such an approximation affect the convergence of the trial-and-error procedure or the correctness of the convergent result?Fortunately, the iterative algorithm we explored here is in essential the method of successive average. The convergence requirements of such a method can guarantee the sequence of solutions to converge to the minimum even if the search direction is a descent vector only on the average. For example, when the MSA is applied to solve the SUE problem, it sometimes requires a Probit stochastic network loading via using Monte-Carlo simulation to determine the descent direction. If such a technique is resorted, then no matter how many times the simulation procedure is repeated, the resulting averaged link flows are not the actual ones. The direction vectors that are produced by such simulations are thereby random direction. However, even in this case, the MSA algorithm still can converge as long as an unbiased estimate of the direction is utilized.Now we encounter the same situation when simulating the mean values of the link flows. As mentioned before, regardless of how long the observation period is allowed and how many the sampling data are collected, the true mean value cannot be accurately computed but estimated. Therefore, each time after the trial toll charge is imposed on the network, the estimated mean SN-UE link flow patternv
-
(
k
) is in fact a random variable. That is to say, the descent direction vector (
v
-
(
k
)
-
v
(
k
)
) is random as well.Using the simplest step size sequence that satisfies conditions (26), {
α
(
k
)
=
1
/
k
}, then
(34)
v
(
k
+
1
)
=
v
(
k
)
+
1
k
v
-
(
k
)
-
v
(
k
)
.
This relation can be rewritten as follows: as its name, the method of successive average, means:
(35)
v
(
k
+
1
)
=
1
k
∑
l
=
1
k
v
-
(
l
)
.
Thus the variance of each component of v
(
k
+
1
) is given by
(36)
Var
v
a
k
+
1
=
1
k
2
∑
l
=
1
k
Var
v
-
a
l
.
At each iteration, since the revealed link flow v
-
a
(
l
) is always below the sum of all O-D flows, the variance of  v
-
a
(
l
) is bounded by some value; that is, Var
(
v
-
a
(
l
)
)
<
σ
2
<
∞, ∀
l. Therefore,
(37)
Var
v
a
k
+
1
<
1
k
2
∑
l
=
1
k
σ
2
.
Obviously, the RHS of (37) approaches zero as k grows, meaning that the variance of v
a
(
k
+
1
) approaches zero as the algorithm progresses. This further indicates that the variance of trial toll pattern τ
(
k
+
1
) updated by using v
(
k
+
1
) approaches zero too. In terms of these properties, it can be ensured that the convergence of the proposed iterative procedure will not be affected no matter how accurate the simulation is at each iteration.


## 6. Numerical Tests

Example 1.
The test network for Example1 is taken from Yang et al. [5] as shown in Figure 1, which has 7 nodes, 11 links, and 4 O-D pairs.Figure 1
Road network used for Example1.In this example, the BPR link cost function, that is,(38)
t
a
V
a
=
t
a
0
+
b
a
V
a
c
a
n
a
,
is adopted with n
a
=
4 for all link a. The other link cost parameters (e.g., the free-flow travel time t
a
0 and the capacity c
a of each link) are given in Table 1.Table 1
Link cost parameters for Example1.
Link
t
a
0
b
a
c
a
1
6
0.90
200
2
5
0.75
200
3
6
0.90
200
4
7
1.05
200
5
6
0.90
100
6
1
0.15
100
7
5
0.75
150
8
10
1.50
150
9
11
1.65
200
10
11
1.65
200
11
15
2.25
200For each O-D pair, the mean of the log-normal demand is shown in Table2. It is worth noting that the reason we give the mean values here is that, in numerical experiments, the SN-UE flow pattern cannot be observed. Thus, the mean values are purely used for generating the observed link flows, which is not necessary for updating link tolls in the real implementation of trial-and-error method.Table 2
Mean of the log-normal demand for Example1.
O-D pair
q
w
1 → 7
420
2 → 7
350
3 → 7
350
6 → 7
280In this example, we examine three VMR levels; that is, VMR = 0, 20, and 40. When VMR = 0, it means no uncertainty on the network, that is, deterministic network. Here the values of VMR are given in order to generate the true mean link flows and marginal cost tolls, which will be used to compare with the estimated results. The true mean link flows and tolls calculated by the MSA are summarized in Table3. It can be seen that the true SN-MCP tolls are higher than those from the average and original MCP calculations. Table 4 shows the expected total travel time at different VMR levels. The “Improv.” column shows the percentage of improvement of the expected total travel time (from the SN-UE) as compared to the SN-SO case; that is,
(39)
Improv
.
case
=
E
T
T
SN-UE
-
E
TT
case
E
T
T
SN-UE
-
E
T
T
SN-SO
×
100
%
.
Figure 2 plots the percentage improvements shown in Table 4. From the figure, it is clear that the improvement of the expected total travel time made by the average MCP and the original MCP schemes are lower than those of the SN-MCP scheme. In particular, when the network is highly uncertain (e.g., VMR = 40 in this example), the origin MCP schemes instead increases the expected total travel time compared to the no toll case.Table 3
True mean link flows and tolls under SN-SO.
Link
VMR = 0
VMR = 20
VMR = 40
Mean flow
Toll
Mean flow
Toll
Mean flow
Toll
v
a
τ
a
v
a
τ
a
v
a
τ
a
1
212.2
4.6
207.9
9.0
204.8
16.9
2
119.7
0.4
121.9
1.4
123.6
4.0
3
301.7
18.6
300.7
31.6
299.3
50.9
4
305.4
22.8
306.0
39.1
306.1
63.6
5
158.5
22.7
153.4
54.9
147.7
117.0
6
185.7
7.1
184.0
16.2
182.6
33.2
7
89.5
0.4
92.8
2.1
94.5
7.2
8
191.5
16.0
196.6
39.6
202.3
86.3
9
285.8
27.5
292.6
52.6
299.7
93.7
10
260.5
19.0
257.2
33.7
255.5
58.1
11
246.6
20.8
243.5
38.2
239.4
65.6Table 4
Comparison of the expected total time under different VMR levels.
VMR
SN-UE (toll free)
SN-SO (SN-MCP)
Average MCP
Original MCP
E
(
TT
)
Improv.
E
(
TT
)
Improv.
E
(
TT
)
Improv.
E
(
TT
)
Improv.
0
29098
0.0%
28919
100.0%
28919
100.0%
28919
100.0%
20
40994
0.0%
40838
100.0%
40848
93.8%
40873
78.0%
40
65752
0.0%
65593
100.0%
65666
53.6%
65793
−25.8%Figure 2
Improvement of system performance by different MCP schemes.The estimated mean link flows and SN-SO tolls obtained through the trial-and-error algorithm are summarized in Table5. The iterative procedure initially starts from a uniform toll scheme; that is, τ
a
=
15, for all link a. The step size α
(
k
)
=
1
/
k and convergence tolerance ε
=
0.005 are utilized in the trial-and-error algorithm. With different VMR levels, Figure 3 illustrates the nice convergence of the iterative procedure. All the trial-and-error processes converge in 10 iterations.Table 5
Estimated mean link flows and tolls under SN-SO.
Link
VMR = 0
VMR = 20
VMR = 40
Mean flow
Toll
Mean flow
Toll
Mean flow
Toll
v
a
τ
a
v
a
τ
a
v
a
τ
a
1
213.4
4.5
207.9
9.0
203.8
16.9
2
117.7
0.4
121.2
1.4
123.3
4.0
3
301.9
18.7
299.7
31.5
299.1
51.1
4
303.8
22.8
306.0
39.1
307.1
63.9
5
158.2
22.7
154.7
54.9
147.8
116.7
6
185.4
7.1
184.6
16.2
183.9
33.3
7
88.3
0.4
91.7
2.2
95.3
7.2
8
192.1
15.9
195.4
39.7
202.4
86.4
9
286.5
27.7
291.0
52.6
298.6
93.3
10
261.3
19.0
258.1
33.6
254.4
57.8
11
246.7
20.8
245.4
38.4
240.3
65.4Figure 3
Convergence of the trial-and-error procedure for SN-MCP with different VMR levels.If we do not use the SN-MCP formula to calculate the trial tolls in Step1 as shown in (24) but refer to the average MCP or original MCP, the trial-and-error procedure cannot converge to the true optimal tolls that achieves SN-SO. Figure 4 shows this phenomenon for VMR = 20.Figure 4
Convergence of the trial-and-error procedure by different MCP schemes.Example 2.
The test network for Example2 is taken from Sumalee et al. [11, 12] as shown in Figure 5, which has 7 nodes, 18 links, and 6 O-D pairs. This example again takes the BPR link cost function with n
a
=
4 for all link a. Table 6 gives the other link cost parameters adopted in this example. The mean values of the stochastic demands are shown in Table 7.Table 6
Link cost parameters for Example2.
Link
t
a
0
b
a
c
a
1
1.2500
0.0253
1800
2
1.2500
0.0253
1800
3
9.1667
6.2610
1100
4
9.1667
6.2610
1100
5
9.1667
6.2610
1100
6
2.5000
1.7075
1100
7
7.5000
1.0866
1100
8
9.1667
6.2610
1100
9
2.5000
1.7075
1100
10
7.5000
1.0866
1100
11
2.5000
1.7075
1100
12
2.5000
1.7075
1100
13
2.0000
1.3660
1100
14
7.5000
1.0866
1100
15
7.5000
1.0866
1100
16
2.0000
1.3660
1100
17
1.2500
0.0253
1800
18
1.2500
0.0253
1800Table 7
Mean of the log-normal demand for Example2.
Origin
Destination
1
5
7
1
—
600
400
5
500
—
600
7
375
800
—Figure 5
Road network used for Example2.Here the numerical test is based on another statistical distribution of O-D travel demand, normal distribution, which is also widely adopted in the literature (e.g., [21, 29, 30]). From this example, it is found that some of mean link flows could be zero when arriving at the equilibrium, for example, the SN-UE flow pattern with no toll. The log-normal distribution, however, excludes this instance. Under the assumptions that the travel demand follows a normal distribution and the path flow has the same kind of distribution as the demand, the link flow, which is the sum of path flows, also follows normal distribution; that is, V
a
~
N
(
v
a
,
ε
a
v
).Using the method of moment generating function, the mean link travel time can be expressed explicitly in terms of the mean and variance of the stochastic link flow. And further noting the relationship between the mean and variance as shown in (20), we have
(40)
E
T
a
=
t
a
0
+
b
a
c
a
4
E
V
a
4
=
t
a
0
+
b
a
c
a
4
v
a
4
+
6
v
a
2
ε
a
v
+
3
ε
a
v
2
=
t
a
0
+
b
a
v
a
4
+
6
VMR
v
a
3
+
3
VM
R
2
v
a
2
c
a
4
.
Similarly, we can compute E
[
TT
], which is
(41)
E
TT
=
t
a
0
v
a
+
b
a
v
a
5
+
10
VMR
v
a
4
+
15
VM
R
2
v
a
3
c
a
4
.
Therefore,
(42)
∂
E
TT
∂
v
a
=
t
a
0
+
b
a
5
v
a
4
+
40
VMR
v
a
3
+
45
VM
R
2
v
a
2
c
a
4
.
Then,
(43)
SN-MCP
=
∂
E
TT
∂
v
a
-
E
T
a
=
b
a
4
v
a
4
+
34
VMR
v
a
3
+
42
VM
R
2
v
a
2
c
a
4
.
Again, taking the step size α
(
k
)
=
1
/
k and setting the convergence tolerance ε
=
0.01 in the trial-and-error algorithm, we estimate the optimal toll charges under stochastic demands with VMR = 100. The estimated results and the true results are both presented in Table 8 for comparison. Figure 6 again exhibits the nice convergence of the iterative procedure.Table 8
Comparison between the true and estimated mean link flows and tolls under SN-SO.
Link
True results
Estimated results
Mean flow
Toll
Mean flow
Toll
v
a
τ
a
v
a
τ
a
1
875.0
0.01
887.0
0.01
2
1000.0
0.02
1005.0
0.02
3
437.5
3.31
448.4
3.35
4
437.6
3.32
438.1
3.35
5
500.0
4.72
495.9
4.73
6
250.0
0.25
255.9
0.25
7
187.5
0.09
189.4
0.09
8
500.1
4.72
503.8
4.72
9
250.1
0.25
252.9
0.25
10
187.5
0.09
186.7
0.09
11
326.1
0.44
325.6
0.45
12
326.1
0.44
326.6
0.45
13
800.0
4.05
792.0
4.09
14
173.9
0.08
179.3
0.08
15
174.0
0.08
175.3
0.07
16
652.1
2.18
647.9
2.18
17
1175.0
0.04
1172.0
0.04
18
1000.0
0.02
994.5
0.02Figure 6
Convergence of the trial-and-error procedure for SN-MCP.


## 7. Conclusions

This study discussed the first-best marginal cost pricing and its trial-and-error implementation under a stochastic network that explicitly considers the demand uncertainty. In the paper, we derived the SN-MCP by reinvestigating the real gap between the marginal social and private costs in terms of stochastic traffic flows. There are two terms involved in the SN-MCP when travelers are assumed to be risk-neutral. The first term can be regarded as the simple modification of the original MCP; that is, the originally deterministic link flows and travel times are substituted by their mean values. The second term is the additional term related to the variability of travel demand, which is often ignored.Given the specific statistical distribution of random demands and the assumption of constant VMR across all O-D pairs, the closed-form formulation of SN-MCP can be calculated with the information of true mean values of demands. In reality, when this information is not available, a revised trial-and-error method was proposed for practical implementation. The trial tolls are computed based on the formula of SN-MCP at each step but not the original MCP. Though the mean link flows cannot be precisely obtained due to the limited sample size, it has been shown that the sampling error will not affect the convergence of the proposed trial-and-error procedure. The convergence and effectiveness of this evolutionary implementation were not only proved theoretically but also examined by two numerical tests. The first one was carried out under the assumption of log-normal demand, while the second one assumed the normal demand.This paper only investigated the traffic assignment and road pricing with the case of inelastic demand noting that the mean of stochastic demand is fixed. If the level of average demand is influenced by the travel cost of the trip, that is, with the case of elastic demand, the SN-MCP we derived in this study is still applicable to drive the link flow pattern towards a SN-SO, where the SN-SO aims to maximize the expected social welfare. At the same time, the convergence of the revised trial-and-error algorithm can be guaranteed as well. The whole analysis will be very similar as that in this study if assuming the demand function incorporates the uncertainty in an additive fashion. The other possible extensions are to also include the stochastic link capacity degradation in the analysis of the SN-MCP and to relax the strict assumption about constant VMR across all O-D pairs.



---

*Source: 618725-2015-02-22.xml*