IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v33y1999i3p189-202.html
   My bibliography  Save this article

Minimal-revenue congestion pricing part I: A fast algorithm for the single-origin case

Author

Listed:
  • Dial, Robert B.

Abstract

This paper derives a simple fast algorithm for computing minimal-revenue tolls in a single-origin network. It assumes that trips have the same value of time, that they make user-optimizing path choices, and they have multiple destinations--but come from the same origin. The algorithm finds tolls that induce a traffic pattern minimizing average time per trip at a minimal average toll per trip. Formally, let X be the set of all feasible traffic assignments and assume all trips have the same value of time [alpha]>0; then the algorithm inputs a network with the system-optimizing flow xo vector and associated arc times t(xo). It outputs an optimal arc toll vector c*[greater-or-equal, slanted]0 such that for x[set membership, variant]X:([alpha]t(xo)+c*)T(x-xo)[greater-or-equal, slanted]0  for x[set membership, variant]X (user  optimal) That is, xo[set membership, variant]X becomes user-optimal, too. Compared to marginal-cost tolls, which would also produce this same effect, the min-revenue tolls c* possess important practical advantages. Perforce, they provide the same system-optimal network usage, but at a much cheaper price to the traveler--remarkably, they assure at least one toll-free path to every destination. In addition, min-revenue tolls have admirable stability: even large increases in travel demand can leave the solution c* virtually unchanged--an important feature since traffic volume can change continuously but tolls cannot. Finally, they provide guidance regarding potential network improvements. The algorithm presented is very efficient, easily able to solve networks with tens of thousands of nodes. A greedy potentials calculator, its expected running time for an n-node road network is a speedy O(n), while its worst case time for any network is O(m), where m is the number of arcs.

Suggested Citation

  • Dial, Robert B., 1999. "Minimal-revenue congestion pricing part I: A fast algorithm for the single-origin case," Transportation Research Part B: Methodological, Elsevier, vol. 33(3), pages 189-202, April.
  • Handle: RePEc:eee:transb:v:33:y:1999:i:3:p:189-202
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191-2615(98)00026-5
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Terry L. Friesz & David Bernstein & Tony E. Smith & Roger L. Tobin & B. W. Wie, 1993. "A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem," Operations Research, INFORMS, vol. 41(1), pages 179-191, February.
    2. Smith, M. J., 1979. "The marginal cost taxation of a transportation network," Transportation Research Part B: Methodological, Elsevier, vol. 13(3), pages 237-242, September.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Wie, Byung-Wook & Tobin, Roger L., 1998. "Dynamic congestion pricing models for general traffic networks," Transportation Research Part B: Methodological, Elsevier, vol. 32(5), pages 313-327, June.
    2. Dial, Robert B., 2000. "Minimal-revenue congestion pricing Part II: An efficient algorithm for the general case," Transportation Research Part B: Methodological, Elsevier, vol. 34(8), pages 645-665, November.
    3. Qixiu Cheng & Zhiyuan Liu & Feifei Liu & Ruo Jia, 2017. "Urban dynamic congestion pricing: an overview and emerging research needs," International Journal of Urban Sciences, Taylor & Francis Journals, vol. 21(0), pages 3-18, August.
    4. Moore, II, James E. & Kim, Geunyoung & Cho, Seongdil & Hu, Hsi-hwa & Xu, Rong, 1997. "Evaluating System ATMIS Technologies Via Rapid Estimation Of Network Flows: Final Report," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt5c70f3d9, Institute of Transportation Studies, UC Berkeley.
    5. Soulaymane Kachani & Georgia Perakis, 2009. "A Dynamic Travel Time Model for Spillback," Networks and Spatial Economics, Springer, vol. 9(4), pages 595-618, December.
    6. Light, Bar & Weintraub, Gabriel, 2018. "Mean Field Equilibrium: Uniqueness, Existence, and Comparative Statics," Research Papers 3731, Stanford University, Graduate School of Business.
    7. Duong Viet Thong & Aviv Gibali & Mathias Staudigl & Phan Tu Vuong, 2021. "Computing Dynamic User Equilibrium on Large-Scale Networks Without Knowing Global Parameters," Networks and Spatial Economics, Springer, vol. 21(3), pages 735-768, September.
    8. Jang, Wonjae & Ran, Bin & Choi, Keechoo, 2005. "A discrete time dynamic flow model and a formulation and solution method for dynamic route choice," Transportation Research Part B: Methodological, Elsevier, vol. 39(7), pages 593-620, August.
    9. Yang, Hai & Huang, Hai-Jun, 2004. "The multi-class, multi-criteria traffic network equilibrium and systems optimum problem," Transportation Research Part B: Methodological, Elsevier, vol. 38(1), pages 1-15, January.
    10. Richard Mounce, 2007. "Convergence to Equilibrium in Dynamic Traffic Networks when Route Cost Is Decay Monotone," Transportation Science, INFORMS, vol. 41(3), pages 409-504, August.
    11. Piyapong Suwanno & Chaiwat Yaibok & Noriyasu Tsumita & Atsushi Fukuda & Kestsirin Theerathitichaipa & Manlika Seefong & Sajjakaj Jomnonkwao & Rattanaporn Kasemsri, 2023. "Estimation of the Evacuation Time According to Different Flood Depths," Sustainability, MDPI, vol. 15(7), pages 1-23, April.
    12. I. V. Evstigneev & M. I. Taksar, 2001. "Stochastic Economies with Locally Interacting Agents," Working Papers 01-03-018, Santa Fe Institute.
    13. Malachy Carey & Y. E. Ge, 2005. "Alternative Conditions for a Well-Behaved Travel Time Model," Transportation Science, INFORMS, vol. 39(3), pages 417-428, August.
    14. Han, Ke & Friesz, Terry L. & Yao, Tao, 2013. "A partial differential equation formulation of Vickrey’s bottleneck model, part II: Numerical analysis and computation," Transportation Research Part B: Methodological, Elsevier, vol. 49(C), pages 75-93.
    15. Szeto, W. Y. & Lo, Hong K., 2004. "A cell-based simultaneous route and departure time choice model with elastic demand," Transportation Research Part B: Methodological, Elsevier, vol. 38(7), pages 593-612, August.
    16. Zhu, Feng & Ukkusuri, Satish V., 2017. "Efficient and fair system states in dynamic transportation networks," Transportation Research Part B: Methodological, Elsevier, vol. 104(C), pages 272-289.
    17. Y. W. Xu & J. H. Wu & M. Florian & P. Marcotte & D. L. Zhu, 1999. "Advances in the Continuous Dynamic Network Loading Problem," Transportation Science, INFORMS, vol. 33(4), pages 341-353, November.
    18. Hoogendoorn, Serge P. & Bovy, Piet H. L., 2004. "Dynamic user-optimal assignment in continuous time and space," Transportation Research Part B: Methodological, Elsevier, vol. 38(7), pages 571-592, August.
    19. Dial, Robert B., 1997. "Bicriterion traffic assignment: Efficient algorithms plus examples," Transportation Research Part B: Methodological, Elsevier, vol. 31(5), pages 357-379, October.
    20. Wang, Dong & Liao, Feixiong, 2023. "Incentivized user-based relocation strategies for moderating supply–demand dynamics in one-way car-sharing services," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 171(C).

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:transb:v:33:y:1999:i:3:p:189-202. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.