Optimal urban networks via mass transportation

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Recently much attention has been devoted to the optimization of transportation networks in a given geographic area. One assumes the distributions of population and of services/workplaces (i.e. the network's sources and sinks) are known, as well as the costs of movement with/without the network, and the cost of constructing/maintaining it. Both the long-term optimization and the short-term, "who goes where" optimization are considered. These models can also be adapted for the optimization of other types of networks, such as telecommunications, pipeline or drainage networks. In the monograph we study the most general problem settings, namely, when neither the shape nor even the topology of the network to be constructed is known a priori.

Author(s): Giuseppe Buttazzo, Aldo Pratelli, Eugene Stepanov, Sergio Solimini (auth.)
Series: Lecture Notes in Mathematics 1961
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2009

Language: English
Pages: 150
Tags: Calculus of Variations and Optimal Control; Optimization; Operations Research, Mathematical Programming; Manifolds and Cell Complexes (incl. Diff.Topology)

Front Matter....Pages 1-8
Introduction....Pages 1-6
Problem setting....Pages 1-17
Optimal connected networks....Pages 1-12
Relaxed problem and existence of solutions....Pages 1-37
Topological properties of optimal sets....Pages 1-29
Optimal sets and geodesics in the two-dimensional case....Pages 1-25
Back Matter....Pages 1-26