A Model for Continuous Dynamic Network Loading Problem with Different Overtaking Class Users.

This article presents a model for solving the continuous loading network problem when different class users interact in the traffic network so that overtaking among different class users is permitted but the FIFO rule is satisfied for the same class users. The model calculates the link travel time functions at a basic finite set of equally spaced times, which are used to interpolate a monotone spline for all other times in order to preserve monotonicity and guarantee that the FIFO rule is satisfied at all points for the same class users. The model assumes nonlinear link travel time functions of the link volumes including those ahead of the linkabeing considered, takes into account that different class functions must be asymptotically coincident for high congestions, and considers link physical queues. The path origin demands are reproduced as linear combinations of density functions and the conservation laws are used to determine the path flow wave evolution throughout the network. Different path flow waves are mixed together and a congestion equation is used to determine the link travel times. Finally, all information is combined to make it compatible in times and locations using an iterative method until convergence. The method is illustrated by some examples of illustrative and real networks. The results seem to reproduce the observed trends closely. The resulting required CPU times are reasonable so that the method seems to be applicable to real networks. [ABSTRACT FROM AUTHOR]