Optimal Networks For Mass Transportation Problems

created on 28 Oct 2003
modified by brancolin on 23 Sep 2015

[BibTeX]

Published Paper

Inserted: 28 oct 2003
Last Updated: 23 sep 2015

Journal: ESAIM Control Optim. Calc. Var.
Volume: 11
Number: 1
Pages: 88-101
Year: 2005
Doi: 10.1051/cocv:2004032

Abstract:

In the framework of transport theory, we are interested in the following optimization problem: given the distributions $\mu^+$ of working people and $\mu^-$ 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 $\mu^+$ from $\mu^-$ with respect to a metric which depends on the transportation network.