# A Trial-and-Error Method with Autonomous Vehicle-to-Infrastructure Traffic Counts for Cordon-Based Congestion Pricing

Authors: Zhiyuan Liu; Yong Zhang; Shuaian Wang; Zhibin Li
Journal: Journal of Advanced Transportation
 (2017)

---

## Abstract

This study proposes a practical trial-and-error method to solve the optimal toll design problem of cordon-based pricing, where only the traffic counts autonomously collected on the entry links of the pricing cordon are needed. With the fast development and adoption of vehicle-to-infrastructure (V2I) facilities, it is very convenient to autonomously collect these data. Two practical properties of the cordon-based pricing are further considered in this article: the toll charge on each entry of one pricing cordon is identical; the total inbound flow to one cordon should be restricted in order to maintain the traffic conditions within the cordon area. Then, the stochastic user equilibrium (SUE) with asymmetric link travel time functions is used to assess each feasible toll pattern. Based on a variational inequality (VI) model for the optimal toll pattern, this study proposes a theoretically convergent trial-and-error method for the addressed problem, where only traffic counts data are needed. Finally, the proposed method is verified based on a numerical network example.


---

## Body

## 1. Introduction

Traffic congestion has become one of the key problems for the operation of urban transport systems. Traffic congestion not only is a daily source of frustration for many motorists but also results in environmental issues and social expenses. Congestion causes longer travel times, increased travel time variability, air and noise pollution, and lower productivity in the work force [1–5]. Road pricing has been well recognized as an important tool for the land transport authority to manage the traffic demand, shifting transit ridership [6–8], and eventually ameliorate the traffic congestion; see Small and Verhoef [9], Lawphongpanich et al. [10], and Cheng et al. [11] among many others. A prosperous literature is observed for the theoretical studies of urban congestion pricing. Many studies have focused on determining the optimal toll fares. Two economics concepts, first-best pricing (no restriction on the pricing locations) and second-best pricing (only part of the network is tolled), have been widely discussed in the context of urban congestion pricing. Despite their theoretical soundness, the achievements of many studies on toll determination are not suitable for practical implementations, mainly because they require the accurate data on many network attributes, including travel demand function and link travel time functions as well as network users’ value-of-time [12], and it is difficult to obtain these data for the whole transport network. This article thus accounts for the practical implementation of congestion pricing by solving the toll determination problem while obviating these data.Since the practical implementation of urban congestion pricing is an important focus of this study, we then investigate some existing congestion pricing practices in Singapore since 1975 [13], in London since 2003 [14], and in Stockholm since 2007 [15]. These three well-known practices all adopt cordon-based schemes, where London uses an area licensing charge and the other two cities take entry-based charge. The entry-based charge is known to be more equitable and efficient than area licensing charge [16]. Therefore, this article also takes cordon-based scheme with entry-based charge as a target.Two practical properties of the cordon-based pricing are further considered in this article. Firstly, when cordon-based pricing is implemented in practice, the network authority is concerned more about the traffic conditions within the cordon area; for instance, when the congestion pricing was first established in Singapore in 1975, Singapore Land Transport Authority’s original target of implementing this scheme is to reduce the total traffic volume to the cordon area by 25% to 35% [13]. This article thus further takes into consideration this point; namely, the total inbound traffic volume of one cordon should be restricted by a predetermined threshold. Secondly, the toll charge on each entry to one cordon should be identical, in view of the convenience for recognition by the drivers and for administration by the authority; for example, toll charge on each link is the same at the Orchard Cordon and Bugis-Marina Centre of Electronic Road Pricing (ERP) system in Singapore.To sum up, this article aims to propose a method for the toll determination of such a cordon-based pricing, where massive data is not needed. Traffic flow data is of crucial value for the studies of urban transport system, for example, the studies on traffic signaling [17, 18] as well as traffic safety studies [19]. With the fast development of intelligent transportation systems and the Internet of things, it is very convenient to collect the number of vehicles in any particular link. Hence, the proposed trial-and-error method only needs the autonomous traffic counts data on the tolled links, which can be easily gathered based on the vehicle-to-infrastructure (V2I) communications.


## 2. Literature Review

The concept of obviating network attributes data and instead using traffic survey data to adjust the toll fares until achieving the optimal tolls is termed as “trial-and-error” method in the literature. Based on the seminal works by Downs [20] and Vickrey [21], Li [22] first proposed a trial-and-error method for marginal cost pricing based on a simple two-link example, where the Origin-Destination (OD) demand function is avoided. This work by Li has been well recognized in the literature, and only recently Wang and Yang [23] pointed out that under some extreme conditions (when the demand function is too flat) this solution method could not converge, and a bisection-based trial-and-error method was then developed to remedy this problem. Such a concept of trial-and-error is also of considerable importance for other sorts of transportation networks [24, 25].Yang et al. [26] proposed a trial-and-error method for the first-best pricing in a general transport network assuming deterministic user equilibrium (DUE) circumstances, which was then extended to the logit-based stochastic user equilibrium (SUE) case by Zhao and Kockelman [27]. As an extension of Yang et al. [26], Han and Yang [28] have proposed a more efficient trial-and-error method for the first-best pricing using advanced step sizes. In the context of second-best pricing, Yang et al. [29] then proposed a convergent trial-and-error mechanism for the optimal toll pattern, which is recently extended by Ye et al. [30] by considering the day-to-day dynamics of network flows.The aforementioned trial-and-error methods obviate the origin-destination (OD) demand function, yet they still rely on the data of link travel time functions and drivers’ value-of-time, which are not all readily available in practice. Based on the concept of traffic-restraint pricing (the objective is to restrict traffic volumes on some links to a desirable target level), Meng et al. [31] have proposed a trial-and-error method that only requires the traffic counts on certain links. This traffic count data could be efficiently and accurately obtained in practice from the toll booths or detection loops. Thus, it is an engineering-based method suitable for practical use. Yang et al. [32] then extended this work by considering elastic demand and asymmetric link flow interactions. In the context of general SUE, Meng and Liu [12] built a trial-and-error method based on the gradient projection algorithm, where the convergence can be guaranteed under mild conditions. Zhou et al. [33] developed a new trial-and-error method for the first-best congestion pricing solution with restriction to link capacity constraints. Recently, Xu et al. [34] have developed a trial-and-error method for the traffic-restraint congestion pricing scheme in a network with day-to-day flow dynamics.As to the cordon-based pricing, these existing methods in the literature, however, are not valid to use, especially considering the two practical properties of cordon-based pricing addressed in this article, namely, (a) the total inbound flow to one cordon should be restricted and (b) toll charge on each link to one cordon should be identical. Considering the wide practicality of cordon-based pricing in reality, an extension of the previous trial-and-error methods for cordon-based pricing is of considerable significance.Assuming the users’ route choice behavior follows the General SUE principle; this article proposed a trial-and-error method based on the variational inequality (VI) model built by Liu et al. [35] for the side-constrained SUE problem. The total inbound traffic flow to each cordon is limited by a predetermined threshold value, which is taken as a side constraint to the SUE traffic assignment problem. It is shown that the optimal toll pattern equals the optimal Lagrangian multiplier of the side constraints.The remainder of this article is organized as follows. The next section describes the connection between the optimal toll pattern and side constraints to the cordons. Then, a convergent trial-and-error method for the optimal toll pattern is developed, which is numerically verified by a network example. Finally, the conclusions and future works are presented.


## 3. Problem Description and Mathematical Model

### 3.1. Assumptions and Notations

LetG denote a strongly connected network; the attributes of this network are represented by the following notations:N:
set of nodesA:
set of links;A is the cardinality of set AW:
set of OD pairs;W is the cardinality of Wqw:
travel demand between OD pairw∈Wq:
column vector of all the OD travel demands;q=qw,w∈WTRw:
set of all the paths between OD pairw∈W, and Rw is the cardinality of Rwδakw:
δakw=1 if path k∈Rw between OD pair w∈W traverses link a∈A; δakw=0 otherwiseΔw:
link/path incidence matrix associated with OD pairw∈W; namely, Δw=δakw,a∈A,k∈RwΔ:
link/path incidence matrix for the entire network;Δ=Δw,w∈Wfwk:
traffic flow on pathk∈Rw between OD pair w∈Wfw:
column vector of traffic flows on all the paths between OD pairw∈W; namely, fw=fwk,k∈RwTf:
column vector of traffic flow on all the paths in the network; that is,f=fw,w∈WTΛ:
OD pair/path incidence matrix,Λ=δwk,w∈W,k∈Rw, where δwk equals 1 if path r∈Rw and 0, otherwiseva:
traffic flow on linka∈Av:
column vector of all the link traffic flows,v=va,a∈ATtav:
asymmetric link travel time function on linka∈A, and it is a nonnegative, monotonically increasing, and continuously differentiable function of the link flow vector vcwkv:
travel time on pathk∈Rw, and cwkv=∑a∈Atavδakwcwv:
column vector of travel times on all the paths connecting OD pairw∈W.According to the flow conservation law, path flows, link flows, and OD travel demands should fulfill the following equations:(1)v=Δf,q=Λf,f≥0.Equations (1) define the feasible set for path flows and link flows, denoted by Ωf and Ωv, respectively.Assume there are totallyI cordons in the network, and all the entry links to cordon i, i=1,2,…,I, are charging with the same toll fare denoted by τi. The toll charges of all the cordons are grouped into vector τ=τi,i=1,2,…IT. Let A-i denote the set of all the entry links to cordon i, i=1,2,…,I, and all the tolled links are then grouped into set A-. Denoted by τa, the toll charge on link a equals τi if a∈A-i and τa=0 if link a is not an entry link to any cordon. Different toll pattern τ will affect the drivers’ route choice and thus give rise to different equilibrium flows. Let vaτ denote the equilibrium link flow on link a∈A in terms of the following generalized link travel time functions:(2)Tav,τ=tav+τaα,a∈A,where α is the drivers’ value-of-time. It should be noted that this value-of-time is actually not needed when the trial-and-error method proposed below is used in practice.As mentioned before, the optimal toll patternτ∗ is one that can restrict the inbound flow to each cordon i to a predetermined threshold Hi, namely, (3)∑a∈A-ivaτ∗≤Hi,i=1,2,…,I.To further reflect the equity issue, the toll charge should be zero if the total inbound flows are strictly less than the threshold value; that is,(4)τi∗×∑a∈A-ivaτ∗-Hi=0,i=1,2,…,I.In addition, the toll charge of each cordon τi∗ should be nonnegative,(5)τi∗≥0,i=1,2,…,I.Herein, (3), (4), and (5) define the mathematical conditions for the optimal toll pattern τ∗. The objective of this article then becomes to find a trial-and-error method for such an optimal toll pattern based on only traffic count data, which can be easily gathered based on the V2I facilities on the road side.


### 3.2. Mathematical Model

We first discuss the mathematical model for the traffic assignment problem, namely, how to get the equilibrium link flowsvaτ,a∈A in terms of a given toll pattern τ=τi,i=1,2,…IT. In view of its better representativeness, the general SUE is adopted to depict the drivers route choice behavior. Hence, with given toll charge pattern τ=τi,i=1,2,…IT, the drivers make their route choice decisions based on the perceived path travel time(6)Cwkv,τ=∑a∈ATav,τδakw+ζwk,k∈Rw,w∈W,where the random variable ζwk is assumed to cover the perception error of all the drivers across the whole population on the travel time of path k∈Rw. In the literature, ζwk is usually assumed to follow Gumbel distribution (Logit-based SUE) or normal distribution (probit-based SUE); see Liu et al. [36, 37].For the general SUE problem with asymmetric link travel time functions, the following fixed point model proposed by Daganzo [38] can be used to formulate the traffic assignment problem(7)va=∑w∈Wqw×∑k∈Rwpwkv,τδakw,a∈A,where pwkv,τ is the path choice probability equal to the probability that k is perceived as the shortest path among all the paths in set Rw. Equation (7) can be solved by the convergent Method of Successive Average [39].We proceed to build a mathematical model for the optimal toll patternτ∗ that can fulfill (3), (4), and (5). In fact, since the feasible set of toll pattern τ is the whole positive orthant, the nonlinear complementarity conditions (3), (4), and (5) are equivalent to the following variational inequality (VI) problem [40]:(8)Φτ∗τ-τ∗≥0,τ∈Ω,where Ω=τ∣τi≥0,i=1,2,…I is the feasible set of τ and the VI function Φτ is defined as(9)Φτ=Φiτ,i=1,2,…,IT=Hi-∑a∈A-ivaτ,i=1,2,…,IT:Ω⟶RI.Hence, solving the VI model gives the optimal toll patternτ∗ that can satisfy the mathematical conditions (3), (4), and (5). The monotonicity of this type of VI model in the context of cordon-based pricing has been rigorously proven by Liu et al. [35], which guarantees the convergence of many projection-based solution algorithms. It is shown in the following section that a trial-and-error mechanism can be built based on the solution algorithm for the VI model (8).


## 3.1. Assumptions and Notations

LetG denote a strongly connected network; the attributes of this network are represented by the following notations:N:
set of nodesA:
set of links;A is the cardinality of set AW:
set of OD pairs;W is the cardinality of Wqw:
travel demand between OD pairw∈Wq:
column vector of all the OD travel demands;q=qw,w∈WTRw:
set of all the paths between OD pairw∈W, and Rw is the cardinality of Rwδakw:
δakw=1 if path k∈Rw between OD pair w∈W traverses link a∈A; δakw=0 otherwiseΔw:
link/path incidence matrix associated with OD pairw∈W; namely, Δw=δakw,a∈A,k∈RwΔ:
link/path incidence matrix for the entire network;Δ=Δw,w∈Wfwk:
traffic flow on pathk∈Rw between OD pair w∈Wfw:
column vector of traffic flows on all the paths between OD pairw∈W; namely, fw=fwk,k∈RwTf:
column vector of traffic flow on all the paths in the network; that is,f=fw,w∈WTΛ:
OD pair/path incidence matrix,Λ=δwk,w∈W,k∈Rw, where δwk equals 1 if path r∈Rw and 0, otherwiseva:
traffic flow on linka∈Av:
column vector of all the link traffic flows,v=va,a∈ATtav:
asymmetric link travel time function on linka∈A, and it is a nonnegative, monotonically increasing, and continuously differentiable function of the link flow vector vcwkv:
travel time on pathk∈Rw, and cwkv=∑a∈Atavδakwcwv:
column vector of travel times on all the paths connecting OD pairw∈W.According to the flow conservation law, path flows, link flows, and OD travel demands should fulfill the following equations:(1)v=Δf,q=Λf,f≥0.Equations (1) define the feasible set for path flows and link flows, denoted by Ωf and Ωv, respectively.Assume there are totallyI cordons in the network, and all the entry links to cordon i, i=1,2,…,I, are charging with the same toll fare denoted by τi. The toll charges of all the cordons are grouped into vector τ=τi,i=1,2,…IT. Let A-i denote the set of all the entry links to cordon i, i=1,2,…,I, and all the tolled links are then grouped into set A-. Denoted by τa, the toll charge on link a equals τi if a∈A-i and τa=0 if link a is not an entry link to any cordon. Different toll pattern τ will affect the drivers’ route choice and thus give rise to different equilibrium flows. Let vaτ denote the equilibrium link flow on link a∈A in terms of the following generalized link travel time functions:(2)Tav,τ=tav+τaα,a∈A,where α is the drivers’ value-of-time. It should be noted that this value-of-time is actually not needed when the trial-and-error method proposed below is used in practice.As mentioned before, the optimal toll patternτ∗ is one that can restrict the inbound flow to each cordon i to a predetermined threshold Hi, namely, (3)∑a∈A-ivaτ∗≤Hi,i=1,2,…,I.To further reflect the equity issue, the toll charge should be zero if the total inbound flows are strictly less than the threshold value; that is,(4)τi∗×∑a∈A-ivaτ∗-Hi=0,i=1,2,…,I.In addition, the toll charge of each cordon τi∗ should be nonnegative,(5)τi∗≥0,i=1,2,…,I.Herein, (3), (4), and (5) define the mathematical conditions for the optimal toll pattern τ∗. The objective of this article then becomes to find a trial-and-error method for such an optimal toll pattern based on only traffic count data, which can be easily gathered based on the V2I facilities on the road side.


## 3.2. Mathematical Model

We first discuss the mathematical model for the traffic assignment problem, namely, how to get the equilibrium link flowsvaτ,a∈A in terms of a given toll pattern τ=τi,i=1,2,…IT. In view of its better representativeness, the general SUE is adopted to depict the drivers route choice behavior. Hence, with given toll charge pattern τ=τi,i=1,2,…IT, the drivers make their route choice decisions based on the perceived path travel time(6)Cwkv,τ=∑a∈ATav,τδakw+ζwk,k∈Rw,w∈W,where the random variable ζwk is assumed to cover the perception error of all the drivers across the whole population on the travel time of path k∈Rw. In the literature, ζwk is usually assumed to follow Gumbel distribution (Logit-based SUE) or normal distribution (probit-based SUE); see Liu et al. [36, 37].For the general SUE problem with asymmetric link travel time functions, the following fixed point model proposed by Daganzo [38] can be used to formulate the traffic assignment problem(7)va=∑w∈Wqw×∑k∈Rwpwkv,τδakw,a∈A,where pwkv,τ is the path choice probability equal to the probability that k is perceived as the shortest path among all the paths in set Rw. Equation (7) can be solved by the convergent Method of Successive Average [39].We proceed to build a mathematical model for the optimal toll patternτ∗ that can fulfill (3), (4), and (5). In fact, since the feasible set of toll pattern τ is the whole positive orthant, the nonlinear complementarity conditions (3), (4), and (5) are equivalent to the following variational inequality (VI) problem [40]:(8)Φτ∗τ-τ∗≥0,τ∈Ω,where Ω=τ∣τi≥0,i=1,2,…I is the feasible set of τ and the VI function Φτ is defined as(9)Φτ=Φiτ,i=1,2,…,IT=Hi-∑a∈A-ivaτ,i=1,2,…,IT:Ω⟶RI.Hence, solving the VI model gives the optimal toll patternτ∗ that can satisfy the mathematical conditions (3), (4), and (5). The monotonicity of this type of VI model in the context of cordon-based pricing has been rigorously proven by Liu et al. [35], which guarantees the convergence of many projection-based solution algorithms. It is shown in the following section that a trial-and-error mechanism can be built based on the solution algorithm for the VI model (8).


## 4. Trial-and-Error Method

Many projection-type methods can be observed in the literature for solving the VI models proposed for transport problems, for example, the works by Nagurney [41], Meng and Liu [39], and Zhou et al. [42]. In this section, we adopt the self-adaptive predictor-corrector (PC) method proposed by He and Liao [43], which is an extension of the PC method with advanced self-adaptive step sizes. We see that this method can converge linearly, which is efficient for practical implementations. The self-adaptive PC method takes the calculation of projection operations of a toll charge pattern as a subroutine. In view of the fact that the feasible set of toll vector here is the nonnegative orthant, calculating the projection operation is very efficient and convenient; for example, for a vector τ′, its projection to the feasible set Ω of the toll patterns, denoted by PΩτ′, equals(10)PΩτ′=max⁡0,τi′,i=1,2,…,IT.Accordingly, model (8) can be efficiently solved using the self-adaptive PC method. The main steps of the self-adaptive PC method are then summarized as follows.Step
0(initialization). Choose an initial vector τ1=τa1=0,a∈A-T, three constants 0<κ2<κ1<1, γ∈0,2, and initial step size η1>0. Let the number of iterations n=1.Step
1(prediction process).Step
1.1. Implement the toll pattern τn in the network and then observe the traffic flows on the entry links to each cordon, which are denoted by vaτn,a∈A-i,i=1,2,…I, and then compute Φτn=Hi-∑a∈A-ivaτn,i=1,2,…,IT.Step
1.2. Find auxiliary vector τ-n by the projection:(11)τ-n=PΩτn-ηnΦτn.Step  1.3. Consequently, levy the toll pattern τ-n in the network and then count the corresponding traffic flows on the entry links, denoted by vaτ-n,a∈A-i,i=1,2,…I, which is used to calculate Φτ-n=Hi-∑a∈A-ivaτ-n,i=1,2,…,IT.Step
1.4. Calculate ratio rn by(12)rn=ηnΦτn-Φτ-n2/τn-τ-n2.If rn≤κ1, go to Step  2; otherwise reduce the step size according to(13)ηn=23ηnmin⁡1,1rn,and go to Step 1.2.Step
2(correction process). Based on τn, τ-n, and ηn, calculate a step size πn for correction and then get an updated vector τn+1.Step  2.1. Calculate another step size πn as per the formula(14)πn=γ×ηn×∑i=1Iτin-τ-in×hin∑i=1Ihin2, where(15)hin=τin-τ-in-ηnΦiτn-Φiτ-n,i=1,2,…,I.Step  2.2. Update the vector τn+1 by this projection:(16)τn+1=PΩτn-πnΦτ-n.Step  3.Slightly enlarge step size ηn according to the following scheme:(17)ηn+1=32ηnifηnΦτn-Φτ-n2/τn-τ-n2≤κ2.Step  4(stop check). If(18)τn-τ-n≤ε,where ε is a predetermined positive tolerance, then stop; otherwise, let n=n+1 and go to Step 1.The output of PC method gives the optimal toll patternτ∗, and it can be seen from the solution procedure that only traffic count data autonomously collected on entry links in Steps  1.1 and 1.3 are needed in practice. Thus, this method can avoid gathering the data of OD demand, link travel time functions, or users’ VOT that are extremely difficult to be accurately collected.


## 5. Numerical Example

A numerical example is employed in this section to validate the proposed model and effectiveness of the self-adaptive PC method. As shown in Figure1, this example contains 7 nodes, 11 links, and one pricing cordon. The cordon area is defined by its vertex nodes 1, 4, 5, and 7. The three entry links 5, 6, and 7 to this cordon are charging. Denoted by τ∗, the optimal toll charges on the entry links are identical.Figure 1
Network structure for the numerical experiment.There are four OD pairs on the network, and their travel demands are tabulated in Table1.Table 1
OD demand.
OD pair
Travel demand
(vehicle/hour)
1
→
7
6000
2
→
7
5000
3
→
7
5000
6
→
7
4000The travel time function on each link follows the BRP type function:(19)tava=ta01.0+0.15vaCa4,a∈A,where ta0 denotes the free flow travel time and Ca is the capacity of each link. The effects of merging links are taken into consideration; for instance, the flows on link 1 and link 7 are merging to link 3; thus traffic flows on link 1 would also influence the travel time on link 7. There are two pairs of merging links on the network: links 1 and 7, as well as links 2 and 6. Thus, for these two pairs of links, their travel time functions are taken as(20)tav=ta01+0.15×va+0.5v^a^1.5Ca4,a∈A, where v^a^ denotes the flow on the paired link of link a∈A. For example, for link 1, v^a^ should be the flow on link 7. This type of functions has given rise to the asymmetric link travel time functions. The specific values of ta0 and Ca on each link are provided in Table 2.Table 2
Parameters in link travel time functions.
Link numbera
Free flow travel time (seconds)ta0
Capacity (vehicles/hour)Ca
1
60
4000
2
50
4000
3
60
4000
4
70
4000
5
60
2000
6
10
2000
7
50
3000
8
100
3000
9
110
4000
10
110
4000
11
150
4000


### 5.1. Probit-Based SUE Framework

For any given toll charge pattern, its corresponding link flows on the entry links are needed by the autonomously collected traffic counts. In this numerical example, we solve a probit-based SUE problem and use the equilibrium link flows on the entry links to estimate these traffic count data. It should be noted that we assume that the network users’ travel behavior follows the probit-based SUE here, because of its better representativeness to the practical conditions, while the proposed methodology is also suitable in terms of other types of SUE models. We also assume that the drivers’ value-of-time is 1.0 cent/second. It should be noted that, in practice, the value-of-time is not needed in the trial-and-error method.The MSA is utilized to solve the probit-based SUE problem. It is well recognized that there is no close form for the path choice probability of probit-based SUE problem, thus the stochastic network loading is approximated by Monte Carlo simulation, as used in Liu and Meng [44], where an accurate approximation can be obtained. To further guarantee the accuracy, the number of simulations in this section is taken as 1000. In each run of the Monte Carlo simulation, there are three tasks: (1) the normally distributed perception errors are first sampled using pseudorandom numbers, (2) then the shortest path between each OD pair is searched, and (3) finally all the OD demands are assigned to the shortest path. Evidently, most of the computation efforts are allocated on solving the shortest path problem.It should be pointed out that since the travel time perception errorζwk is defined on paths, thus a direct sampling of the perception errors requires path enumeration. In order to avoid the path enumeration, a link-based interpretation is adopted for ζwk (see, e.g., Liu and Meng [44]); that is, a perception error is defined on each link, denoted by ξa; thus the users’ perceived generalized link travel time equals(21)T-a=Ta+ξa,where Ta is the generalized travel time defined by (2). The link travel time perception error ξa is assumed to be normally distributed with zero mean and constant variance.


### 5.2. Computation Results on Three Scenarios

As claimed in the beginning of Introduction, the objective of cordon-based pricing is to maintain the traffic conditions within cordon area. This objective can be realized by restricting the number of inbound vehicles to the cordon area to a predetermined threshold value. In order to see the sensitivity of optimal toll charge pattern to the threshold, three scenarios are tested, where the threshold values are given in the second row of Table3.Table 3
Three scenarios of threshold and the optimal toll charges.
Scenario 1
Scenario 2
Scenario 3
ThresholdH
6000.0
5000.0
4000.0
Toll price (cents)
12.4
32.4
59.5
Total inbound flow
5999.9
5000.0
4000.3The self-adaptive PC method is then used to solve the optimal toll charge pattern for each scenario. The stop criteria in (18) is taken as 1×10-4, and the parameters used are κ1=0.9, κ2=0.1, γ=1.8, and η0=1.0.The output optimal toll charge value is provided in the third row of Table3. As illustrated in the fourth row of Table 3, the total inbound flow (total flow on entry links 5, 6, and 7) to the cordon area of each scenario is equal to the threshold value, implying that the mathematical conditions (3), (4), and (5) can be fulfilled. It can be seen that from scenarios 1 to 3, as the threshold is getting more restrictive, implying a better traffic condition, the toll price becomes larger. This phenomenon means that the drivers need to pay more to achieve and maintain a better traffic condition.


## 5.1. Probit-Based SUE Framework

For any given toll charge pattern, its corresponding link flows on the entry links are needed by the autonomously collected traffic counts. In this numerical example, we solve a probit-based SUE problem and use the equilibrium link flows on the entry links to estimate these traffic count data. It should be noted that we assume that the network users’ travel behavior follows the probit-based SUE here, because of its better representativeness to the practical conditions, while the proposed methodology is also suitable in terms of other types of SUE models. We also assume that the drivers’ value-of-time is 1.0 cent/second. It should be noted that, in practice, the value-of-time is not needed in the trial-and-error method.The MSA is utilized to solve the probit-based SUE problem. It is well recognized that there is no close form for the path choice probability of probit-based SUE problem, thus the stochastic network loading is approximated by Monte Carlo simulation, as used in Liu and Meng [44], where an accurate approximation can be obtained. To further guarantee the accuracy, the number of simulations in this section is taken as 1000. In each run of the Monte Carlo simulation, there are three tasks: (1) the normally distributed perception errors are first sampled using pseudorandom numbers, (2) then the shortest path between each OD pair is searched, and (3) finally all the OD demands are assigned to the shortest path. Evidently, most of the computation efforts are allocated on solving the shortest path problem.It should be pointed out that since the travel time perception errorζwk is defined on paths, thus a direct sampling of the perception errors requires path enumeration. In order to avoid the path enumeration, a link-based interpretation is adopted for ζwk (see, e.g., Liu and Meng [44]); that is, a perception error is defined on each link, denoted by ξa; thus the users’ perceived generalized link travel time equals(21)T-a=Ta+ξa,where Ta is the generalized travel time defined by (2). The link travel time perception error ξa is assumed to be normally distributed with zero mean and constant variance.


## 5.2. Computation Results on Three Scenarios

As claimed in the beginning of Introduction, the objective of cordon-based pricing is to maintain the traffic conditions within cordon area. This objective can be realized by restricting the number of inbound vehicles to the cordon area to a predetermined threshold value. In order to see the sensitivity of optimal toll charge pattern to the threshold, three scenarios are tested, where the threshold values are given in the second row of Table3.Table 3
Three scenarios of threshold and the optimal toll charges.
Scenario 1
Scenario 2
Scenario 3
ThresholdH
6000.0
5000.0
4000.0
Toll price (cents)
12.4
32.4
59.5
Total inbound flow
5999.9
5000.0
4000.3The self-adaptive PC method is then used to solve the optimal toll charge pattern for each scenario. The stop criteria in (18) is taken as 1×10-4, and the parameters used are κ1=0.9, κ2=0.1, γ=1.8, and η0=1.0.The output optimal toll charge value is provided in the third row of Table3. As illustrated in the fourth row of Table 3, the total inbound flow (total flow on entry links 5, 6, and 7) to the cordon area of each scenario is equal to the threshold value, implying that the mathematical conditions (3), (4), and (5) can be fulfilled. It can be seen that from scenarios 1 to 3, as the threshold is getting more restrictive, implying a better traffic condition, the toll price becomes larger. This phenomenon means that the drivers need to pay more to achieve and maintain a better traffic condition.


## 6. Conclusions

This article addressed the trial-and-error method for cordon-based pricing, with the aim of avoiding gathering massive network data including OD demand functions, link travel time functions, and value-of-time. To better reflect the practical conditions, two properties of cordon-based pricing are further considered, including restricting the total inbound flow to the cordon to a predetermined threshold and assuming the tolls on all the entry links of one cordon to be identical.Assuming the drivers’ route choice behavior follows general SUE with asymmetric link travel time functions, a variational inequality (VI) model was used to formulate the optimal toll pattern. Then, based on this VI model, a self-adaptive predictor-corrector (PC) method was then employed, which gives the optimal toll pattern. It can be seen that this PC method provides a mechanism for the trial-and-error method, and only traffic count data on the entry links of each cordon are needed, which is quite convenient for practical use and the accuracy of these data could also be guaranteed. The numerical example showed that the resultant toll pattern can successfully limit the total inbound flow to any predetermined threshold value.



---

*Source: 9243039-2017-07-02.xml*