IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v47y2011i5p641-647.html
   My bibliography  Save this article

Reaching a destination earlier by starting later: Revisited

Author

Listed:
  • Qian, Chen
  • Chan, Ching-Yuen
  • Yung, Kai-Leung

Abstract

This paper simulates a dynamic traffic network by embedding an extra nonlinear delay function to represent traffic lights (or a similar regular delay) in each arc (or link), and it was shown that a late start driver may catch up with one who started earlier, subject only to the condition that they pick the same path (or the same shortest path), and overtaking will never be made. Moreover, a theoretical lower bound value to guarantee the sustainability of the FIFO principle in a dynamic traffic network was also derived.

Suggested Citation

  • Qian, Chen & Chan, Ching-Yuen & Yung, Kai-Leung, 2011. "Reaching a destination earlier by starting later: Revisited," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 47(5), pages 641-647, September.
    • Handle: RePEc:eee:transe:v:47:y:2011:i:5:p:641-647
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554511000044
    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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Chen, Bi Yu & Chen, Xiao-Wei & Chen, Hui-Ping & Lam, William H.K., 2020. "Efficient algorithm for finding k shortest paths based on re-optimization technique," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 133(C).
    2. Yang, Lixing & Zhou, Xuesong, 2017. "Optimizing on-time arrival probability and percentile travel time for elementary path finding in time-dependent transportation networks: Linear mixed integer programming reformulations," Transportation Research Part B: Methodological, Elsevier, vol. 96(C), pages 68-91.

    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:transe:v:47:y:2011:i:5:p:641-647. 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/600244/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.