Reaching a destination earlier by starting later: Revisited
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.
Volume (Year): 47 (2011)
Issue (Month): 5 (September)
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description |
|Order Information:|| Postal: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/bibliographic|
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 references are entirely missing, you can add them using this form.