Decentralized algorithms for multiple path routing in urban transportation networks

Abstract

In the last decades, the increase of traffic and the limited capacity of urban networks, led to the development of algorithms for traffic management and route guidance. GPS technology can be used for fleet monitoring in urban or suburban areas and may provide useful information concerning the movement of all vehicles. Current route guidance systems are simple from an algorithmic point of view, since they compute shortest paths to the destination, but they have to deal with very large networks. For this reason, a decentralized approach, in which each vehicle independently calculates its own route, is desirable. Usually, the main drawback of this approach is the possibility that too many vehicles choose the same route, thus causing oversaturation phenomena. Hence, to allow path diversification, we propose a decentralized algorithm in which each vehicle computes its own satisfactory route on the basis of (i) its specific settings and (ii) traffic information provided by a reference station based on other vehicles forecasted routes.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 4 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.