On decentralized dynamic routing for congested traffic networks

Sarachik, P.; Özgüner, Ü.

doi:10.1109/tac.1982.1103104

Cited by 61 publications

(10 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The techniques can be broadly classified into being either static [9], [10], [11], which consider the assignment of routes under equilibrium conditions, or dynamic [12], [13], [14], [15], [16], [17], which consider the evolving nature of traffic patterns. Fundamentally, GPS navigation devices are an implementation of traffic assignment techniques.…”

Section: A Traffic Assignmentmentioning

confidence: 99%

Game-theoretic routing of GPS-assisted vehicles for energy efficiency

Aswani

Tomlin

2011

Proceedings of the 2011 American Control Conference

View full text Add to dashboard Cite

Congestion on roads and highways is an issue that leads to reductions in the energy-efficiency of travel. Current GPS navigation devices include features which provide turn-byturn directions to vehicles based on real-time traffic conditions, and these features provide an opportunity to improve average fuel consumption. Routing strategies in these devices optimize individual travel times, but theoretical (e.g., Braess's paradox) and empirical results show that this can actually increase congestion and average travel times. We model traffic routing in the game-theoretic framework of Stackelberg games, which is a simplification of the true information patterns, and then use this model to provide an algorithm for turn-by-turn directions. One advantage of our algorithm is that it can be easily incorporated into existing GPS devices by modifying the traffic information sent to them. Our framework is used to qualitatively study the effectiveness of traffic routing on a specific road network topology. If roughly 60% of users follow GPS directions implementing our strategy, then the average delay will be close to the optimal average delay for the road network. This poses social and technological challenges for reduction in congestion through routing. The situation is not hopeless though, because our qualitative results indicate that having a small percentage of compliant users may still lead to large reductions in congestion.

show abstract

Section: A Traffic Assignmentmentioning

confidence: 99%

Game-theoretic routing of GPS-assisted vehicles for energy efficiency

Aswani

Tomlin

2011

Proceedings of the 2011 American Control Conference

View full text Add to dashboard Cite

show abstract

“…Sarachik [52] is perhaps one of the earliest works on decentralized route guidance. The paper proposes decentralized controllers which compute the time to the destination from each node in a single destination network, based on the lengths of downstream queues.…”

Section: Other Modelsmentioning

confidence: 99%

Hybrid Vehicle-Centric Route Guidance 1

Farver

Chabini

2003

IFAC Proceedings Volumes

View full text Add to dashboard Cite

“…Later references include Sarachik [52], Lin and Kumar [46], Walrand [64], Viniotis and Ephremides [63], and Shenker and Weinrib [56]. Most references concentrate on proving the optimality of a threshold policy: always route the customer at the head of the queue to the faster server, if available, and route to the slower server only if the faster server is unavailable and the number of customers in the queue exceeds a threshold.…”

Section: Routing To Parallel Servers From a Common Queuementioning

confidence: 99%