Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2012, Article ID 542459, 14 pages
http://dx.doi.org/10.1155/2012/542459
Research Article

A Node Model Capturing Turning Lane Capacity and Physical Queuing for the Dynamic Network Loading Problem

School of Traffic and Transportation, Lanzhou Jiaotong University, Lanzhou 730070, China

Received 8 May 2012; Revised 30 August 2012; Accepted 30 August 2012

Academic Editor: Wuhong Wang

Copyright © 2012 Mingxia Gao. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. J. H. Wu, Y. Chen, and M. Florian, “The continuous dynamic network loading problem: a mathematical formulation and solution method,” Transportation Research Part B, vol. 32, no. 3, pp. 173–187, 1998. View at Publisher · View at Google Scholar · View at Scopus
  2. Y. W. Xu, J. H. Wu, M. Florian, P. Marcotte, and D. L. Zhu, “Advances in the continuous dynamic network loading problem,” Transportation Science, vol. 33, no. 4, pp. 341–353, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  3. M. Blumberg and H. Bar-Gera, “Consistent node arrival order in dynamic network loading models,” Transportation Research Part B, vol. 43, no. 3, pp. 285–300, 2009. View at Publisher · View at Google Scholar · View at Scopus
  4. J. M. Rubio-Ardanaz, J. H. Wu, and M. Florian, “Two improved numerical algorithms for the continuous dynamic network loading problem,” Transportation Research Part B, vol. 37, no. 2, pp. 171–190, 2003. View at Publisher · View at Google Scholar · View at Scopus
  5. V. Astarita, “A continuous time link model for dynamic network loading based on travel time function,” in Proceedings of the 13th International Symposium on Transportation and Traffic Theory, pp. 79–102, Lyon, France, 1996.
  6. H. Bar-Gera, “Continuous and discrete trajectory models for dynamic traffic assignment,” Networks and Spatial Economics, vol. 5, no. 1, pp. 41–70, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  7. R. Jayakrishnan, H. S. Mahmassani, and T. Y. Hu, “An evaluation tool for advanced traffic information and management systems in urban networks,” Transportation Research Part C, vol. 2, no. 3, pp. 129–147, 1994. View at Publisher · View at Google Scholar · View at Scopus
  8. Q. Yang and H. N. Koutsopoulos, “A microscopic traffic simulator for evaluation of dynamic traffic management systems,” Transportation Research Part C, vol. 4, no. 3, pp. 113–129, 1996. View at Publisher · View at Google Scholar · View at Scopus
  9. V. Astarita, M. Florian, M. Mahut, and J. H. Wu, “Modeling the spill-back of congestion in link based dynamic network lloading models: a simulation model with application,” in Proceedings of the 14th International Symposium on Transportation and Traffic Theory, pp. 55–573, Jerusalem, 1999.
  10. M. Carey and Y. E. Ge, “Convergence of a discretised travel-time model,” Transportation Science, vol. 39, no. 1, pp. 25–38, 2005. View at Publisher · View at Google Scholar · View at Scopus
  11. X. Nie and H. M. Zhang, “A comparative study of some macroscopic link models used in dynamic traffic assignment,” Networks and Spatial Economics, vol. 5, no. 1, pp. 89–115, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  12. C. F. Daganzo, “The cell transmission model, part II: network traffic,” Transportation Research Part B, vol. 29, no. 2, pp. 79–93, 1995. View at Publisher · View at Google Scholar · View at Scopus
  13. D. K. Merchant and G. L. Nemhauser, “Model and an algorithm for the dynamic traffic assignment problems,” Transportation Science, vol. 12, no. 3, pp. 183–199, 1978. View at Publisher · View at Google Scholar · View at Scopus
  14. C. F. Daganzo, “Properties of link travel time functions under dynamic loads,” Transportation Research Part B, vol. 29, no. 2, pp. 95–98, 1995. View at Publisher · View at Google Scholar · View at Scopus
  15. J. P. Lebacque, “The Godunov scheme and what it means for first order traffic flow models,” in Proceedings of the 13th International Symposium on Transportation and Traffic Theory, pp. 647–677, Lyon, France, 1996.
  16. S. Mammar, J. P. Lebacque, and H. Haj Salem, “Intersection modeling based on the second order traffic flow model (ARZ),” in Proceedings of the 11th EWGT Meeting, pp. 435–440, 2006.
  17. H. B. Celikoglu, “A dynamic node model with a quadratic travel time function based link model,” in Proceedings of the 11th EWGT Meeting, pp. 658–666, 2006.
  18. H. B. Celikoglu, E. Gedizlioglu, and M. Dell'Orco, “A node-based modeling approach for the continuous dynamic network loading problem,” IEEE Transactions on Intelligent Transportation Systems, vol. 10, no. 1, pp. 165–174, 2009. View at Publisher · View at Google Scholar · View at Scopus
  19. H. M. Zhang and Y. Nie, “Modeling network flow with and without link interaction: properties and implications,” in Proceedings of the 84th annual meeting of the Transportation Research Board, Washington, DC, USA, 2006.
  20. M. Carey and M. McCartney, “Behaviour of a whole-link travel time model used in dynamic traffic assignment,” Transportation Research Part B, vol. 36, no. 1, pp. 83–95, 2002. View at Publisher · View at Google Scholar · View at Scopus
  21. C. F. Daganzo, “A variational formulation of kinematic waves: solution methods,” Transportation Research Part B, vol. 39, no. 10, pp. 934–950, 2005. View at Publisher · View at Google Scholar · View at Scopus
  22. R. Jayakrishnan, W. K. Tsai, and A. Chen, “A dynamic traffic assignment model with traffic-flow relationships,” Transportation Research Part C, vol. 3, no. 1, pp. 51–72, 1995. View at Publisher · View at Google Scholar · View at Scopus
  23. B. W. Wie, R. L. Tobin, and M. Carey, “The existence, uniqueness and computation of an arc-based dynamic network user equilibrium formulation,” Transportation Research Part B, vol. 36, no. 10, pp. 897–918, 2002. View at Publisher · View at Google Scholar · View at Scopus
  24. H. B. Celikoglu and M. Dell'Orco, “Mesoscopic simulation of a dynamic link loading process,” Transportation Research Part C, vol. 15, no. 5, pp. 329–344, 2007. View at Publisher · View at Google Scholar · View at Scopus
  25. A. K. Ziliaskopoulos, “Linear programming model for the single destination System Optimum Dynamic Traffic Assignment problem,” Transportation Science, vol. 34, no. 1, pp. 37–49, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus