IDEAS home Printed from https://ideas.repec.org/a/spr/pubtra/v9y2017i1d10.1007_s12469-016-0128-9.html
   My bibliography  Save this article

The integrated dial-a-ride problem with timetabled fixed route service

Author

Listed:
  • Marcus Posada

    (Linköping University)

  • Henrik Andersson

    (Norwegian University of Science and Technology)

  • Carl H. Häll

    (Linköping University)

Abstract

This paper concerns operational planning of door-to-door transportation systems for the elderly and/or disabled, who often need a more flexible transportation system than the rest of the population. Highly flexible, but very costly direct transportation is often offered as a complement to standard fixed route public transport service. In the integrated dial-a-ride problem (IDARP), these modes of transport are combined and certain legs of the passengers journeys may be performed with the fixed route public transport system. We extend the IDARP and include timetables for the fixed route services, forcing the fleet of vehicles to schedule the arrival at transfer locations with care. Two mixed integer linear programming formulations of the integrated dial-a-ride problem with timetables are presented and analyzed. The key modeling challenge is that of the transfers between the fleet of vehicles and the fixed route public transport system. The formulations differ in how the transfers are modeled and the differences are thoroughly discussed. The computational study compares the formulations in terms of network size, computational time and memory usage and conclusions about their performances are drawn.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:pubtra:v:9:y:2017:i:1:d:10.1007_s12469-016-0128-9
    DOI: 10.1007/s12469-016-0128-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12469-016-0128-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s12469-016-0128-9?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. Nicole Ronald & Russell Thompson & Stephan Winter, 2015. "Simulating Demand-responsive Transportation: A Review of Agent-based Approaches," Transport Reviews, Taylor & Francis Journals, vol. 35(4), pages 404-421, July.
    2. 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.
    3. 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.
    4. Cortés, Cristián E. & Matamala, Martín & Contardo, Claudio, 2010. "The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method," European Journal of Operational Research, Elsevier, vol. 200(3), pages 711-724, February.
    5. Stålhane, Magnus & Andersson, Henrik & Christiansen, Marielle & Fagerholt, Kjetil, 2014. "Vendor managed inventory in tramp shipping," Omega, Elsevier, vol. 47(C), pages 60-72.
    6. Chowdhury, Subeh & Ceder, Avishai (Avi), 2016. "Users’ willingness to ride an integrated public-transport service: A literature review," Transport Policy, Elsevier, vol. 48(C), pages 183-195.
    7. Horn, M. E. T., 2002. "Multi-modal and demand-responsive passenger transport systems: a modelling framework with embedded control systems," Transportation Research Part A: Policy and Practice, Elsevier, vol. 36(2), pages 167-188, February.
    8. Rais, A. & Alvelos, F. & Carvalho, M.S., 2014. "New mixed integer-programming model for the pickup-and-delivery problem with transshipment," European Journal of Operational Research, Elsevier, vol. 235(3), pages 530-539.
    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. MELIS, Lissa & SÖRENSEN, Kenneth, 2021. "The real-time on-demand bus routing problem: What is the cost of dynamic requests?," Working Papers 2021003, University of Antwerp, Faculty of Business and Economics.
    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. 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).
    5. Dessouky, Maged M & Hu, Shichun, 2021. "Dynamic Routing for Ride-Sharing," Institute of Transportation Studies, Working Paper Series qt6qq8r7hz, Institute of Transportation Studies, UC Davis.
    6. 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.
    7. 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.
    8. 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.
    9. Chen, Rui & Chen, Shukai & Cui, Haipeng & Meng, Qiang, 2021. "The container drayage problem for heterogeneous trucks with multiple loads: A revisit," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 147(C).
    10. 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.
    11. 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).
    12. Hilde Heggen & Yves Molenbruch & An Caris & Kris Braekers, 2019. "Intermodal Container Routing: Integrating Long-Haul Routing and Local Drayage Decisions," Sustainability, MDPI, vol. 11(6), pages 1-36, March.
    13. 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.

    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. Shangyao Yan & Chun-Ying Chen & Chuan-Che Wu, 2012. "Solution methods for the taxi pooling problem," Transportation, Springer, vol. 39(3), pages 723-748, May.
    4. 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.
    5. Mahmoudi, Monirehalsadat & Chen, Junhua & Shi, Tie & Zhang, Yongxiang & Zhou, Xuesong, 2019. "A cumulative service state representation for the pickup and delivery problem with transfers," Transportation Research Part B: Methodological, Elsevier, vol. 129(C), pages 351-380.
    6. Lyu, Zefeng & Yu, Andrew Junfang, 2023. "The pickup and delivery problem with transshipments: Critical review of two existing models and a new formulation," European Journal of Operational Research, Elsevier, vol. 305(1), pages 260-270.
    7. Wolfinger, David & Salazar-González, Juan-José, 2021. "The Pickup and Delivery Problem with Split Loads and Transshipments: A Branch-and-Cut Solution Approach," European Journal of Operational Research, Elsevier, vol. 289(2), pages 470-484.
    8. 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.
    9. Garaix, Thierry & Artigues, Christian & Feillet, Dominique & Josselin, Didier, 2010. "Vehicle routing problems with alternative paths: An application to on-demand transportation," European Journal of Operational Research, Elsevier, vol. 204(1), pages 62-75, July.
    10. 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.
    11. 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.
    12. David Wolfinger & Fabien Tricoire & Karl F. Doerner, 2019. "A matheuristic for a multimodal long haul routing problem," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(4), pages 397-433, December.
    13. 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.
    14. Reinhardt, Line Blander & Clausen, Tommy & Pisinger, David, 2013. "Synchronized dial-a-ride transportation of disabled passengers at airports," European Journal of Operational Research, Elsevier, vol. 225(1), pages 106-117.
    15. Zahra Navidi & Nicole Ronald & Stephan Winter, 2018. "Comparison between ad-hoc demand responsive and conventional transit: a simulation study," Public Transport, Springer, vol. 10(1), pages 147-167, May.
    16. Nicole Ronald & Russell Thompson & Stephan Winter, 2015. "Simulating Demand-responsive Transportation: A Review of Agent-based Approaches," Transport Reviews, Taylor & Francis Journals, vol. 35(4), pages 404-421, July.
    17. Masoud, Neda & Jayakrishnan, R., 2017. "A decomposition algorithm to solve the multi-hop Peer-to-Peer ride-matching problem," Transportation Research Part B: Methodological, Elsevier, vol. 99(C), pages 1-29.
    18. Paul Buijs & Jose Alejandro Lopez Alvarez & Marjolein Veenstra & Kees Jan Roodbergen, 2016. "Improved Collaborative Transport Planning at Dutch Logistics Service Provider Fritom," Interfaces, INFORMS, vol. 46(2), pages 119-132, April.
    19. 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.
    20. Wei, Xiaoyang & Jia, Shuai & Meng, Qiang & Tan, Kok Choon, 2020. "Tugboat scheduling for container ports," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).

    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:spr:pubtra:v:9:y:2017:i:1:d:10.1007_s12469-016-0128-9. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.