Optimal Transportation Networks pp 39-45 | Cite as

# The Structure of Optimal Traffic Plans

Chapter

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

$$
\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)

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

## Preview

Unable to display preview. Download preview PDF.

## Copyright information

© Springer-Verlag Berlin Heidelberg 2009