Optimal urban networks via mass transportation

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 ofconstructing/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 generalproblem settings, namely, when neither the shape nor even the topology of thenetwork to be constructed is known a priori. INDICE: 1 Introduction.- 2 Problem setting.- 3 Optimal connected networks.- 4 Relaxed problem and existence of solutions.- 5 Topological properties of optimal sets.- 6 Optimal sets and geodesics in the two y dimensional case.- Appendix A The mass transportation problem.- Appendix B Some tools from GeometricMeasure Theory.

• ISBN: 978-3-540-85798-3
• Editorial: Springer
• Encuadernacion: Rústica
• Páginas: 160
• Fecha Publicación: 01/12/2008
• Nº Volúmenes: 1
• Idioma: Inglés