IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v152y2021ics1366554521001356.html
   My bibliography  Save this article

Zonal-based flexible bus service under elastic stochastic demand

Author

Listed:
  • Lee, Enoch
  • Cen, Xuekai
  • Lo, Hong K.

Abstract

This study investigates flexible bus that provides door-to-door service with multiple passengers sharing the vehicle, which reduces congestion on the urban network. The service area is divided into zones, and flexible buses are assigned to zonal routes based on the historical demand characteristics before demand realization. Passengers are served by either regular service or ad hoc service after the demand realization to minimize the sum of ad hoc service cost and detour time cost. The elastic and stochastic natures of demand are captured in the formulation by the volume stochasticity of demand, detour time stochasticity, and elasticity of demand with respect to the flexible bus service price and quality. The profit of the flexible bus service is maximized while accounting for the detour time cost. To effectively solve the problem, volume and detour time reliability measures are introduced to separate the problem into a vehicle-to-route assignment problem and a passenger-to-vehicle assignment problem. A gradient-based solution approach is devised to determine the flexible bus routing plans by optimizing the associated reliability measures. The solution approach is further improved by combining the gradient-based approach with a greedy search solution approach and relaxing the formulations. The formulation and solution approaches are implemented using real data in Chengdu, China, with promising results.

Suggested Citation

  • Lee, Enoch & Cen, Xuekai & Lo, Hong K., 2021. "Zonal-based flexible bus service under elastic stochastic demand," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).
  • Handle: RePEc:eee:transe:v:152:y:2021:i:c:s1366554521001356
    DOI: 10.1016/j.tre.2021.102367
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554521001356
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.tre.2021.102367?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Gérard P. Cachon & Kaitlin M. Daniels & Ruben Lobel, 2017. "The Role of Surge Pricing on a Service Platform with Self-Scheduling Capacity," Manufacturing & Service Operations Management, INFORMS, vol. 19(3), pages 368-384, July.
    2. An, Kun & Lo, Hong K., 2016. "Two-phase stochastic program for transit network design under demand uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 84(C), pages 157-181.
    3. Mohring, Herbert, 1972. "Optimization and Scale Economies in Urban Bus Transportation," American Economic Review, American Economic Association, vol. 62(4), pages 591-604, September.
    4. Jiaru Bai & Kut C. So & Christopher S. Tang & Xiqun (Michael) Chen & Hai Wang, 2019. "Coordinating Supply and Demand on an On-Demand Service Platform with Impatient Customers," Manufacturing & Service Operations Management, INFORMS, vol. 21(3), pages 556-570, July.
    5. Timo Gschwind & Stefan Irnich, 2015. "Effective Handling of Dynamic Time Windows and Its Application to Solving the Dial-a-Ride Problem," Transportation Science, INFORMS, vol. 49(2), pages 335-354, May.
    6. Kim, Myungseob (Edward) & Schonfeld, Paul, 2015. "Maximizing net benefits for conventional and flexible bus services," Transportation Research Part A: Policy and Practice, Elsevier, vol. 80(C), pages 116-133.
    7. Ho, Sin C. & Szeto, W.Y. & Kuo, Yong-Hong & Leung, Janny M.Y. & Petering, Matthew & Tou, Terence W.H., 2018. "A survey of dial-a-ride problems: Literature review and recent developments," Transportation Research Part B: Methodological, Elsevier, vol. 111(C), pages 395-421.
    8. An, Kun & Lo, Hong K., 2014. "Ferry service network design with stochastic demand under user equilibrium flows," Transportation Research Part B: Methodological, Elsevier, vol. 66(C), pages 70-89.
    9. Lo, Hong K. & An, Kun & Lin, Wei-hua, 2013. "Ferry service network design under demand uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 59(C), pages 48-70.
    10. Zhiling Han & Yanyan Chen & Hui Li & Kuanshuang Zhang & Jiyang Sun, 2019. "Customized Bus Network Design Based on Individual Reservation Demands," Sustainability, MDPI, vol. 11(19), pages 1-25, October.
    11. Jean-François Cordeau, 2006. "A Branch-and-Cut Algorithm for the Dial-a-Ride Problem," Operations Research, INFORMS, vol. 54(3), pages 573-586, June.
    12. Djavadian, Shadi & Chow, Joseph Y.J., 2017. "An agent-based day-to-day adjustment process for modeling ‘Mobility as a Service’ with a two-sided flexible transport market," Transportation Research Part B: Methodological, Elsevier, vol. 104(C), pages 36-57.
    13. Sayarshad, Hamid R. & Chow, Joseph Y.J., 2015. "A scalable non-myopic dynamic dial-a-ride and pricing problem," Transportation Research Part B: Methodological, Elsevier, vol. 81(P2), pages 539-554.
    14. Lars Hellemo & Paul I. Barton & Asgeir Tomasgard, 2018. "Decision-dependent probabilities in stochastic programs with recourse," Computational Management Science, Springer, vol. 15(3), pages 369-395, October.
    15. Enrique Fernández L., J. & de Cea Ch., Joaquin & Malbran, R. Henry, 2008. "Demand responsive urban public transport system design: Methodology and application," Transportation Research Part A: Policy and Practice, Elsevier, vol. 42(7), pages 951-972, August.
    16. Wang, Hai & Yang, Hai, 2019. "Ridesourcing systems: A framework and review," Transportation Research Part B: Methodological, Elsevier, vol. 129(C), pages 122-155.
    17. Nourinejad, Mehdi & Ramezani, Mohsen, 2020. "Ride-Sourcing modeling and pricing in non-equilibrium two-sided markets," Transportation Research Part B: Methodological, Elsevier, vol. 132(C), pages 340-357.
    18. Lauri Häme & Harri Hakula, 2015. "A Maximum Cluster Algorithm for Checking the Feasibility of Dial-A-Ride Instances," Transportation Science, INFORMS, vol. 49(2), pages 295-310, May.
    19. Sophie N. Parragh & Jorge Pinho de Sousa & Bernardo Almada-Lobo, 2015. "The Dial-a-Ride Problem with Split Requests and Profits," Transportation Science, INFORMS, vol. 49(2), pages 311-334, May.
    20. Liu, Tao & Ceder, Avishai (Avi), 2015. "Analysis of a new public-transport-service concept: Customized bus in China," Transport Policy, Elsevier, vol. 39(C), pages 63-76.
    21. Braekers, Kris & Caris, An & Janssens, Gerrit K., 2014. "Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 166-186.
    22. Kibaek Kim & Sanjay Mehrotra, 2015. "A Two-Stage Stochastic Integer Programming Approach to Integrated Staffing and Scheduling with Application to Nurse Management," Operations Research, INFORMS, vol. 63(6), pages 1431-1451, December.
    23. Masmoudi, Mohamed Amine & Hosny, Manar & Demir, Emrah & Genikomsakis, Konstantinos N. & Cheikhrouhou, Naoufel, 2018. "The dial-a-ride problem with electric vehicles and battery swapping stations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 118(C), pages 392-420.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Gong, Manlin & Hu, Yucong & Chen, Zhiwei & Li, Xiaopeng, 2021. "Transfer-based customized modular bus system design with passenger-route assignment optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 153(C).
    2. Fielbaum, Andrés & Tirachini, Alejandro & Alonso-Mora, Javier, 2023. "Economies and diseconomies of scale in on-demand ridepooling systems," Economics of Transportation, Elsevier, vol. 34(C).
    3. Li, Mingyang & Tang, Jinjun, 2023. "Simulation-based optimization considering energy consumption for assisted station locations to enhance flex-route transit," Energy, Elsevier, vol. 277(C).
    4. Zheng, Hankun & Sun, Huijun & Kang, Liujiang & Dai, Peiling & Wu, Jianjun, 2023. "Multi-route coordination for bus systems in response to road disruptions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 179(C).
    5. Zhang, Si & Sun, Huijun & Liu, Yang & Lv, Ying & Wu, Jianjun & Feng, Xiaoyan, 2024. "Carsharing equitable relocation problem: A two-stage stochastic programming approach with learning-embedded endogenous uncertainty in demand," Transportation Research Part B: Methodological, Elsevier, vol. 179(C).
    6. Si, Jinhua & He, Fang & Lin, Xi & Tang, Xindi, 2024. "Vehicle dispatching and routing of on-demand intercity ride-pooling services: A multi-agent hierarchical reinforcement learning approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 186(C).
    7. Li, Yifu & Zhou, Chenhao & Yuan, Peixue & Ngo, Thi Tu Anh, 2023. "Experience-based territory planning and driver assignment with predicted demand and driver present condition," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 171(C).
    8. Tang, Xindi & Yang, Jie & Lin, Xi & He, Fang & Si, Jinhua, 2023. "Dynamic operations of an integrated mobility service system of fixed-route transits and flexible electric buses," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 173(C).
    9. Ma, Jiaxin & Chen, Xumei & Xing, Ziwen & Zhang, Yixin & Yu, Lei, 2023. "Improving the performance of airport shuttle through demand-responsive service with dynamic fare strategy considering mixed demand," Journal of Air Transport Management, Elsevier, vol. 112(C).
    10. Lee, Enoch & Cen, Xuekai & Lo, Hong K., 2022. "Scheduling zonal-based flexible bus service under dynamic stochastic demand and Time-dependent travel time," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 168(C).
    11. Xuekai Cen & Kanghui Ren & Yiying Cai & Qun Chen, 2023. "Designing Flexible-Bus System with Ad-Hoc Service Using Travel-Demand Clustering," Mathematics, MDPI, vol. 11(4), pages 1-27, February.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Guo, Jiaqi & Long, Jiancheng & Xu, Xiaoming & Yu, Miao & Yuan, Kai, 2022. "The vehicle routing problem of intercity ride-sharing between two cities," Transportation Research Part B: Methodological, Elsevier, vol. 158(C), pages 113-139.
    2. Ho, Sin C. & Szeto, W.Y. & Kuo, Yong-Hong & Leung, Janny M.Y. & Petering, Matthew & Tou, Terence W.H., 2018. "A survey of dial-a-ride problems: Literature review and recent developments," Transportation Research Part B: Methodological, Elsevier, vol. 111(C), pages 395-421.
    3. Lee, Enoch & Cen, Xuekai & Lo, Hong K., 2022. "Scheduling zonal-based flexible bus service under dynamic stochastic demand and Time-dependent travel time," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 168(C).
    4. Schulz, Arne & Pfeiffer, Christian, 2024. "Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems," European Journal of Operational Research, Elsevier, vol. 312(2), pages 456-472.
    5. Rahman, Md Hishamur & Chen, Shijie & Sun, Yanshuo & Siddiqui, Muhammad Imran Younus & Mohebbi, Matthew & Marković, Nikola, 2023. "Integrating dial-a-ride with transportation network companies for cost efficiency: A Maryland case study," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 175(C).
    6. Timo Gschwind & Michael Drexl, 2016. "Adaptive Large Neighborhood Search with a Constant-Time Feasibility Test for the Dial-a-Ride Problem," Working Papers 1624, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    7. Aslaksen, Ingvild Eide & Svanberg, Elisabeth & Fagerholt, Kjetil & Johnsen, Lennart C. & Meisel, Frank, 2021. "A combined dial-a-ride and fixed schedule ferry service for coastal cities," Transportation Research Part A: Policy and Practice, Elsevier, vol. 153(C), pages 306-325.
    8. Schulz, Arne & Pfeiffer, Christian, 2024. "A Branch-and-Cut algorithm for the dial-a-ride problem with incompatible customer types," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 181(C).
    9. Sharif Azadeh, Sh. & Atasoy, Bilge & Ben-Akiva, Moshe E. & Bierlaire, M. & Maknoon, M.Y., 2022. "Choice-driven dial-a-ride problem for demand responsive mobility service," Transportation Research Part B: Methodological, Elsevier, vol. 161(C), pages 128-149.
    10. Lei, Zengxiang & Ukkusuri, Satish V., 2023. "Scalable reinforcement learning approaches for dynamic pricing in ride-hailing systems," Transportation Research Part B: Methodological, Elsevier, vol. 178(C).
    11. Meijian Yang & Enjun Xia, 2021. "A Systematic Literature Review on Pricing Strategies in the Sharing Economy," Sustainability, MDPI, vol. 13(17), pages 1-28, August.
    12. Zhang, Li & Liu, Zhongshan & Yu, Lan & Fang, Ke & Yao, Baozhen & Yu, Bin, 2022. "Routing optimization of shared autonomous electric vehicles under uncertain travel time and uncertain service time," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 157(C).
    13. Johnsen, Lennart C. & Meisel, Frank, 2022. "Interrelated trips in the rural dial-a-ride problem with autonomous vehicles," European Journal of Operational Research, Elsevier, vol. 303(1), pages 201-219.
    14. Chen, Junlin & Xiong, Jinghong & Chen, Guobao & Liu, Xin & Yan, Peng & Jiang, Hai, 2024. "Optimal instant discounts of multiple ride options at a ride-hailing aggregator," European Journal of Operational Research, Elsevier, vol. 314(2), pages 718-734.
    15. Christian Pfeiffer & Arne Schulz, 2022. "An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(1), pages 87-119, March.
    16. Si, Jinhua & He, Fang & Lin, Xi & Tang, Xindi, 2024. "Vehicle dispatching and routing of on-demand intercity ride-pooling services: A multi-agent hierarchical reinforcement learning approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 186(C).
    17. Dong, Tingting & Xu, Zhengtian & Luo, Qi & Yin, Yafeng & Wang, Jian & Ye, Jieping, 2021. "Optimal contract design for ride-sourcing services under dual sourcing," Transportation Research Part B: Methodological, Elsevier, vol. 146(C), pages 289-313.
    18. Su, Yue & Dupin, Nicolas & Puchinger, Jakob, 2023. "A deterministic annealing local search for the electric autonomous dial-a-ride problem," European Journal of Operational Research, Elsevier, vol. 309(3), pages 1091-1111.
    19. Ke, Jintao & Yang, Hai & Li, Xinwei & Wang, Hai & Ye, Jieping, 2020. "Pricing and equilibrium in on-demand ride-pooling markets," Transportation Research Part B: Methodological, Elsevier, vol. 139(C), pages 411-431.
    20. Yunlin Guan & Yun Wang & Xuedong Yan & Haonan Guo & Yi Zhao, 2022. "The One E-Ticket Customized Bus Service Mode for Passengers with Multiple Trips and the Routing Problem," Sustainability, MDPI, vol. 14(4), pages 1-17, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:transe:v:152:y:2021:i:c:s1366554521001356. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.