Abstract
The conventional transport model (recursive in character) is a combination of three submodels, trip generation, trip distribution and assignment. As a rule, these stages are treated separately as if the travel choices involved in each one were made independently of the other. A careful examination of this procedure, however, reveals some significant weaknesses. Although quite sophisticated models based on behavioral assumptions have been developed for the assignment stage, the models available for the distribution and generation stages are less refined. As a result, serious internal inconsistencies arise. For example, the travel costs that are used as inputs for the distribution and generation stage are not the same as those which are outputs from the assignment stage. As a partial remedy, practitioners have devised in recent years an iterative scheme, in which the above model is imbedded, in the hope that the interrelationship between demand, supply and cost will be taken into account. Unfortunately, the above scheme does not produce in general equilibrium flows (see e.g. [6]). For these reasons we strongly believe that the substitution of the “first generation” recursive transport model by a “second generation” integrated transport model based on behavioral assumptions and the equilibrium concept will be an important step towards better planning of transportation systems.
This research was supported by N.S.F. grant No. GP28931.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Dafermos, S. C. and F. T. Sparrow. The Traffic Assignment Problem for a General Network. Journal of the National Bureau of Standards, 37B, 91–118 (1969).
Dafermos, S. C. An Extended Traffic Assignment Model with Applications to Two-Way Traffic. Transportation Science, 5, 366–389 (1971).
Dafermos, S. C. The Traffic Assignment Problem for Multiclass-User Transportation Networks. Transportation Science, 6, 73–87 (1972).
Florian M. and S. Nguyen. A New Method for Computing Network Equilibrium with Elastic Demands. Publication No. 140, Department d’Informatique, Universite de Montreal, 1973.
Leventhal, T.,Nemhauser G. and Trotter, L., Jr. A Column Generation Algorithm for Optimal Traffic Assignment. Transportation Science, 7. 168–176 (1973).
Manheim, M. L. Practical Implications of Some Fundamental Properties of Travel Demand Models. M.I.T. Research Report No. R72-23, Department of Civil Engineering, M.I.T., Cambridge, Massachusetts.
Nguyen, S. An Algorithm for the Traffic Assignment Problem. Transportation Science, 8, 203–216 (1974).
Potts, R. B. and R. M. Oliver. Flows in Transportation Networks. Academic Press, New York, 1972.
Quandt, R. E. and W. J. Baumal. The Abstract Mode Model: Theory and Measurement. Northeast Corridor Transportation Project. Technical paper No. 4, June, 1966.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1976 Springer-Verlag Berlin · Heidelberg
About this paper
Cite this paper
Dafermos, S.C. (1976). Integrated Equilibrium Flow Models for Transportation Planning. In: Florian, M.A. (eds) Traffic Equilibrium Methods. Lecture Notes in Economics and Mathematical Systems, vol 118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-48123-9_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-48123-9_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07620-9
Online ISBN: 978-3-642-48123-9
eBook Packages: Springer Book Archive