Equivalent formulations for the branched transport and urban planning problems
From MaRDI portal
Publication:304880
DOI10.1016/J.MATPUR.2016.03.008zbMATH Open1345.49055arXiv1509.06698OpenAlexW2237119880MaRDI QIDQ304880FDOQ304880
Authors: Alessio Brancolini, Benedikt Wirth 
Publication date: 26 August 2016
Published in: Journal de Mathématiques Pures et Appliquées. Neuvième Série (Search for Journal in Brave)
Abstract: We consider two variational models for transport networks, an urban planning and a branched transport model, in both of which there is a preference for networks that collect and transport lots of mass together rather than transporting all mass particles independently. The strength of this preference determines the ramification patterns and the degree of complexity of optimal networks. Traditionally, the models are formulated in very different ways, via cost functionals of the network in case of urban planning or via cost functionals of irrigation patterns or of mass fluxes in case of branched transport. We show here that actually both models can be described by all three types of formulations; in particular, the urban planning can be cast into a Eulerian (flux-based) or a Lagrangian (pattern-based) framework.
Full work available at URL: https://arxiv.org/abs/1509.06698
Recommendations
- An equivalent path functional formulation of branched transportation problems
- Duality in branched transport and urban planning
- An optimization problem with an equilibrium constraint in urban transport
- Formalization and solution of a special class of transportation problems
- An application of optimal transport paths to urban transport networks
- Some branch-and-bound procedures for fixed-cost transportation problems
- On optimization problems in urban transport
- scientific article; zbMATH DE number 3847213
- A mixed integer formulation for multiple-route transit network design
- A simulation-based optimization framework for urban transportation problems
Variational problems in a geometric measure-theoretic setting (49Q20) Deterministic network models in operations research (90B10) Optimization of shapes other than minimal surfaces (49Q10)
Cites Work
- Network flows. Theory, algorithms, and applications.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Real Analysis and Probability
- Gradient flows in metric spaces and in the space of probability measures
- Optimal Transport
- Title not available (Why is that?)
- Title not available (Why is that?)
- A variational model of irrigation patterns
- Decomposition theorems for linear programs
- Interior regularity of optimal transport paths
- Optimal channel networks, landscape function and branched transport
- Traffic plans
- Synchronic and asynchronic descriptions of irrigation problems
- Optimal networks for mass transportation problems
- Fractal regularity results on optimal irrigation patterns
- OPTIMAL PATHS RELATED TO TRANSPORT PROBLEMS
- Transport distances and irrigation models
- Estimates on path functionals over Wasserstein spaces
- An equivalent path functional formulation of branched transportation problems
- On the Hölder regularity of the landscape function
- The regularity of optimal irrigation patterns
- Path functionals over Wasserstein spaces
- The structure of branched transportation networks
- Optimal transportation networks. Models and theory
- Optimal urban networks via mass transportation
Cited In (13)
- Approximation of rectifiable 1-currents and weak-\(\ast\) relaxation of the \(h\)-mass
- A multi-material transport problem with arbitrary marginals
- On the Lagrangian branched transport model and the equivalence with its Eulerian formulation
- General transport problems with branched minimizers as functionals of 1-currents with prescribed boundary
- A multimaterial transport problem and its convex relaxation via rectifiable \(G\)-currents
- Improved stability of optimal traffic paths
- An equivalent path functional formulation of branched transportation problems
- Optimal micropatterns in 2D transport networks and their relation to image inpainting
- Phase field models for two-dimensional branched transportation problems
- Optimal energy scaling for micropatterns in transport networks
- Duality in branched transport and urban planning
- Generic uniqueness of optimal transportation networks
- Formulation of branched transport as geometry optimization
This page was built for publication: Equivalent formulations for the branched transport and urban planning problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q304880)
