Braess Net

$net={\rm TrafficExample}('Braess')$

Figure 1: Non-assigned and Assigned Braess Net

GP	LPF data	Demands
$\begin{array}{\vert c\vert c\vert c\vert} \hline nn & ln & dn\\ \hline 4 & 5 & 1\\ \hline \end{array}$	$\begin{array}{\vert l\vert ccccc\vert} \hline t0 & 0 & 50 & 5 & 50 & 0 \\ \hlin... ... ma & 0 & 0 & 0 & 0 & 0 \\ \hline ba & 1 & 1 & 1 & 1 & 1 \\ \hline \end{array}$	$\begin{array}{\vert ccc\vert} \hline dt & = & 1 \\ \hline dh & = & 4 \\ \hline dv & = & 6 \\ \hline \end{array}$

Link performance function:

This example can be found in: Braess D., Über ein Paradox der Verkehrsplannung, Unternehmenstorchung, 12 (1968), pp. 258-268.