Computational comparisons of algorithms for general asymmetric traffic equilibrium problems with fixed and elastic demands
In this note we compare the computational efficiency of projection and relaxation methods for the solution of the asymmetric traffic equilibrium problem with elastic demands with their computational efficiency for the fixed demand problem. In particular, we tested networks with three different classes of travel cost and travel disutility functions. Our experiments suggest that the form of the travel cost and disutility functions affects not only the relative efficiencies of these two methods but also their overall efficiencies.
Volume (Year): 20 (1986)
Issue (Month): 1 (February)
|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:20:y:1986:i:1:p:78-84. 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.