Dynamic route guidance with queue- and flow-dependent travel time

This paper presents an optimal guidance algorithm that takes into account the driver compliance to route advice and flows higher than capacities of links. The optimization problem consists in minimizing the travel time of guided vehicles using a model that describes the traffic by a set of flows on a graph. The travel time of a link is obtained by computing the delay of vehicles due to queues. It leads to Wardrop’s travel time when the initial queue is empty and the flow is smaller than the capacity of the link. The optimization problem is solved using the Simplex Algorithm recursively on two examples. Results show that for most of the demands, the guidance benefit increases with the ratio of equipped vehicles.