Traffic Assignment: Equilibrium Models

Michael Florian () and Donald W. Hearn ()
Additional contact information
Michael Florian: University of Montreal
Donald W. Hearn: University of Florida

A chapter in Pareto Optimality, Game Theory And Equilibria, 2008, pp 571-592 from Springer

Abstract: The formulation of static assignment models, with variable and fixed demand, based on Wardrop's first principle, are presented for deterministic and stochastic models. The main algorithms used to obtain solutions for these network equilibrium models are given for each class of assignment problems. Calibration and validation issues are considered.

Keywords: traffic assignment; equilibrium models; variational inequalities; stochastic traffic assignment; linear approximation method; partial linear approximation method; PARTAN; restricted simplicial decomposition; cyclic decomposition; path equilibration algorithm; relaxation algorithm (search for similar items in EconPapers)
Date: 2008
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-0-387-77247-9_22

Ordering information: This item can be ordered from
http://www.springer.com/9780387772479

DOI: 10.1007/978-0-387-77247-9_22

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().