Abstract 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.
Computational comparisons of algorithms for general asymmetric traffic equilibrium problems with fixed and elastic demands
Transportation Research Part B: Methodological ; 20 , 1 ; 78-84
1985-05-15
7 pages
Article (Journal)
Electronic Resource
English
Equilibrium traffic assignment procedures with elastic demands
TIBKAT | 1976
|Dynamic Traffic Network Equilibrium System with Elastic Demands
British Library Conference Proceedings | 2014
|Dynamic Traffic Network Equilibrium System with Elastic Demands
Tema Archive | 2014
|An Efficient Method to Compute Traffic Assignment Problems with Elastic Demands
Online Contents | 2008
|