{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T04:33:21Z","timestamp":1777869201550,"version":"3.51.4"},"reference-count":61,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T00:00:00Z","timestamp":1771459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100005669","name":"Research Support Foundation of Para\u00edba State","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100005669","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"National Council for Scientific and Technological Development","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.cor.2026.107436","type":"journal-article","created":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T00:16:01Z","timestamp":1771460161000},"page":"107436","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["On solving a share-a-ride problem with forbidden passenger detours"],"prefix":"10.1016","volume":"190","author":[{"given":"Ana Beatriz","family":"Herthel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9431-3750","authenticated-orcid":false,"given":"Teobaldo","family":"Bulh\u00f5es","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anand","family":"Subramanian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0461-0979","authenticated-orcid":false,"given":"Richard F.","family":"Hartl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.cor.2026.107436_b1","series-title":"Constraint Integer Programming","author":"Achterberg","year":"2007"},{"key":"10.1016\/j.cor.2026.107436_b2","series-title":"Ride-hailing\u2019s climate risks: Steering a growing industry toward a clean transportation future","author":"Anair","year":"2020"},{"issue":"5","key":"10.1016\/j.cor.2026.107436_b3","doi-asserted-by":"crossref","first-page":"1269","DOI":"10.1287\/opre.1110.0975","article-title":"New route relaxation and pricing strategies for the vehicle routing problem","volume":"59","author":"Baldacci","year":"2011","journal-title":"Oper. Res."},{"issue":"5","key":"10.1016\/j.cor.2026.107436_b4","doi-asserted-by":"crossref","first-page":"1269","DOI":"10.1287\/opre.1110.0975","article-title":"New route relaxation and pricing strategies for the vehicle routing problem","volume":"59","author":"Baldacci","year":"2011","journal-title":"Oper. Res."},{"issue":"5","key":"10.1016\/j.cor.2026.107436_b5","doi-asserted-by":"crossref","first-page":"1359","DOI":"10.1287\/trsc.2022.0085","article-title":"A new family of route formulations for split delivery vehicle routing problems","volume":"57","author":"Balster","year":"2023","journal-title":"Transp. Sci."},{"key":"10.1016\/j.cor.2026.107436_b6","series-title":"Vehicle Routing","first-page":"161","article-title":"Chapter 6: Pickup-and-delivery problems for goods transportation","author":"Battarra","year":"2014"},{"issue":"2","key":"10.1016\/j.cor.2026.107436_b7","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1080\/03052159808941240","article-title":"Intractability of the dial-a-ride problem and a multiobjective solution using simulated annealing","volume":"30","author":"Baugh Jr.","year":"1998","journal-title":"Eng. Optim."},{"issue":"9","key":"10.1016\/j.cor.2026.107436_b8","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1016\/j.ifacol.2018.07.064","article-title":"Integrating people and freight transportation using shared autonomous vehicles with compartments","volume":"51","author":"Beirigo","year":"2018","journal-title":"IFAC-PapersOnLine"},{"key":"10.1016\/j.cor.2026.107436_b9","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.cor.2018.01.016","article-title":"A branch-and-price algorithm for the minimum latency problem","volume":"93","author":"Bulh\u00f5es","year":"2018","journal-title":"Comput. Oper. Res."},{"issue":"8","key":"10.1016\/j.cor.2026.107436_b10","doi-asserted-by":"crossref","DOI":"10.3390\/su13084362","article-title":"Implementing horizontal cooperation in public transport and parcel deliveries: The cooperative share-a-ride problem","volume":"13","author":"Cavagnini","year":"2021","journal-title":"Sustainability"},{"key":"10.1016\/j.cor.2026.107436_b11","article-title":"Integration of passenger and freight transport: A concept-centric literature review","volume":"43","author":"Cavallaro","year":"2022","journal-title":"Res. Transp. Bus. Manag."},{"issue":"7","key":"10.1016\/j.cor.2026.107436_b12","doi-asserted-by":"crossref","first-page":"1833","DOI":"10.1080\/00207543.2016.1173258","article-title":"Using taxis to collect citywide e-commerce reverse flows: A crowdsourcing solution","volume":"55","author":"Chen","year":"2017","journal-title":"Int. J. Prod. Res."},{"issue":"3","key":"10.1016\/j.cor.2026.107436_b13","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1016\/j.ejor.2018.04.037","article-title":"Collaborative urban transportation: Recent advances in theory and practice","volume":"273","author":"Cleophas","year":"2019","journal-title":"European J. Oper. Research"},{"key":"10.1016\/j.cor.2026.107436_b14","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/j.disopt.2014.03.001","article-title":"A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints","volume":"12","author":"Contardo","year":"2014","journal-title":"Discrete Optim."},{"issue":"2","key":"10.1016\/j.cor.2026.107436_b15","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 J. Belg. Fr. Ital. Oper. Res. Societies"},{"issue":"17","key":"10.1016\/j.cor.2026.107436_b16","doi-asserted-by":"crossref","DOI":"10.3390\/su141710861","article-title":"Branch-and-price-and-cut for the heterogeneous fleet and multi-depot static bike rebalancing problem with split load","volume":"14","author":"Ding","year":"2022","journal-title":"Sustainability"},{"key":"10.1016\/j.cor.2026.107436_b17","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.datak.2017.06.002","article-title":"A time-dependent model with speed windows for share-a-ride problems: A case study for tokyo transportation","volume":"114","author":"Do","year":"2018","journal-title":"Data Knowl. Engineering"},{"key":"10.1016\/j.cor.2026.107436_b18","doi-asserted-by":"crossref","unstructured":"Elkout, E., Nouri, H.E., Belkahla Driss, O., 2023. Simulated Annealing for the Green Share-A-Ride Problem. In: 2023 IEEE International Conference on Artificial Intelligence & Green Energy. ICAIGE, pp. 1\u20136.","DOI":"10.1109\/ICAIGE58321.2023.10346564"},{"key":"10.1016\/j.cor.2026.107436_b19","series-title":"Europe\u2019s giant \u2018taxi\u2019 company: Is uber part of the problem or the solution?","author":"Environment","year":"2019"},{"key":"10.1016\/j.cor.2026.107436_b20","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/j.cor.2014.03.028","article-title":"A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands","volume":"50","author":"Gauvin","year":"2014","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2026.107436_b21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2023.11.032","article-title":"Vehicle routing problems with multiple commodities: A survey","volume":"317","author":"Gu","year":"2024","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107436_b22","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":"\u201dTransportation Res. Part B: Methodological\u201d"},{"key":"10.1016\/j.cor.2026.107436_b23","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/j.trb.2014.09.011","article-title":"The shared-taxi problem: Formulation and solution methods","volume":"70","author":"Hosni","year":"2014","journal-title":"Transp. Res. Part B: Methodol."},{"key":"10.1016\/j.cor.2026.107436_b24","series-title":"Global post industry report 2020: Key findings","author":"International Post Corporation","year":"2021"},{"issue":"2","key":"10.1016\/j.cor.2026.107436_b25","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1287\/opre.1070.0449","article-title":"Subset-row inequalities applied to the vehicle-routing problem with time windows","volume":"56","author":"Jepsen","year":"2008","journal-title":"Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2026.107436_b26","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1287\/trsc.1110.0399","article-title":"A branch-and-cut algorithm for the symmetric two-echelon capacitated vehicle routing problem","volume":"47","author":"Jepsen","year":"2013","journal-title":"Transp. Sci."},{"key":"10.1016\/j.cor.2026.107436_b27","first-page":"242","article-title":"Modeling individuals\u2019 willingness to share trips with strangers in an autonomous vehicle future","volume":"124","author":"Lavieri","year":"2019","journal-title":"Transp. Res. Part A: Policy Pr."},{"key":"10.1016\/j.cor.2026.107436_b28","first-page":"199","article-title":"To pool or not to pool? Understanding opportunities, challenges, and equity considerations to expanding the market for pooling","volume":"148","author":"Lazarus","year":"2021","journal-title":"Transp. Res. Part A: Policy Pr."},{"issue":"1","key":"10.1016\/j.cor.2026.107436_b29","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.ejor.2014.03.003","article-title":"The share-a-ride problem: People and parcels sharing taxis","volume":"238","author":"Li","year":"2014","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107436_b30","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/j.cor.2015.08.008","article-title":"An adaptive large neighborhood search heuristic for the share-a-ride problem","volume":"66","author":"Li","year":"2016","journal-title":"Computers Oper. Research"},{"key":"10.1016\/j.cor.2026.107436_b31","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/j.trc.2016.01.014","article-title":"The share-a-ride problem with stochastic travel times and stochastic delivery locations","volume":"67","author":"Li","year":"2016","journal-title":"Transportation Res. Part C: Emerg. Technologies"},{"key":"10.1016\/j.cor.2026.107436_b32","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1016\/j.trc.2019.01.030","article-title":"Characterization of ridesplitting based on observed data: A case study of Chengdu, China","volume":"100","author":"Li","year":"2019","journal-title":"Transp. Res. Part C: Emerg. Technol."},{"key":"10.1016\/j.cor.2026.107436_b33","doi-asserted-by":"crossref","DOI":"10.1016\/j.tre.2021.102546","article-title":"Combined passenger and parcel transportation using a mixed fleet of electric and gasoline vehicles","volume":"157","author":"Lu","year":"2022","journal-title":"Transp. Res. Part E: Logist. Transp. Rev."},{"key":"10.1016\/j.cor.2026.107436_b34","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2020.105196","article-title":"A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem","volume":"129","author":"Malheiros","year":"2021","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107436_b35","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/j.trb.2019.02.003","article-title":"A survey of models and algorithms for optimizing shared mobility","volume":"123","author":"Mourad","year":"2019","journal-title":"Transportation Res. Part B: Methodological"},{"issue":"2","key":"10.1016\/j.cor.2026.107436_b36","doi-asserted-by":"crossref","first-page":"220","DOI":"10.4218\/etrij.2021-0406","article-title":"Novel online routing algorithms for smart people-parcel taxi sharing services","volume":"44","author":"Nguyen Van","year":"2022","journal-title":"ETRI J."},{"key":"10.1016\/j.cor.2026.107436_b37","doi-asserted-by":"crossref","unstructured":"Notice, D., Soleimani, H., Pavlidis, N.G., Kheiri, A., Mu\u00f1oz, M.A., 2025. Instance Space Analysis of the Capacitated Vehicle Routing Problem with Mixture Discriminant Analysis. In: Proceedings of the Genetic and Evolutionary Computation Conference. pp. 1172\u20131180.","DOI":"10.1145\/3712256.3726405"},{"key":"10.1016\/j.cor.2026.107436_b38","doi-asserted-by":"crossref","DOI":"10.1007\/s10288-025-00584-0","article-title":"New cuts and a branch-cut-and-price model for the multi-vehicle covering tour problem","author":"Oliveira","year":"2025","journal-title":"4OR-Q J Oper Res"},{"key":"10.1016\/j.cor.2026.107436_b39","series-title":"TSPPD test instance library","author":"O\u2019Neil","year":"2017"},{"issue":"3","key":"10.1016\/j.cor.2026.107436_b40","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1287\/ijoc.2016.0744","article-title":"New enhancements for the exact solution of the vehicle routing problem with time windows","volume":"29","author":"Pecin","year":"2017","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/j.cor.2026.107436_b41","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s12532-016-0108-8","article-title":"Improved branch-cut-and-price for capacitated vehicle routing","volume":"9","author":"Pecin","year":"2017","journal-title":"Math. Program. Comput."},{"issue":"2","key":"10.1016\/j.cor.2026.107436_b42","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1287\/ijoc.2017.0784","article-title":"Automation and combination of linear-programming based stabilization techniques in column generation","volume":"30","author":"Pessoa","year":"2018","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/j.cor.2026.107436_b43","doi-asserted-by":"crossref","DOI":"10.1007\/s10288-025-00585-z","article-title":"A tutorial on branch-price-and-cut algorithms","volume":"23","author":"Petris","year":"2025","journal-title":"4OR"},{"key":"10.1016\/j.cor.2026.107436_b44","unstructured":"Poggi, M., Uchoa, E., 2003. Integer program reformulation for robust branch-and-cut-and-price. In: Wolsey, L. (Ed.), Annals of Mathematical Programming in Rio. B\u00fazios, Brazil, pp. 56\u201361."},{"issue":"9","key":"10.1016\/j.cor.2026.107436_b45","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1016\/S0305-0548(99)00066-0","article-title":"A heuristic for the pickup and delivery traveling salesman problem","volume":"27","author":"Renaud","year":"2000","journal-title":"Computers Oper. Research"},{"issue":"3","key":"10.1016\/j.cor.2026.107436_b46","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1287\/trsc.2013.0474","article-title":"Dynamic ng-path relaxation for the delivery man problem","volume":"48","author":"Roberti","year":"2014","journal-title":"Transp. Sci."},{"key":"10.1016\/j.cor.2026.107436_b47","series-title":"Branching decisions in branch-and-cut-and-price algorithms for vehicle routing problems","author":"R\u00f8pke","year":"2012"},{"issue":"1","key":"10.1016\/j.cor.2026.107436_b48","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/trsc.2020.0985","article-title":"A bucket graph\u2013based labeling algorithm with application to vehicle routing","volume":"55","author":"Sadykov","year":"2021","journal-title":"Transp. Sci."},{"key":"10.1016\/j.cor.2026.107436_b49","series-title":"BaPCod - A Generic Branch-And-Price Code","author":"Sadykov","year":"2021"},{"key":"10.1016\/j.cor.2026.107436_b50","series-title":"Sustainable Transportation and Smart Logistics","first-page":"381","article-title":"Chapter 15 - Crowd-based city logistics","author":"Sampaio","year":"2019"},{"key":"10.1016\/j.cor.2026.107436_b51","series-title":"Unsustainable? The Growth of App-Based Ride Services and Traffic, Travel and the Future of New York City","author":"Schaller","year":"2017"},{"issue":"2","key":"10.1016\/j.cor.2026.107436_b52","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1002\/net.3230110212","article-title":"Formulation and structure of more complex\/realistic routing and scheduling problems","volume":"11","author":"Schrage","year":"1981","journal-title":"Networks"},{"issue":"12","key":"10.1016\/j.cor.2026.107436_b53","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3572895","article-title":"Instance space analysis for algorithm testing: Methodology and software tools","volume":"55","author":"Smith-Miles","year":"2023","journal-title":"ACM Comput. Surv."},{"key":"10.1016\/j.cor.2026.107436_b54","series-title":"Melbourne algorithm test instance library with data analytics (MATILDA)","author":"Smith-Miles","year":"2020"},{"key":"10.1016\/j.cor.2026.107436_b55","doi-asserted-by":"crossref","first-page":"1899","DOI":"10.1016\/j.cor.2009.10.011","article-title":"A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery","volume":"37","author":"Subramanian","year":"2010","journal-title":"Comput. or"},{"key":"10.1016\/j.cor.2026.107436_b56","series-title":"Uber movement","author":"Uber","year":"2017"},{"key":"10.1016\/j.cor.2026.107436_b57","series-title":"RouteOpt: An open-source modular exact solver for vehicle routing problems","author":"You","year":"2025"},{"key":"10.1016\/j.cor.2026.107436_b58","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.120569","article-title":"A matheuristic algorithm for the share-a-ride problem","volume":"230","author":"Yu","year":"2023","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.cor.2026.107436_b59","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.119044","article-title":"The multi-depot general share-a-ride problem","volume":"213","author":"Yu","year":"2023","journal-title":"Expert Syst. Appl."},{"issue":"7","key":"10.1016\/j.cor.2026.107436_b60","doi-asserted-by":"crossref","first-page":"1178","DOI":"10.1080\/0305215X.2018.1437153","article-title":"Simulated annealing heuristic for the general share-a-ride problem","volume":"50","author":"Yu","year":"2018","journal-title":"Eng. Optim."},{"key":"10.1016\/j.cor.2026.107436_b61","doi-asserted-by":"crossref","DOI":"10.1016\/j.tre.2023.103073","article-title":"The ride-hailing sharing problem with parcel transportation","volume":"172","author":"Zhan","year":"2023","journal-title":"Transp. Res. Part E: Logist. Transp. Rev."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826000547?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826000547?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T13:18:09Z","timestamp":1777555089000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054826000547"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":61,"alternative-id":["S0305054826000547"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2026.107436","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On solving a share-a-ride problem with forbidden passenger detours","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2026.107436","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Authors. Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}],"article-number":"107436"}}