Journal of the ACM (JACM)
How unfair is optimal routing?
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On the performance of user equilibria in traffic networks
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
INFORMS Journal on Computing
Stackelberg Scheduling Strategies
SIAM Journal on Computing
A Multicommodity Network-Flow Problem with Side Constraints on Paths Solved by Column Generation
INFORMS Journal on Computing
Smoothed penalty algorithms for optimization of nonlinear models
Computational Optimization and Applications
Altruism, selfishness, and spite in traffic routing
Proceedings of the 9th ACM conference on Electronic commerce
The Vehicle Routing Problem with Real-Time Travel Times
Proceedings of the 2008 conference on Techniques and Applications for Mobile Commerce: Proceedings of TAMoCo 2008
Traffic Networks and Flows over Time
Algorithmics of Large and Complex Networks
The Impact of Oligopolistic Competition in Networks
Operations Research
Wardrop Equilibria with Risk-Averse Users
Transportation Science
NET-COOP'07 Proceedings of the 1st EuroFGI international conference on Network control and optimization
Congestion games with failures
Discrete Applied Mathematics
On the inefficiency of equilibria in congestion games
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Acceleration of shortest path and constrained shortest path computation
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Stronger Bounds on Braess's Paradox and the Maximum Latency of Selfish Routing
SIAM Journal on Discrete Mathematics
Anytime algorithms for biobjective heuristic search
AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
Hi-index | 0.00 |
The design of route guidance systems faces a well-known dilemma. The approach that theoretically yields the system-optimal traffic pattern may discriminate against some users in favor of others. Proposed alternate models, however, do not directly address the system perspective and may result in inferior performance. We propose a novel model and corresponding algorithms to resolve this dilemma. We present computational results on real-world instances and compare the new approach with the well-established traffic assignment model. The essence of this study is that system-optimal routing of traffic flow with explicit integration of user constraints leads to a better performance than the user equilibrium, while simultaneously guaranteeing superior fairness compared to the pure system optimum.