Skip to main content

The Tree Structure of Optimal Traffic Plans and their Approximation

  • Chapter
  • 1703 Accesses

Part of the Lecture Notes in Mathematics book series (LNM,volume 1955)

Abstract

We shall get in this chapter a deeper insight of the structure of optimal traffic plans. Section 7.1 proves a single path property for optimal traffic plans: almost all fibers passing from x to y follow the same path between x and y. By a slight modification of the optimal traffic plan, this statement can be made strict: All fibers (not just almost all) passing by x and y follow the same path. Section 7.2 extends the single path property in the case of optimal traffic plans for the irrigation problem. In that case optimal traffic plans have no circuits, in other terms are trees. Section 7.3 uses the single path property to show that optimal traffic plans can be monotonically approximated by finite irrigation graphs. The steps leading to this conclusion have their own interest. In particular it is shown that any optimal traffic plan is a finite or countable union of trunk trees, namely trees whose fibers pass all by some point. The presentation here is inspired from [13]. Several techniques come from papers by Xia [94] and Maddalena-Solimini [58]. The proof of the bi-Lipschitz regularity of fibers with positive flow follows [95] and the pruning and theorem is borrowed from Devillanova and Solimini [79]. The monotone approximation theorem has also been proved in [58].

Keywords

  • Tree Structure
  • Trunk Tree
  • Irrigation Tree
  • Single Path
  • Countable Union

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Rights and permissions

Reprints and Permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

(2009). The Tree Structure of Optimal Traffic Plans and their Approximation. In: Optimal Transportation Networks. Lecture Notes in Mathematics, vol 1955. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69315-4_7

Download citation