Abstract
One of the first mathematical models of a physical network interacting with human behavior was the model of road traffic equilibria with variable flow (demand) formulated by Martin Beckmann and colleagues in 1954. Beckmann applied the recently-proved theorem of Kuhn and Tucker to incorporate an assumption and two hypotheses concerning road traffic into a single mathematical formulation. The model considers a road network consisting of nodes and links. Associated with each directional link is an increasing function relating its travel time, or generalized travel cost, to its flow. The behavioral hypotheses represented by the model are as follows:
-
1.
All used routes from node p to node q have equal travel times, and no unused route has a lower travel time;
-
2.
The total flow over all routes from node p to node q is determined by a decreasing function of this minimum and equal, or equilibrium, travel time.
In large-scale implementations of the model, nodes p and q represent small areas called zones, at which flows originate and terminate; other nodes represent intersections on the road network. The formulation minimizes an artificial function, subject to definitional constraints. The optimality conditions of this model correspond to the above two hypotheses. Subsequently, more general formulations were investigated based on variational inequality, nonlinear complementarity and fixed point theory.
Beckmann’s formulation and its descendents considered traffic flows over a relatively long period of time, during which network conditions may be regarded as constant. The peak commuting period in the morning or evening is a typical example. Such models are static, and the flows departing from and arriving at nodes are constant over the time period. Models that consider shorter periods of time, and for which the departure and arrival rates are variables, are dynamic. These models seek to represent the effect of changing network conditions during a longer time period, including accidents and other incidents disrupting flow.
Although Beckmann did not propose an algorithm for solving his formulation, in the 1970s researchers began to solve large-scale traffic equilibria. Until recently, these solutions were rather approximate, and did not reveal the structure of the solution, especially with regard to the number and pattern of equilibrium routes. In 2003, Bar-Gera and Boyce proposed an algorithm that reveals this structure for the first time. Subsequently, they began to explore the properties of this solution for large-scale implementations, such as for the Chicago region. The initial results of these explorations for the Chicago region were unexpected and regarded as “astonishing” by one informed observer. One result examined is the relation between the number of routes between a pair of zones and the frequency with which this number occurs in the network. The authors observed that the number of routes increases greatly as the level of congestion increases.
This chapter seeks to introduce traffic network equilibrium models to scholars from a broad range of backgrounds, mainly focusing on static models of urban road traffic. Findings on the solution properties of static models for a large network for three congestion levels are presented. A discussion of the applicability of the findings to other types of networks, such as electrical power and supply chain networks, concludes the paper.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barabási, A.-L. 2002. Linked. Perseus Publishing, Cambridge, MA.
Bar-Gera, H. (2002). Origin-based Algorithms for the Traffic Assignment Problem. Transportation Science, 36, 398–417.
Bar-Gera, H. (2005). Primal Method for Determining the Most Likely Route Flows in Large Road Networks. Transportation Science 40, 269–286.
Bar-Gera, H. and D. Boyce (2003). Origin-based Algorithms for Combined Travel Forecasting Models. Transportation Research 37B, 405–422.
Bar-Gera, H. and D. Boyce (2005). User-Equilibrium Route Set Analysis of a Large Road Network. In: H.S. Mahmassani (ed), Transportation and Traffic Theory: Flow, Dynamics and Human Interaction, Elsevier, Oxford, pp. 673–692.
Bertsekas, D. (1980). A Class of Optimal Routing Algorithms for Communication Networks. Proc. 5th International Conference on Computers and Communication, Atlanta, pp. 71–76.
Bertsekas, D. and R. Gallager 1987. Data Networks. Prentice-Hall, Englewood Cliffs, NJ.
Boyce, D. and H. Bar-Gera (2003). Validation of Multiclass Urban Travel Forecasting Models Combining Origin-Destination, Mode, and Route Choices, Journal of Regional Science, 43, 517–540.
Boyce, D., and H. Bar-Gera (2004). Multiclass Combined Models for Urban Travel Forecasting, Networks and Spatial Economics, 4, 115–124.
Boyce, D. (2004). Forecasting Travel on Congested Urban Transportation Networks: Review and Prospects for Network Equilibrium Models. Networks and Spatial Economics, 7(2).
Beckmann, M., C.B. McGuire and C.B. Winsten 1956. Studies in the Economics of Transportation. Yale University Press, New Haven, CT.
Crainic, T.G. (1999). Long-haul Freight Transportation. In: R.W. Hall (ed), Handbook of Transportation Science, Kluwer, Norwell, MA, pp. 433–491.
Duffin, R.J. (1947). Nonlinear Networks IIa. Bulletin of the American Mathematical Society, 53, 963–971.
Florian, M. and D. Hearn (1999). Network Equilibrium and Pricing. In: R. W. Hall (ed), Handbook of Transportation Science, Kluwer, Norwell, MA, pp. 361–393.
Fratta, L., M. Gerla and L. Kleinrock (1973). The Flow Deviation Method: An Approach to Store-and-Forward Communication Network Design. Networks, 3, 97–133.
Friesz, T.L., J.A. Gottfried and E.K. Morlok (1986). A Sequential Shipper-Carrier Network Model for Predicting Freight Flows. Transportation Science, 20, 80–91.
Friesz, T.L., R. Mookherjee, S. Peeta and P. Zhang (2004). Modeling the Dynamic Formulation of Distribution Networks and Supply Chains Using Self-Regulating Variational Inequalities. The Fifth Triennial Symposium on Transportation Analysis, Guadeloupe.
Geunes, J. and P.M. Pardalos (2003). Network Optimization in Supply Chain Management and Financial Engineering: An Annotated Bibliography. Networks, 42, 66–84.
Hobbs, B.F. (2001). Linear Complementarity Models of Nash-Cournot Competition in Bilateral and POOLCO Power Markets. IEEE Transactions of Power Systems, 16, 194–202.
Hobbs, B.F., C.B. Metzler and J.-S. Pang (2000). Strategic Gaming Analysis for Electric Power Systems: An MPEC Approach. IEEE Transactions of Power Systems, 15, 638–645.
Marcotte, P. and S. Nguyen (eds.) 1998. Equilibrium and Advanced Transportation Modelling. Kluwer, Norwell, MA.
Nagurney, A. (1999). Network Economics, second and revised edition. Kluwer, Dordrecht, The Netherlands.
Nagurney, A. (2005). Virtual Center for Supernetworks. http://supernet.som.umass.edu/dart.html
Nagurney, A. and J. Dong (2002). Supernetworks. Edward Elgar, Northampton, MA.
Nagurney, A., J. Dong and D. Zhang (2002). A Supply Chain Network Equilibrium Model. Transportation Research E, 38, 281–303.
Nagurney, A. and D. Matsypura (2004). A Supply Chain Network Perspective for Electric Power Generation, Supply, Transmission and Consumption. In: E.J. Kontoghiorghes and C. Gatu (eds), Optimisation, Econometric and Financial Analysis, Springer, Berlin, pp. 3–27.
Patriksson, M. (1994). The Traffic Assignment Problem: Models and Methods. VSP, Utrecht.
Patriksson, M. and R.T. Rockafellar (2003). Variational Geometry and Equilibrium. In: Equilibrium Problems and Variational Models, Proceedings of the International School of Mathematics “G. Stampacchia” 32th Workshop, Kluwer Academic Publishers, Norwell, MA, pp. 347–368.
Sansò, B. and P. Soriano (eds.) (1999). Telecommunications Network Planning, Kluwer, Norwell, MA.
Wardrop, J.G. (1952). Some Theoretical Aspects of Road Traffic Research. Proceedings of the Institution of Civil Engineers, Part II, 1, 325–378.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Bar-Gera, H., Boyce, D. (2007). Some Amazing Properties of Road Traffic Network Equilibria. In: Friesz, T.L. (eds) Network Science, Nonlinear Science and Infrastructure Systems. International Series in Operations Research & Management Science, vol 102. Springer, Boston, MA. https://doi.org/10.1007/0-387-71134-1_13
Download citation
DOI: https://doi.org/10.1007/0-387-71134-1_13
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-71080-8
Online ISBN: 978-0-387-71134-8
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)