Stochastic User Equilibrium with Full Route Set in Dynamic Traffic Assignment

In current practice, there are two main concepts to handle the route set in an equilibrium route choice model. The first one is to maintain a fixed route set throughout the iterations for each OD pair. The second one is to determine the route set during the execution (every iteration or less), depending on the current congestion levels. They both have some problems. With a fixed route set, there is a change that an important route is not considered. While having a flexible route set over the iterations may negatively affect the convergence, Recursive Logit could resolve these issues as it is an implicit route choice model that considers all routes. It calculates the turning percentages from each node to each destination separately. From these percentages, destination-based flows can easily be calculated (in a static assignment). This paper first illustrates how recursive logit converges very stably to static equilibrium. The main contribution of this paper is the finding of a method to implement a full route choice with recursive logit in a dynamic assignment. Another contribution is suggestion a few important parameters that determine the utility for a traveller. Other parameters can easily be added. Finally, the relation between these parameters and finding a solution is formulated.

ISBN:978-9-4619753-3-1

Jaar van publicatie:2017

Toegankelijkheid:Open