Abstract
This chapter gives a more geometric form to traffic plans and their energy which was first proved in [59], [11]. Section 4.1 shows that all arcs of a traffic plan can be parameterized by length without changing the energy. Section 4.3.1 shows that traffic plans with finite energy are countably rectifiable. This first regularity result is used in Section 4.3 to obtain the sonsistency of the traffic plan energy \( \varepsilon ^\alpha \) with the original Gilbert energy. One has
for simple paths traffic plans. Section 4.2 gives a method to actually remove the loops from any traffic plan, therefore decreasing the multiplicity |x|χ. As apparent in (4.1) the Gilbert energy decreases with the multiplicity. Thus we get a handy and intuitive Gilbert energy formula for optimal traffic plans.
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). The Structure of Optimal 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_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-69315-4_4
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)