IDEAS home Printed from https://ideas.repec.org/p/ant/wpaper/2020005.html
   My bibliography  Save this paper

The on-demand bus routing problem: A large neighborhood search heuristic for a dial-a-ride problem with bus station assignment

Author

Listed:
  • MELIS, Lissa
  • SÖRENSEN, Kenneth

Abstract

We introduce a novel optimization problem to support the planning and routing of ondemand buses in an urban context. We call this problem the on-demand bus routing problem. Given are a fl eet of identical buses with fixed capacity, a set of bus stations and travel times between them, and a set of transportation requests. Each transportation request consists of a set of potential departure and a set of potential arrival bus stations, as well as a time window, i.e., an earliest departure time and a latest arrival time. The aim of the on-demand bus routing problem is to (1) assign each passenger to a departure and arrival bus station and (2) develop a set of bus routes to fulfill each request in time while minimizing the total travel time of all users. We present the on-demand bus routing problem, as well as a straightforward large neighborhood search heuristic to solve it. The results found by the heuristic for the on-demand bus system are compared to those of a simulated traditional public bus system with fixed lines and timetables. A thorough analysis of the comparison demonstrates that total user ride times can be significantly lower in an on-demand public bus system and shows that an on-demand bus system works best with a large number of small buses.

Suggested Citation

  • MELIS, Lissa & SÖRENSEN, Kenneth, 2020. "The on-demand bus routing problem: A large neighborhood search heuristic for a dial-a-ride problem with bus station assignment," Working Papers 2020005, University of Antwerp, Faculty of Business and Economics.
    • Handle: RePEc:ant:wpaper:2020005
    as

    Download full text from publisher

    File URL: https://repository.uantwerpen.be/docstore/d:irua:2737
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Cordeau, Jean-François & Laporte, Gilbert, 2003. "A tabu search heuristic for the static multi-vehicle dial-a-ride problem," Transportation Research Part B: Methodological, Elsevier, vol. 37(6), pages 579-594, July.
    2. Schittekat, Patrick & Kinable, Joris & Sörensen, Kenneth & Sevaux, Marc & Spieksma, Frits & Springael, Johan, 2013. "A metaheuristic for the school bus routing problem with bus stop selection," European Journal of Operational Research, Elsevier, vol. 229(2), pages 518-528.
    3. Garcia-Martinez, Andres & Cascajo, Rocio & Jara-Diaz, Sergio R. & Chowdhury, Subeh & Monzon, Andres, 2018. "Transfer penalties in multimodal public transport networks," Transportation Research Part A: Policy and Practice, Elsevier, vol. 114(PA), pages 52-66.
    4. 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.
    5. Ibarra-Rojas, O.J. & Delgado, F. & Giesen, R. & Muñoz, J.C., 2015. "Planning, operation, and control of bus transport systems: A literature review," Transportation Research Part B: Methodological, Elsevier, vol. 77(C), pages 38-75.
    6. Timo Gschwind & Michael Drexl, 2019. "Adaptive Large Neighborhood Search with a Constant-Time Feasibility Test for the Dial-a-Ride Problem," Transportation Science, INFORMS, vol. 53(2), pages 480-491, March.
    7. 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.
    8. Carosi, Samuela & Frangioni, Antonio & Galli, Laura & Girardi, Leopoldo & Vallese, Giuliano, 2019. "A matheuristic for integrated timetabling and vehicle scheduling," Transportation Research Part B: Methodological, Elsevier, vol. 127(C), pages 99-124.
    9. Nelson, John D. & Wright, Steve & Masson, Brian & Ambrosino, Giorgio & Naniopoulos, Aristotelis, 2010. "Recent developments in Flexible Transport Services," Research in Transportation Economics, Elsevier, vol. 29(1), pages 243-248.
    10. Ceder, Avishai & Wilson, Nigel H. M., 1986. "Bus network design," Transportation Research Part B: Methodological, Elsevier, vol. 20(4), pages 331-344, August.
    11. Martin W. P. Savelsbergh, 1992. "The Vehicle Routing Problem with Time Windows: Minimizing Route Duration," INFORMS Journal on Computing, INFORMS, vol. 4(2), pages 146-154, May.
    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. MELIS, Lissa & QUEIROZ, Michell & SÖRENSEN, kenneth, 2021. "The integrated on-demand bus routing problem," Working Papers 2021004, University of Antwerp, Faculty of Business and Economics.

    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. Hörcher, Daniel & Tirachini, Alejandro, 2021. "A review of public transport economics," Economics of Transportation, Elsevier, vol. 25(C).
    2. 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.
    3. Ritzinger, Ulrike & Puchinger, Jakob & Rudloff, Christian & Hartl, Richard F., 2022. "Comparison of anticipatory algorithms for a dial-a-ride problem," European Journal of Operational Research, Elsevier, vol. 301(2), pages 591-608.
    4. Gaul, Daniela & Klamroth, Kathrin & Stiglmayr, Michael, 2022. "Event-based MILP models for ridepooling applications," European Journal of Operational Research, Elsevier, vol. 301(3), pages 1048-1063.
    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 & 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.
    7. 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.
    8. Lian, Ying & Lucas, Flavien & Sörensen, Kenneth, 2024. "Prepositioning can improve the performance of a dynamic stochastic on-demand public bus system," European Journal of Operational Research, Elsevier, vol. 312(1), pages 338-356.
    9. Gilbert Laporte, 2016. "Scheduling issues in vehicle routing," Annals of Operations Research, Springer, vol. 236(2), pages 463-474, January.
    10. Paquette, Julie & Cordeau, Jean-François & Laporte, Gilbert & Pascoal, Marta M.B., 2013. "Combining multicriteria analysis and tabu search for dial-a-ride problems," Transportation Research Part B: Methodological, Elsevier, vol. 52(C), pages 1-16.
    11. Gupta, Diwakar & Chen, Hao-Wei & Miller, Lisa A. & Surya, Fajarrani, 2010. "Improving the efficiency of demand-responsive paratransit services," Transportation Research Part A: Policy and Practice, Elsevier, vol. 44(4), pages 201-217, May.
    12. Timo Gschwind, 2019. "Route feasibility testing and forward time slack for the Synchronized Pickup and Delivery Problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(2), pages 491-512, June.
    13. 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.
    14. Bruni, M.E. & Guerriero, F. & Beraldi, P., 2014. "Designing robust routes for demand-responsive transport systems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 70(C), pages 1-16.
    15. (Edward) Kim, Myungseob & Levy, Joshua & Schonfeld, Paul, 2019. "Optimal zone sizes and headways for flexible-route bus services," Transportation Research Part B: Methodological, Elsevier, vol. 130(C), pages 67-81.
    16. Kuo, Yong-Hong & Leung, Janny M.Y. & Yan, Yimo, 2023. "Public transport for smart cities: Recent innovations and future challenges," European Journal of Operational Research, Elsevier, vol. 306(3), pages 1001-1026.
    17. 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.
    18. 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.
    19. Schilde, M. & Doerner, K.F. & Hartl, R.F., 2014. "Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem," European Journal of Operational Research, Elsevier, vol. 238(1), pages 18-30.
    20. Häme, Lauri, 2011. "An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows," European Journal of Operational Research, Elsevier, vol. 209(1), pages 11-22, February.

    More about this item

    Keywords

    Transportation; Routing; Public transport; Metaheuristic;
    All these keywords.

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    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:ant:wpaper:2020005. 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: Joeri Nys (email available below). General contact details of provider: https://edirc.repec.org/data/ftufsbe.html .

    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.