posted on 2014-01-07, 09:40authored byTakfarinas Saber, Anthony Ventresque, John Murphy
More and more drivers use on-board units to help
them navigate in the increasing urbanised environment they live
and work in. These system (e.g., routing applications on smart
phones) are now very often on-line, and use information from
the traffic situation (e.g., accidents, congestion) to get the best
route. We can now envisage a world where all trips are assigned
and updated by such an on-line system, making the best routing
decisions based on traffic conditions. The problem is that current
systems consider only ‘local’ elements (e.g., driver preference and
current traffic condition) and do not make routing decisions from
a global perspective. This can lead to a lot of similar routing
assignments that could lead to further traffic congestion. The
objective of the next generation on-line navigation systems is
then to come up with a ‘smart’, real-time route assignment, which
balances the load between the different road segments and offers
the best quality to the drivers. However, every routing decision
made has an impact on the traffic conditions (one more vehicle
on the road segments selected) and computing the load induced
by the trips is a computationally heavy problem. This paper
addresses this question of real-time on-line traffic assignment,
and shows that under certain conditions it is possible to have (i)
an accurate estimation of the load and travel time on every road
segment and (ii) an optimised traffic assignment that adapts to
divergence and evolutions (e.g., accidents) of the system.
History
Publication
IEEE/ACM Distributed Systems and Real Time applications (DS-RT) 2013;pp. 79-86