Hostname: page-component-74656f9884-j7cmm Total loading time: 0 Render date: 2026-11-10T12:42:35.430Z Has data issue: false hasContentIssue false

Optimal networks for mass transportation problems

Published online by Cambridge University Press:  15 December 2004

Alessio Brancolini
Affiliation:
Alessio Brancolini, Scuola Normale Superiore, Piazza dei Cavalieri 7, 56126 Pisa, Italy; a.brancolini@sns.it
Giuseppe Buttazzo
Affiliation:
Giuseppe Buttazzo, Dipartimento di Matematica, Università di Pisa, Via Buonarroti 2, 56127 Pisa, Italy; buttazzo@dm.unipi.it
Get access

Abstract

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.

Information

Type
Research Article
Copyright
© EDP Sciences, SMAI, 2005

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable