Volume 11, Number 1, January 2005
|Page(s)||88 - 101|
|Published online||15 December 2004|
Optimal networks for mass transportation problems
Alessio Brancolini, Scuola Normale Superiore, Piazza dei Cavalieri 7, 56126 Pisa, Italy; firstname.lastname@example.org
2 Giuseppe Buttazzo, Dipartimento di Matematica, Università di Pisa, Via Buonarroti 2, 56127 Pisa, Italy; email@example.com
In the framework of transport theory, we are interested in the following optimization problem: given the distributions µ+ of working people and µ- of their working places in an urban area, build a transportation network (such as a railway or an underground system) which minimizes a functional depending on the geometry of the network through a particular cost function. The functional is defined as the Wasserstein distance of µ+ from µ- with respect to a metric which depends on the transportation network.
Mathematics Subject Classification: 49J45 / 49Q10 / 90B10
Key words: Optimal networks / mass transportation problems.
© EDP Sciences, SMAI, 2005
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.