## The Traffic Assignment Problem - Models and Methods |

### Contents

Urban traffic planning | 3 |

Algorithms for general traffic equilibria | 5 |

The basic equilibrium model and extensions | 33 |

Copyright | |

9 other sections not shown

### Other editions - View all

### Common terms and phrases

all-or-nothing solutions applied approach approximation algorithms assignment model assumptions asymmetric column commodity computational constraints convergence convex function convex program corresponding cost approximation Cpqr Dafermos decomposition algorithms defined demand function denote dual elastic demand equilibrium models equilibrium solution equivalent feasible set fixed demand Frank-Wolfe algorithm given hpqr iteration line search linear program link flows Lipschitz continuous mapping Mathematical Programming merit function methods monotone network flow node nonlinear complementarity problem nonlinear programming nonnegative O-D pair obtained optimal solution partial linearization algorithm quadratic programming restricted master problem route costs route flows search direction Section sequence shortest route side constrained simplicial decomposition single-commodity solutions to VIP solved step length stochastic network TAP-E TAP-VIP-F Theorem traffic assignment problem traffic equilibrium problems transportation planning Transportation Research travel cost functions travel time functions trip distribution variables variational inequality Wardrop conditions