Optimal transportation networks as free Dirichlet regions for the Monge-Kantorovich problem

Annali della Scuola Normale Superiore di Pisa- Classe di Scienze 2 (4):631-678 (2003)
  Copy   BIBTEX

Abstract

In the paper the problem of constructing an optimal urban transportation network in a city with given densities of population and of workplaces is studied. The network is modeled by a closed connected set of assigned length, while the optimality condition consists in minimizing the Monge-Kantorovich functional representing the total transportation cost. The cost of trasporting a unit mass between two points is assumed to be proportional to the distance between them when the transportation is carried out outside of the network, and negligible when it is carried out along the network. The same problem can be also viewed as finding an optimal Dirichlet zone minimizing the Monge-Kantorovich cost of transporting the given two measures. The paper basically studies qualitative topological and geometrical properties of optimal networks. A mild regularity result for optimal networks is also provided

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,610

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

On the second boundary value problem for Monge-Ampère type equations and optimal transportation.Neil S. Trudinger & Xu-Jia Wang - 2009 - Annali della Scuola Normale Superiore di Pisa- Classe di Scienze 8 (1):143-174.
On the Hessian of the optimal transport potential.Stefán Ingi Valdimarsson - 2007 - Annali della Scuola Normale Superiore di Pisa- Classe di Scienze 6 (3):441-456.
Neural Network Learning as an Inverse Problem.Věra Kůrková - 2005 - Logic Journal of the IGPL 13 (5):551-559.
The Economic Basis of Legal Culture: Networks and Monopolization.Anthony Ogus - 2002 - Oxford Journal of Legal Studies 22 (3):419-434.
A Simple Metric for Ad Hoc Network Adaptation.Stephen F. S. F. Bush - 2005 - Ieee Journal on Selected Areas in Communications Journal 23 (12):2272--2287.
The equation -Δu-λ=|∇ u|p+ c f: The Optimal Power.Boumediene Abdellaoui & Ireneo Peral - 2007 - Annali della Scuola Normale Superiore di Pisa- Classe di Scienze 6 (1):159-183.
Theory-Contraction is NP-Complete.Neil Tennant - 2003 - Logic Journal of the IGPL 11 (6):675-693.

Analytics

Added to PP
2015-04-27

Downloads
3 (#1,706,939)

6 months
1 (#1,463,894)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references