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

Queue replacement principle for corridor problems with heterogeneous commuters

Author

Listed:
  • Sakai, Takara
  • Akamatsu, Takashi
  • Satsukawa, Koki

Abstract

This study investigates the theoretical properties of a departure time choice problem considering commuters’ heterogeneity with respect to the value of schedule delay in corridor networks. Specifically, we develop an analytical method to solve the dynamic system optimal (DSO) and dynamic user equilibrium (DUE) problems. To derive the DSO solution, we first demonstrate the bottleneck-based decomposition property, i.e., the DSO problem can be decomposed into multiple single bottleneck problems. Subsequently, we obtain the analytical solution by applying the theory of optimal transport to each decomposed problem and derive optimal congestion prices to achieve the DSO state. To derive the DUE solution, we prove the queue replacement principle (QRP) that the time-varying optimal congestion prices are equal to the queueing delay in the DUE state at every bottleneck. This principle enables us to derive a closed-form DUE solution based on the DSO solution. Moreover, as an application of the QRP, we prove that the equilibrium solution under various policies (e.g., on-ramp metering, on-ramp pricing, and its partial implementation) can be obtained analytically. Finally, we compare these equilibria with the DSO state.

Suggested Citation

  • Sakai, Takara & Akamatsu, Takashi & Satsukawa, Koki, 2024. "Queue replacement principle for corridor problems with heterogeneous commuters," Transportation Research Part B: Methodological, Elsevier, vol. 187(C).
  • Handle: RePEc:eee:transb:v:187:y:2024:i:c:s0191261524001486
    DOI: 10.1016/j.trb.2024.103024
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191261524001486
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.trb.2024.103024?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:eee:transb:v:187:y:2024:i:c:s0191261524001486. 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: 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.