2015
DOI: 10.1016/j.trb.2014.11.009
|View full text |Cite
|
Sign up to set email alerts
|

A trial-and-error congestion pricing scheme for networks with elastic demand and link capacity constraints

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
21
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
8

Relationship

1
7

Authors

Journals

citations
Cited by 39 publications
(21 citation statements)
references
References 17 publications
0
21
0
Order By: Relevance
“…Alternatively, in this study, the mathematical complexity of the CTAP is overcome by adopting an intuitive interpretation of capacity; that is, the Lagrange multipliers of the capacity constraints are interpreted as additional delay imposed on the oversaturated roads to make them saturated. Such an interpretation has also been employed in the congestion pricing, namely the ''trial-and-error'' methods [18,[61][62][63][64].…”
Section: A Heuristic Methods To Update the Initial-betamentioning
confidence: 99%
“…Alternatively, in this study, the mathematical complexity of the CTAP is overcome by adopting an intuitive interpretation of capacity; that is, the Lagrange multipliers of the capacity constraints are interpreted as additional delay imposed on the oversaturated roads to make them saturated. Such an interpretation has also been employed in the congestion pricing, namely the ''trial-and-error'' methods [18,[61][62][63][64].…”
Section: A Heuristic Methods To Update the Initial-betamentioning
confidence: 99%
“…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-anderror 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 trafficrestraint congestion pricing scheme in a network with dayto-day flow dynamics.…”
Section: Literature Reviewmentioning
confidence: 99%
“…To the best of our knowledge, none of the mentioned studies propose a piece-wise constant scheme for setting congestion taxes in repeated routing games to achieve a socially optimal flow. In the transportation literature, when the demand and/or the cost functions are unknown, trial-and-error methods have been used for setting the congestion charges (Yang et al, 2010;Zhao and Kockelman, 2006;Wang and Yang, 2012;Zhou et al, 2015;Han and Yang, 2009). For instance, a trial-and-error implementation of marginal-cost pricing on road networks when the demand functions are unknown was introduced in .…”
Section: Previous Studiesmentioning
confidence: 99%
“…A modified bisection method for the trial-and-error implementation of tradable credit scheme (to achieve a revenue-neutral congestion pricing system) was proposed in Wang and Yang (2012). A combination of trial-and-error congestion pricing schemes was studied in Zhou et al (2015) to both consider the minimization of the total system cost and address the capacity constraints. Although extremely powerful in setting and adapting the congestion taxes with minimal knowledge of the demand and based on recent changes in the transportation network, these studies do not consider the day-to-day traffic assignment aspect of the problem.…”
Section: Previous Studiesmentioning
confidence: 99%