Local detouredness: A new phenomenon for modelling route choice and traffic assignment

• Theoretical and empirical motivation for considering local detours in route choice. • Consistent route choice and route generation model bounding local & global detours. • Stochastic User Equilibrium conditions and proof of solution existence. • Branch-and-bound-based algorithm efficiently generating & equilibrating route sets. • Experiments on large-scale network testing solution method and model specifications. This study introduces the novel concept of local detouredness, i.e. detours on subsections of a route, as a new phenomenon for understanding and modelling route choice. Traditionally, Stochastic User Equilibrium (SUE) traffic assignment models have been concerned with judging the attractiveness of a route by its total route cost. However, through empirical analysis we show that considering solely the global properties of a route is insufficient. We find that it is important to consider local detouredness both when determining realistic and tractable route choice sets and when determining route choice probabilities. For example, analysis of observed route choice data shows that route usage tends to decay with local detouredness, and that there is an apparent limit on the amount of local detouredness seen as acceptable. No existing models can account for this systematically and consistently, which is the motivation for the new route choice model proposed in this paper: the Bounded Choice Model with Local Detour Threshold (BCM-LDT). The BCM-LDT model incorporates the effect of local detouredness on route choice probability, and has an in-built mechanism that assigns zero probabilities to routes violating a bound on total route costs and/or a threshold on local detouredness. Thereby, the model consistently predicts which routes are used and unused. Moreover, the probability expression is closed-form and continuous. SUE conditions for the BCM-LDT are given, and solution existence is proven. Exploiting the special structure of the problem, a novel solution algorithm is proposed where flow averaging is integrated with a modified branch-and-bound method that iteratively column-generates all routes satisfying local and global bounds. Numerical experiments are conducted on small-scale and large-scale networks, establishing that equilibrated solutions can be found and demonstrating the influence of the BCM-LDT parameters on choice set size and flow allocation.