Dynamic user optimal route choice problem on a signalized transportation network

Abstract

In this paper, we present a new route-based discrete time variational inequality (VI) ideal dynamic user optimal route choice (DUO) model on a transportation network with fixed signal timing at signalized intersections and a relaxation with gradient projection algorithm to solve the model. The new trait of our study is the queue length in red time and the throughput in green time for each cycle at each intersection can be found when traffic is in DUO status. This is different from other studies, in which either only average queue length or average delay in a period composing of multiple cycles can be found or traffic is not in DUO status. Furthermore, the optimal signal timings can be found by the algorithm. Under optimal signal timing, the total queuing delay of the network reaches minimum when traffic is in DUO status.

Keywords

• Transportation engineering
• Dynamic user optimal route choice
• Signalized transportation network
• Signal timing
• Gradient projection algorithm