A trade-off between average and maximum arc congestion minimization in traffic assignment with user constraints

DOI10.1016/j.cor.2019.05.028zbMath1458.90197OpenAlexW2947303085WikidataQ127795660 ScholiaQ127795660MaRDI QIDQ2002850

V. Morandi, Enrico Angelelli, Maria Grazia Speranza

Publication date: 12 July 2019

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2019.05.028

zbMATH Keywords

linear programmingtraffic assignmentcongestionCVaR

Mathematics Subject Classification ID

Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20)

Related Items (4)

A scalable dynamic parking allocation framework ⋮ System optimal routing of traffic flows with user constraints using linear programming ⋮ Improving the performance of a traffic system by fair rerouting of travelers ⋮ Gathering avoiding centralized pedestrian advice framework: an application for Covid-19 outbreak restrictions

Cites Work

• Bridging \(k\)-sum and CVaR optimization in MILP
• System optimal routing of traffic flows with user constraints using linear programming
• Fast, Fair, and Efficient Flows in Networks
• Efficiency and fairness of system-optimal routing with user constraints
• The α-reliable mean-excess regret model for stochastic facility location modeling
• System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion
• Unnamed Item

This page was built for publication: A trade-off between average and maximum arc congestion minimization in traffic assignment with user constraints