TY - JOUR
T1 - Formulation and solution method of bounded path size stochastic user equilibrium models
T2 - consistently addressing route overlap and unrealistic routes
AU - Duncan, Lawrence Christopher
AU - Watling, David Paul
AU - Connors, Richard Dominic
AU - Rasmussen, Thomas Kjær
AU - Nielsen, Otto Anker
N1 - Publisher Copyright:
© 2023 Hong Kong Society for Transportation Studies Limited.
PY - 2024
Y1 - 2024
N2 - Bounded Path Size (BPS) route choice models (Duncan et al, 2021) offer a theoretically consistent and practical approach to dealing with both route overlap and unrealistic routes. It captures correlations between overlapping routes by including correction terms within the probability relations, and has a consistent criterion for assigning zero probabilities to unrealistic routes while eliminating their path size contributions. The present paper establishes Stochastic User Equilibrium (SUE) conditions for BPS models, where the choice sets of realistic routes are equilibrated along with the route flows. Solution existence/uniqueness are addressed. A generic solution algorithm is proposed, where realistic route choice sets are equilibrated from a pre-generated approximated universal set of routes. Numerical experiments on the Sioux Falls and Winnipeg networks show that BPS SUE models can be solved in feasible computation times compared to nonbounded versions, while providing potential for significantly improved robustness to the adopted master route choice set.
AB - Bounded Path Size (BPS) route choice models (Duncan et al, 2021) offer a theoretically consistent and practical approach to dealing with both route overlap and unrealistic routes. It captures correlations between overlapping routes by including correction terms within the probability relations, and has a consistent criterion for assigning zero probabilities to unrealistic routes while eliminating their path size contributions. The present paper establishes Stochastic User Equilibrium (SUE) conditions for BPS models, where the choice sets of realistic routes are equilibrated along with the route flows. Solution existence/uniqueness are addressed. A generic solution algorithm is proposed, where realistic route choice sets are equilibrated from a pre-generated approximated universal set of routes. Numerical experiments on the Sioux Falls and Winnipeg networks show that BPS SUE models can be solved in feasible computation times compared to nonbounded versions, while providing potential for significantly improved robustness to the adopted master route choice set.
KW - Bounded path size
KW - Convergence
KW - Equilibrated choice sets
KW - Fixed-point
KW - Solution algorithm
KW - Stochastic user equilibrium
U2 - 10.1080/23249935.2023.2178240
DO - 10.1080/23249935.2023.2178240
M3 - Journal article
AN - SCOPUS:85148456578
SN - 2324-9935
VL - 20
JO - Transportmetrica A: Transport Science
JF - Transportmetrica A: Transport Science
IS - 2
M1 - 2178240
ER -