IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v206y2026ics1366554525005903.html

A hybrid large neighborhood search algorithm for the integrated dial-a-ride problem using electric vehicles

Author

Listed:
  • Fang, Yumeng
  • Ma, Tai-Yu

Abstract

Integrating demand-responsive mobility services with transit systems is recognized as a practical and effective strategy to mitigate their impact on traffic congestion and the environment. This study develops an efficient hybrid metaheuristic to solve the integrated dial-a-ride problem by utilizing electric vehicles to minimize operational costs and customer travel time. Customer transfer inconvenience is restricted by a maximum intermodal transfer time to synchronize demand-responsive buses’ arrival and transit departures. The proposed metaheuristic addresses the challenges of integrating demand-responsive vehicle routing and charging operations with fixed-route transit systems with capacitated charging stations and partial recharge. We benchmarked our algorithm against a state-of-the-art mixed-integer programming solver on instances with 10–50 customers and two transit lines. Our approach achieves solutions that are, on average, 23.8% better in solution quality within around 2 min, outperforming those obtained by the solver using an 8-hour computational time limit. We evaluate the impact of various system parameters to bridge the gap between theory and practice. The results suggest that, from the operator’s perspective, while the integrated dial-a-ride service reduces vehicle kilometers traveled, the used fleet size may not necessarily be reduced when ensuring high-quality service for passengers. Moreover, operating the integrated systems is more beneficial in areas with dense transit networks, compared with increases in transit frequency. The findings provide valuable insights for developing integrated dial-a-ride services in practice.

Suggested Citation

  • Fang, Yumeng & Ma, Tai-Yu, 2026. "A hybrid large neighborhood search algorithm for the integrated dial-a-ride problem using electric vehicles," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 206(C).
  • Handle: RePEc:eee:transe:v:206:y:2026:i:c:s1366554525005903
    DOI: 10.1016/j.tre.2025.104562
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.tre.2025.104562?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

    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. Sun, Peng & Veelenturf, Lucas P. & Hewitt, Mike & Van Woensel, Tom, 2018. "The time-dependent pickup and delivery problem with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 116(C), pages 1-24.
    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. Alinaghian, Mahdi & Shokouhi, Nadia, 2018. "Multi-depot multi-compartment vehicle routing problem, solved by a hybrid adaptive large neighborhood search," Omega, Elsevier, vol. 76(C), pages 85-99.
    5. Schaller, Bruce, 2021. "Can sharing a ride make for less traffic? Evidence from Uber and Lyft and implications for cities," Transport Policy, Elsevier, vol. 102(C), pages 1-10.
    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. 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.
    8. Alberto Santini & Stefan Ropke & Lars Magnus Hvattum, 2018. "A comparison of acceptance criteria for the adaptive large neighbourhood search metaheuristic," Journal of Heuristics, Springer, vol. 24(5), pages 783-815, October.
    9. Veaceslav Ghilas & Jean-François Cordeau & Emrah Demir & Tom Van Woensel, 2018. "Branch-and-Price for the Pickup and Delivery Problem with Time Windows and Scheduled Lines," Transportation Science, INFORMS, vol. 52(5), pages 1191-1210, October.
    10. M. Posada & C. H. Häll, 2020. "A metaheuristic for evaluation of an integrated special transport service," International Journal of Urban Sciences, Taylor & Francis Journals, vol. 24(3), pages 316-338, July.
    11. 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.
    12. Ma, Tai-Yu & Rasulkhani, Saeid & Chow, Joseph Y.J. & Klein, Sylvain, 2019. "A dynamic ridesharing dispatch and idle vehicle repositioning strategy with integrated transit transfers," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 128(C), pages 417-442.
    13. Su, Yue & Dupin, Nicolas & Parragh, Sophie N. & Puchinger, Jakob, 2024. "A Branch-and-Price algorithm for the electric autonomous Dial-A-Ride Problem," Transportation Research Part B: Methodological, Elsevier, vol. 186(C).
    14. 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.
    15. Ma, Tai-Yu & Fang, Yumeng & Connors, Richard D. & Viti, Francesco & Nakao, Haruko, 2024. "A hybrid metaheuristic to optimize electric first-mile feeder services with charging synchronization constraints and customer rejections," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 185(C).
    16. Turkeš, Renata & Sörensen, Kenneth & Hvattum, Lars Magnus, 2021. "Meta-analysis of metaheuristics: Quantifying the effect of adaptiveness in adaptive large neighborhood search," European Journal of Operational Research, Elsevier, vol. 292(2), pages 423-442.
    17. Alejandro Henao & Wesley E. Marshall, 2019. "The impact of ride-hailing on vehicle miles traveled," Transportation, Springer, vol. 46(6), pages 2173-2194, December.
    18. 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.
    19. 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.
    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. 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.
    2. Su, Yue & Dupin, Nicolas & Parragh, Sophie N. & Puchinger, Jakob, 2024. "A Branch-and-Price algorithm for the electric autonomous Dial-A-Ride Problem," Transportation Research Part B: Methodological, Elsevier, vol. 186(C).
    3. 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.
    4. 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.
    5. 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.
    6. Nakao, Haruko & Ma, Tai-Yu & Connors, Richard D. & Viti, Francesco, 2026. "Joint optimization of charging infrastructure and fleet mix for CO₂-constrained feeder services," Applied Energy, Elsevier, vol. 405(C).
    7. 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.
    8. 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.
    9. Zang, Zhaoqi & Tian, Qingyun & Wang, David Z.W., 2025. "On-demand transportation system for cross-state abortion travel: A dual dial-a-ride problem," Transportation Research Part A: Policy and Practice, Elsevier, vol. 196(C).
    10. 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.
    11. Ma, Tai-Yu & Fang, Yumeng & Connors, Richard D. & Viti, Francesco & Nakao, Haruko, 2024. "A hybrid metaheuristic to optimize electric first-mile feeder services with charging synchronization constraints and customer rejections," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 185(C).
    12. Cleder M. Schenekemberg & Antonio A. Chaves & Thiago A. Guimarães & Leandro C. Coelho, 2025. "Hybrid metaheuristic for the dial-a-ride problem with private fleet and common carrier integrated with public transportation," Annals of Operations Research, Springer, vol. 351(1), pages 809-847, August.
    13. Lu, Jiawei & Ye, Tinghan & Chen, Wenbo & Van Hentenryck, Pascal, 2025. "Boosting column generation with graph neural networks for joint rider trip planning and crew shift scheduling," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 202(C).
    14. 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.
    15. Rolim, Gustavo Alencar & Tomazella, Caio Paziani & Nagano, Marcelo Seido, 2025. "On the integration of reinforcement learning and simulated annealing for the parallel batch scheduling problem with setups," European Journal of Operational Research, Elsevier, vol. 326(2), pages 220-233.
    16. Jodeau, Jean & Absi, Nabil & Chevrier, Rémy & Feillet, Dominique, 2024. "The rail-road Dial-a-Ride problem," European Journal of Operational Research, Elsevier, vol. 318(2), pages 486-499.
    17. 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.
    18. Turkeš, Renata & Sörensen, Kenneth & Hvattum, Lars Magnus, 2021. "Meta-analysis of metaheuristics: Quantifying the effect of adaptiveness in adaptive large neighborhood search," European Journal of Operational Research, Elsevier, vol. 292(2), pages 423-442.
    19. Voigt, Stefan, 2025. "A review and ranking of operators in adaptive large neighborhood search for vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 322(2), pages 357-375.
    20. 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.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:eee:transe:v:206:y:2026:i:c:s1366554525005903. 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.