Optimal transport with constraints: from mirror descent to classical mechanics
arXiv:2309.04727 · doi:10.1103/PhysRevLett.133.057401
Abstract
Finding optimal trajectories for multiple traffic demands in a congested network is a challenging task. Optimal transport theory is a principled approach that has been used successfully to study various transportation problems. Its usage is limited by the lack of principled and flexible ways to incorporate realistic constraints. We propose a principled physics-based approach to impose constraints flexibly in such optimal transport problems. Constraints are included in mirror descent dynamics using the principle of D'Alembert-Lagrange from classical mechanics. This leads to a sparse, local and linear approximation of the feasible set leading in many cases to closed-form updates.
6 pages, 3 figures
References in corpus (11)
- Transport on coupled spatial networks
- Entropy Rate of Diffusion Processes on Complex Networks
- Searchability of Networks
- Hide and seek on complex networks
- Statistical Mechanics of Steiner trees
- Optimal transport in multilayer networks for traffic flow optimization
- Designing optimal networks for multi-commodity transport problem
- Sustainable optimal transport in multilayer networks
- Infrastructure adaptation and emergence of loops in network routing with time-dependent loads
- Noise-induced network topologies
- Immiscible Color Flows in Optimal Transport Networks for Image Classification