IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v12y2020i14p5594-d383339.html
   My bibliography  Save this article

Design of Flexible Vehicle Scheduling Systems for Sustainable Paratransit Services

Author

Listed:
  • Daniel Y. Mo

    (Department of Supply Chain and Information Management, The Hang Seng University of Hong Kong, Shatin, Hong Kong, China)

  • H. Y. Lam

    (Department of Supply Chain and Information Management, The Hang Seng University of Hong Kong, Shatin, Hong Kong, China)

  • Weikun Xu

    (Department of Supply Chain and Information Management, The Hang Seng University of Hong Kong, Shatin, Hong Kong, China)

  • G. T. S. Ho

    (Department of Supply Chain and Information Management, The Hang Seng University of Hong Kong, Shatin, Hong Kong, China)

Abstract

The aging population has led to an increase in the variety and volume of transportation demands by people facing travel difficulties. Hence, transportation organisations need to provide flexible and sustainable paratransit services to meet these increasing demands. In this study, we investigate the design of flexible vehicle scheduling systems in order for a community organisation to serve more people and achieve higher operational efficiency. We analyse and propose a system design based on user requirements for different types of paratransit types. Further, we identify an integrated service option and process flow for dial-a-ride passengers to ride on a vehicle with schedule route passengers. Because this option involves a complex decision, we formulate the problem as a two-stage decision model. To verify the effectiveness of our proposed design, we perform numerical simulations and conduct a case study by collaborating with a transportation organisation. We found that the proposed system would enable the organisation to serve more people with fewer vehicles but without an increase in the travelling time. These results demonstrate the importance of a flexible vehicle scheduling system for accessible transportation organisations to sustain their service operations.

Suggested Citation

  • Daniel Y. Mo & H. Y. Lam & Weikun Xu & G. T. S. Ho, 2020. "Design of Flexible Vehicle Scheduling Systems for Sustainable Paratransit Services," Sustainability, MDPI, vol. 12(14), pages 1-18, July.
  • Handle: RePEc:gam:jsusta:v:12:y:2020:i:14:p:5594-:d:383339
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/12/14/5594/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2071-1050/12/14/5594/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Mohammad Torkjazi & Nathan Huynh, 2019. "Effectiveness of Dynamic Insertion Scheduling Strategy for Demand-Responsive Paratransit Vehicles Using Agent-Based Simulation," Sustainability, MDPI, vol. 11(19), pages 1-12, September.
    2. Marcus Posada & Henrik Andersson & Carl H. Häll, 2017. "The integrated dial-a-ride problem with timetabled fixed route service," Public Transport, Springer, vol. 9(1), pages 217-241, July.
    3. Attila A. Kovacs & Bruce L. Golden & Richard F. Hartl & Sophie N. Parragh, 2015. "The Generalized Consistent Vehicle Routing Problem," Transportation Science, INFORMS, vol. 49(4), pages 796-816, November.
    4. Chris Groër & Bruce Golden & Edward Wasil, 2009. "The Consistent Vehicle Routing Problem," Manufacturing & Service Operations Management, INFORMS, vol. 11(4), pages 630-643, February.
    5. Yves Molenbruch & Kris Braekers & An Caris, 2017. "Typology and literature review for dial-a-ride problems," Annals of Operations Research, Springer, vol. 259(1), pages 295-325, December.
    6. Fu, Liping, 2002. "Scheduling dial-a-ride paratransit under time-varying, stochastic congestion," Transportation Research Part B: Methodological, Elsevier, vol. 36(6), pages 485-506, July.
    7. Campelo, Pedro & Neves-Moreira, Fábio & Amorim, Pedro & Almada-Lobo, Bernardo, 2019. "Consistent vehicle routing problem with service level agreements: A case study in the pharmaceutical distribution sector," European Journal of Operational Research, Elsevier, vol. 273(1), pages 131-145.
    8. Kunlei Lian & Ashlea Bennett Milburn & Ronald L. Rardin, 2016. "An improved multi-directional local search algorithm for the multi-objective consistent vehicle routing problem," IISE Transactions, Taylor & Francis Journals, vol. 48(10), pages 975-992, October.
    9. Qian, Xinwu & Zhang, Wenbo & Ukkusuri, Satish V. & Yang, Chao, 2017. "Optimal assignment and incentive design in the taxi group ride problem," Transportation Research Part B: Methodological, Elsevier, vol. 103(C), pages 208-226.
    10. Friman, Margareta & Gärling, Tommy & Ettema, Dick & Olsson, Lars E., 2017. "How does travel affect emotional well-being and life satisfaction?," Transportation Research Part A: Policy and Practice, Elsevier, vol. 106(C), pages 170-180.
    11. Plano, Christopher & Behrens, Roger & Zuidgeest, Mark, 2020. "Towards evening paratransit services to complement scheduled public transport in Cape Town: A driver attitudinal survey of alternative policy interventions," Transportation Research Part A: Policy and Practice, Elsevier, vol. 132(C), pages 273-289.
    12. Dominik Goeke & Roberto Roberti & Michael Schneider, 2019. "Exact and Heuristic Solution of the Consistent Vehicle-Routing Problem," Transportation Science, INFORMS, vol. 53(4), pages 1023-1042, July.
    13. Behrens, Roger & McCormick, Dorothy & Orero, Risper & Ommeh, Marilyn, 2017. "Improving paratransit service: Lessons from inter-city matatu cooperatives in Kenya," Transport Policy, Elsevier, vol. 53(C), pages 79-88.
    14. Hosni, Hadi & Naoum-Sawaya, Joe & Artail, Hassan, 2014. "The shared-taxi problem: Formulation and solution methods," Transportation Research Part B: Methodological, Elsevier, vol. 70(C), pages 303-318.
    15. Carlo Luiu & Miles Tight & Michael Burrow, 2017. "The unmet travel needs of the older population: a review of the literature," Transport Reviews, Taylor & Francis Journals, vol. 37(4), pages 488-506, July.
    16. G. Dikas & I. Minis, 2018. "Scheduled Paratransit Transport Enhanced by Accessible Taxis," Transportation Science, INFORMS, vol. 52(5), pages 1122-1140, October.
    17. 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.
    18. Phun, Veng Kheang & Kato, Hironori & Chalermpong, Saksith, 2019. "Paratransit as a connective mode for mass transit systems in Asian developing cities: Case of Bangkok in the era of ride-hailing services," Transport Policy, Elsevier, vol. 75(C), pages 27-35.
    19. Stefan Ropke & Jean-François Cordeau, 2009. "Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows," Transportation Science, INFORMS, vol. 43(3), pages 267-286, August.
    20. Croce, Antonello Ignazio & Musolino, Giuseppe & Rindone, Corrado & Vitetta, Antonino, 2019. "Sustainable mobility and energy resources: A quantitative assessment of transport services with electrical vehicles," Renewable and Sustainable Energy Reviews, Elsevier, vol. 113(C), pages 1-1.
    21. Deka, Devajyoti & Gonzales, Eric J., 2014. "The generators of paratransit trips by persons with disabilities," Transportation Research Part A: Policy and Practice, Elsevier, vol. 70(C), pages 181-193.
    22. Paolo Toth & Daniele Vigo, 1997. "Heuristic Algorithms for the Handicapped Persons Transportation Problem," Transportation Science, INFORMS, vol. 31(1), pages 60-71, February.
    Full references (including those not matched with items on IDEAS)

    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. Yang, Meng & Ni, Yaodong & Song, Qinyu, 2022. "Optimizing driver consistency in the vehicle routing problem under uncertain environment," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    2. Mohsen Emadikhiav & David Bergman & Robert Day, 2020. "Consistent Routing and Scheduling with Simultaneous Pickups and Deliveries," Production and Operations Management, Production and Operations Management Society, vol. 29(8), pages 1937-1955, August.
    3. Mahmoudi, Monirehalsadat & Zhou, Xuesong, 2016. "Finding optimal solutions for vehicle routing problem with pickup and delivery services with time windows: A dynamic programming approach based on state–space–time network representations," Transportation Research Part B: Methodological, Elsevier, vol. 89(C), pages 19-42.
    4. Amirmahdi Tafreshian & Neda Masoud & Yafeng Yin, 2020. "Frontiers in Service Science: Ride Matching for Peer-to-Peer Ride Sharing: A Review and Future Directions," Service Science, INFORMS, vol. 12(2-3), pages 44-60, June.
    5. Quirion-Blais, Olivier & Chen, Lu, 2021. "A case-based reasoning approach to solve the vehicle routing problem with time windows and drivers’ experience," Omega, Elsevier, vol. 102(C).
    6. Mancini, Simona & Gansterer, Margaretha & Hartl, Richard F., 2021. "The collaborative consistent vehicle routing problem with workload balance," European Journal of Operational Research, Elsevier, vol. 293(3), pages 955-965.
    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. Braekers, Kris & Kovacs, Attila A., 2016. "A multi-period dial-a-ride problem with driver consistency," Transportation Research Part B: Methodological, Elsevier, vol. 94(C), pages 355-377.
    9. Hua, Shijia & Zeng, Wenjia & Liu, Xinglu & Qi, Mingyao, 2022. "Optimality-guaranteed algorithms on the dynamic shared-taxi problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    10. 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).
    11. Yao, Yu & Van Woensel, Tom & Veelenturf, Lucas P. & Mo, Pengli, 2021. "The consistent vehicle routing problem considering path consistency in a road network," Transportation Research Part B: Methodological, Elsevier, vol. 153(C), pages 21-44.
    12. Nolz, Pamela C. & Absi, Nabil & Feillet, Dominique & Seragiotto, Clóvis, 2022. "The consistent electric-Vehicle routing problem with backhauls and charging management," European Journal of Operational Research, Elsevier, vol. 302(2), pages 700-716.
    13. Yves Molenbruch & Kris Braekers & An Caris, 2017. "Typology and literature review for dial-a-ride problems," Annals of Operations Research, Springer, vol. 259(1), pages 295-325, December.
    14. Rodríguez-Martín, Inmaculada & Yaman, Hande, 2022. "Periodic Vehicle Routing Problem with Driver Consistency and service time optimization," Transportation Research Part B: Methodological, Elsevier, vol. 166(C), pages 468-484.
    15. Detti, Paolo & Papalini, Francesco & Lara, Garazi Zabalo Manrique de, 2017. "A multi-depot dial-a-ride problem with heterogeneous vehicles and compatibility constraints in healthcare," Omega, Elsevier, vol. 70(C), pages 1-14.
    16. Martins, Sara & Ostermeier, Manuel & Amorim, Pedro & Hübner, Alexander & Almada-Lobo, Bernardo, 2019. "Product-oriented time window assignment for a multi-compartment vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 276(3), pages 893-909.
    17. Timo Gschwind & Stefan Irnich, 2012. "Effective Handling of Dynamic Time Windows and Synchronization with Precedences for Exact Vehicle Routing," Working Papers 1211, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    18. Jean-François Cordeau & Gilbert Laporte, 2007. "The dial-a-ride problem: models and algorithms," Annals of Operations Research, Springer, vol. 153(1), pages 29-46, September.
    19. Liu, Mengyang & Luo, Zhixing & Lim, Andrew, 2015. "A branch-and-cut algorithm for a realistic dial-a-ride problem," Transportation Research Part B: Methodological, Elsevier, vol. 81(P1), pages 267-288.
    20. Soriano, Adria & Vidal, Thibaut & Gansterer, Margaretha & Doerner, Karl, 2020. "The vehicle routing problem with arrival time diversification on a multigraph," European Journal of Operational Research, Elsevier, vol. 286(2), pages 564-575.

    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:gam:jsusta:v:12:y:2020:i:14:p:5594-:d:383339. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.