Technical Papers
Feb 28, 2023

Two-Phase Model for Demand-Responsive Transit Considering the Cancellation Behavior of Boundedly Rational Passengers

Publication: Journal of Transportation Engineering, Part A: Systems
Volume 149, Issue 5

Abstract

The resurgence of demand-responsive transit (DRT) has been pushed toward a more sharable and user-friendly mobility service to reshape the urban mobility ecosystem. Nevertheless, to fulfill the swiftly growing diversified and personalized demand, how to depict the cancellation behavior of passengers remains an often overlooked but extremely significant challenge. This paper attempts to discuss the cancellation behavior in the two-phase optimization process. With regard to the unconfirmed reservation cancellation, bounded rationality is incorporated to portray the decision-making process of passengers. Bernoulli random variable is utilized to discuss the stochastic possibility of order cancellation. Simultaneously, a two-phase biobjective model considering the cancellation behavior is constructed to balance the inherent trade-off between passengers and operators. In addition, the algorithm based on multidirectional local search is constructed to achieve the Pareto front for the proposed model. Small-scale experiments in the Nguyen-Dupuis network are illustrated to validate the effectiveness of the algorithm. Subsequently, the Beijing case is further exemplified to evaluate the performance of DRT service considering the cancellation behavior. A reasonable penalty mechanism contributes to ensuring operating profit while substantially diminishing the penalty cost. Therefore, this paper facilitates not only capturing the cancellation behavior of passengers but also developing a more flexible and cost-effective DRT service.

Get full access to this article

View all available purchase options and get full access to this article.

Data Availability Statement

All data, models, and code generated or used during the study appear in the published article.

Acknowledgments

This research was funded by the National Natural Science Foundation of China (No. 71971005), Beijing Municipal Natural Science Foundation (No. 8202003), and Beijing Municipal Natural Science Foundation (No. 8212002). We would like to thank Jie Xiong and Yuan Zhang for providing guidance.

References

Amirgholy, M., and E. J. Gonzales. 2016. “Demand responsive transit systems with time-dependent demand: User equilibrium, system optimum, and management strategy.” Transp. Res. Part B Methodol. 92 (Oct): 234–252. https://doi.org/10.1016/j.trb.2015.11.006.
Berrada, J., and A. Poulhès. 2021. “Economic and socioeconomic assessment of replacing conventional public transit with demand responsive transit services in low-to-medium density areas.” Transp. Res. Part A Policy Pract. 150 (Aug): 317–334. https://doi.org/10.1016/j.tra.2021.06.008.
Chen, X., Y. Wang, Y. Wang, X. Qu, and X. Ma. 2021. “Customized bus route design with pickup and delivery and time windows: Model, case study and comparative analysis.” Expert Syst. Appl. 168 (Apr): 114242. https://doi.org/10.1016/j.eswa.2020.114242.
Cordeau, J. 2006. “A branch-and-cut algorithm for the dial-a-ride problem.” Oper. Res. 54 (3): 573–586. https://doi.org/10.1287/opre.1060.0283.
Currie, G., and N. Fournier. 2020. “Why most DRT/micro-transits fail—What the survivors tell us about progress.” Res. Transp. Econ. 83 (Nov): 100895. https://doi.org/10.1016/j.retrec.2020.100895.
Deceuninck, M., D. Fiems, and S. De Vuyst. 2018. “Outpatient scheduling with unpunctual patients and no-shows.” Eur. J. Oper. Res. 265 (1): 195–207. https://doi.org/10.1016/j.ejor.2017.07.006.
de Palma, A., and N. Picard. 2005. “Route choice decision under travel time uncertainty.” Transp. Res. Part A Policy Pract. 39 (4): 295–324. https://doi.org/10.1016/j.tra.2004.10.001.
Erdmann, M., F. Dandl, and K. Bogenberger. 2021. “Combining immediate customer responses and car–passenger reassignments in on-demand mobility services.” Transp. Res. Part C Emerging Technol. 126 (May): 103104. https://doi.org/10.1016/j.trc.2021.103104.
Gendreau, M., F. Guertin, J. Potvin, and R. Séguin. 2006. “Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries.” Transp. Res. Part C Emerging Technol. 14 (3): 157–174. https://doi.org/10.1016/j.trc.2006.03.002.
Gmira, M., M. Gendreau, A. Lodi, and J. Potvin. 2021. “Managing in real-time a vehicle routing plan with time-dependent travel times on a road network.” Transp. Res. Part C Emerging Technol. 132 (Nov): 103379. https://doi.org/10.1016/j.trc.2021.103379.
Guo, R., W. Guan, and W. Zhang. 2018. “Route design problem of customized buses: Mixed integer programming model and case study.” J. Transp. Eng. Part A Syst. 144 (11): 04018069. https://doi.org/10.1061/JTEPBS.0000185.
Hadas, Y., and A. Ceder. 2008. “Multiagent approach for public transit system based on flexible routes.” Transp. Res. Rec. 2063 (1): 89–96. https://doi.org/10.3141/2063-11.
He, F., X. Wang, X. Lin, and X. Tang. 2018. “Pricing and penalty/compensation strategies of a taxi-hailing platform.” Transp. Res. Part C Emerging Technol. 86 (Jan): 263–279. https://doi.org/10.1016/j.trc.2017.11.003.
Ho, S. C., W. Y. Szeto, Y. Kuo, J. M. Y. Leung, M. Petering, and T. W. H. Tou. 2018. “A survey of dial-a-ride problems: Literature review and recent developments.” Transp. Res. Part B Methodol. 111 (May): 395–421. https://doi.org/10.1016/j.trb.2018.02.001.
Hoogendoorn, S. P., and P. H. L. Bovy. 2004. “Pedestrian route-choice and activity scheduling theory and models.” Transp. Res. Part B Methodol. 38 (2): 169–190. https://doi.org/10.1016/S0191-2615(03)00007-9.
Huang, A., Z. Dou, L. Qi, and L. Wang. 2020a. “Flexible route optimization for demand-responsive public transit service.” J. Transp. Eng. Part A Syst. 146 (12): 04020132. https://doi.org/10.1061/JTEPBS.0000448.
Huang, D., Y. Gu, S. Wang, Z. Liu, and W. Zhang. 2020b. “A two-phase optimization model for the demand-responsive customized bus network design.” Transp. Res. Part C Emerging Technol. 111 (Feb): 1–21. https://doi.org/10.1016/j.trc.2019.12.004.
Kahneman, D., and A. Tversky. 2012. “Prospect theory: An analysis of decision under risk.” In Handbook of the fundamentals of financial decision making, 99–127. Hackensack, NJ: World Scientific.
Li, Y., and Y. Liu. 2021. “Optimizing flexible one-to-two matching in ride-hailing systems with boundedly rational users.” Transp. Res. Part E Logist. Transp. Rev. 150 (Jun): 102329. https://doi.org/10.1016/j.tre.2021.102329.
Liu, J., and X. Zhou. 2016. “Capacitated transit service network design with boundedly rational agents.” Transp. Res. Part B Methodol. 93 (Part A): 225–250. https://doi.org/10.1016/j.trb.2016.07.015.
Liu, T., O. Cats, and K. Gkiotsalitis. 2021. “A review of public transport transfer coordination at the tactical planning phase.” Transp. Res. Part C Emerging Technol. 133 (Dec): 103450. https://doi.org/10.1016/j.trc.2021.103450.
Lyu, Y., C. Chow, V. C. S. Lee, J. K. Y. Ng, Y. Li, and J. Zeng. 2019. “CB-Planner: A bus line planning framework for customized bus systems.” Transp. Res. Part C Emerging Technol. 101 (Apr): 233–253. https://doi.org/10.1016/j.trc.2019.02.006.
Mahmassani, H. S., and G. Chang. 1987. “On boundedly rational user equilibrium in transportation systems.” Transp. Sci. 21 (2): 89–99. https://doi.org/10.1287/trsc.21.2.89.
Men, J., P. Jiang, S. Zheng, Y. Kong, Y. Zhao, G. Sheng, N. Su, and S. Zheng. 2020. “A multi-objective emergency rescue facilities location model for catastrophic interlocking chemical accidents in chemical parks.” IEEE Trans. Intell. Transp. Syst. 21 (11): 4749–4761. https://doi.org/10.1109/TITS.2019.2946209.
Molenbruch, Y., K. Braekers, A. Caris, and G. Vanden Berghe. 2017. “Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation.” Comput. Oper. Res. 77 (Jan): 58–71. https://doi.org/10.1016/j.cor.2016.07.020.
Mourad, A., J. Puchinger, and C. Chu. 2019. “A survey of models and algorithms for optimizing shared mobility.” Transp. Res. Part B Methodol. 123 (May): 323–346. https://doi.org/10.1016/j.trb.2019.02.003.
Ojeda Rios, B. H., E. C. Xavier, F. K. Miyazawa, P. Amorim, E. Curcio, and M. J. Santos. 2021. “Recent dynamic vehicle routing problems: A survey.” Comput. Ind. Eng. 160 (Oct): 107604. https://doi.org/10.1016/j.cie.2021.107604.
Paquay, C., Y. Crama, and T. Pironet. 2020. “Recovery management for a dial-a-ride system with real-time disruptions.” Eur. J. Oper. Res. 280 (3): 953–969. https://doi.org/10.1016/j.ejor.2019.08.006.
Ren, X., H. Huang, S. Feng, and G. Liang. 2020. “An improved variable neighborhood search for bi-objective mixed-energy fleet vehicle routing problem.” J. Cleaner Prod. 275 (Dec): 124155. https://doi.org/10.1016/j.jclepro.2020.124155.
Rigas, E. S., S. D. Ramchurn, and N. Bassiliades. 2018. “Algorithms for electric vehicle scheduling in large-scale mobility-on-demand schemes.” Artif. Intell. 262 (Sep): 248–278. https://doi.org/10.1016/j.artint.2018.06.006.
Ritzinger, U., J. Puchinger, C. Rudloff, and R. F. Hartl. 2022. “Comparison of anticipatory algorithms for a dial-a-ride problem.” Eur. J. Oper. Res. 301 (2): 591–608. https://doi.org/10.1016/j.ejor.2021.10.060.
Ropke, S., and D. Pisinger. 2006. “An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows.” Transp. Sci. 40 (4): 455–472. https://doi.org/10.1287/trsc.1050.0135.
Salemi Parizi, M., and A. Ghate. 2016. “Multi-class, multi-resource advance scheduling with no-shows, cancellations and overbooking.” Comput. Oper. Res. 67 (Mar): 90–101. https://doi.org/10.1016/j.cor.2015.09.004.
Satunin, S., and E. Babkin. 2014. “A multi-agent approach to intelligent transportation systems modeling with combinatorial auctions.” Expert Syst. Appl. 41 (15): 6622–6633. https://doi.org/10.1016/j.eswa.2014.05.015.
Schyns, M. 2015. “An ant colony system for responsive dynamic vehicle routing.” Eur. J. Oper. Res. 245 (3): 704–718. https://doi.org/10.1016/j.ejor.2015.04.009.
Simon, H. A. 1955. “A behavioral model of rational choice.” Q. J. Econ. 69 (1): 99–118. https://doi.org/10.2307/1884852.
Soeffker, N., M. W. Ulmer, and D. C. Mattfeld. 2022. “Stochastic dynamic vehicle routing in the light of prescriptive analytics: A review.” Eur. J. Oper. Res. 298 (3): 801–820. https://doi.org/10.1016/j.ejor.2021.07.014.
Solomon, M. M. 1987. “Algorithms for the vehicle routing and scheduling problems with time window constraints.” Oper. Res. 35 (2): 254–265. https://doi.org/10.1287/opre.35.2.254.
Tversky, K. A. 1979. “Prospect theory: An analysis of decision under risk.” Econometrica 47 (2): 263–291. https://doi.org/10.2307/1914185.
Uncles, M. D. 1987. “Discrete choice analysis: Theory and application to travel demand.” J. Oper. Res. Soc. 38 (4): 370–371. https://doi.org/10.1057/jors.1987.63.
Vansteenwegen, P., L. Melis, D. Aktaş, B. D. G. Montenegro, F. Sartori Vieira, and K. Sörensen. 2022. “A survey on demand-responsive public bus systems.” Transp. Res. Part C Emerging Technol. 137 (Apr): 103573. https://doi.org/10.1016/j.trc.2022.103573.
Wang, H., H. Guan, H. Qin, W. Li, and J. Zhu. 2022. “A slack departure strategy for demand responsive transit based on bounded rationality.” J. Adv. Transp. 2022 (May): 9693949. https://doi.org/10.1155/2022/9693949.
Wang, X., W. Liu, H. Yang, D. Wang, and J. Ye. 2020a. “Customer behavioural modelling of order cancellation in coupled ride-sourcing and taxi markets.” Transp. Res. Part B Methodol. 132 (Feb): 358–378. https://doi.org/10.1016/j.trb.2019.05.016.
Wang, Z., J. Yu, W. Hao, J. Tang, Q. Zeng, C. Ma, and R. Yu. 2020b. “Two-step coordinated optimization model of mixed demand responsive feeder transit.” J. Transp. Eng. Part A Syst. 146 (3): 04019082. https://doi.org/10.1061/JTEPBS.0000317.
Xu, K., M. Saberi, and W. Liu. 2022. “Dynamic pricing and penalty strategies in a coupled market with ridesourcing service and taxi considering time-dependent order cancellation behaviour.” Transp. Res. Part C Emerging Technol. 138 (May): 103621. https://doi.org/10.1016/j.trc.2022.103621.
Zheng, Y., L. Gao, W. Li, and T. Wang. 2021. “Vehicle routing and scheduling of flex-route transit under a dynamic operating environment.” Discrete Dyn. Nat. Soc. 2021 (Jan): 6669567.

Information & Authors

Information

Published In

Go to Journal of Transportation Engineering, Part A: Systems
Journal of Transportation Engineering, Part A: Systems
Volume 149Issue 5May 2023

History

Received: Sep 4, 2022
Accepted: Dec 29, 2022
Published online: Feb 28, 2023
Published in print: May 1, 2023
Discussion open until: Jul 28, 2023

Permissions

Request permissions for this article.

Authors

Affiliations

Ph.D. Candidate, Faculty of Urban Construction, Beijing Univ. of Technology, Beijing 100124, China (corresponding author). ORCID: https://orcid.org/0000-0001-8816-2677. Email: [email protected]
Hongzhi Guan [email protected]
Professor, Faculty of Urban Construction, Beijing Univ. of Technology, Beijing 100124, China. Email: [email protected]
Huanmei Qin [email protected]
Associate Professor, Faculty of Urban Construction, Beijing Univ. of Technology, Beijing 100124, China. Email: [email protected]
Ph.D. Candidate, Faculty of Urban Construction, Beijing Univ. of Technology, Beijing 100124, China. Email: [email protected]
School of Civil and Transportation Engineering, Beijing Univ. of Civil Engineering and Architecture, Beijing 102616, China. ORCID: https://orcid.org/0000-0001-7443-5857. Email: [email protected]

Metrics & Citations

Metrics

Citations

Download citation

If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.

View Options

Get Access

Access content

Please select your options to get access

Log in/Register Log in via your institution (Shibboleth)
ASCE Members: Please log in to see member pricing

Purchase

Save for later Information on ASCE Library Cards
ASCE Library Cards let you download journal articles, proceedings papers, and available book chapters across the entire ASCE Library platform. ASCE Library Cards remain active for 24 months or until all downloads are used. Note: This content will be debited as one download at time of checkout.

Terms of Use: ASCE Library Cards are for individual, personal use only. Reselling, republishing, or forwarding the materials to libraries or reading rooms is prohibited.
ASCE Library Card (5 downloads)
$105.00
Add to cart
ASCE Library Card (20 downloads)
$280.00
Add to cart
Buy Single Article
$35.00
Add to cart

Get Access

Access content

Please select your options to get access

Log in/Register Log in via your institution (Shibboleth)
ASCE Members: Please log in to see member pricing

Purchase

Save for later Information on ASCE Library Cards
ASCE Library Cards let you download journal articles, proceedings papers, and available book chapters across the entire ASCE Library platform. ASCE Library Cards remain active for 24 months or until all downloads are used. Note: This content will be debited as one download at time of checkout.

Terms of Use: ASCE Library Cards are for individual, personal use only. Reselling, republishing, or forwarding the materials to libraries or reading rooms is prohibited.
ASCE Library Card (5 downloads)
$105.00
Add to cart
ASCE Library Card (20 downloads)
$280.00
Add to cart
Buy Single Article
$35.00
Add to cart

Media

Figures

Other

Tables

Share

Share

Copy the content Link

Share with email

Email a colleague

Share