Abstract
A solution algorithm of Nash equilibrium in dy namic traffic assignment is proposed. Although many methodologies have been proposed for finding dynamic user equilibrium solutions, no algorithm that can solve equilibrium solutions in general conditions have been known. This study defines user equilibrium as Nash equilibrium and proposes a methodology so lving an equilibrium solution by assigning each vehicle one-by-one onto its shortest route. It is guara nteed that the algorithm derives a solution in certain cases such as single origin or single destinations. Th e algorithm can also applicab le to cases where queue spillbacks should be incorporated.
