A node-based modeling approach for the continuous dynamic network loading problem

IEEE Transactions on Intelligent Transportation Systems

Volumn 10, Issue 1, 2009, Pages 165-174

  Celikoglu, Hilmi Berk ^a   Gedizlioglu, Ergun ^a   Dell'Orco, Mauro ^b  

^a ISTANBUL TECHNICAL UNIVERSITY   (Turkey)

^b POLITECNICO DI BARI   (Italy)

Author keywords

Dynamic network loading (DNL); Mesoscopic model; Simulation; Traffic flow

Indexed keywords

DYNAMICS; TRANSPORTATION;

ACCELERATION BEHAVIOR; ANALYTICAL DYNAMICS; CONTINUOUS DYNAMICS; DYNAMIC NETWORK LOADING; FLOW CONSERVATION; MESOSCOPIC MODELING; SIMULATION; TRAFFIC FLOW;

SUPERCONDUCTING MATERIALS;

EID: 85042597805     PISSN: 15249050     EISSN: None     Source Type: Journal    
DOI: 10.1109/TITS.2008.2011720     Document Type: Article

References (36)

1. T. L. Friesz, J. Luque, R. L. Tobin, and B. W. Wie, "Dynamic network traffic assignment considered as a continuous time optimal control problem," Oper. Res., vol. 37, no. 6, pp. 893-901, Nov./Dec. 1989.
2. T. L. Friesz, D. E. Bernstein, T. E. Smith, R. L. Tobin, and B. W. Wie, "A variational inequality formulation of the dynamic network user equilibrium problem," Open Res., vol. 41, no. 1, pp. 179-191, Jan./Feb. 1993.
3. J. H. Wu, Y. Chen, and M. Florian, "The continuous dynamic network loading problem: A mathematical formulation and solution method," Transp. Res., Part B: Methodol., vol. 32, no. 3, pp. 173-187, Apr. 1998.
4. Y. W. Xu, J. H. Wu, M. Florian, P. Marcotte, and D. L. Zhu, "Advances in the continuous dynamic network loading problem," Transp. Sci., vol. 33, no. 4, pp. 341-353, Apr. 1999.
5. J. M. Rubio-Ardanaz, J. H. Wu, and M. Florian, "Two improved numerical algorithms for the dynamic network loading problems," Transp. Res., Part B: Methodol., vol. 37, no. 2, pp. 171-190, Feb. 2003.
6. D. R. Leonard, P. Gower, and N. B. Taylor, "CONTRAM: Structure of the model," TRL, Crowthorne, U.K., TRL Res. Rep. No. 178, 1989.
7. V. Astarita, "A continuous time link model for dynamic network loading based on travel time function," in Proc. 13th Int. Symp. Theory Traffic Flow, 1996, pp. 79-102.
8. R. Jayakrishnan, H. S. Mahmassani, and T. Y. Hu, "An evaluation tool for advanced information and management systems in urban networks," Transp. Res., Part C Emerg. Technol., vol. 2, no. 3, pp. 129-147, Sep. 1994.
9. H. S. Mahmassani, "Dynamic traffic simulation and assignment: Models, algorithms and application to ATIS/ATMS evaluation and operation," in Operations Research and Decision Aid Methodologies in Traffic and Transportation Management, M. Labbe, G. Laporte, K. Tanczos, and P. Toint, Eds. New York: Springer-Verlag, 1997, vol. 166, pp. 104-135.
10. V. Adamo, V. Astarita, M. Florian, M. Mahut, and J. H. Wu, "Modelling the spill-back of congestion in link based dynamic network loading models: A simulation model with application," in Proc. 14th Int. Symp. Transp. Traffic Theory, 1999, pp. 555-573.
11. M. Carey and Y. Ge, "Convergence of a discretised travel time model," Transp. Sci., vol. 39, no. 1, pp. 25-38, Feb. 2005.
12. X. J. Nie and H. M. Zhang, "A comparative study of some macroscopic link models used in dynamic traffic assignment," Netw. Spat. Econ., vol. 5, no. l, pp. 89-115, Mar. 2005.
13. C. F. Daganzo, "The cell transmission model, part II: Network traffic," Transp. Res., Part B: Methodol., vol. 29, no. 2, pp. 79-93. Apr. 1995.
14. J.-P. Lebacque, "The Godunov scheme and what it means for first order traffic flow models," in Proc. 13th Int. Symp. Transp. Traffic Theory, 1996, pp. 647-677.
15. J.-P. Lebacque and M. M. Khoshyaran, "First order traffic flow models: Intersection modelling, network modelling, applications," in Proc. Workshop ACI NIM Modelisation du Traffic, Nice, France. 2005.
16. S. Mammar, J.-P. Lebacque, and H. Haj Salem, "Intersection modelling based on the second order traffic flow model (ARZ)," in Proc. 11th EWGT Meeting, 2006, pp. 435-440.
17. H. B. Celikoglu, "A dynamic node model with a quadratic travel time function based link model," in Proc. 11th EWGT Meeting, 2006, pp. 658-666.
18. D. K. Merchant and G. L. Nemhauser, "A model and an algorithm for the dynamic traffic assignment problems," Transp. Sci., vol. 12, no. 3, pp. 183-199, Aug. 1978.
19. M. J. Smith, "The existence of an equilibrium distribution of arrivals at a single bottleneck," Transp. Sci., vol. 18, pp. 385-394, Nov. 1984.
20. M. Kuwahara and T. Akamatsu, "Decomposition of the reactive dynamic assignments with queues for a many-to-many origin-destination pattern," Transp. Res., Part B: Methodol., vol. 31, no. 1, pp. 1-10, Feb. 1997.
21. M. Carey, "A constraint qualification for a dynamic traffic assignment model," Transp. Sci., vol. 20, no. 1, pp. 55-58, Feb. 1986.
22. B. W. Wie, R. L. Tobin, and T. L. Friesz, "The augmented Lagrangian method for solving dynamic network traffic assignment models in discrete time," Transp. Sci., vol. 28, no. 3, pp. 204-220, Jun. 1994.
23. B. W. Wie, R. L. Tobin, T. L. Friesz, and D. Bernstein, "A discrete time, nested cost operator approach to the dynamic network user equilibrium problem," Transp. Sci., vol. 29, no. 1, pp. 79-92, Feb. 1995.
24. B. Ran, D. E. Boyce, and J. LeBlanc, "A new class of instantaneous dynamic user-optimal traffic assignment models," Oper. Res., vol. 41, no. 1, pp. 192-202, Feb. 1993.
25. B. W. Wie, R. L. Tobin, and M. Carey, "The existence, uniqueness and computation of an arc-based dynamic network user equilibrium formulation," Transp. Res., Part B: Methodol., vol. 36, no. 10, pp. 897-918, Dec. 2002.
26. D. Zhu and R Marcotte, "On existence of solutions to the dynamic user equilibrium problem," Transp. Sci., vol. 34, no. 4, pp. 402-414, Nov. 2000.
27. M. Carey, Y. E. Ge, and M. McCartney, "A whole-link travel-time model with desirable properties," Transp. Sci., vol. 37, no. 1, pp. 83-96, Feb. 2003.
28. H. B. Celikoglu, "A dynamic network loading model for traffic dynamics modelling," IEEE Trans. Intell. Transp. Syst., vol. 8, no. 4, pp. 575-583, Dec. 2007.
29. H. B. Celikoglu and M. Dell'Orco, "Mesoscopic simulation of a dynamic link loading process," Transp. Res., Pan C-Emerg. Technol., vol. 15, no. 5, pp. 329-344, Oct. 2007.
30. R. Jayakrishnan, W. K. Tsai, and A. Chen, "A dynamic traffic assignment model with traffic-flow relationships," Transp. Res., Part C-Emerg. Technol., vol. 3, no. 1, pp. 51-72, Feb. 1995.
31. A. K. Ziliaskopoulos, "A linear programming model for the single destination system optimum dynamic traffic assignment problem," Transp. Sci., vol. 34, no. 1, pp. 37-49, Feb. 2000.
32. I. Chabini, "Analytical dynamic network loading problem: Formulation, solution algorithms, and computer implementations," Transp. Res. Rec., no. 1771, pp. 191-200, 2001.
33. M. Dell'Orco, "A dynamic network loading model for mesosimulation in transportation systems," Eur. J. Oper. Res., vol. 175, no. 3, pp. 1447-1454, Dec. 2006.
34. M. Dell'Orco, E. Gedizlioglu, and H. B. Celikoglu, "Introduction to a node management model for traffic networks: A mesoscopic approach," in Proc. 10th EWGT Meeting, 2005, pp. 435-440.
35. H. B. Celikoglu, "A dynamic node model for highway networks," Ph.D. dissertation, Istanbul Tech. Univ., Istanbul, Turkey. 2006.
36. B. D. Greenshields, "A study in highway capacity," in Proc. HRB, 1935, vol. 14, pp. 468-477.