{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:08:23Z","timestamp":1750219703467,"version":"3.41.0"},"reference-count":34,"publisher":"Association for Computing Machinery (ACM)","license":[{"start":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T00:00:00Z","timestamp":1703116800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ACM J. Exp. Algorithmics"],"published-print":{"date-parts":[[2023,12,31]]},"abstract":"<jats:p>\n            Over the last decades, new mobility offers have emerged to enlarge the coverage and the accessibility of public transportation systems. In many areas, public transit now incorporates on-demand transport lines, that can be activated at user need. In this paper, we propose to integrate lines without predefined schedules but with predefined stop sequences into a state-of-the-art trip planning algorithm for public transit, the Trip-Based Public Transit Routing algorithm\u00a0[\n            <jats:xref ref-type=\"bibr\">33<\/jats:xref>\n            ]. We extend this algorithm to non-scheduled lines and explain how to model other modes of transportation, such as bike sharing, with this approach. The resulting algorithm is exact and optimizes two criteria: the earliest arrival time and the minimal number of transfers. Experiments on two large datasets show the interest of the proposed method over a baseline modelling.\n          <\/jats:p>","DOI":"10.1145\/3632969","type":"journal-article","created":{"date-parts":[[2023,11,24]],"date-time":"2023-11-24T11:30:47Z","timestamp":1700825447000},"page":"1-16","source":"Crossref","is-referenced-by-count":0,"title":["Routing in Multimodal Transportation Networks with Non-scheduled Lines"],"prefix":"10.1145","volume":"28","author":[{"given":"Darko","family":"Drakulic","sequence":"first","affiliation":[{"name":"NAVER LABS Europe, France"}]},{"given":"Christelle","family":"Loiodice","sequence":"additional","affiliation":[{"name":"NAVER LABS Europe, France"}]},{"given":"Vassilissa","family":"Lehoux","sequence":"additional","affiliation":[{"name":"NAVER LABS Europe, France"}]}],"member":"320","published-online":{"date-parts":[[2023,12,21]]},"reference":[{"key":"e_1_3_1_2_2","unstructured":"Transports Montalbanais. (n.d.). https:\/\/www.montm.com\/transport-a-la-demande-et-pmr\/Access date: 2021\/03\/29."},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539798337716"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03456-5_24"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.5555\/1888935.1888969"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49487-6_2"},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974317.2"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ESA.2019.14"},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2017.09.001"},{"key":"e_1_3_1_10_2","unstructured":"datahub. Timetables for transit in Netherlands. (n.d.). https:\/\/old.datahub.io\/dataset\/gtfs-nlAccess date: 2019\/07\/29."},{"key":"e_1_3_1_11_2","unstructured":"\u00cele de France Mobilit\u00e9s. Open Data portal. (n.d.). https:\/\/data.iledefrance-mobilites.fr\/pages\/home\/Access date: 2020\/05\/04."},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975499.5"},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38527-8_24"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-20086-6_21"},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2014.0534"},{"key":"e_1_3_1_16_2","unstructured":"Syndicat Mixte des Mobilit\u00e9s de l\u2019Aire Grenobloise. Horaires th\u00e9oriques du r\u00e9seau TAG. (n.d.). https:\/\/transport.data.gouv.fr\/datasets\/horaires-theoriques-du-reseau-tag\/Access date: 2020\/05\/04."},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38527-8_6"},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972924.12"},{"key":"e_1_3_1_19_2","unstructured":"Agglo du Pays de Dreux. Lin\u00e9ad. (n.d.). https:\/\/www.linead.fr\/8-Transport-a-la-demande.htmlAccess date: 2021\/03\/29."},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68552-4_24"},{"key":"e_1_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.3390\/a12100213"},{"key":"e_1_3_1_22_2","first-page":"156","volume-title":"Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201905)","author":"Goldberg Andrew","year":"2005","unstructured":"Andrew Goldberg and Chris Harrelson. 2005. Computing the shortest path: A* search meets graph theory. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201905). SIAM, 156\u2013165."},{"key":"e_1_3_1_23_2","unstructured":"GTFS. General Transit Feed Specification. (n.d.). https:\/\/gtfs.org\/Access date: 2021\/03\/29."},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-48782-8_9"},{"key":"e_1_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/2670126"},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.4230\/OASIcs.ATMOS.2019.13"},{"key":"e_1_3_1_27_2","volume-title":"Mobility on Demand (MOD) Sandbox: Vermont Agency of Transportation (VTrans) Flexible Trip Planner","author":"MacDonald Ross","year":"2020","unstructured":"Ross MacDonald. 2020. Mobility on Demand (MOD) Sandbox: Vermont Agency of Transportation (VTrans) Flexible Trip Planner. Technical Report 0150. Federal Transit Administration (FTA) Research."},{"key":"e_1_3_1_28_2","unstructured":"Transports publics de Flers Agglo. N\u00e9mus. (n.d.). https:\/\/nemus.flers-agglo.fr\/se-deplacer\/transport-a-la-demandeAccess date: 2021\/03\/29."},{"key":"e_1_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/1227161.1227166"},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.21815"},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.SEA.2020.16"},{"key":"e_1_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1049\/iet-its.2016.0265"},{"key":"e_1_3_1_33_2","unstructured":"GTFS-Flex v2. Flexible public transit services in GTFS. (n.d.). https:\/\/github.com\/MobilityData\/gtfs-flex\/blob\/master\/spec\/reference.md"},{"key":"e_1_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48350-3_85"},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.4230\/OASIcs.ATMOS.2016.10"}],"container-title":["ACM Journal of Experimental Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3632969","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3632969","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:35:50Z","timestamp":1750178150000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3632969"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,21]]},"references-count":34,"alternative-id":["10.1145\/3632969"],"URL":"https:\/\/doi.org\/10.1145\/3632969","relation":{},"ISSN":["1084-6654","1084-6654"],"issn-type":[{"type":"print","value":"1084-6654"},{"type":"electronic","value":"1084-6654"}],"subject":[],"published":{"date-parts":[[2023,12,21]]}}}