Robust traffic assignment model: Formulation, solution algorithms and empirical application. Issue 6 (2nd November 2017)

• Record Type: Journal Article
• Authors: Seshadri, Ravi; Srinivasan, Karthik K.
• Is Part Of: Journal of intelligent transportation systems. Volume 21:Issue 6(2017)
• Page Start: 507
• Page End: 524
• Publication Date: 2017-11-02
• Subjects: robust traffic assignment -- travel time reliability -- value of reliability; Intelligent transportation systems -- Periodicals; Transportation -- Technological innovations -- Periodicals; 388.312
• DOI: 10.1080/15472450.2017.1358624
• Languages: English
• ISSNs: 1547-2450

Abstract

ABSTRACT: The deterministic traffic assignment problem based on Wardrop's first criterion of traffic network utilization has been widely studied in the literature. However, the assumption of deterministic travel times in these models is restrictive, given the large degree of uncertainty prevalent in urban transportation networks. In this context, this paper proposes a robust traffic assignment model that generalizes Wardrop's principle of traffic network equilibrium to networks with stochastic and correlated link travel times and incorporates the aversion of commuters to unreliable routes. The user response to travel time uncertainty is modeled using the robust cost (RC) measure (defined as a weighted combination of the mean and standard deviation of path travel time) and the corresponding robust user equilibrium (UE) conditions are defined. The robust traffic assignment problem (RTAP) is subsequently formulated as a Variational Inequality problem. To solve the RTAP, a Gradient Projection algorithm is proposed, which involves solving a series of minimum RC path sub-problems that are theoretically and practically harder than deterministic shortest path problems. In addition, an origin-based heuristic is proposed to enhance computational performance on large networks. Numerical experiments examine the computational performance and convergence characteristics of the exact algorithm and establish the accuracy and efficiency of the origin-based heuristic on various real-world networks. Finally, the proposed RTA model is applied to the Chennai road network using empirical data, and its benefits as a normative benchmark are quantified through comparisons against the standard UE and System Optimum (SO) models.