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

Benefits of horizontal cooperation in dial-a-ride services

Author

Listed:
  • Molenbruch, Yves
  • Braekers, Kris
  • Caris, An

Abstract

Dial-a-ride services provide collective on-demand transportation, usually tailored to the needs of people with reduced mobility. This paper investigates the operational effects of horizontal cooperation among dial-a-ride providers. The current practice is that users choose a particular provider to submit their requests. Providers operating in the same area create their routing solutions independently of each other, given their own set of customers. In contrast, horizontal cooperation through joint route planning implies that customer requests can be exchanged among providers in order to minimize the overall routing cost. In addition to quantifying the operational benefits generated by such a horizontal cooperation, this paper identifies operational characteristics that influence the magnitude of the savings. A real-life case study reveals the reasons why providers benefit from certain request exchanges, as well as the extent to which these exchanges are predictable in advance. The solutions are obtained using a large neighborhood search algorithm that performs well on benchmark data.

Suggested Citation

  • Molenbruch, Yves & Braekers, Kris & Caris, An, 2017. "Benefits of horizontal cooperation in dial-a-ride services," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 107(C), pages 97-119.
    • Handle: RePEc:eee:transe:v:107:y:2017:i:c:p:97-119
    DOI: 10.1016/j.tre.2017.09.001
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554517301990
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tre.2017.09.001?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. Stefan Ropke & David Pisinger, 2006. "An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows," Transportation Science, INFORMS, vol. 40(4), pages 455-472, November.
    2. M A Krajewska & H Kopfer & G Laporte & S Ropke & G Zaccour, 2008. "Horizontal cooperation among freight carriers: request allocation and profit sharing," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(11), pages 1483-1491, November.
    3. 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.
    4. Tijs, S.H. & Driessen, T.S.H., 1986. "Game theory and cost allocation problems," Other publications TiSEM 376c24c5-c95d-4d29-96b6-4, Tilburg University, School of Economics and Management.
    5. Lotte Verdonck & Patrick Beullens & An Caris & Katrien Ramaekers & Gerrit K Janssens, 2016. "Analysis of collaborative savings and cost allocation techniques for the cooperative carrier facility location problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 67(6), pages 853-871, June.
    6. López-Ibáñez, Manuel & Dubois-Lacoste, Jérémie & Pérez Cáceres, Leslie & Birattari, Mauro & Stützle, Thomas, 2016. "The irace package: Iterated racing for automatic algorithm configuration," Operations Research Perspectives, Elsevier, vol. 3(C), pages 43-58.
    7. Xiang, Zhihai & Chu, Chengbin & Chen, Haoxun, 2008. "The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments," European Journal of Operational Research, Elsevier, vol. 185(2), pages 534-551, March.
    8. 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.
    9. 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.
    10. Cruijssen, Frans & Cools, Martine & Dullaert, Wout, 2007. "Horizontal cooperation in logistics: Opportunities and impediments," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 43(2), pages 129-142, March.
    11. Yves Molenbruch & Kris Braekers & An Caris, 2017. "Operational effects of service level variations for the dial-a-ride problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 25(1), pages 71-90, March.
    12. Lotte Verdonck & AN Caris & Katrien Ramaekers & Gerrit K. Janssens, 2013. "Collaborative Logistics from the Perspective of Road Transportation Companies," Transport Reviews, Taylor & Francis Journals, vol. 33(6), pages 700-719, November.
    13. Berbeglia, Gerardo & Cordeau, Jean-François & Laporte, Gilbert, 2010. "Dynamic pickup and delivery problems," European Journal of Operational Research, Elsevier, vol. 202(1), pages 8-15, April.
    14. Masmoudi, Mohamed Amine & Hosny, Manar & Braekers, Kris & Dammak, Abdelaziz, 2016. "Three effective metaheuristics to solve the multi-depot multi-trip heterogeneous dial-a-ride problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 96(C), pages 60-80.
    15. S. H. Tijs & T. S. H. Driessen, 1986. "Game Theory and Cost Allocation Problems," Management Science, INFORMS, vol. 32(8), pages 1015-1028, August.
    16. 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.
    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. 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.
    2. Sonia Nasri & Hend Bouziri & Wassila Aggoune-Mtalaa, 2022. "An Evolutionary Descent Algorithm for Customer-Oriented Mobility-On-Demand Problems," Sustainability, MDPI, vol. 14(5), pages 1-18, March.
    3. Rossana Cavagnini & Valentina Morandi, 2021. "Implementing Horizontal Cooperation in Public Transport and Parcel Deliveries: The Cooperative Share-A-Ride Problem," Sustainability, MDPI, vol. 13(8), pages 1-20, April.
    4. Nassim Mrabti & Nadia Hamani & Laurent Delahoche, 2022. "A Comprehensive Literature Review on Sustainable Horizontal Collaboration," Sustainability, MDPI, vol. 14(18), pages 1-38, September.
    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. Los, Johan & Schulte, Frederik & Spaan, Matthijs T.J. & Negenborn, Rudy R., 2020. "The value of information sharing for platform-based collaborative vehicle routing," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 141(C).
    7. Molenbruch, Yves & Braekers, Kris & Hirsch, Patrick & Oberscheider, Marco, 2021. "Analyzing the benefits of an integrated mobility system using a matheuristic routing algorithm," European Journal of Operational Research, Elsevier, vol. 290(1), pages 81-98.

    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. 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.
    2. 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.
    3. Molenbruch, Yves & Braekers, Kris & Hirsch, Patrick & Oberscheider, Marco, 2021. "Analyzing the benefits of an integrated mobility system using a matheuristic routing algorithm," European Journal of Operational Research, Elsevier, vol. 290(1), pages 81-98.
    4. Lotte Verdonck & Katrien Ramaekers & Benoît Depaire & An Caris & Gerrit K. Janssens, 2019. "Analysing the Effect of Partner Characteristics on the Performance of Horizontal Carrier Collaborations," Networks and Spatial Economics, Springer, vol. 19(2), pages 583-609, June.
    5. Defryn, Christof & Sörensen, Kenneth & Dullaert, Wout, 2019. "Integrating partner objectives in horizontal logistics optimisation models," Omega, Elsevier, vol. 82(C), pages 1-12.
    6. 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.
    7. 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.
    8. Ertan Yakıcı & Robert F. Dell & Travis Hartman & Connor McLemore, 2018. "Daily aircraft routing for amphibious ready groups," Annals of Operations Research, Springer, vol. 264(1), pages 477-498, May.
    9. 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.
    10. 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).
    11. 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.
    12. 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).
    13. Bongiovanni, Claudia & Kaspi, Mor & Cordeau, Jean-François & Geroliminis, Nikolas, 2022. "A machine learning-driven two-phase metaheuristic for autonomous ridesharing operations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 165(C).
    14. Mohamed Amine Masmoudi & Manar Hosny & Emrah Demir & Erwin Pesch, 2020. "Hybrid adaptive large neighborhood search algorithm for the mixed fleet heterogeneous dial-a-ride problem," Journal of Heuristics, Springer, vol. 26(1), pages 83-118, February.
    15. 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.
    16. 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.
    17. Stefan Vonolfen & Michael Affenzeller, 2016. "Distribution of waiting time for dynamic pickup and delivery problems," Annals of Operations Research, Springer, vol. 236(2), pages 359-382, January.
    18. 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.
    19. Lu, Chang & Wu, Yuehui & Yu, Shanchuan, 2022. "A Sample Average Approximation Approach for the Stochastic Dial-A-Ride Problem on a Multigraph with User Satisfaction," European Journal of Operational Research, Elsevier, vol. 302(3), pages 1031-1044.
    20. Ramaekers, Katrien & Verdonck, Lotte & Caris, An & Meers, Dries & Macharis, Cathy, 2017. "Allocating collaborative costs in multimodal barge networks for freight bundling," Journal of Transport Geography, Elsevier, vol. 65(C), pages 56-69.

    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:107:y:2017:i:c:p:97-119. 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.