IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v59y2025i3p565-586.html
   My bibliography  Save this article

A Two-Stage Iteration Method for Solving the Departure Time Choice Problem

Author

Listed:
  • Ren-Yong Guo

    (School of Economics and Management, Beihang University, Beijing 100191, China; and MOE Key Laboratory of Complex System Analysis and Management Decision, Beihang University, Beijing 100191, China)

  • Hai Yang

    (Department of Civil and Environmental Engineering, The Hong Kong University of Science and Technology, Kowloon, Hong Kong, China)

  • Hai-Jun Huang

    (School of Economics and Management, Beihang University, Beijing 100191, China; and MOE Key Laboratory of Complex System Analysis and Management Decision, Beihang University, Beijing 100191, China)

Abstract

We discuss the numerical solution of the departure time choice problem. The non–quasi-monotone of the travel cost vector function is first proved to address the study motivation. A two-stage iteration method is then proposed to effectively solve the problem in a single origin-destination (OD) pair network with parallel links, in which departure time and route choices of commuters are involved. We analytically reveal why the iteration method can solve the problem and theoretically prove the convergence, that is, the iteration process finally achieves at a user equilibrium (UE) state. The iteration method is then extended to a single link network with heterogeneous users in the values of travel time and schedule delay and the preferred arrival time. Furthermore, numerical analyses are conducted for the two networks to demonstrate the effectiveness of the iteration method for solving the departure time choice problem.

Suggested Citation

  • Ren-Yong Guo & Hai Yang & Hai-Jun Huang, 2025. "A Two-Stage Iteration Method for Solving the Departure Time Choice Problem," Transportation Science, INFORMS, vol. 59(3), pages 565-586, June.
    • Handle: RePEc:inm:ortrsc:v:59:y:2025:i:3:p:565-586
    DOI: 10.1287/trsc.2024.0599
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.2024.0599
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.2024.0599?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
    ---><---

    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:inm:ortrsc:v:59:y:2025:i:3:p:565-586. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.