The existence and calculation of traffic equilibria
AbstractThe paper considers the assignment problem when there are junction interactions. We give an objective function which measures the extent to which a traffic distribution departs from equilibrium, and an algorithm which (under certain conditions) calculates equilibria by steadily reducing the objective function to zero. It is shown that the algorithm certainly works if the network cost-flow function is monotone and continuously differentiable, and a boundary condition is satisfied.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by Elsevier in its journal Transportation Research Part B: Methodological.
Volume (Year): 17 (1983)
Issue (Month): 4 (August)
Contact details of provider:
Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Otsubo, Hironori & Rapoport, Amnon, 2008. "Vickrey's model of traffic congestion discretized," Transportation Research Part B: Methodological, Elsevier, vol. 42(10), pages 873-889, December.
- Arnott, Richard & Kraus, Marvin, 1993.
"The Ramsey problem for congestible facilities,"
Journal of Public Economics,
Elsevier, vol. 50(3), pages 371-396, March.
- David Levinson & Ajay Kumar, 1994. "Integrating Feedback into the Transportation Planning Mode," Working Papers 199404, University of Minnesota: Nexus Research Group.
- Lo, Hong K. & Chen, Anthony, 2000. "Traffic equilibrium problem with route-specific costs: formulation and algorithms," Transportation Research Part B: Methodological, Elsevier, vol. 34(6), pages 493-513, August.
- Yang, Fan & Zhang, Ding, 2009. "Day-to-day stationary link flow pattern," Transportation Research Part B: Methodological, Elsevier, vol. 43(1), pages 119-126, January.
- He, Xiaozheng & Guo, Xiaolei & Liu, Henry X., 2010. "A link-based day-to-day traffic assignment model," Transportation Research Part B: Methodological, Elsevier, vol. 44(4), pages 597-608, May.
- Meneguzzer, Claudio, 1995. "An equilibrium route choice model with explicit treatment of the effect of intersections," Transportation Research Part B: Methodological, Elsevier, vol. 29(5), pages 329-356, October.
- Dulce Rosas & Jordi Castro & Lídia Montero, 2009. "Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem," Computational Optimization and Applications, Springer, vol. 44(2), pages 289-313, November.
- Xiao, Feng & Shen, Wei & Michael Zhang, H., 2012. "The morning commute under flat toll and tactical waiting," Transportation Research Part B: Methodological, Elsevier, vol. 46(10), pages 1346-1359.
- Lo, Hong K. & Szeto, W. Y., 2002. "A methodology for sustainable traveler information services," Transportation Research Part B: Methodological, Elsevier, vol. 36(2), pages 113-130, February.
- Terry E. Daniel & Eyran J. Gisches & Amnon Rapoport, 2009. "Departure Times in Y-Shaped Traffic Networks with Multiple Bottlenecks," American Economic Review, American Economic Association, vol. 99(5), pages 2149-76, December.
If references are entirely missing, you can add them using this form.