System optimal routing of traffic flows with user constraints using linear programming
DOI10.1016/j.ejor.2020.12.043zbMath1487.90210OpenAlexW3116490005MaRDI QIDQ2030327
V. Morandi, Savelsbergh, Martin W. P., Maria Grazia Speranza, Enrico Angelelli
Publication date: 7 June 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2020.12.043
linear programmingtrafficcongestionpiecewise linear approximationconstrained system optimumlatency function
Applications of game theory (91A80) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Stackelberg strategies for selfish routing in general multicommodity networks
- Congestion avoiding heuristic path generation for the proactive route guidance
- System optimal and user equilibrium time-dependent traffic assignment in congested networks
- A trade-off between average and maximum arc congestion minimization in traffic assignment with user constraints
- Minimizing the total travel time with limited unfairness in traffic networks
- Using Piecewise Linear Functions for Solving MINLPs
- Stackelberg Routing on Parallel Networks With Horizontal Queues
- The Impact of Oligopolistic Competition in Networks
- The effectiveness of stackelberg strategies and tolls for network congestion games
- Fast, Fair, and Efficient Flows in Networks
- Efficiency and fairness of system-optimal routing with user constraints
- Stackelberg Scheduling Strategies
- System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion
- Algorithmic Game Theory
- Shortest Path Problems with Resource Constraints
This page was built for publication: System optimal routing of traffic flows with user constraints using linear programming
