Prediction-failure-risk-aware online dial-a-ride scheduling considering spatial demand correlation via approximate dynamic programming and scenario approach

被引:1
|
作者
Wu, Weitiao [1 ]
Zou, Honghui [1 ]
Liu, Ronghui [2 ]
机构
[1] South China Univ Technol, Sch Civil Engn & Transportat, Guangzhou 510641, Peoples R China
[2] Univ Leeds, Inst Transport Studies, Leeds LS2 9JT, England
基金
美国国家科学基金会;
关键词
Dial-a-ride service; OD demand prediction; Spatial demand correlation; Approximate dynamic programming; Risk-aware decision-making; VEHICLE-ROUTING PROBLEM; TRANSPORT SERVICES; ALGORITHM; EQUILIBRIUM; INTEGRATION; SEARCH; PICKUP;
D O I
10.1016/j.trc.2024.104801
中图分类号
U [交通运输];
学科分类号
08 ; 0823 ;
摘要
The dial-a-ride (DAR) service is a precursor to emerging shared mobility. Service providers expect efficient management of fleet resources to improve service quality without degrading economic viability. Most existing studies overlook possible future demands that could yield better matching opportunities and scheduling benefits, and therefore have short-sighted limitations. Moreover, the effects of correlated demand and potential prediction errors were ignored. To address these gaps, this paper investigates prediction-failure-risk-aware online DAR scheduling with spatial demand correlation. Request selection and cancellation are explicitly considered. We formulate the problem as a Markov decision process (MDP) and solve it by approximate dynamic programming (ADP). We further develop a demand prediction model that can capture the characteristics of DAR travel demand (uncertainty, sparsity, and spatial correlation). Deep quantile regression is adopted to estimate the marginal distribution of each OD pair. These marginals are combined into a joint demand distribution by constructing a Gaussian Copula to capture the spatial demand correlation. A prediction error correction mechanism is proposed to eliminate prediction errors and rectify policies promptly. Based on the model properties, several families of customized pruning strategies are devised to improve the computational efficiency and solution quality of ADP. We solve policies over time in the dynamic environment mixed with actual and stochastic future demands via the ADP algorithm and scenario approach. We propose the value function rolling method and multi-scenario exploration method, to address the deviation of the value function and identify the optimal policy from multiple future demand scenarios. Numerical results demonstrate the importance and benefits of incorporating demand forecasting and spatial correlation into the DAR operation. The improvement due to prediction is significant even when the prediction is imperfect, while the demand prediction can hedge against the negative effects of request cancellation. The real-world application result shows that compared to state-of-thepractice, the overall delivery efficiency can be substantially improved, along with better service quality and fleet size savings.
引用
收藏
页数:34
相关论文
empty
未找到相关数据