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.
Original language | English |
---|---|
Pages (from-to) | 641-647 |
Number of pages | 7 |
Journal | Transportation Research Part E: Logistics and Transportation Review |
Volume | 47 |
Issue number | 5 |
DOIs | |
Publication status | Published - 1 Jan 2011 |
Keywords
- Dynamic traffic network
- Shortest path
- Transportation
ASJC Scopus subject areas
- Business and International Management
- Civil and Structural Engineering
- Transportation