{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T05:14:47Z","timestamp":1770873287379,"version":"3.50.1"},"reference-count":44,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2025,11,9]],"date-time":"2025-11-09T00:00:00Z","timestamp":1762646400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"},{"start":{"date-parts":[[2025,11,9]],"date-time":"2025-11-09T00:00:00Z","timestamp":1762646400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"funder":[{"DOI":"10.13039\/501100003032","name":"Association Nationale de la Recherche et de la Technologie","doi-asserted-by":"publisher","award":["CIFRE 2020\u20101688"],"award-info":[{"award-number":["CIFRE 2020\u20101688"]}],"id":[{"id":"10.13039\/501100003032","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Networks"],"published-print":{"date-parts":[[2026,3]]},"abstract":"<jats:title>ABSTRACT<\/jats:title>\n                  <jats:p>We consider an original dynamic dial\u2010a\u2010ride service designed for sparsely populated areas. The service relies on vehicles capable of switching between road and an existing abandoned rail network. It defines a Dial\u2010A\u2010Ride Problem (DARP) with rail scheduling constraints. In the DARP, a set of users must be picked up and dropped off at desired locations, while adhering to time windows and maximum travel time constraints. In the dynamic context, the system has to evaluate the acceptance of new customers and their integration into vehicle routes. Rail scheduling highly complicates the problem by creating interdependencies between vehicles. We develop a solution method combining the Adaptive Large Neighborhood Search framework, a set\u2010covering approach, and multiple anticipatory scenarios generated with fictitious requests. We evaluate the effectiveness of our approach with realistic instances generated from a specific abandoned railway in France.<\/jats:p>","DOI":"10.1002\/net.70017","type":"journal-article","created":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T07:17:14Z","timestamp":1762759034000},"page":"191-209","update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Dynamic Rail\u2010Road Dial\u2010A\u2010Ride Problem"],"prefix":"10.1002","volume":"87","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-5542-1691","authenticated-orcid":false,"given":"Jean","family":"Jodeau","sequence":"first","affiliation":[{"name":"SNCF, DTIPG  Saint\u2010Denis France"},{"name":"Mines Saint\u2010Etienne, University of Clermont Auvergne, INP Clermont Auvergne, CNRS, UMR 6158 LIMOS  Saint\u2010Etienne France"}]},{"given":"Nabil","family":"Absi","sequence":"additional","affiliation":[{"name":"Mines Saint\u2010Etienne, University of Clermont Auvergne, INP Clermont Auvergne, CNRS, UMR 6158 LIMOS  Saint\u2010Etienne France"}]},{"given":"R\u00e9my","family":"Chevrier","sequence":"additional","affiliation":[{"name":"SNCF, DTIPG  Saint\u2010Denis France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1246-223X","authenticated-orcid":false,"given":"Dominique","family":"Feillet","sequence":"additional","affiliation":[{"name":"Mines Saint\u2010Etienne, University of Clermont Auvergne, INP Clermont Auvergne, CNRS, UMR 6158 LIMOS  Saint\u2010Etienne France"}]}],"member":"311","published-online":{"date-parts":[[2025,11,9]]},"reference":[{"key":"e_1_2_10_2_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1040.0124"},{"key":"e_1_2_10_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2024.05.036"},{"key":"e_1_2_10_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-019-09423-y"},{"key":"e_1_2_10_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2022.02.021"},{"key":"e_1_2_10_6_1","doi-asserted-by":"publisher","DOI":"10.19139\/soic-2310-5070-1165"},{"key":"e_1_2_10_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-007-0170-8"},{"key":"e_1_2_10_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-017-2525-0"},{"key":"e_1_2_10_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2018.02.001"},{"key":"e_1_2_10_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0191-2615(02)00045-0"},{"key":"e_1_2_10_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0360-8352(03)00032-9"},{"key":"e_1_2_10_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2011.12.014"},{"key":"e_1_2_10_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2016.12.008"},{"key":"e_1_2_10_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73053-8_50"},{"key":"e_1_2_10_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2012.08.004"},{"key":"e_1_2_10_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2013.07.020"},{"key":"e_1_2_10_17_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2018.0837"},{"key":"e_1_2_10_18_1","doi-asserted-by":"publisher","DOI":"10.3390\/a12020039"},{"key":"e_1_2_10_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2015.10.002"},{"key":"e_1_2_10_20_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1110.0400"},{"key":"e_1_2_10_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2023.04.007"},{"key":"e_1_2_10_22_1","unstructured":"A.Froger J. E.Mendoza O.Jabali andG.Laporte \u201cA matheuristic for the Electric Vehicle Routing Problem With Capacitated Charging Stations \u201d(2017)."},{"key":"e_1_2_10_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2012.08.015"},{"key":"e_1_2_10_24_1","volume-title":"Proceedings of the 21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2021)","author":"Gaul D.","year":"2021"},{"key":"e_1_2_10_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2021.11.053"},{"key":"e_1_2_10_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2020.101199"},{"key":"e_1_2_10_27_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1110.0454"},{"key":"e_1_2_10_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2018.02.049"},{"key":"e_1_2_10_29_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.14.2.130"},{"key":"e_1_2_10_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02031946"},{"key":"e_1_2_10_31_1","doi-asserted-by":"publisher","DOI":"10.1287\/inte.1080.0379"},{"key":"e_1_2_10_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00291-008-0135-6"},{"key":"e_1_2_10_33_1","doi-asserted-by":"publisher","DOI":"10.1080\/03081060.2013.798488"},{"key":"e_1_2_10_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trpro.2017.12.131"},{"key":"e_1_2_10_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trpro.2017.05.097"},{"key":"e_1_2_10_36_1","first-page":"1816","article-title":"Waiting and Relocation Strategies in Online Stochastic Vehicle Routing","volume":"7","author":"Bent R.","year":"2007","journal-title":"IJCAI"},{"key":"e_1_2_10_37_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2015.1043403"},{"key":"e_1_2_10_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2021.10.060"},{"key":"e_1_2_10_39_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2016.0719"},{"key":"e_1_2_10_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejtl.2020.100008"},{"key":"e_1_2_10_41_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.20332"},{"key":"e_1_2_10_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCS.2018.00126"},{"key":"e_1_2_10_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2018.05.032"},{"key":"e_1_2_10_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2023.10.014"},{"key":"e_1_2_10_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2013.08.015"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.70017","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full-xml\/10.1002\/net.70017","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.70017","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T04:44:27Z","timestamp":1770871467000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.70017"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,9]]},"references-count":44,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["10.1002\/net.70017"],"URL":"https:\/\/doi.org\/10.1002\/net.70017","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,9]]},"assertion":[{"value":"2024-11-18","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-10-27","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-11-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}