Decomposition of the reactive dynamic assignments with queues for a many-to-many origin-destination pattern

Kuwahara, Masao; Akamatsu, Takashi

doi:10.1016/s0191-2615(96)00020-3

Cited by 94 publications

(27 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The model has been implemented in several DTA studies (Drissi-Kaitouni and Hameda-Benchekroun, 1992;Gangi et al, 1995;Kuwahara and Akamatsu, 1997;Li et al, 2000). Its continuous version can be described as follows:…”

Section: The Point Queue Modelmentioning

confidence: 99%

“…In the above modelling framework, the two ways of specifying flow propagation speed lead to two types of link models: the delay-function model that uses (2) and the exit-flow function model that uses (3) Examples of the former include the linear delay-function model studied by many researchers: Friesz et al (1993), Astarita (1996), Wu et al (1998), Xu et al (1999, and examples of the latter include the M-N model proposed by Nemhauser (1978a, 1978b), the CTM model developed by Daganzo 1994Daganzo , 1995a, and the widely-used point queue (PQ) model (Smith, 1983;Kuwahara and Akamatsu, 1997). We have noticed that neither the M-N model nor the CTM model defines link traversal time.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Comparative Study of Some Macroscopic Link Models Used in Dynamic Traffic Assignment

Nie

Zhang

2005

Netw Spat Econ

View full text Add to dashboard Cite

As network loading forms the basis of many dynamic traffic assignment solution algorithms, we consider in this paper four macroscopic link models that are widely used in DTA studies as the building blocks of certain network loading procedures. For the same generic link, the four models are solved and evaluated numerically for various link inflow profiles under a single-destination framework. And the characteristics of each model is analyzed and compared with others from multiple perspectives such as algorithmic implementation, model calibration, model accuracy, computational time and memory consumption. It is our purpose to find the best link model for the development of realistic and efficient network loading procedures. Moreover, since model discretization and calibration substantially influence a link model's performance, both issues are carefully addressed in the paper.

show abstract

Section: The Point Queue Modelmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A Comparative Study of Some Macroscopic Link Models Used in Dynamic Traffic Assignment

Nie

Zhang

2005

Netw Spat Econ

View full text Add to dashboard Cite

show abstract

“…The first attempt of time-dependent traffic flow representation is the Point Queue (PQ) model that is inspired by fluid queue models for dam processes proposed in the 1950s, is based on the bottleneck model (Vickrey 1969), and has been applied to represent traffic dynamics on traffic links (e.g., Drissi-Kaïtouni, Hameda-Benchekroun 1992;Kuwahara, Akamatsu 1997;Han et al 2013a). A variational inequality formulation of the PQ model has been recently formulated to allow the flow to be a distribution instead of an integrable func-Downloaded by [New York University] (Han et al 2013b) and has been applied to a realworld network (Han et al 2013c).…”

Section: Introductionmentioning

confidence: 99%

Dynamic Queuing Transmission Model for Dynamic Network Loading

2015

View full text Add to dashboard Cite

This paper presents a new macroscopic multi-class dynamic network loading model called Dynamic Queuing Transmission Model (DQTM). The model utilizes 'good' properties of the Dynamic Queuing Model (DQM) and the Link Transmission Model (LTM) by offering a DQM consistent with the kinematic wave theory and allowing for the representation of multiple vehicle classes, queue spillbacks and shock waves. The model assumes that a link is split into a moving part plus a queuing part, and p that traffic dynamics are given by a triangular fundamental diagram. A case-study is investigated and the DQTM is compared with single-class LTM, single-class DQM and multi-class DQM. Under the model assumptions, single-class models indicate that the LTM and the DQTM give similar results and that the shock wave property is properly included in the DQTM, while the multi-class models show substantially different travel times for two vehicle classes. Moreover, the results show that the travel time will be underestimated without considering the shock wave property.

show abstract

“…The history of this simple yet useful model can be traced back to Vickery's benchmark study of rush hour congestion pricing (Vickrey 1963). Since then, the bottleneck model has been used to describe network flow dynamics by many researchers for different applications, such as road pricing (Newll 1987;Arnott, de Palma, and Lindsey 1990, 1992, 1993a, 1993bKuwahara 1990;Braid 1996;Yang and Huang 1997) and DTA (Smith 1993;Heydecker and Addison 1996;Kuwahara and Akamatsu 1997;Yang and Meng 1998;Huang and Lam 2002;Han, Friesz, andYao 2013a, 2013bPang et al in press). In the bottleneck model, vehicles always move along a link at the free flow speed until they arrive at the exit point, where they form a queue if the outflow rate they induce exceeds the maximum discharge rate (capacity flow) of the link.…”

Section: Introductionmentioning

confidence: 99%

Modelling network flow with and without link interactions: the cases of point queue, spatial queue and cell transmission model

Zhang

Nie

Qian

2013

Transportmetrica B: Transport Dynamics

View full text Add to dashboard Cite

This paper studies dynamic network models in which congestion takes the form of queuing behind bottlenecks. The three models in consideration, the point queue (P-Q) model, the spatial queue (S-Q) model and the cell transmission model, all deal with queues caused by temporal bottlenecks, yet differ with each other in describing the S-Q characteristics. Our work focuses on exploring the impacts of spatial distribution of queues on the result of dynamic network loading (DNL). For this purpose, simple node models (merge and diverge) are introduced to describe flow interactions across links. We present a numerical solution algorithm to the DNL problem which accommodates the three models in a general framework. Analytical solutions are derived for simple cases and agree with numerical results. Our limited experiments indicate that P-Q and S-Q may severely underestimate network travel costs under DNL, particularly when queue spillback prevails.

show abstract

Decomposition of the reactive dynamic assignments with queues for a many-to-many origin-destination pattern

Cited by 94 publications

References 4 publications

A Comparative Study of Some Macroscopic Link Models Used in Dynamic Traffic Assignment

A Comparative Study of Some Macroscopic Link Models Used in Dynamic Traffic Assignment

Dynamic Queuing Transmission Model for Dynamic Network Loading

Modelling network flow with and without link interactions: the cases of point queue, spatial queue and cell transmission model

Contact Info

Product

Resources

About