Simplical decomposition of the asymmetric traffic assignment problem

Siriphong Lawphongpanich and Donald W. Hearn

Transportation Research Part B: Methodological, 1984, vol. 18, issue 2, 123-133

Abstract: This paper presents a convergent simplicial decomposition algorithm for the variational inequality formulation of the asymmetric traffic assignment problem. It alternates between generating minimum path trees based on the cost function evaluated at the current iterate and the approximate solving of a master variational inequality subject to simple convexity constraints. Thus it generalizes the popular Frank-Wolfe method (where the master problem is a line search) to the asymmetric problem. Rules are given for dropping flow patterns which are not needed to express the current iterate as a convex combination of previous patterns. The results of some computational testing are reported.

Date: 1984
References: Add references at CitEc
Citations: View citations in EconPapers (19)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0191-2615(84)90026-2
Full text for ScienceDirect subscribers only

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:eee:transb:v:18:y:1984:i:2:p:123-133

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Transportation Research Part B: Methodological is currently edited by Fred Mannering

More articles in Transportation Research Part B: Methodological from Elsevier
Bibliographic data for series maintained by Catherine Liu ().