IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/7609572.html
   My bibliography  Save this article

Least Expected Time Paths in Stochastic Schedule-Based Transit Networks

Author

Listed:
  • Dang Khoa Vo
  • Tran Vu Pham
  • Nguyen Huynh Tuong
  • Van Hoai Tran

Abstract

We consider the problem of determining a least expected time (LET) path that minimizes the number of transfers and the expected total travel time in a stochastic schedule-based transit network. A time-dependent model is proposed to represent the stochastic transit network where vehicle arrival times are fully stochastically correlated. An exact label-correcting algorithm is developed, based on a proposed dominance condition by which Bellman’s principle of optimality is valid. Experimental results, which are conducted on the Ho Chi Minh City bus network, show that the running time of the proposed algorithm is suitable for real-time operation, and the resulting LET paths are robust against uncertainty, such as unknown traffic scenarios.

Suggested Citation

  • Dang Khoa Vo & Tran Vu Pham & Nguyen Huynh Tuong & Van Hoai Tran, 2016. "Least Expected Time Paths in Stochastic Schedule-Based Transit Networks," Mathematical Problems in Engineering, Hindawi, vol. 2016, pages 1-13, March.
    • Handle: RePEc:hin:jnlmpe:7609572
    DOI: 10.1155/2016/7609572
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2016/7609572.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/MPE/2016/7609572.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2016/7609572?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
    ---><---

    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:hin:jnlmpe:7609572. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.