 A path-based user-equilibrium traffic assignment algorithm that obviates path storage and enumerationRobert B. Dial Transportation Research Part B: Methodological, 2006, vol. 40, issue 10, 917-936 Abstract: This paper presents a novel user-equilibrium (UE) traffic assignment algorithm, which under conventional assumptions, promises to compute UE arc flows to acceptable precision, regardless of the network's topology, size or congestion: - The algorithm takes the simple approach of shifting flow from a costliest path to a cheapest path until the costs of all used paths are within a given [epsilon] of the cheapest. - Because of being path-based, it avoids tailing. - In spite of being path-based, it neither stores nor enumerates paths. - These efficiencies derive from decomposing the problem into a sequence of easy single-origin problems on acyclic sub-networks. Solutions to this sequence of sub-network flows converge rapidly to a sharp practical estimate of UE arc flows--as is amply demonstrated by tests using the Chicago region's 40,000-arc network model. Date: 2006 Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:transb:v:40:y:2006:i:10:p:917-936 Ordering information: This journal article can be ordered from 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 |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.