Journal
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL
Volume 173, Issue -, Pages 31-58Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.trb.2023.04.007
Keywords
Time surplus; Bi-objective user equilibrium; Infinite user class; Non-additive
Ask authors/readers for more resources
This paper presents a continuous time surplus maximization bi-objective user equilibrium (C-TSmaxBUE) model, in which the users' variability toward the time and toll trade-off in a tolled road network is explicitly considered. The model assigns different users with different ratios of the time saved per unit of money (RTSMs), and infinite indifference curves are generated by considering continuously distributed RTSMs in the population. A path-based single-boundary adjustment (SBA) algorithm is developed to solve the problem, which adjusts RTSM boundaries and path flows simultaneously. Numerical results demonstrate the equilibrium flow pattern and the efficiency of the SBA algorithm in obtaining high-quality equilibrium solutions.
This paper presents a continuous time surplus maximization bi-objective user equilibrium (C-TSmaxBUE) model, in which the users' variability toward the time and toll trade-off in a tolled road network is explicitly considered. Different users are assigned with different ratios of the time saved per unit of money (RTSMs), the values of which represent the different expectations to trade more money for less travel time. Infinite indifference curves are then generated by considering continuously distributed RTSMs in the population. Accordingly, we extend the definition of the path-based time surplus for the C-TSmaxBUE model, which can be formulated as a Beckmann-type mathematical program operating in the space of RTSM boundaries. To solve the problem, we develop a path-based single-boundary adjustment (SBA) algorithm that fits the non-additive structure of the model. The algorithm involves a Newton-type flow equilibration procedure that simultaneously adjusts RTSM boundaries and path flows, as well as a column generation scheme that firstly enumerates all efficient paths and then identifies the paths that have the potential to reduce generalized travel times. Numerical results on a small network show the feature of the equilibrium flow pattern, whereas instances of practical size confirm that SBA is an efficient tool to obtain high-quality equilibrium solutions. Compared to the original TSmaxBUE problem, we found that a larger set of efficient paths will be used when the users' heterogeneity is considered.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available