New Traffic Assignment Method on Circuit Theory for Urban Planning
Publication: Journal of Urban Planning and Development
Volume 131, Issue 1
Abstract
In terms of the similarity between a road network and a circuit network, this paper demonstrates that Kirchhoff’s current and voltage laws observed in the circuit can be employed in the traffic assignment of the road network. Inspired by the more consummate circuit theory, we put forward a new idea and method of traffic assignment. A set of models is formularized by means of multiobjective nonlinear planning theory, and the solutions are found using MATLAB. An example is provided to prove the feasibility of the new traffic assignment model.
Get full access to this article
View all available purchase options and get full access to this article.
Acknowledgment
This paper was supported by the National Natural Science Foundation of China (NSFC), Project Number 59978018.
References
Almond, J. (1967). “Traffic assignment with flow-dependent journey times.” Vehicular Traffic Science: Proc., 3rd Int. Symp. on the Theory of Traffic Flow, L. C. Edie, R. Herman, and R. Rothery, eds., Elsevier, New York, 222-234.
Beckmann, M. J. , McGuire, C. B., and Winsten, C. B. (1956). Studies in the economics of transportation, Yale University Press, New Haven, Conn.
Burrell, J. E. (1968). “Multipath route assignment and its application to capacity restraint.” Proc., 4th Int. Symp. on the Theory of Road Traffic Flow, Karlsruhe, Germany.
Daganzo, C. F. (1977). “Some statistical problems in connection with traffic assignment.” Transportation Research II, 6, 385-389.
Fisk, C. (1980). “Some developments in equilibrium traffic assignment.” Transp. Res., Part B: Methodol. 14(3), 243-255.
Frank, M., and Wolfe, P. (1956). “An algorithm for quadratic programming.” Naval Res. Logistics Quart., 3 (1-2), 95-110.
Hanson, S., and Hoff, J. (1988). “Systematic variability in repetitious travel.” Transportation, 13, 111-135.
Knight, F. H. (1924). “Some fallacies in the interpretation of social costs.” Quart. J. Econom., 38, 582-606.
Lago, G., and Benningfield, L. M. (1979). Circuit and system theory, Wiley, New York.
Manheim, M. L. , and Ruiter, E. R. (1970). “DODOTRANS I: A decision oriented computer language for analysis of multimodal transportation systems.” Highway Research Record 314, Highway Research Board, Washington, D.C., 135-163.
Moore, E. (1957). “The shortest path through a maze.” Proc., Int. Symp. on the Theory of Switching, Harvard University, Cambridge, Mass., 285-292.
Ortúzar, J. de D., and Willumsen, L. G. (1990). “Modelling transport.” Assignment, Wiley, London, 258-260.
Sheffi, Y. (1985). “Urban transportation networks: equilibrium analysis with mathematical programming methods.” Formulating the assignment problem as a mathematical program, Prentice Hall, Englewood Cliffs, N.J.
Wardrop, J. G. (1952). “Some theoretical aspects of road traffic research.” Proc., Institute of Civil Engineering, Part II, 1, 325-378.
Watling, D., and van Vuren, T. (1993). “The modeling of dynamic route guidance systems.” Transportation Research C 1, 159-182.
Information & Authors
Information
Published In
Journal of Urban Planning and Development
Volume 131 • Issue 1 • March 2005
Pages: 30 - 38
Copyright
© ASCE.
History
Received: Oct 21, 2003
Accepted: May 6, 2004
Published online: Mar 1, 2005
Published in print: Mar 2005
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.