Equivalent formulations for the branched transport and urban planning problems
Preprint
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.Keywords
All Related Versions
This publication has 14 references indexed in Scilit:
- Decomposition theorems for linear programsOperations Research Letters, 2014
- Fractal regularity results on optimal irrigation patternsJournal de Mathématiques Pures et Appliquées, 2014
- Synchronic and Asynchronic Descriptions of Irrigation ProblemsAdvanced Nonlinear Studies, 2013
- Estimates on Path Functionals over Wasserstein SpacesSIAM Journal on Mathematical Analysis, 2010
- The Regularity of Optimal Irrigation PatternsArchive for Rational Mechanics and Analysis, 2009
- The structure of branched transportation networksCalculus of Variations and Partial Differential Equations, 2007
- Optimal networks for mass transportation problemsESAIM: Control, Optimisation and Calculus of Variations, 2004
- Interior regularity of optimal transport pathsCalculus of Variations and Partial Differential Equations, 2004
- OPTIMAL PATHS RELATED TO TRANSPORT PROBLEMSCommunications in Contemporary Mathematics, 2003
- Real and Complex Analysis.Journal of the Royal Statistical Society: Series D (The Statistician), 1987