Optimization of continuous-flow over traffic networks with fundamental diagram constraints

2026/07/01 by Anqi Dong, Karl Henrik Johansson, Johan Karlsson

paper · doi:10.1016/j.ejcon.2026.101593

Citations

• A lasso-alternative to Dijkstra's algorithm for identifying short paths in networks
• Mitigating Stop-and-Go Traffic Congestion with Operator Learning
• Mean field type control with species dependent dynamics via structured tensor optimization
• Monge-Kantorovich Optimal Transport Through Constrictions and Flow-rate Constraints
• Graph-structured tensor optimization for nonlinear density control and mean field games
• Scalable computation of dynamic flow problems via multi-marginal graph-structured optimal transport
• Scalable Computation of Dynamic Flow Problems via Multimarginal Graph-Structured Optimal Transport
• Macroscopic fundamental diagram based perimeter control considering dynamic user equilibrium
• Lasso formulation of the shortest path problem
• Robust transport over networks
• Optimal transport over a linear dynamical system
• Iterative Bregman Projections for Regularized Transportation Problems
• Gradient flows of the entropy for finite Markov chains
• Gradient flows of the entropy for finite Markov chains
• On the fundamental diagram of traffic flow
• The geometry of optimal transportation
• The cell transmission model: A dynamic representation of highway traffic consistent with the hydrodynamic theory
• Multiplier and gradient methods
• A computational fluid mechanics solution to the Monge-Kantorovich mass transfer problem
• Numerical Calculation of Time-Dependent Viscous Incompressible Flow of Fluid with Free Surface