Bilevel optimization in flow networks: A message-passing approach
arXiv:2108.00960 · doi:10.1103/PhysRevE.106.L042301
Abstract
Optimizing embedded systems, where the optimization of one depends on the state of another, is a formidable computational and algorithmic challenge, that is ubiquitous in real world systems. We study flow networks, where bilevel optimization is relevant to traffic planning, network control and design, and where flows are governed by an optimization requirement subject to the network parameters. We employ message-passing algorithms in flow networks with sparsely coupled structures to adapt network parameters that govern the network flows, in order to optimize a global objective. We demonstrate the effectiveness and efficiency of the approach on randomly generated graphs.
References in corpus (13)
- Learning Graphical Model Parameters with Approximate Marginal Inference
- The limits of multifunctionality in tunable networks
- From the Physics of Interacting Polymers to Optimizing Routes on the London Underground
- Supervised learning in physical networks: From machine learning to learning machines
- The Competition for Shortest Paths on Sparse Graphs
- Inference and Optimization of Real Edges on Sparse Graphs - A Statistical Physics Perspective
- Shortest node-disjoint paths on random graphs
- Designing optimal networks for multi-commodity transport problem
- The Futility of Being Selfish -- The Impact of Selfish Routing on Uncoordinated and Optimized Transportation Networks
- Optimal Location of Sources in Transportation Networks
- A New Approach to Laplacian Solvers and Flow Problems
- Coverage versus Supply Cost in Facility Location: Physics of Frustrated Spin Systems
- Reducing urban traffic congestion due to localized routing decisions