Centralized and decentralized computation of routing startegies in congested traffic networks

Abstract

The computational problems associated with routing of traffic in congested networks is analyzed. An optimal and a suboptimal, but partially decentralized approach is presented. In the decentralized case infrequent updates of relative costs are allowed to give aggregate information about congestion downstream, and optimal controls are re-calculated with the horizon pushed-back at each update time.