Traffic Assignment in Practice: Overview and Guidelines for Users
Publication: Journal of Transportation Engineering
Volume 117, Issue 6
Abstract
This paper presents an overview of the elements of traffic assignment and a synthesis of the problems that may be encountered in applying traffic‐assignment models in practice. The elements include preparing the transportation network, establishing the origin‐destination (OD) demands, identifying a traffic‐assignment technique, calibrating and validating a model, and forecasting. The practical problems of traffic assignment are classified into four categories: network‐representation problems, system‐subarea data‐translation problems, model‐calibration problems, and forecasting problems. The paper presents the state of the art in traffic‐assignment elements and provides specific guidelines on their implementation in practice and on the resolution of the identified problems. This paper is one of a series being produced by the Urban Transportation Division (UTD) Transportation Planning Committee of ASCE.
Get full access to this article
View all available purchase options and get full access to this article.
References
1.
Allen, B., Easa, S., and Case, E. (1978). “Application of freeway corridor assignment and control model.” Transp. Res. Rec., 682, 76–84.
2.
Babin, A. (1982). “EMME/2: Interactive graphic method for road and transit planning.” Transp. Res. Rec., 866, 1–8.
3.
Bajpai, J. (1990). “Forecasting the basic inputs to transportation planning at the zonal level.” NCHRP Report 328, Transp. Res. Board, Nat. Res. Council, Washington, D.C.
4.
Beckman, M., McGuire, C. and Winsten, C. (1956). Studies in the economics of transportation. Yale Univ. Press, New Haven, Conn.
5.
Bovy, P., and Jansen, G. (1983). “Network aggregation effects upon equilibrium assignment outcomes: An empirical investigation.” Transp. Sci., 17(3), 240–262.
6.
Branston, D. (1976). “Link capacity functions: A review.” Transp. Res., 10(4), 223–236.
7.
Brown, G., and Scott, R. (1970). “Micro‐assignment: A new tool for small area planning.” Highway Res. Rec., 322, 149–161.
8.
Chan, Y. (1976). “A method to simplify network representation in transportation planning.” Transp. Res., 10(3), 179–191.
9.
“Computer programs for urban transportation planning: PLACPAC/BACKPAC.” (1977). General Information Manual, U.S. Dept. of Transp., Federal Highway Administration, Washington, D.C.
10.
Daganzo, C. (1977a). “On the traffic assignment problem with flow dependent costs.” Transp. Res., 11(6), 433–438.
11.
Daganzo, C. (1977b). “Some research on traffic assignment methodology selection.” Working Paper 7703, Inst. of Transp. Studies, Univ. of California, Berkeley, Calif.
12.
Daganzo, C. (1979). Multinorninal probit: The theory and its application to demand forecasting. Academic Press, New York, N.Y.
13.
Daganzo, C. (1980). “Network representation, continuum approximations, and a solution to the spatial aggregation problem of traffic assignment.” Transp. Res., 14B, 229–239.
14.
Daganzo, C., and Sheffi, Y. (1977). “On stochastic models of traffic assignment.” Transp. Sci., 11(3), 253–274.
15.
Dial, R. (1971). “A probabilistic multipath traffic assignment algorithm which obviates path enumeration.” Transp. Res., 5(2), 83–111.
16.
Dijkstra, E. (1959). “A note on two problems in connection with graphs.” Numer. Math., 1, 269–271.
17.
Easa, S. (1982). “Selecting two‐regime traffic‐flow models.” Transp. Res. Rec., 869, 25–36.
18.
Easa, S. (1985). “Shortest‐route algorithm with movement prohibitions.” Transp. Res., 19B(3), 197–208.
19.
Easa, S., and May, A. (1981). “Evaluation of traffic management strategies in central business districts.” Transp. Res. Rec., 816, 1–10.
20.
Easa, S., and McColl, D. (1987). “Assessing traffic and emergency benefits of railroad grade separations.” J. Transp. Engrg., ASCE, 113(6), 593–608.
21.
Eash, R., Janson, B., and Boyce, D. (1979). “Equilibrium trip assignment: Advantages and implication for practice.” Transp. Res. Rec., 728, 1–8.
22.
Eash, R. (1983). “Equilibrium traffic assignment on an aggregated highway network for sketch planning.” Transp. Res. Rec., 944, 30–37.
23.
Florian, M., and Nguyen, S. (1976). “An application and validation of equilibrium traffic assignment methods.” Transp. Sci., 10(4), 374–390.
24.
Florian, M. (1979). “Validation and application of EMME: An equilibrium based two‐mode urban transportation planning method.” Publication No. 103, Ctr. for Transp. Res., Univ. of Montreal, Montreal, Quebec.
25.
Fricker, J. (1989). “Procedures to calibrate link performance functions in traffic assignment models.” Second Conf. on Application of Transportation Planning Methods, Orlando, Florida.
26.
Gartner, N. (1980a). “Optimal traffic assignment with elastic demands: A review; Part I. Analysis framework.” Transp. Sci., 14(2), 174–191.
27.
Gartner, N. (1980b). “Optimal traffic assignment with elastic demands: A review; Part II. Algorithmic approaches.” Transp. Sci., 14(2), 192–208.
28.
Gur, Y. (1980). “Estimation of an origin‐destination trip table based on observed link volumes and turning movements.” FHWA/RD‐80/035, Vols. 1, 2, and 3, Federal Highway Administration, U.S. Dept. of Transp., Washington, D.C.
29.
Gur, Y. (1983). “Estimation of trip tables from traffic counts: Comparative evaluation of available techniques.” Transp. Res. Rec., 944, 113–117.
30.
Haghani, A., and Daskin, M. (1983), Network design application of an extraction algorithm for network aggregation.” Transp. Res. Rec., 944, 37–46.
31.
Han, A., and Sullivan, E. (1983). “Trip table synthesis for CBD networks: Evaluation of the LINKOD model.” Transp. Res. Rec., 944, 106–112.
32.
“Highway capacity manual.” (1985). Special Report 209, Transp. Res. Board, Nat. Res. Council, Washington, D.C.
33.
Horowitz, A. (1989). “Convergence properties of some iterative traffic assignment algorithms.” Transp. Res. Rec., 1220, 21–27.
34.
Horowitz, A. (1990). “Subarea focusing with combined models of spatial interaction and equilibrium assignment.” Transp. Res. Rec., 1285, 1–8.
35.
Huber, M., Boutwell, H., and Witheford, D. (1968). “Comparative analysis of traffic assignment techniques with actual highway use.” NCHRP Report 58, Highway Res. Board, Nat. Res. Council, Washington, D.C.
36.
Humphrey, T. (1967). “A report on the accuracy of traffic assignment when using capacity restraint.” Highway Res. Rec. 191, 53–75.
37.
Hutchinson, B. (1974). Principles of urban transport systems planning. McGraw‐Hill, New York, N.Y.
38.
James, M. (1987). “Accuracy evaluation tests for assignment models of large traffic networks.” ITE J., 57(1), 36–40.
39.
Janson, B., Thint, S., and Hendrickson, C. (1986). “Validation and use of equilibrium network assignment for urban highway reconstruction planning.” Transp. Res., 20A(1), 61–73.
40.
Kanafani, A. (1983). Transportation demand analysis. McGraw Hill, New York, N.Y.
41.
Kirby, R., and Potts, R. (1969). “The minimum route problem for networks with turn penalties and prohibitions.” Transp. Res., 3(3), 397–408.
42.
LeBlanc, L., Morlok, E., and Pierskalla, W. (1975). “An efficient approach to solving the road network equilibrium traffic assignment problem.” Transp. Res., 9(5), 309–318.
43.
Manheim, M. (1979). Fundamentals of transportation systems analysis. Massachusetts Inst. of Tech. Press, Cambridge, Mass.
44.
Matsoukis, E. (1986). “Road traffic assignment: A review; Part I. Non‐equilibrium methods.” Transp. Plan, and Tech., 11(1), 69–79.
45.
Matsoukis, E., and Michalopoulos, P. (1986). “Road traffic assignment: A review; Part II. Equilibrium methods.” Transp. Plan, and Tech., 11(2), 117–135.
46.
May, A. (1990). Traffic flow fundamentals. Prentice Hall, Englewood Cliffs, N.J.
47.
McShane, W., and Roess, R. (1990). Traffic engineering. Prentice Hall, Englewood Cliffs, N.J.
48.
Meyer, M., and Miller, E. (1984). Urban transportation planning: A decision‐oriented approach. McGraw‐Hill, New York, N.Y.
49.
Meyer, M., et al. (1989). A toolbox for alleviating traffic congestion. Inst. of Transp. Engrs., Washington, D.C.
50.
Moore, E. (1957). “The shortest path through a maze.” Proc. Int. Symp. on the Theory of Switching, Harvard University, Cambridge, Mass., 285–292.
51.
Morlok, E. (1978). Introduction to transportation engineering and planning. McGraw‐Hill, New York, N.Y.
52.
Newell, G. (1980). Traffic flow on transportation networks. Massachusetts Inst. of Tech. Press, Cambridge, Mass.
53.
Nguyen, S. (1977a). “Estimating an O‐D matrix from network data: A network equilibrium approach.” Publication No. 60, Ctr. for Transp. Res., Univ. of Montreal, Montreal, Quebec.
54.
Nguyen, S. (1977b). “On the estimation of an O‐D trip matrix by equilibrium methods using pseudo delay functions.” Publication No. 81, Ctr. for Transp. Res., Univ. of Montreal, Montreal, Quebec.
55.
Pedersen, N., and Samdahl, D. (1982). “Highway traffic data for urbanized area project planning and design.” NCHRP Report 255, Transp. Res. Board, Nat. Res. Council, Washington, D.C.
56.
Pignataro, L. (1973), “Traffic engineering: Theory and practice.” Prentice‐Hall, Englewood Cliffs, N.J.
57.
Safwat, K., and Magnanti, T. (1988). “A combined trip generation, trip distribution, modal split, and trip assignment model.” Transp. Sci., 18(1), 14–30.
58.
Sheffi, Y. (1985). Urban transportation networks. Prentice Hall, Englewood Cliffs, N.J.
59.
Sheffi, Y., and Powell, W. (1980). “A comparison of stochastic and deterministic traffic assignment over congested networks.” Transp. Res., 15B(1), 53–64.
60.
Smith, R., and Brennan, T. (1980). “Traffic assignment techniques for smaller cities.” J. Transp. Engrg., ASCE, 106(1), 85–98.
61.
Software and Source Book. (1988). Ctr. for Microcomputers in Transp., Univ. of Florida, Gainesville, Fla.
62.
Sosslau, A. (1978). “Quick‐response urban travel estimation techniques and transferable parameters: User's guide.” NCHRP Report 187, Transp. Res. Board, Nat. Res. Council, Washington, D.C.
63.
Stokes, R., and Chavala, T. (1989). “Design and implementation of intercity origin‐destination surveys.” Transp. Res. Rec., 1236, 23–33.
64.
Suh, S., Park, C., and Kim, T. (1990). “A highway capacity function in Korea: Measurement and calibration.” Transp. Res., 24A(3), 177–186.
65.
Traffic assignment manual. (1964). U.S. Dept. of Commerce, Bureau of Public Roads, Washington, D.C.
66.
Trip generation. (1987). Fourth Ed., Inst. of Transp. Engrs., Washington, D.C.
67.
Wardrop, J. (1952). “Some theoretical aspects of road traffic research.” Proc. of the Inst. of Civ. Engrs., 2(1), 325–378.
68.
Wildermuth, B., Delandy, D., and Thompson, K. (1972). “Effect of zone size on traffic assignment and trip distribution.” Highway Res. Rec., 392, 58–75.
69.
Wilson, E., Matthias, J., and Betz, M. (1974). “A traffic assignment planning model: The load‐node concept.” Transp. Res., 8, 75–84.
70.
Witheford, D. (1982). “Urban transportation planning.” Transportation and traffic engineering handbook, Prentice‐Hall, Englewood Cliffs, N.J.
71.
Yagar, S. (1975). “CORQ—A model for predicting flows and queues in a road corridor.” Transp. Res. Rec., 533, 77–87.
Information & Authors
Information
Published In
Journal of Transportation Engineering
Volume 117 • Issue 6 • November 1991
Pages: 602 - 623
Copyright
Copyright © 1991 ASCE.
History
Published online: Nov 1, 1991
Published in print: Nov 1991
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.