Effects of Users' Bounded Rationality on a Traffic Network Performance: A Simulation Study

In this paper, we revisit the principle of bounded rationality applied to dynamic traffic assignment to evaluate its influences on network performance. We investigate the influence of different types of bounded rational user behavior on (i) route flows at equilibrium and (ii) network performance in terms of its internal, inflow, and outflow capacities. We consider the implementation of a bounded rational framework based on Monte Carlo simulation. A Lighthill-Whitham-Richards (LWR) mesoscopic traffic simulator is considered to calculate time-dependent route costs that account for congestion, spillback, and shock-wave effects. Network equilibrium is calculated using the Method of Successive Averages. As a benchmark, the results are compared against both Deterministic and Stochastic User Equilibrium. To model different types of bounded rational user behavior we consider two definitions of user search order (indifferent and strict preferences) and two settings of the indifference band. We also test the framework on a toy Braess network to gain insight into changes in the route flows at equilibrium for both search orders and increasing values of aspiration levels.