Abstract
In this chapter, directly inspired from [11]. we define almost all notions used throughout this book: traffic plan, its irrigated and irrigating measure, its transference plan, its parameterization, its fibers, the stopping time of each fiber and the multiplicity (or flow) at each point. After addressing some measurability issues we prove semicontinuity properties for all quantities of interest (average length of fibers, stopping time and multiplicity). All of these notions are first applied to the classical Monge-Kantorovich existence theory of optimal transports. Finally an existence theorem is given for traffic plans with prescribed irrigating and irrigated measures (the irrigation problem) and with prescribed transference plan (the who goes where problem).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2009). Traffic Plans. In: Optimal Transportation Networks. Lecture Notes in Mathematics, vol 1955. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69315-4_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-69315-4_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69314-7
Online ISBN: 978-3-540-69315-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)