Computer generation of network cost from one link's equilibrium data
- 33 Downloads
Our computer implemented algorithm generates global network equilibrium information from the local network equilibrium data at one arbitrary link. This data consists of variations in its flow and in its cost resulting from variations in its obstruction level, as well as in network demand. Output and timings from two test networks are given.
KeywordsEquilibrium network network cost transportation T-grid
Unable to display preview. Download preview PDF.
- S. Dafermos, Traffic equilibria and variational inequalities, Transp. Sci. 14 (1980) 42–54.Google Scholar
- M. Frank, The equilibrium worth of a network link, Transp. Sci. 23 (1989).Google Scholar
- M. Frank, Obtaining network cost(s) from one link's output, Transp. Sci. 26 (1992) 27–35.Google Scholar
- M. Frank and P. Wolfe, An algorithm for quadratic programming, Naval Res. Logist. Q. 3 (1956) 95–118.Google Scholar
- T.L. Friesz, Transportation network equilibrium design and aggregation, Transp. Res. 19A (1985) 413–427.Google Scholar
- L.J. Le Blanc, E.K. Morlok and W. Pierskalla, An efficient approach to solving the road network equilibrium traffic assignment problem, Transp. Res. 9 (1975) 309–318.Google Scholar
- A.B. Nagurney, Comparative tests of multimodel traffic equilibrium methods, Transp. Res. 18B (1984) 469–485.Google Scholar
- A.B. Nagurney, Computer program for multimodel traffic equilibrium methods, Tech. Rep., Division of Applied Math., Brown Univ. (1983).Google Scholar
- J.G. Wardrop, Some theoretical aspects of road traffic research, Proc. Institute of Civil Engineering, Part II, 1 (1952) 325–378.Google Scholar
- S. Nguyen and C. Dupuis, A method for computing traffic equilibria, Trans. Sci. 18 (1984) 185–232.Google Scholar