{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T15:56:48Z","timestamp":1786118208529,"version":"build-2736575974"},"reference-count":47,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72542017"],"award-info":[{"award-number":["72542017"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72271175"],"award-info":[{"award-number":["72271175"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72471017"],"award-info":[{"award-number":["72471017"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72288101"],"award-info":[{"award-number":["72288101"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72394374"],"award-info":[{"award-number":["72394374"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72431006"],"award-info":[{"award-number":["72431006"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013093","name":"Science and Technology Planning Project of Shenzhen Municipality","doi-asserted-by":"publisher","award":["KJZD20240903103806009"],"award-info":[{"award-number":["KJZD20240903103806009"]}],"id":[{"id":"10.13039\/501100013093","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,12]]},"DOI":"10.1016\/j.ejor.2026.03.016","type":"journal-article","created":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T23:36:44Z","timestamp":1773531404000},"page":"749-763","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Exact algorithm for a half-open multi-depot multi-commodity unpaired pickup and delivery problem with redistribution in omnichannel retailing"],"prefix":"10.1016","volume":"335","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-0752-9619","authenticated-orcid":false,"given":"Ying","family":"He","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peng","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shuxian","family":"Xu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ronghui","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.ejor.2026.03.016_bib0001","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.ijpe.2017.11.011","article-title":"Vehicle routing problem in omni-channel retailing distribution systems","volume":"196","author":"Abdulkader","year":"2018","journal-title":"International Journal of Production Economics"},{"key":"10.1016\/j.ejor.2026.03.016_bib0002","first-page":"218","article-title":"The fulfillment-optimization problem","author":"Acimovic","year":"2019","journal-title":"INFORMS TutORials in Operations Research"},{"key":"10.1016\/j.ejor.2026.03.016_bib0003","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2020.106695","article-title":"A two-phase local search with a discrete-event heuristic for the omnichannel vehicle routing problem","volume":"148","author":"Bayliss","year":"2020","journal-title":"Computers & Industrial Engineering"},{"issue":"3","key":"10.1016\/j.ejor.2026.03.016_bib0004","doi-asserted-by":"crossref","first-page":"987","DOI":"10.1016\/j.ejor.2020.01.011","article-title":"Order fulfillment policies for ship-from-store implementation in omni-channel retailing","volume":"294","author":"Bayram","year":"2021","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.03.016_bib0005","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"},{"issue":"2","key":"10.1016\/j.ejor.2026.03.016_bib0006","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1016\/j.ejor.2020.01.008","article-title":"A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem","volume":"284","author":"Brand\u00e3o","year":"2020","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2026.03.016_bib0007","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.disopt.2012.11.005","article-title":"Bike sharing systems: Solving the static rebalancing problem","volume":"10","author":"Chemla","year":"2013","journal-title":"Discrete Optimization"},{"key":"10.1016\/j.ejor.2026.03.016_bib0008","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/j.tre.2014.06.010","article-title":"Model and algorithm for an unpaired pickup and delivery vehicle routing problem with split loads","volume":"69","author":"Chen","year":"2014","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"1","key":"10.1016\/j.ejor.2026.03.016_bib0009","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1287\/opre.8.1.101","article-title":"Decomposition principle for linear programs","volume":"8","author":"Dantzig","year":"1960","journal-title":"Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2026.03.016_bib0010","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1016\/j.ejor.2014.09.015","article-title":"A column generation approach for a multi-attribute vehicle routing problem","volume":"241","author":"Dayarian","year":"2015","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.03.016_bib0011","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1016\/j.trb.2018.10.015","article-title":"The bike sharing rebalancing problem with stochastic demands","volume":"118","author":"Dell\u2019Amico","year":"2018","journal-title":"Transportation Research Part B: Methodological"},{"key":"10.1016\/j.ejor.2026.03.016_bib0012","series-title":"Vehicle Routing: Problems, Methods, and Applications, MOS","article-title":"The vehicle routing problem with time windows","author":"Desaulniers","year":"2014"},{"issue":"2","key":"10.1016\/j.ejor.2026.03.016_bib0013","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1287\/opre.40.2.342","article-title":"A new optimization algorithm for the vehicle routing problem with time windows","volume":"40","author":"Desrochers","year":"1992","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2026.03.016_bib0014","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.120807","article-title":"A multi-depot vehicle routing problem with time windows, split pickup and split delivery for surplus food recovery and redistribution","volume":"232","author":"Dubey","year":"2023","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.ejor.2026.03.016_bib0015","doi-asserted-by":"crossref","DOI":"10.1016\/j.trc.2022.103958","article-title":"Cost-optimal deployment of autonomous mobile lockers co-operating with couriers for simultaneous pickup and delivery operations","volume":"146","author":"Ensafian","year":"2023","journal-title":"Transportation Research Part C: Emerging Technologies"},{"issue":"2","key":"10.1016\/j.ejor.2026.03.016_bib0016","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/j.ejor.2014.04.013","article-title":"The static bicycle relocation problem with demand intervals","volume":"238","author":"Erdo\u011fan","year":"2014","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2026.03.016_bib0017","doi-asserted-by":"crossref","first-page":"1009","DOI":"10.1016\/j.ejor.2023.06.018","article-title":"Replenishment and fulfilment decisions for stores in an omni-channel retail network","volume":"311","author":"Goedhart","year":"2023","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.03.016_bib0018","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejor.2026.02.025","article-title":"Modeling and planning a novel logistic transport system: Several drone pickups for each delivery","author":"G\u00f3mez-Lagos","year":"2026","journal-title":"European Journal of Operational Research"},{"issue":"2&3","key":"10.1016\/j.ejor.2026.03.016_bib0019","first-page":"93","article-title":"The travelling salesman problem as a constrained shortest path problem: Theory and computational experience","volume":"17","author":"Houck","year":"1980","journal-title":"Opsearch"},{"issue":"5","key":"10.1016\/j.ejor.2026.03.016_bib0020","doi-asserted-by":"crossref","first-page":"1725","DOI":"10.1080\/00207543.2024.2389550","article-title":"Supermarket-chain grocery delivery optimization through crowdshipping","volume":"63","author":"Hwang","year":"2024","journal-title":"International Journal of Production Research"},{"issue":"3","key":"10.1016\/j.ejor.2026.03.016_bib0021","doi-asserted-by":"crossref","first-page":"1059","DOI":"10.1016\/j.ejor.2020.08.043","article-title":"Designing multi-tier, multi-service-level, and multi-modal last-mile distribution networks for omni-channel operations","volume":"294","author":"Janjevic","year":"2021","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2026.03.016_bib0022","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":"2007","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2026.03.016_bib0023","series-title":"Parallelization of the vehicle routing problem with time windows","author":"Jesper","year":"1999"},{"key":"10.1016\/j.ejor.2026.03.016_bib0024","article-title":"Statistical data analysis based on the l1-norm","author":"Kaufman","year":"1987","journal-title":"Clustering by Means of Medoids"},{"key":"10.1016\/j.ejor.2026.03.016_bib0025","unstructured":"Kohl, N. (1995). Exact methods for time constrained routing and related scheduling problems. Lyngby, Denmark: Technical University of Denmark. Unpublished doctoral thesis. https:\/\/orbit.dtu.dk\/en\/publications\/exact-methods-for-time-constrained-routing-and-related-scheduling\/."},{"key":"10.1016\/j.ejor.2026.03.016_bib0026","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/j.trb.2018.01.009","article-title":"Continuous approximation for demand balancing in solving large-scale one-commodity pickup and delivery problems","volume":"109","author":"Lei","year":"2018","journal-title":"Transportation Research Part B: Methodological"},{"key":"10.1016\/j.ejor.2026.03.016_bib47","doi-asserted-by":"crossref","first-page":"101955","DOI":"10.1016\/j.tre.2020.101955","article-title":"Branch-and-price-and-cut for the synchronized vehicle routing problem with split delivery, proportional service time and multiple time windows","volume":"140","author":"Li","year":"2020","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"10.1016\/j.ejor.2026.03.016_bib0027","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2024.106828","article-title":"Vehicle routing problem for omnichannel retailing including multiple types of time windows and products","volume":"173","author":"Li","year":"2025","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2026.03.016_bib0028","article-title":"Proceedings of the fifth berkeley symposium on mathematical statistics and probability","author":"MacQueen","year":"1967","journal-title":"Some Methods for Classification and Analysis of Multivariate Observations"},{"key":"10.1016\/j.ejor.2026.03.016_bib0029","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.trpro.2020.03.082","article-title":"A savings-based heuristic for solving the omnichannel vehicle routing problem with pick-up and delivery","volume":"47","author":"Martins","year":"2020","journal-title":"Transportation Research Procedia"},{"key":"10.1016\/j.ejor.2026.03.016_bib0030","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2020.105158","article-title":"An exact solution method for a rich helicopter flight scheduling problem arising in offshore oil and gas logistics","volume":"128","author":"Nafstad","year":"2021","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2026.03.016_bib0031","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/j.trb.2021.03.009","article-title":"Optimal rebalancing and on-board charging of shared electric scooters","volume":"147","author":"Osorio","year":"2021","journal-title":"Transportation Research Part B: Methodological"},{"key":"10.1016\/j.ejor.2026.03.016_bib0032","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/j.trb.2019.10.002","article-title":"Optimizing omni-channel fulfillment with store transfers","volume":"129","author":"Paul","year":"2019","journal-title":"Transportation Research Part B: Methodological"},{"issue":"2","key":"10.1016\/j.ejor.2026.03.016_bib0033","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1016\/j.ejor.2018.08.027","article-title":"Shared capacity routing problem \u2212 an omni-channel retail study","volume":"273","author":"Paul","year":"2019","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2026.03.016_bib0034","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1016\/j.ejor.2024.08.005","article-title":"Optimizing omnichannel retailer inventory replenishment using vehicle capacity-sharing with demand uncertainties and service level requirements","volume":"320","author":"Qiu","year":"2025","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.03.016_bib0035","unstructured":"Ratcliff, C. (2014). How fashion ecommerce retailers can reduce online returns. Retrieved from https:\/\/econsultancy.com\/how-fashion-ecommerce-retailers-can-reduce-online-returns\/. Accessed Mar 9, 2026."},{"issue":"3","key":"10.1016\/j.ejor.2026.03.016_bib0036","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/j.disopt.2006.05.007","article-title":"Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints","volume":"3","author":"Righini","year":"2006","journal-title":"Discrete Optimization"},{"issue":"6","key":"10.1016\/j.ejor.2026.03.016_bib0037","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1002\/nav.21954","article-title":"Same-day deliveries in omnichannel retail: Integrated order picking and vehicle routing with vehicle-site dependencies","volume":"68","author":"Schubert","year":"2021","journal-title":"Naval Research Logistics"},{"issue":"2","key":"10.1016\/j.ejor.2026.03.016_bib0038","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":"Operations Research"},{"key":"10.1016\/j.ejor.2026.03.016_bib0039","doi-asserted-by":"crossref","DOI":"10.1016\/j.trb.2023.102831","article-title":"An exact algorithm for the pickup and delivery problem with crowdsourced bids and transshipment","volume":"177","author":"Su","year":"2023","journal-title":"Transportation Research Part B: Methodological"},{"key":"10.1016\/j.ejor.2026.03.016_bib0040","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/j.trb.2018.01.007","article-title":"Exact loading and unloading strategies for the static multi-vehicle bike repositioning problem","volume":"109","author":"Szeto","year":"2018","journal-title":"Transportation Research Part B: Methodological"},{"key":"10.1016\/j.ejor.2026.03.016_bib0041","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1007\/s10479-024-06031-3","article-title":"Configuration of last-mile distribution networks for an encroaching manufacturer","volume":"344","author":"Tahirov","year":"2025","journal-title":"Annals of Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2026.03.016_bib0042","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/S0260-8774(01)00040-1","article-title":"Distribution of fresh meat","volume":"51","author":"Tarantilis","year":"2002","journal-title":"Journal of Food Engineering"},{"issue":"6","key":"10.1016\/j.ejor.2026.03.016_bib0043","doi-asserted-by":"crossref","first-page":"1634","DOI":"10.1287\/msom.2020.0903","article-title":"Shipping consolidation across two warehouses with delivery deadline and expedited options for e-commerce and omni-channel retailers","volume":"23","author":"Wei","year":"2020","journal-title":"Manufacturing & Service Operations Management"},{"key":"10.1016\/j.ejor.2026.03.016_bib0044","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2020.105035","article-title":"An adaptive tabu search algorithm embedded with iterated local search and route elimination for the bike repositioning and recycling problem","volume":"123","author":"Zhang","year":"2020","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2026.03.016_bib0045","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/j.cor.2018.10.020","article-title":"Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer","volume":"103","author":"Zhang","year":"2019","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2026.03.016_bib0046","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2023.106318","article-title":"Green split multiple-commodity pickup and delivery vehicle routing problem","volume":"159","author":"Zhao","year":"2023","journal-title":"Computers & Operations Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221726002444?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221726002444?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,8,6]],"date-time":"2026-08-06T15:28:27Z","timestamp":1786030107000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221726002444"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,12]]},"references-count":47,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,12]]}},"alternative-id":["S0377221726002444"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2026.03.016","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2026,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Exact algorithm for a half-open multi-depot multi-commodity unpaired pickup and delivery problem with redistribution in omnichannel retailing","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2026.03.016","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}