{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T05:31:37Z","timestamp":1736400697941,"version":"3.32.0"},"reference-count":55,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2024,11,14]],"date-time":"2024-11-14T00:00:00Z","timestamp":1731542400000},"content-version":"vor","delay-in-days":287,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2024,2]]},"DOI":"10.1016\/j.cor.2023.106467","type":"journal-article","created":{"date-parts":[[2023,10,31]],"date-time":"2023-10-31T23:13:20Z","timestamp":1698794000000},"page":"106467","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":7,"special_numbering":"C","title":["A unified exact approach for a broad class of vehicle routing problems with simultaneous pickup and delivery"],"prefix":"10.1016","volume":"162","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0123-0337","authenticated-orcid":false,"given":"Rafael","family":"Praxedes","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9431-3750","authenticated-orcid":false,"given":"Teobaldo","family":"Bulh\u00f5es","sequence":"additional","affiliation":[]},{"given":"Anand","family":"Subramanian","sequence":"additional","affiliation":[]},{"given":"Eduardo","family":"Uchoa","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"2007","series-title":"Constraint Integer Programming","author":"Achterberg","key":"10.1016\/j.cor.2023.106467_b1"},{"key":"10.1016\/j.cor.2023.106467_b2","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/j.orl.2019.11.005","article-title":"A new model for the asymmetric vehicle routing problem with simultaneous pickup and deliveries","volume":"48","author":"Agarwal","year":"2020","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"10.1016\/j.cor.2023.106467_b3","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1002\/net.22069","article-title":"New valid inequalities for the symmetric vehicle routing problem with simultaneous pickup and deliveries","volume":"79","author":"Agarwal","year":"2021","journal-title":"Networks"},{"key":"10.1016\/j.cor.2023.106467_b4","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2022.105896","article-title":"A branch-and-price algorithm for a routing problem with inbound and outbound requests","volume":"146","author":"Agius","year":"2022","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2023.106467_b5","series-title":"Quantitative Approaches To Distribution Logistics and Supply Chain Management","first-page":"249","article-title":"The vehicle routing problem with time windows and simultaneous pick-up and delivery","author":"Angelelli","year":"2002"},{"key":"10.1016\/j.cor.2023.106467_b6","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/j.eswa.2016.01.038","article-title":"A hybrid metaheuristic algorithm for heterogeneous vehicle routing problem with simultaneous pickup and delivery","volume":"53","author":"Avci","year":"2016","journal-title":"Expert Syst. Appl."},{"issue":"5","key":"10.1016\/j.cor.2023.106467_b7","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."},{"key":"10.1016\/j.cor.2023.106467_b8","doi-asserted-by":"crossref","first-page":"968","DOI":"10.1016\/j.ejor.2005.06.074","article-title":"Using clustering analysis in a capacitated location-routing problem","volume":"179","author":"Barreto","year":"2007","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2023.106467_b9","series-title":"Vehicle Routing","first-page":"161","article-title":"Chapter 6: Pickup-and-delivery problems for goods transportation","author":"Battarra","year":"2014"},{"key":"10.1016\/j.cor.2023.106467_b10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11750-007-0009-0","article-title":"Static pickup and delivery problems: a classification scheme and survey","volume":"15","author":"Berbeglia","year":"2007","journal-title":"TOP"},{"key":"10.1016\/j.cor.2023.106467_b11","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1016\/j.ejor.2009.04.024","article-title":"Dynamic pickup and delivery problems","volume":"202","author":"Berbeglia","year":"2010","journal-title":"European J. Oper. Res."},{"issue":"1\u20132","key":"10.1016\/j.cor.2023.106467_b12","first-page":"77","article-title":"The vehicle routing problem with simultaneous delivery and pickup: a taxonomic survey","volume":"41","author":"Bouanane","year":"2022","journal-title":"Int. J. Logist. Syst. Manage."},{"key":"10.1016\/j.cor.2023.106467_b13","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":"3","key":"10.1016\/j.cor.2023.106467_b14","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BF02592196","article-title":"0, 1\/2-Chv\u00e1tal-Gomory cuts","volume":"74","author":"Caprara","year":"1996","journal-title":"Math. Programm. Ser. B"},{"issue":"5","key":"10.1016\/j.cor.2023.106467_b15","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1057\/palgrave.jors.2602028","article-title":"Vehicle routing problem with simultaneous deliveries and pickups","volume":"57","author":"Chen","year":"2006","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/j.cor.2023.106467_b16","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.2023.106467_b17","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1287\/trsc.1050.0118","article-title":"A branch-and-price approach to the vehicle routing problem with simultaneous distribution and collection","volume":"40","author":"Dell\u2019Amico","year":"2006","journal-title":"Transp. Sci."},{"year":"2006","series-title":"Column Generation, Vol. 5","author":"Desaulniers","key":"10.1016\/j.cor.2023.106467_b18"},{"issue":"1","key":"10.1016\/j.cor.2023.106467_b19","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/PL00013346","article-title":"Vehicle routing and reverse logistics: the vehicle routing problem with simultaneous delivery and pick-up","volume":"23","author":"Dethloff","year":"2001","journal-title":"OR-Spektrum"},{"issue":"3","key":"10.1016\/j.cor.2023.106467_b20","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1023\/A:1015053600842","article-title":"Parallelization of a two-phase metaheuristic for routing problems with time windows","volume":"8","author":"Gehring","year":"2002","journal-title":"J. Heuristics"},{"key":"10.1016\/j.cor.2023.106467_b21","series-title":"Column Generation","first-page":"33","article-title":"Shortest path problems with resource constraints","author":"Irnich","year":"2005"},{"issue":"2","key":"10.1016\/j.cor.2023.106467_b22","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."},{"key":"10.1016\/j.cor.2023.106467_b23","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1016\/j.ejor.2011.01.003","article-title":"A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery","volume":"211","author":"Karaoglan","year":"2011","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2023.106467_b24","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1016\/j.omega.2011.09.002","article-title":"The location-routing problem with simultaneous pickup and delivery: Formulations and a heuristic approach","volume":"40","author":"Karaoglan","year":"2012","journal-title":"Omega"},{"key":"10.1016\/j.cor.2023.106467_b25","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2020.104987","article-title":"A review of vehicle routing with simultaneous pickup and delivery","volume":"122","author":"Ko\u00e7","year":"2020","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2023.106467_b26","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF01720015","article-title":"A branch and bound algorithm for the capacitated vehicle routing problem","volume":"5","author":"Laporte","year":"1983","journal-title":"Oper. -Res. -Spektrum"},{"key":"10.1016\/j.cor.2023.106467_b27","doi-asserted-by":"crossref","DOI":"10.1007\/s10107-003-0481-8","article-title":"A new branch-and-cut algorithm for the capacitated vehicle routing problem","volume":"100","author":"Lysgaard","year":"2004","journal-title":"Math. Program."},{"issue":"5","key":"10.1016\/j.cor.2023.106467_b28","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0191-2607(89)90085-X","article-title":"The multiple vehicle routing problem with simultaneous delivery and pick-up points","volume":"23","author":"Min","year":"1989","journal-title":"Transp. Res. A General"},{"issue":"02","key":"10.1016\/j.cor.2023.106467_b29","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1142\/S0217595905000522","article-title":"An algorithm for the generalized vehicle routing problem with backhauling","volume":"22","author":"Mitra","year":"2005","journal-title":"Asia-Pac. J. Oper. Res."},{"key":"10.1016\/j.cor.2023.106467_b30","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1016\/j.cor.2004.07.009","article-title":"A Tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service","volume":"33","author":"Montan\u00e9","year":"2006","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2023.106467_b31","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s11301-008-0033-7","article-title":"A survey on pickup and delivery problems","volume":"58","author":"Parragh","year":"2008","journal-title":"J. Betriebswirtschaft"},{"key":"10.1016\/j.cor.2023.106467_b32","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s11301-008-0036-4","article-title":"A survey on pickup and delivery problems: Part II: Transportation between pickup and delivery locations","volume":"58","author":"Parragh","year":"2008","journal-title":"J. Betriebswirtschaft"},{"issue":"3","key":"10.1016\/j.cor.2023.106467_b33","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.2023.106467_b34","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":"3","key":"10.1016\/j.cor.2023.106467_b35","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1016\/j.orl.2017.02.006","article-title":"Limited memory rank-1 cuts for vehicle routing problems","volume":"45","author":"Pecin","year":"2017","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"10.1016\/j.cor.2023.106467_b36","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.2023.106467_b37","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1007\/s10107-020-01523-z","article-title":"A generic exact solver for vehicle routing and related problems","volume":"183","author":"Pessoa","year":"2020","journal-title":"Math. Program."},{"key":"10.1016\/j.cor.2023.106467_b38","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."},{"key":"10.1016\/j.cor.2023.106467_b39","first-page":"1115","article-title":"Nouveaux algorithmes pour le probl\u00e8me de localisation et routage sous contraintes de capacit\u00e9","volume":"2","author":"Prins","year":"2004","journal-title":"MOSIM\u201904"},{"issue":"3","key":"10.1016\/j.cor.2023.106467_b40","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1002\/net.21511","article-title":"A survey of resource constrained shortest path problems: Exact solution approaches","volume":"62","author":"Pugliese","year":"2013","journal-title":"Networks"},{"key":"10.1016\/j.cor.2023.106467_b41","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/trsc.2014.0524","article-title":"A branch-and-price-and-cut algorithm for heterogeneous pickup and delivery problems with configurable vehicle capacity","volume":"49","author":"Qu","year":"2015","journal-title":"Transp. Sci."},{"key":"10.1016\/j.cor.2023.106467_b42","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF03342743","article-title":"Exact solutions to the symmetric and asymmetric vehicle routing problem with simultaneous delivery and pick-up","volume":"6","author":"Rieck","year":"2013","journal-title":"Bus. Res."},{"issue":"3","key":"10.1016\/j.cor.2023.106467_b43","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."},{"year":"2012","series-title":"Branching decisions in branch-and-cut-and-price algorithms for vehicle routing problems","author":"R\u00f8pke","key":"10.1016\/j.cor.2023.106467_b44"},{"issue":"1","key":"10.1016\/j.cor.2023.106467_b45","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."},{"issue":"10","key":"10.1016\/j.cor.2023.106467_b46","doi-asserted-by":"crossref","first-page":"1034","DOI":"10.1057\/palgrave.jors.2600808","article-title":"A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling","volume":"50","author":"Salhi","year":"1999","journal-title":"J. Oper. Res. Soc."},{"issue":"2","key":"10.1016\/j.cor.2023.106467_b47","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","article-title":"Algorithms for the vehicle routing and scheduling problems with time window constraints","volume":"35","author":"Solomon","year":"1987","journal-title":"Oper. Res."},{"year":"2012","series-title":"Heuristic, Exact and Hybrid Approaches for Vehicle Routing Problems","author":"Subramanian","key":"10.1016\/j.cor.2023.106467_b48"},{"key":"10.1016\/j.cor.2023.106467_b49","series-title":"Experimental Algorithms","first-page":"276","article-title":"New lower bounds for the vehicle routing problem with simultaneous pickup and delivery","author":"Subramanian","year":"2010"},{"key":"10.1016\/j.cor.2023.106467_b50","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1016\/j.orl.2011.06.012","article-title":"Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery","volume":"39","author":"Subramanian","year":"2011","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/j.cor.2023.106467_b51","doi-asserted-by":"crossref","first-page":"1569","DOI":"10.1007\/s11590-012-0570-9","article-title":"Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery","volume":"7","author":"Subramanian","year":"2013","journal-title":"Optim. Lett."},{"issue":"4","key":"10.1016\/j.cor.2023.106467_b52","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1287\/trsc.31.4.372","article-title":"An exact algorithm for the vehicle routing problem with backhauls","volume":"31","author":"Toth","year":"1997","journal-title":"Transp. Sci."},{"year":"2017","series-title":"BaPCod \u2014 a generic branch-and-price code","author":"Vanderbeck","key":"10.1016\/j.cor.2023.106467_b53"},{"key":"10.1016\/j.cor.2023.106467_b54","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/j.cie.2011.08.018","article-title":"A genetic algorithm for the simultaneous delivery and pickup problems with time window","volume":"62","author":"Wang","year":"2012","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2023.106467_b55","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1016\/j.ijpe.2012.04.011","article-title":"A coevolutionary algorithm for the flexible delivery and pickup problem with time windows","volume":"141","author":"Wang","year":"2013","journal-title":"Int. J. Prod. Econ."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054823003313?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054823003313?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T20:49:10Z","timestamp":1736369350000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054823003313"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2]]},"references-count":55,"alternative-id":["S0305054823003313"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2023.106467","relation":{},"ISSN":["0305-0548"],"issn-type":[{"type":"print","value":"0305-0548"}],"subject":[],"published":{"date-parts":[[2024,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A unified exact approach for a broad class of vehicle routing problems with simultaneous pickup and delivery","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2023.106467","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2023 Elsevier Ltd.","name":"copyright","label":"Copyright"}],"article-number":"106467"}}