Ergun GEDİZLİOĞLU, Hilmi Berk ÇELİKOĞLU

Nokta kuyruk modellemesi için bir dinamik düğüm noktası modeli

Bu çalışmada; karayolu ağlarında akım yayılımını modelleyen ve bir dinamik ağ yükleme sürecinde tümleşik olarak kullanılabilen analitik bir dinamik düğüm noktası modeli yardımıyla, bağ girişlerinde meydana gelen nokta kuyruklanmanın modellemesi yapılmıştır. Önerilen dinamik düğüm noktası modelinin; bağ çıkış formülasyonu temelli bir karma-boyut bağ modeli bileşeni ve akım korunumu, kapasite, akım dağılımı ve negatif olmama kısıtlarını içeren bir düğüm noktası kuralları bileşeni vardır. Oluşturulan dinamik düğüm noktası formülasyonu, belirlenen kısıtlar altında benzetim yoluyla çözülmüştür. Nokta kuyruk varsayımı ile oluşturulan bağ modeli bileşeni; aşırı-doygun trafik akım durumunu değerlendiren bir yapıdadır. Zaman boyutunda yapılan ayrıklaştırma, aşırı-doygun duruma ilişkin konulan kapasite kısıtı ve düzgün ivmelenen taşıt hareketi varsayımı ile oluşturulan bağ modeli bileşeni, gerçekçi trafik akım dinamiklerinin temsiline olanak sağlamıştır. Bağ modeli ile belirlenen akımlar, düğüm noktası bileşenine girdi olmaktadır. Akımların düğüm noktası bileşeninde, önceden tanımlı dağılım oranları ve ayrılan bağ özellikleri ile işlenmesi ile ayrılan bağ giriş akımları hesaplanır. Modellenen nokta kuyrukların; i) kapasitenin aşıldığı herhangi durumda ve ii) modeli çözmek için zaman düzeyinde yapılan ayrıklaştırmaya bağlı olarak, bir önceki hesaplama anından arta kalan akım hacmi varolduğu durumda belirdiği varsayılmıştır. Nokta kuyruk modellemesi için önerilen yeni dinamik düğüm noktası modeli, karma-boyut yaklaşımı temeli üzerinde yapılandırılmış tek düğüm noktası modelidir. Yeni modelin aşırı-doygunlukta gerçekçi sonuçlar verdiği görülmüştür.

A dynamic node model for point queue modelling

Point-queuing and physical queuing are the two main assumptions that have been made in problems of Dynamic Network Loading (DNL) in order to mo-del link and network performances. The queue spillback can only be captured by physical-queue approach, which is more realistic. Accordingly, the recent trend on traffic flow modeling for Dynamic Traffic Assignment (DTA) is to propose models with physical-queue assumption. However capturing the effects of physical-queuing in DNL modelling brings difficulties in obtaining an optimal solution of a DTA problem. As an alternative, the point-queue assumption handles vehicles as points without physical lengths. The storage capacity of each link can be ignored. The queue spillback on a link can be simulated by assuming the existence of a buffer area in the initial node of the link, for the temporary storage of vehicles exceeding the maximum density. Therefore, all links can contain unconstrained number of vehicles and capacity constraint on a link can be applied without numerical and computational difficulties. Moreover, the outflow rate of a link is only affected by its own flow considering that the downstream links will always have sufficient storage capacities. In the literature, point-queue assumption has been made in a varying structure of flow models adopting both exit-flow function approach, and in travel time function approach to perform DNL.In this paper, a mesoscopic dynamic node model for network loading is proposed, based on discrete packets, to model the point-queue process on a highway node with multiple merging and diverging links. The model is run using theoretical input data to simulate point-queuing in over-saturation condition. The presented dynamic node model has two components; a mesoscopic link model set with an exit link function formulation, and an algorithm written with a set of node rules considering the constraints of conservation, capacity, flow splitting rates and non-negativities. First, the time-varying flows that enter to multiple merging links (inflows) simultaneously are input to the mesoscopic link model.The link model component is developed by both considering the over-saturation phenomenon and improving the computational efficiency on a previously proposed link model. This model, is set out with link exit function formulation, discretisation on time dimension, defining capacity constraint rules for over-saturated states and uniformly accelerated speed assumption, which allows a realistic representation of outflow dynamics. Model has an iterative structure, which enables convergence to any target performance criteria with the coded algorithm. The flows that exit from these merging links (outflows) are computed regarding the link and flow characteristics. Then outflows of the merging links are input to a node as inflows. These conflicting flows are processed within the node component with predefined splitting rates and characteristics of the diverging links, and then the nodal exiting flows are computed. The main difference of the proposed dynamic node model in comparison to other models is that it respects capacity constraints regarding to splitting rules and consequently holds first-in-first-out rule. For the link model component of integrated model structure has been set out with the point-queuing assumption, the point-queues and the delays calculated in the presence of these vertical queues are considered instead of the physical queues and the delays occurring as a result of over-saturation.The node model problem is formulated as to maximize the total flow passing through the node subject to the constraints of conservation, capacity, flow splitting rates and non-negativities. The optimization problem is solved by simulation within the modelling horizon. Simulation process of the proposed model lasted as the inflows to merging links are wholly discharged from the entire node structure.The integrated model structure provided more realistic results in representing outflow dynamics. It is seen that the outflows of the link model component existed respecting to capacity constraints and the diagrams of these outflows seemed alike the sinusoidal inflow curves under the set node configuration. Despite the flows requiring to enter the diverging links are above over-saturation rates, the capacity restraint is respected. The results show that the model appears realistic in the representation of point-queuing process and diverging link flow dynamics, and is quite easy to calculate. The future extension of this study will be on the application of the proposed model to a general network.

PDF

___

Astarita, V., (1995). Flow propagation description in dynamic network loading models, Proceedings, 4th International Conference on Applications of Advanced Technologies in Transportation Engineering, 599-603, Capri, Italy.
Astarita, V., (1996). A continuous time link model for dynamic network loading based on travel time function, Proceedings, 13th International Symposium on Transportation and Traffic Theory, 87-102, Lyon, France.
Carey, M., (1987). Optimal time-varying flows on congested network, Operations Research, 35, 1, 58-69.
Carey, M., (1990). Extending and solving a multi-period congested network flow model, Computers and Operations Research, 17, 5, 495-507.
Carey, M., Ge, Y.E. ve McCartney, M., (2003). A whole-link travel time model with desirable properties, Transportation Science, 37, 1, 83-96.
Cascetta, E., (2001). Transportation systems engineering: theory and methods, Applied Optimization Series, Kluwer Academic Publishers.
Celikoglu, H.B., (2006a). A dynamic node model with a quadratic travel time function based link model, Proceedings, 11th EWGT Meeting, 658-666, Bari, Italy.
Çelikoğlu, H.B., (2006b). A dynamic node model for highway networks, Doktora tezi, İTÜ Fen Bilimleri Enstitüsü, İstanbul.
Daganzo, C.F., (1995). The cell transmission model, part II: network traffic, Transportation Research, 29B, 2, 79-93.
Dell’Orco, M., (2006). A dynamic network loading model for mesosimulation in transportation systems, European Journal of Operational Research, 175, 3, 1447-1454.
Dell'Orco, M., Gedizlioglu, E. ve Celikoglu, H.B., (2005). Introduction to a node management model for traffic networks: a mesoscopic approach, Proceedings, 10th EWGT Meeting, 435-440, Poznan, Poland.
Friesz, T.L., Bernstein, D., Mehta, N.J., Tobin, R.L. ve Ganjalizadeh, S., (1989). Dynamic network traffic assignment considered as a continuous time optimal control problem, Operations Research, 37, 6, 893-901.
Friesz, T.L., Bernstein, D.H., Smith, T.E., Tobin, R.L. ve Wie, B.W., (1993). A variational inequality formulation of the dynamic network user equilibrium problem, Operations Research, 41, 1, 179-191.
Greenshields, B.D., (1935). A study in highway capacity, Highway Research Board Proceedings, 14, 448-477.
Kuwahara, M. ve Akamatsu, T., (2001). Dynamic user optimal assignment with physical queues for a many-to-many OD pattern, Transportation Research, 35B, 5, 461-479.
Lam, W.H.K. ve Huang, H.J., (1995). Dynamic user optimal traffic assignment model for many to one travel demand, Transportation Research, 29B, 4, 243-259.
Leonard, D.R., Gower, P. ve Taylor, N.B., eds. (1989). CONTRAM: Structure of the model, TRRL Research Report 178, Crowthorne.
Lo, H. ve Szeto, W.Y., (2002). A cell-based variational inequality formulation of the dynamic user optimal assignment problem, Transportation Research, 36B, 5, 421-443.
Merchant, D.K. ve Nemhauser, G.L., (1978a). A model and an algorithm for the dynamic traffic assignment problem, Transportation Science, 12, 3, 183-199.
Merchant, D.K. ve Nemhauser, G.L., (1978b). Optimality conditions of a dynamic traffic assignment model, Transportation Science, 12, 3, 200-207.
Ran, B. ve Boyce, D., (1996). Modeling dynamic transport networks: An intelligent transportation system oriented approach, Second revised edition, Springer Verlag, Heidelberg.
Ran, B., Boyce, D.E. ve LeBlanc, L.J., (1993). A new class of instantaneous dynamic user-optimal traffic assignment models, Operations Research, 41, 1, 192-202.
Rubio-Ardanaz, J.M., Wu, J.H. ve Florian, M., (2003). Two improved numerical algorithms for the dynamic network loading problems, Transportation Research, 37B, 2, 171-190.
Spiess, H., (1990). Conical volume-delay functions, Transportation Science, 24, 2, 153-158.
Wie B.W., Tobin R.L. ve Friesz, T.L., (1994). The augmented lagrangian method for solving dynamic network traffic assignment models in discrete time, Transportation Science, 28, 3, 204-220.
Wu, J.H., Chen, Y. ve Florian, M., (1998). The continuous dynamic network loading problem: A mathematical formulation and solution method, Transportation Research, 32B, 3, 173-187.
Xu, Y., Wu, J.H., Florian, M., Marcotte, P. ve Zhu, D.L., (1999). New advances in the continuous dynamic network loading problem, Transportation Science, 33, 4, 341-353.
Yang, H. ve Huang, H.J., (1997). Analysis of the time-varying pricing of a bottleneck with elastic demand using optimal control theory, Transportation Research, 31B, 6, 425-440.
Zhu, D. ve Marcotte, P., (2000). On existence of solutions to the dynamic user equilibrium problem, Transportation Science, 34, 4, 402-414.