Mesoscopic simulation of a dynamic link loading process

Passing from path flows to link flows requires non-linear and complex flow propagation models known as network loading models. In specific technical literature, different approaches have been used to study Dynamic Network Loading models, depending on whether the link performances are expressed in an aggregate or disaggregate way, and how vehicles are traced. When vehicle movements are traced implicitly and link performances are expressed in an aggregate way, the approach is macroscopic. When vehicle movements are traced explicitly, two cases are possible, depending on whether link performances are expressed in a disaggregate or aggregate way. In the first case, the approach is microscopic, otherwise it is mesoscopic. In this paper, a mesoscopic Dynamic Network Loading model is considered, based on discrete packets and taking into account the vehicle acceleration and deceleration. A simulation was carried out, first using theoretical input data to simulate over-saturation condition, and then real data to validate the model. The results show that the model appears realistic in the representation of outflow dynamics and is quite easy to calculate. It is worth noting that network loading models are usually used downstream of the assignment models from which they take path flows to calculate link flows. In the above mentioned simulation, we assumed that a generic assignment model provides sinusoidal path flow.