Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
482550 | European Journal of Operational Research | 2006 | 8 Pages |
Flow propagation models can be divided into static and dynamic network loading models. Different approaches to dynamic network loading problem formulated in the literature point out models that can be classified as disaggregate or aggregate.Applying aggregate models, it is possible to trace implicitly or explicitly vehicles movements. The second case concerns mesoscopic models. These models consider the traffic as a sequence of “packets” of vehicles. Two approaches can be followed:(a)continuous packets, where vehicles are distributed inside each packet, defined by the head and the tail points;(b)discrete packets, where all users belonging to a packet are grouped and represented by a single point, for instance the head.In this paper, a mesoscopic model based on discrete packets has been developed, taking into account the vehicles acceleration. The proposed model, assuming discrete packets and uniformly accelerated movement, appears lifelike in the representation of outflow dynamics and quite easy to calculate.