TY - GEN
T1 - Choice-Based Service Region Assortment Problem
T2 - 26th IEEE International Conference on Intelligent Transportation Systems, ITSC 2023
AU - Ren, Xiyuan
AU - Chow, Joseph Y.J.
N1 - Publisher Copyright:
© 2023 IEEE.
PY - 2023
Y1 - 2023
N2 - Incorporating individual user preferences in statewide transportation planning is of great importance regarding revenue management and behavioral equity. However, an enduring challenge is that consistent population travel data remains scarce, particularly in underserved and rural areas. Moreover, large-scale optimization models are computationally demanding when considering stochastic travel demands in a discrete choice model (DCM) framework. These can be addressed with a combination of synthetic population data and deterministic taste coefficients. We formulate a choice-based optimization model, in which the mode share in each block group-level trip origin-destination (OD) is determined by a set of deterministic coefficients reflecting user preferences. In that case, statewide service region design becomes an assortment optimization problem with known parameters and linear constraints, which can be efficiently solved through linear or quadratic programming (depending on variant). We test the method using a hypothetical new mobility service considered for New York State. The proposed model is applied to optimize its service region with one of the three objectives: (1) maximizing the total revenue; (2) maximizing the total change of consumer surplus; (3) minimizing the disparity between disadvantaged and non-disadvantaged communities.
AB - Incorporating individual user preferences in statewide transportation planning is of great importance regarding revenue management and behavioral equity. However, an enduring challenge is that consistent population travel data remains scarce, particularly in underserved and rural areas. Moreover, large-scale optimization models are computationally demanding when considering stochastic travel demands in a discrete choice model (DCM) framework. These can be addressed with a combination of synthetic population data and deterministic taste coefficients. We formulate a choice-based optimization model, in which the mode share in each block group-level trip origin-destination (OD) is determined by a set of deterministic coefficients reflecting user preferences. In that case, statewide service region design becomes an assortment optimization problem with known parameters and linear constraints, which can be efficiently solved through linear or quadratic programming (depending on variant). We test the method using a hypothetical new mobility service considered for New York State. The proposed model is applied to optimize its service region with one of the three objectives: (1) maximizing the total revenue; (2) maximizing the total change of consumer surplus; (3) minimizing the disparity between disadvantaged and non-disadvantaged communities.
UR - http://www.scopus.com/inward/record.url?scp=85186505527&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85186505527&partnerID=8YFLogxK
U2 - 10.1109/ITSC57777.2023.10422249
DO - 10.1109/ITSC57777.2023.10422249
M3 - Conference contribution
AN - SCOPUS:85186505527
T3 - IEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC
SP - 5490
EP - 5495
BT - 2023 IEEE 26th International Conference on Intelligent Transportation Systems, ITSC 2023
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 24 September 2023 through 28 September 2023
ER -