IDEAS home Printed from https://ideas.repec.org/a/kap/transp/v51y2024i6d10.1007_s11116-023-10400-5.html
   My bibliography  Save this article

Optimal coordinated congestion pricing for multiple regions: a surrogate-based approach

Author

Listed:
  • Yifan Chen

    (Nanjing University of Science and Technology)

  • Ziyuan Gu

    (Southeast University)

  • Nan Zheng

    (Monash University)

  • Hai L. Vu

    (Monash University)

Abstract

Congestion pricing is one of the efficient travel demand management strategies. Many existing researches focus on dealing with the toll optimization problem for a single area. However, the urban network is often composed of several administrative regions. Furthermore, even inside a single administrative region, there may be multiple subnetworks with different traffic dynamics. As a result, the centric pricing scheme may not be applicable. This paper aims to design a coordinated dynamic pricing scheme for such a scenario with multiple adjacent areas which experience an overlapping congested period. Unlike the traditional approach centered on the bi-level mathematical programming, we adopt the regressing Kriging model to estimate the input–output mapping, thus searching for the simulation-based optimal solution in the toll design problem. Two types of coordinated pricing schemes are proposed. The first or unconstrained scheme only focuses on the network performance, while the second or constrained scheme further takes into account the pricing efficiency. The proposed coordinated pricing scheme is further compared with the perimeter control. The results indicate that our scheme is more moderate without imposing traffic burden on the links/corridors heading to protected zones.

Suggested Citation

  • Yifan Chen & Ziyuan Gu & Nan Zheng & Hai L. Vu, 2024. "Optimal coordinated congestion pricing for multiple regions: a surrogate-based approach," Transportation, Springer, vol. 51(6), pages 2139-2171, December.
  • Handle: RePEc:kap:transp:v:51:y:2024:i:6:d:10.1007_s11116-023-10400-5
    DOI: 10.1007/s11116-023-10400-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11116-023-10400-5
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s11116-023-10400-5?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    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:kap:transp:v:51:y:2024:i:6:d:10.1007_s11116-023-10400-5. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.