XNET: Extended Traffic Assignment Model
Publication: Journal of Transportation Engineering
Volume 113, Issue 4
Abstract
A PC‐based traffic planning model for use by small cities is described. The software includes routines for estimating OD matrices from observed link data and for determining equilibrium traffic flows. The mathematical modeling and algorithmic implementation of the problem and its solution technique are emphasized. An example application of the model is included.
Get full access to this article
View all available purchase options and get full access to this article.
References
1.
Beckmann, M. J., McGuire, C. B., and Winsten, C. B. (1956). Studies in the economics of transportation. Yale Univ. Press, New Haven, Conn.
2.
Borland International (1985). Turbo Pascal Version 3.0, Scotts Valley, Calif.
3.
Frank, M., and Wolfe, P. (1956). “An algorithm for quadratic programming.” Naval Res. Logist. Quart., 3(1–2), 95–110.
4.
Gur, Y. J., et al. (1980). “Estimation of an origin‐destination trip table based on observed link volumes and turning movements—volume 1: technical report.” Report No. RD‐80/034, FHWA, U.S. Dept. Transp., Washington, D.C.
5.
Han, A., Dowling, R., Sullivan, E., and May, A. (1981). “Deriving origin‐destination information from routinely collected traffic counts volume II.” Inst. Transp. Studies Res. Rep. UCB‐ITS‐RR‐81‐9, Univ. of California, Berkeley, Calif., 1981.
6.
Holm, J., et al. (1976). “Calibrating traffic models on traffic census results only.” Traffic Engrg. and Control, 17.
7.
Interface Technologies Corp. (1985). SDS‐XP, Modula‐2, Houston, Tex.
8.
Jornsten, K., and Nguyen, R. (1980). “On the estimation of trip matrix from network data.” Report NITH‐MAT‐R‐79‐36, Linkoping Inst., of Tech., Linkoping, Sweden.
9.
LeBlanc, L. J., Morlok, E. K., and Pierskalla, W. (1975). “An efficient approach to solving the road network equilibrium traffic assignment problem.” Transp. Res., 9(5), 309–318.
10.
Moore, E. (1957). “The shortest path through a maze.” Proc. Int. Symp. Theory of Switching, Harvard Univ. Press, Cambridge, Mass., 285–292.
11.
Pape, U. (1974). “Implementation and efficiency of Moore‐algorithms for the shortest route problem.” Math. Programming, 7(2), 212–222.
12.
Sheffi, Y. (1985). Urban transportation networks: equilibrium analysis with mathematical programming methods. Prentice‐Hall, Englewood Cliffs, N.J.
13.
Software Bottling Company of New York. (1985). Screen sculpture. New York, N.Y.
14.
U.S. Bureau of Public Roads. (1964). Traffic assignment manual. U.S. Dept. of Commerce, Washington, D.C.
15.
Wardrop, J. G. (1952). “Some theoretical aspects of road traffic research.” Proc., Inst., of Civ. Engrs., II(1), 325–378.
Information & Authors
Information
Published In
Journal of Transportation Engineering
Volume 113 • Issue 4 • July 1987
Pages: 450 - 462
Copyright
Copyright © 1987 ASCE.
History
Published online: Jul 1, 1987
Published in print: Jul 1987
Authors
Metrics & Citations
Metrics
Citations
Download citation
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.