Skip to main content

The Structure of Optimal Traffic Plans

  • Chapter
  • 1710 Accesses

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

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

$$ \varepsilon ^\alpha \left( P \right) = E^\alpha \left( P \right): = \int_{\mathbb{R}^N } {\left| x \right|_\chi ^\alpha d\mathcal{H}^1 \left( x \right)} $$
((4.1))

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.

Keywords

  • Lower Semicontinuous
  • Double Point
  • Nondecreasing Function
  • Simple Path
  • Plan Energy

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 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