A reactive dynamic user equilibrium model in network with queues

A discrete time reactive dynamic user equilibrium (DUE) model for network with queues is presented. Based on the point queue model, each link is assumed to have a constant running time and queuing delay caused by link exit capacity. The link performance function and link exit function are given as functions of the arrival rate and the queue length, where the first-in-first-out rule is shown to be satisfied. The DUE problem is then formulated as a variational inequality (VI) problem over a polyhedral set by constructing a new network so that the path enumeration is avoided. Therefore the proposed model is applicable for large-scale networks. The existence of solution for VI problem is proved, and an iteration method is discussed in detail. A static capacity constrained model is employed to initialize the network and avoid the zero-flow network at initial time. Finally, the advantages of the new model and method proposed are tested by numerical examples.