In current practice, there are two main concepts to handle the route set in an equilibriumroute choice model. The first one is to maintain a fixed route set throughoutthe iterations for each OD pair. The second one is to determine the route setduring the execution (every iteration or less), depending on the current congestionlevels. They both have some problems. With a fixed route set, there is a changethat an important route is not considered. While having a flexible route set overthe iterations may negatively affect the convergence, Recursive Logit could resolvethese 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 convergesvery stably to static equilibrium. The main contribution of this paper is the findingof a method to implement a full route choice with recursive logit in a dynamicassignment. Another contribution is suggestion a few important parameters thatdetermine the utility for a traveller. Other parameters can easily be added. Finally,the relation between these parameters and finding a solution is formulated.
展开▼
