Is order-2 proportionality good enough for approximating the most likely path flow in user equilibrium traffic assignment?

Abstract

The proportionality condition is a standard approach to dealing with the non-uniqueness issue in the user equilibrium (UE) traffic assignment problems (TAP). Although the proportionality condition can reduce the degree of arbitrariness, it remains unclear how much arbitrariness remains and whether it can meaningfully affect model outcomes and relevant decisions that depend on them. The answers to these questions are impeded by the lack of an efficient algorithm that can find the exact maximum entropy UE path flow solution for networks of practical size. In this paper, we fill this gap by developing a high-performance augmented Lagrangian algorithm that effectively exploits the special problem structure. Our numerical results reveal that there are a considerable number of links with non-negligible arbitrariness in the solution generated by the proportionality condition, and that this problem becomes worse if the level of congestion increases in the network. Since about a decade ago, many practitioners have relied on state-of-the-art traffic assignment tools based on the proportionality condition to perform select link analysis, among other applications. The results reported herein are a reminder that their toolbox may need reevaluation and perhaps an upgrade.