A DISTRIBUTED ALGORITHM FOR THE DYNAMIC TRAFFIC EQUILIBRIUM ASSIGNMENT PROBLEM
M B Wistem, Mike Smith · 1996
In this paper the dynamic traffic assignment problem has been formulated in the space of splitting rates. The ideas in Gallager's method for steady-state message routeing in computer networks have been combined with Smith'a Algorithm (D) for computing traffic equilibria and then extended to dynamic-state. The result is a distributed algorithm that seeks to solve the dynamic traffic assignment problem by iteratively adjusting splitting rates at each junction according to the costs of reaching destinations from the exits of that junction. (A) For the covering abstract see IRRD 886400.