|
|
|
Title: CONVERGENCE PROPERTIES OF SOME ITERATIVE TRAFFIC ASSIGNMENT ALGORITHMS
Accession Number: 00492084
Record Type: Component
Availability: Find a library where document is available Abstract: This paper examines the convergence properties of four popular traffic assignment algorithms: Frank-Wolfe decomposition for fixed-demand equilibrium assignment, an ad hoc variation of the Evans algorithm for elastic-demand equilibrium assignment, fixed-demand incremental assignment, and elastic-demand incremental assignment. The algorithms were evaluated according to errors associated with insufficient iterations, arbitrary selection of starting point, inexact theory, and small variations in data. Each of the four algorithms reached its intended solution, but did so very slowly. Elastic-demand incremental assignment emerged as the preferred technique, principally because of its more accurate response to small variations in data and its adaptability to various models of travel demand.
Supplemental Notes: This paper appears in Transportation Research Record No. 1220, Forecasting. Distribution, posting, or copying of this PDF is strictly prohibited without written permission of the Transportation Research Board of the National Academy of Sciences. Unless otherwise indicated, all materials in this PDF are copyrighted by the National Academy of Sciences. Copyright © National Academy of Sciences. All rights reserved
Monograph Title: Monograph Accession #: 01414064
Authors: Horowitz, Alan JPagination: p. 21-27
Publication Date: 1989
Serial: ISBN: 0309048141
Features: References
(9)
; Tables
(9)
TRT Terms: Uncontrolled Terms: Old TRIS Terms: Subject Areas: Economics; Highways; Planning and Forecasting; I72: Traffic and Transport Planning
Files: TRIS, TRB, ATRI
Created Date: Mar 31 1990 12:00AM
More Articles from this Serial Issue:
|
