Estimating an origin-destination table using a method based on shortest augmenting paths
The most well-known origin-destination estimation methods involve entropy maximization or information minimization. However, these methods often require much more information than is available in reliable form, namely, target trip tables and the extent to which each origin-destination path uses each link. In this paper, a second version of the Shortest Augmenting Path Estimation method (SHAPE-2) is introduced, in which target trip tables and path use proportions are not required. In tests to date, SHAPE-2 has produced good results. It has demonstrated good sensitivity to changes in link loadings on small test networks and, on a real network of special interest to the authors, it performed better than any method previously applied.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 28 (1994)
Issue (Month): 2 (April)
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
When requesting a correction, please mention this item's handle: RePEc:eee:transb:v:28:y:1994:i:2:p:77-89. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Shamier, Wendy)
If references are entirely missing, you can add them using this form.