4.7 Article

Multiclass bi-criteria traffic assignment without class-specific variables: An alternative formulation and a subgradient projection algorithm

Publisher

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.tre.2023.103210

Keywords

Multiclass; Bi-criteria traffic assignment; Class-specific variables; Alternative formulation; Subgradient projection

Ask authors/readers for more resources

This paper focuses on the multiclass bi-criteria traffic assignment problem and proposes an alternative formulation without class-specific variables, which greatly reduces the burden on memory storage and computational speed. The alternative formulation utilizes the order information of paths and travelers to differentiate between high value of time and low value of time travelers. A subgradient projection algorithm is developed to solve the nondifferentiable convex objective function of the alternative formulation. The results demonstrate that the alternative formulation achieves the same link flow pattern as the conventional MBTA model with fewer variables.
In this paper, we focus on the multiclass bi-criteria (time and toll) traffic assignment (MBTA) problem. The conventional MBTA model keeps multiple copies of class-specific variables to model user heterogeneity, which puts a great burden on memory storage and computational speed when dealing with real transportation networks. This paper proposes an alternative formulation for the MBTA problem without class-specific variables by exploiting the order information of paths and travelers, i.e., high value of time (VOT) travelers will prefer fast but expensive paths, while low VOT travelers will prefer slow but cheap paths. We prove the equivalence of the alternative formulation to the conventional MBTA model. To solve the alternative formu-lation with a nondifferentiable convex objective function, a path-based subgradient projection algorithm is developed utilizing the subgradient and available second-order information. We adopt a small network and several large networks to examine the detailed features and the computational performance of the proposed formulation and algorithm, respectively. The results show that the alternative formulation provides the same link flow pattern as that of the conventional MBTA model but uses much fewer variables, which can greatly relieve the burden on computer memory and computational speed in solving real transportation networks.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available