{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T04:56:21Z","timestamp":1777870581441,"version":"3.51.4"},"reference-count":57,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100003130","name":"Fonds Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["G020222N"],"award-info":[{"award-number":["G020222N"]}],"id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003130","name":"Fonds Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["W001321N"],"award-info":[{"award-number":["W001321N"]}],"id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100019618","name":"Vlaams Supercomputer Centrum","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100019618","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100021906","name":"Vermont Studio Center","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100021906","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100011878","name":"Vlaamse regering","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100011878","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.ejor.2025.12.008","type":"journal-article","created":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T00:14:03Z","timestamp":1764980043000},"page":"774-793","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimizing transport operations in a hybrid mobility system for rural-urban transport"],"prefix":"10.1016","volume":"332","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5792-9879","authenticated-orcid":false,"given":"Soukaina","family":"Bayri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6052-6846","authenticated-orcid":false,"given":"Kris","family":"Braekers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9344-7255","authenticated-orcid":false,"given":"Yves","family":"Molenbruch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.ejor.2025.12.008_bib0001","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0360-8352(03)00032-9","article-title":"Hybrid scheduling methods for paratransit operations","volume":"45","author":"Aldaihani","year":"2003","journal-title":"Computers & Industrial Engineering"},{"key":"10.1016\/j.ejor.2025.12.008_bib0002","series-title":"2019 international colloquium on logistics and supply chain management (LOGISTIQUA)","first-page":"1","article-title":"The new formulation for the integrated dial-a-ride problem with timetabled fixed route service","author":"Amor","year":"2019"},{"key":"10.1016\/j.ejor.2025.12.008_bib0003","series-title":"Handbook of heuristics","first-page":"1","article-title":"Heuristics in vehicle routing","author":"Archetti","year":"2025"},{"issue":"5\u20136","key":"10.1016\/j.ejor.2025.12.008_bib0004","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1002\/mcda.1518","article-title":"A multicriteria dial-a-ride problem with an ecological measure and heterogeneous vehicles","volume":"21","author":"Atahran","year":"2014","journal-title":"Journal of Multi-Criteria Decision Analysis"},{"key":"10.1016\/j.ejor.2025.12.008_bib0005","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/j.rtbm.2018.09.001","article-title":"The development of mobility-as-a-service in the helsinki metropolitan area: A multi-level governance analysis","volume":"27","author":"Audouin","year":"2018","journal-title":"Research in Transportation Business & Management"},{"key":"10.1016\/j.ejor.2025.12.008_bib0006","series-title":"Introduction to linear optimization","author":"Bertsimas","year":"1997"},{"key":"10.1016\/j.ejor.2025.12.008_bib0007","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2024.106588","article-title":"A ride time-oriented scheduling algorithm for dial-a-ride problems","volume":"165","author":"Bongiovanni","year":"2024","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2025.12.008_bib0008","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/s00291-012-0284-5","article-title":"Integrated planning of loaded and empty container movements","volume":"35","author":"Braekers","year":"2013","journal-title":"OR Spectrum"},{"issue":"1","key":"10.1016\/j.ejor.2025.12.008_bib0009","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s10288-006-0018-0","article-title":"An effective and fast heuristic for the dial-a-ride problem","volume":"5","author":"Calvo","year":"2007","journal-title":"4or"},{"issue":"3","key":"10.1016\/j.ejor.2025.12.008_bib0010","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1287\/opre.1060.0283","article-title":"A branch-and-cut algorithm for the dial-a-ride problem","volume":"54","author":"Cordeau","year":"2006","journal-title":"Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2025.12.008_bib0011","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1002\/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G","article-title":"A tabu search heuristic for periodic and multi-depot vehicle routing problems","volume":"30","author":"Cordeau","year":"1997","journal-title":"Networks: An International Journal"},{"key":"10.1016\/j.ejor.2025.12.008_bib0012","first-page":"89","article-title":"The dial-a-ride problem (DARP): Variants, modeling issues and algorithms","volume":"1","author":"Cordeau","year":"2003","journal-title":"Quarterly Journal of the Belgian, French and Italian Operations Research Societies"},{"issue":"6","key":"10.1016\/j.ejor.2025.12.008_bib0013","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1016\/S0191-2615(02)00045-0","article-title":"A tabu search heuristic for the static multi-vehicle dial-a-ride problem","volume":"37","author":"Cordeau","year":"2003","journal-title":"Transportation Research Part B: Methodological"},{"key":"10.1016\/j.ejor.2025.12.008_bib0014","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s10479-007-0170-8","article-title":"The dial-a-ride problem: Models and algorithms","volume":"153","author":"Cordeau","year":"2007","journal-title":"Annals of Operations Research"},{"key":"10.1016\/j.ejor.2025.12.008_bib0015","doi-asserted-by":"crossref","DOI":"10.1016\/j.trc.2024.104869","article-title":"The dial-a-ride problem with meeting points: A problem formulation for shared demand\u2013responsive transit","volume":"169","author":"Cortenbach","year":"2024","journal-title":"Transportation Research Part C: Emerging Technologies"},{"issue":"1","key":"10.1016\/j.ejor.2025.12.008_bib0016","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0021-9991(90)90201-B","article-title":"Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing","volume":"90","author":"Dueck","year":"1990","journal-title":"Journal of Computational Physics"},{"issue":"6","key":"10.1016\/j.ejor.2025.12.008_bib0017","doi-asserted-by":"crossref","first-page":"3252","DOI":"10.3390\/su14063252","article-title":"Potential benefits of demand responsive transport in rural areas: A simulation study in lolland, denmark","volume":"14","author":"Dytckov","year":"2022","journal-title":"Sustainability"},{"issue":"2","key":"10.1016\/j.ejor.2025.12.008_bib0018","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/j.ejor.2013.01.001","article-title":"A review of urban transportation network design problems","volume":"229","author":"Farahani","year":"2013","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2025.12.008_bib0019","doi-asserted-by":"crossref","first-page":"1048","DOI":"10.1016\/j.ejor.2021.11.053","article-title":"Event-based MILP models for ridepooling applications","volume":"301","author":"Gaul","year":"2022","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2025.12.008_bib0020","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1287\/trsc.2018.0837","article-title":"Adaptive large neighborhood search with a constant-time feasibility test for the dial-a-ride problem","volume":"53","author":"Gschwind","year":"2019","journal-title":"Transportation Science"},{"key":"10.1016\/j.ejor.2025.12.008_bib0021","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/s12469-008-0006-1","article-title":"The integrated dial-a-ride problem","volume":"1","author":"H\u00e4ll","year":"2009","journal-title":"Public Transport"},{"issue":"4","key":"10.1016\/j.ejor.2025.12.008_bib0022","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1080\/03081060.2013.798488","article-title":"Improving paratransit scheduling using ruin and recreate methods","volume":"36","author":"H\u00e4ll","year":"2013","journal-title":"Transportation Planning and Technology"},{"issue":"5","key":"10.1016\/j.ejor.2025.12.008_bib0023","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1111\/itor.12273","article-title":"Evaluating the importance of randomization in adaptive large neighborhood search","volume":"24","author":"Hemmati","year":"2017","journal-title":"International Transactions in Operational Research"},{"key":"10.1016\/j.ejor.2025.12.008_bib0024","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/j.trb.2018.02.001","article-title":"A survey of dial-a-ride problems: Literature review and recent developments","volume":"111","author":"Ho","year":"2018","journal-title":"Transportation Research Part B: Methodological"},{"issue":"2","key":"10.1016\/j.ejor.2025.12.008_bib0025","doi-asserted-by":"crossref","first-page":"13","DOI":"10.17645\/up.v2i2.931","article-title":"Mobility as a service: A critical review of definitions, assessments of schemes, and key challenges","volume":"2","author":"Jittrapirom","year":"2017","journal-title":"Urban Planning"},{"issue":"10","key":"10.1016\/j.ejor.2025.12.008_bib0026","doi-asserted-by":"crossref","first-page":"1321","DOI":"10.1057\/palgrave.jors.2602287","article-title":"Solving the dial-a-ride problem using genetic algorithms","volume":"58","author":"Jorgensen","year":"2007","journal-title":"Journal of the Operational Research Society"},{"issue":"5","key":"10.1016\/j.ejor.2025.12.008_bib0027","doi-asserted-by":"crossref","first-page":"552","DOI":"10.1109\/3468.531903","article-title":"A decision support system for the bimodal dial-a-ride problem","volume":"26","author":"Liaw","year":"1996","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics-Part A: Systems and Humans"},{"key":"10.1016\/j.ejor.2025.12.008_bib0028","series-title":"Proceedings of the institution of civil engineers-transport","first-page":"353","article-title":"Transport poverty and its adverse social consequences","volume":"vol. 169","author":"Lucas","year":"2016"},{"key":"10.1016\/j.ejor.2025.12.008_bib0029","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cor.2016.12.008","article-title":"A hybrid genetic algorithm for the heterogeneous dial-a-ride problem","volume":"81","author":"Masmoudi","year":"2017","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2025.12.008_bib0030","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.cor.2013.07.020","article-title":"The dial-a-ride problem with transfers","volume":"41","author":"Masson","year":"2014","journal-title":"Computers & Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2025.12.008_bib0031","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1504\/IJOR.2011.038585","article-title":"A tabu search heuristic for solving the multi-depot, multi-vehicle, double request dial-a-ride problem faced by a healthcare organisation","volume":"10","author":"Melachrinoudis","year":"2011","journal-title":"International Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.12.008_bib0032","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2022.105941","article-title":"The real-time on-demand bus routing problem: The cost of dynamic requests","volume":"147","author":"Melis","year":"2022","journal-title":"Computers & Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2025.12.008_bib0033","doi-asserted-by":"crossref","first-page":"1417","DOI":"10.1111\/itor.13058","article-title":"The static on-demand bus routing problem: Large neighborhood search for a dial-a-ride problem with bus station assignment","volume":"29","author":"Melis","year":"2022","journal-title":"International Transactions in Operational Research"},{"key":"10.1016\/j.ejor.2025.12.008_bib0034","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.tre.2017.09.001","article-title":"Benefits of horizontal cooperation in dial-a-ride services","volume":"107","author":"Molenbruch","year":"2017","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"10.1016\/j.ejor.2025.12.008_bib0035","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/s10479-017-2525-0","article-title":"Typology and literature review for dial-a-ride problems","volume":"259","author":"Molenbruch","year":"2017","journal-title":"Annals of Operations Research"},{"key":"10.1016\/j.ejor.2025.12.008_bib0036","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/j.cor.2016.07.020","article-title":"Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation","volume":"77","author":"Molenbruch","year":"2017","journal-title":"Computers & Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2025.12.008_bib0037","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/j.ejor.2020.07.060","article-title":"Analyzing the benefits of an integrated mobility system using a matheuristic routing algorithm","volume":"290","author":"Molenbruch","year":"2021","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"10.1016\/j.ejor.2025.12.008_bib0038","doi-asserted-by":"crossref","first-page":"1721","DOI":"10.1016\/j.cie.2008.07.005","article-title":"Quality of service in dial-a-ride operations","volume":"56","author":"Paquette","year":"2009","journal-title":"Computers & Industrial Engineering"},{"issue":"4","key":"10.1016\/j.ejor.2025.12.008_bib0039","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1002\/net.20335","article-title":"A heuristic two-phase solution approach for the multi-objective dial-a-ride problem","volume":"54","author":"Parragh","year":"2009","journal-title":"Networks"},{"issue":"1","key":"10.1016\/j.ejor.2025.12.008_bib0040","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s00291-021-00656-7","article-title":"An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization","volume":"44","author":"Pfeiffer","year":"2022","journal-title":"Or Spectrum"},{"issue":"12","key":"10.1016\/j.ejor.2025.12.008_bib0041","doi-asserted-by":"crossref","first-page":"1187","DOI":"10.1016\/j.ifacol.2016.07.668","article-title":"Heuristic approaches to solve a generalized dial-a-ride problem applied to car-pooling","volume":"49","author":"Pinson","year":"2016","journal-title":"IFAC-PapersOnLine"},{"issue":"8","key":"10.1016\/j.ejor.2025.12.008_bib0042","doi-asserted-by":"crossref","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","article-title":"A general heuristic for vehicle routing problems","volume":"34","author":"Pisinger","year":"2007","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2025.12.008_bib0043","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/978-3-319-91086-4_4","article-title":"Large neighborhood search","author":"Pisinger","year":"2019","journal-title":"Handbook of Metaheuristics"},{"key":"10.1016\/j.ejor.2025.12.008_bib0044","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/s12469-016-0128-9","article-title":"The integrated dial-a-ride problem with timetabled fixed route service","volume":"9","author":"Posada","year":"2017","journal-title":"Public Transport"},{"issue":"3","key":"10.1016\/j.ejor.2025.12.008_bib0045","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1080\/12265934.2019.1709533","article-title":"A metaheuristic for evaluation of an integrated special transport service","volume":"24","author":"Posada","year":"2020","journal-title":"International Journal of Urban Sciences"},{"key":"10.1016\/j.ejor.2025.12.008_bib0046","doi-asserted-by":"crossref","DOI":"10.1016\/j.tre.2023.103140","article-title":"Integrating dial-a-ride with transportation network companies for cost efficiency: A maryland case study","volume":"175","author":"Rahman","year":"2023","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"1","key":"10.1016\/j.ejor.2025.12.008_bib0047","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/j.ejor.2012.09.008","article-title":"Synchronized dial-a-ride transportation of disabled passengers at airports","volume":"225","author":"Reinhardt","year":"2013","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.12.008_bib0048","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/j.trc.2017.04.003","article-title":"Vehicle routing with roaming delivery locations","volume":"80","author":"Reyes","year":"2017","journal-title":"Transportation Research Part C: Emerging Technologies"},{"key":"10.1016\/j.ejor.2025.12.008_bib0049","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2022.105933","article-title":"The dial-a-ride problem with private fleet and common carrier","volume":"147","author":"Schenekemberg","year":"2022","journal-title":"Computers & Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2025.12.008_bib0050","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1016\/j.ejor.2023.07.002","article-title":"Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems","volume":"312","author":"Schulz","year":"2024","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.12.008_bib0051","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2024.106530","article-title":"Revised eight-step feasibility checking procedure with linear time complexity for the dial-a-ride problem (DARP)","volume":"164","author":"Sohrabi","year":"2024","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2025.12.008_bib0052","series-title":"Integrated strategic and tactical planning for public transport bus systems","author":"Steiner","year":"2019"},{"issue":"2","key":"10.1016\/j.ejor.2025.12.008_bib0053","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1016\/j.ejor.2020.10.045","article-title":"Meta-analysis of metaheuristics: Quantifying the effect of adaptiveness in adaptive large neighborhood search","volume":"292","author":"Turke\u0161","year":"2021","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.12.008_bib0054","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.rtbm.2018.10.005","article-title":"Review on mobility as a service in scientific publications","volume":"27","author":"Utriainen","year":"2018","journal-title":"Research in Transportation Business & Management"},{"key":"10.1016\/j.ejor.2025.12.008_bib0055","doi-asserted-by":"crossref","DOI":"10.1016\/j.trc.2022.103573","article-title":"A survey on demand-responsive public bus systems","volume":"137","author":"Vansteenwegen","year":"2022","journal-title":"Transportation Research Part C: Emerging Technologies"},{"key":"10.1016\/j.ejor.2025.12.008_bib0056","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Cats, O., & Azadeh, S. S. (2025). Dynamic preference-based multi-modal trip planning of public transport and shared mobility. arXiv: 2502.14528.","DOI":"10.1016\/j.tre.2025.104286"},{"issue":"6","key":"10.1016\/j.ejor.2025.12.008_bib0057","doi-asserted-by":"crossref","first-page":"1121","DOI":"10.1016\/j.engappai.2012.03.012","article-title":"A multi-objective simulated annealing for the multi-criteria dial a ride problem","volume":"25","author":"Zidi","year":"2012","journal-title":"Engineering Applications of Artificial Intelligence"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221725009750?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221725009750?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T16:24:08Z","timestamp":1777566248000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221725009750"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":57,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,8]]}},"alternative-id":["S0377221725009750"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2025.12.008","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Optimizing transport operations in a hybrid mobility system for rural-urban transport","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2025.12.008","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}