Stochastic User Equilibrium Assignment with Explicit Path Enumeration: Comparison of Models and Algorithms

In this paper a preliminary analysis of alternative models for “feasible” path generation and choice is presented. In particular a k-shortest path multi-criteria model for path enumeration is explored and different choice models (Logit, recently proposed C-Logit and Probit) are tested by comparing SUE assignment link flows with counts on an urban road network. Flows are also compared for more traditional DUE and SUE Probit implicit path enumeration models. The results obtained show that a limited number (4-7) of paths generated with rather “simple” criteria give satisfactory results, SUE with explicit path enumeration is largely comparable with, and in some cases superior to, traditional implicit SUE and DUE models. Explicit path enumeration allow also the specification of more sophisticated non additive attributes in the utility function of route choice models. From the computational point of view the explicit path C-Logit and Probit SUE algorithms are from three to twenty times superior to the implicit Probit SUE assignment.