• Embed Doc
  • Copy Link
  • Readcast
  • Collections
  • CommentGo Back
Download
 
Bellei, Gentile, Papola1
 
Tolls and Transit Frequencies Optimization
G. Bellei, G. Gentile and N. Papola
1
 
 Abstract 
In this paper a tolls and transit frequencies optimization problem has beenreduced to a specific equivalent equilibrium assignment problem and its localsolution conditions have been stated. A specific fixed-point approach algorithm hasalso been devised, introducing a hyper-network consisting of a multi-modaltransportation network combined with a specific
investment network 
. Based on a testnetwork, a numerical example concerning different scenarios is presented, exhibitingencouraging results.
 Introduction
The
 Network Design Problem
(
 NDP 
) consists, as is known, in the seeking of atransportation network configuration that maximizes some objective function, subjectto the equilibrium constraint. In this paper we address the optimization of an existingmulti-modal network, considering tolls and transit line frequencies as designvariables.On the supply side, congested networks are considered, utilizing non-separablelink-cost functions in a multi-user and multi-modal context, where, with specificreference to the transit network modeling, a
directed hypergraph
(Nguyen, Pallottinoand Gendreau, 1998) will be utilized, thereby enabling to express the relation between arc and path costs in an additive form. On the demand side, probabilisticadditive strictly positive differentiable choice models, based on the random utilitytheory, have been employed, with elastic demand up to the trip generation level. Inseeking the equilibrium, a fixed-point approach will be used as in Cantarella (1997).Despite the fact that frequencies optimization is a classic transportation designissue, most contributions found in the literature face the problem by adopting anheuristic approach, often combined with route generation procedures. A bileveloptimization approach, consistent with the nature of the problem, has been utilized
1
Università degli Studi di Roma “La Sapienza” , via Eudossiana, 18 00184 Rome, Italy
 
Bellei, Gentile, Papola2instead by LeBlanc (1988) and Yang (1997), employing the Hooke and Jeevesalgorithm and sensitivity analysis, respectively.In Bellei, Gentile, and Papola (1998), the
 NDP 
is formalized within the wellestablished framework of the neoclassic microeconomic theory, considering network users as consumers of urban trips (
trip consumer approach
) and assuming anobjective function of the so-called
Utilitarian
type: the
Social Surplus
(
S 
) , whichmeasures the social welfare summing up the supply modification monetary effects onall individual. On this basis, the problem of optimizing the tolls on an existingnetwork, assumed that it is possible to apply any toll to each arc of the network, isaddressed and the conditions under which the solution exists and is unique arederived. In this work we extend the problem to the case where transit line frequenciesare optimized together with tolls.
 Formalization of the problem
Let
t 
be the vector of arc tolls,
φ
the vector of line frequencies,
 f 
the vector of arc flows, S(
 f 
,
t 
,
φ
) the social surplus function and
 f 
UE
the
User Equilibrium
(
UE 
)arc flow pattern. The
 NDP 
can be formally expressed as:max
 f 
,
t 
,
φ
S(
 f 
,
t 
,
φ
) = [
 N 
⋅
Γ
 
-1
⋅
W(C
        
(
 f 
,
t 
,
φ
))]
T
⋅
1
-E(
 f 
,
φ
) -G(
φ
) +
t 
 
T
⋅
 f 
(1)s.t.
φ
min
 
≤
 
φ
 
≤
 
φ
max
 
G(
φ
)
≤
 
 B
 f 
=
 f 
 
UE
 
 f 
 
UE
= f[c
      
(
 f 
 
UE
,
φ
) +
t 
,
φ
]where:
 N 
is the diagonal matrix whose generic entry is the number of users belonging to class
u
∈
U 
, having specific choice set
 J 
u
;
Γ
 
-1
is the inverse of thecorresponding income marginal utility;
C 
the vector of generalized costs; W(
C 
) thesatisfaction function; E(
 f 
,
φ
) the transport externality function; G(
φ
) the transitoperating costs function.As a cost
c
au
and a flow
 f 
au
, specific to class
u
, are assigned to each arc
a
∈
 A
, wehave:
C 
 ju
=
Σ
a
∈
 A
 
c
au
⋅
π 
aju
 
 j
= 1, … , |
 J 
u
| ,
u
= 1, … , |
U 
| , or, in compact form
C 
=
Π
T
⋅
c
, (2)
 f 
au
 
=
 
Σ
 j
∈
 J 
u
 
 F 
 ju
⋅
π 
aju
 
a
= 1, … , |
 A
| ,
u
= 1, … , |
U 
| , or, in compact form
 f 
=
Π
 
⋅
F 
, (3)where
C 
 ju
e
 F 
 ju
are, respectively, the generalized cost and the flow of the alternative
 j
∈
 J 
u
and
π 
aju
is the probability that arc
a
is used within the hyperpath associatedwith the alternative
 j
. The design variables are then the arc tolls
t 
au
,
a
= 1, … , |
 A
| ,specific to each class
u
= 1, … , |
U 
| , and the line frequencies
φ 
l 
 
,
l 
= 1, … , |
 L
|. Thefollowing relations hold:
c
= c(
 f 
,
t 
,
φ
) = c
      
(
 f 
,
φ
) +
t 
, (4)
Π
=
Π
(
φ
) , (5)where c(
 f 
,
t 
,
φ
), c
      
(
 f 
,
φ
), and
Π
(
φ
) denote the arc cost function, the arc performancefunction, and the share function, respectively.Let us define the
Social Cost 
(
SC 
) as:
SC 
=
C 
+
 E 
+
G
-
T 
=
C 
           
+
 E 
+
G
, (6)
 
Bellei, Gentile, Papola3where:
C 
=
C 
T
⋅
F 
=
c
T
⋅
 f 
= total costs;
C 
           
=
C 
           
T
⋅
F 
=
c
      
T
⋅
 f 
= total performance costs;
T 
=
T 
T
⋅
F 
=
t 
 
T
⋅
 f 
= pricing revenues.As
C 
           
 
and
T 
are related to the corresponding arc variables by relations like the(2), the
SC 
can be expressed in terms of the arc flows
 f 
or the alternative flows
F 
as:
SC 
=
 
c
      
(
 f 
,
 z 
)
T
⋅
 f 
+E(
 f 
,
 z 
) +
λ 
⋅
G(
 f 
,
 z 
) = sc(
 f 
,
 z 
) , (7)
SC 
= C
                
(
F 
,
 z 
)
T
⋅
F 
+E(
Π
(
 z 
)
⋅
F 
,
 z 
) +
λ 
⋅
G(
Π
(
 z 
)
⋅
F 
,
 z 
) = SC(
F 
,
 z 
) . (8)We assume the following hypotheses:
 B
> G(
φ
min
) , (9)
∇
G(
φ
)
≥
 
ε
>
0
 
∀
φ
:
φ
min
 
≤
 
φ
 
≤
 
φ
max
. (10)As a consequence, the feasible set of problem (1), with respect to
φ
, is compactand non-empty, while the constraints are assumed regular. Then, for any feasible
φ
,the problem (1) is equivalent to the optimal tolls
 NDP 
in Bellei, Gentile e Papola(1998), whose solution has been proved to determine a
System Equilibrium
(
SE 
) flow pattern. We recall that
SE 
is a
UE 
where the individual average costs
c
are replaced by the social marginal costs
msc
, defined as
msc
=
∇
 f 
sc(
 f 
,
 z 
). Assuming that thefunctions appearing in the
 NDP 
(1) are all continuous, the value of the Social Surplusin its solution is a continuous function of 
φ
. Moreover, because the feasible set of 
φ
 is compact, then, on the basis of the Weierstrass’ theorem, the solution of the
 NDP 
 (1) determines an
SE 
flow pattern as well.
 Solutions characterization
As it is
C 
=
C 
           
+
T 
, problem (1) expressing
S 
in term of 
C 
yields:min
C 
,
φ
-S(
C 
,
φ
) = -[
 N 
⋅ 
Γ
 
-
1
⋅ 
W(
C 
)]
T
⋅
1
-
C 
T
⋅
F(
C 
) +SC[F(
C 
),
φ
] (11)s.t.
φ
min
-
φ
 
≤
 
0
 
φ
-
φ
max
 
≤
 
0
 G(
φ
) -
 B
 
≤
0The Lagrangian function of problem (11) is:L(
C 
,
φ
,
µ
,
η 
) = -S(
C 
,
φ
) +
∑
l 
∈
 L
 
µ 
min
l 
⋅
(
φ 
min
l 
-
φ 
l 
) +
∑
l 
∈
 L
 
µ 
max
l 
⋅
(
φ 
l 
 
-
φ 
max
l 
) +
η 
⋅
[G(
φ
) -
 B
]. (12)The following
Karush - Khun - Tucker 
first order conditions
 
(
 KKT 
) :
η 
 
≥
0 , (13)
µ
 
≥
 
0
, (14)
η 
⋅
[G(
φ
) -
 B
] = 0 (15)
µ 
min
l 
 
⋅
(
φ 
min
l 
-
φ 
l 
) = 0 ,
µ 
max
l 
 
⋅
(
φ 
l 
 
-
φ 
max
l 
) = 0
l 
= 1, ... , |
 L
| ,
 
(16)
∂
L(
C 
,
φ
,
µ
,
η 
)/
∂
φ 
l 
= -
∂
S(
C 
,
φ
)/
∂
φ 
l 
-
µ 
min
l 
+
µ 
max
l 
+
η 
⋅∂
G(
φ
)/
∂
φ 
l 
= 0
l 
= 1, ... , |
 L
| ,
 
(17)
∇
C 
L(
C 
,
φ
,
µ
,
η 
) = -
∇
C 
S(
C 
,
φ
) =
0
, (18)G(
φ
)
≤
 
 B
,
 
(19)
φ
min
 
≤
 
φ
 
≤
 
φ
max
, (20)due to the constraint regularity, are necessary for a local minimum, and, so, for thesolution of the
 NDP 
.The (18) coincides with the necessary condition of the cited optimal tolls
 NDP 
,
of 00

Leave a Comment

You must be to leave a comment.
Submit
Characters: ...
You must be to leave a comment.
Submit
Characters: ...