Eine Plattform für die Wissenschaft: Bauingenieurwesen, Architektur und Urbanistik
Eine Plattform für die Wissenschaft: Bauingenieurwesen, Architektur und Urbanistik
Numerical experience with diagonalization algorithms for asymmetric demand traffic assignment
This paper reviews the concept of a diagonalization algorithm for use in solving traffic network equilibrium problems for which the arc cost and/or the origin-destination travel demand functions are asymmetric. Such functions are known to occur in realistic settings involving multiple modes or users. The computational performance of this algorithm for different degrees of travel demand asymmetry is then explored by a detailed numerical experiment since no previous results of this type have been reported. It is found that, through the use of progressive stopping tolerances, the impact of high degrees of travel demand function asymmetry on the computational burden associated with finding a traffic network equilibrium may be mitigated; in effect equilibrium problems with high degrees of demand asymmetry are little more difficult to solve than perfectly symmetric problems.
Numerical experience with diagonalization algorithms for asymmetric demand traffic assignment
This paper reviews the concept of a diagonalization algorithm for use in solving traffic network equilibrium problems for which the arc cost and/or the origin-destination travel demand functions are asymmetric. Such functions are known to occur in realistic settings involving multiple modes or users. The computational performance of this algorithm for different degrees of travel demand asymmetry is then explored by a detailed numerical experiment since no previous results of this type have been reported. It is found that, through the use of progressive stopping tolerances, the impact of high degrees of travel demand function asymmetry on the computational burden associated with finding a traffic network equilibrium may be mitigated; in effect equilibrium problems with high degrees of demand asymmetry are little more difficult to solve than perfectly symmetric problems.
Numerical experience with diagonalization algorithms for asymmetric demand traffic assignment
Friesz, Terry L. (Autor:in) / Weiss, Jack (Autor:in) / Gottfried, Joel (Autor:in)
Civil Engineering and Environmental Systems ; 1 ; 63-68
01.12.1983
6 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Evaluation with Traffic Assignment Under Demand Uncertainty
| British Library Online Contents | 2001
Dynamic Traffic Assignment: Genetic Algorithms Approach
| British Library Online Contents | 1997
Demand-Driven Traffic Assignment Problem Based on Travel Time Reliability
| British Library Online Contents | 2006
Deterministic model for dynamic assignment of time-varying traffic demand
| Taylor & Francis Verlag | 1987