{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T04:26:12Z","timestamp":1781843172561,"version":"3.54.5"},"reference-count":46,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T00:00:00Z","timestamp":1519862400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T00:00:00Z","timestamp":1519862400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["EURO Journal on Computational Optimization"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1007\/s13675-017-0089-z","type":"journal-article","created":{"date-parts":[[2017,9,13]],"date-time":"2017-09-13T05:45:45Z","timestamp":1505281545000},"page":"85-115","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":36,"title":["New exact solution approaches for the split delivery vehicle routing problem"],"prefix":"10.1016","volume":"6","author":[{"given":"Gizem","family":"Ozbaygin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Oya","family":"Karasan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hande","family":"Yaman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"1","key":"10.1007\/s13675-017-0089-z_CR1","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1504\/IJMHEUR.2010.033123","article-title":"A tabu search with vocabulary building approach for the vehicle routing problem with split demands","volume":"1","author":"Aleman","year":"2010","journal-title":"Int J Metaheuristics"},{"issue":"3","key":"10.1007\/s13675-017-0089-z_CR2","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/s10732-008-9101-3","article-title":"An adaptive memory algorithm for the split delivery vehicle routing problem","volume":"16","author":"Aleman","year":"2010","journal-title":"J Heuristics"},{"issue":"1-2","key":"10.1007\/s13675-017-0089-z_CR3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1111\/j.1475-3995.2011.00811.x","article-title":"Vehicle routing problems with split deliveries","volume":"19","author":"Archetti","year":"2012","journal-title":"Int Trans Oper Res"},{"issue":"1","key":"10.1007\/s13675-017-0089-z_CR4","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1287\/trsc.1040.0103","article-title":"A tabu search algorithm for the split delivery vehicle routing problem","volume":"40","author":"Archetti","year":"2006","journal-title":"Transp Sci"},{"issue":"1","key":"10.1007\/s13675-017-0089-z_CR5","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/trsc.1070.0204","article-title":"An optimization-based heuristic for the split delivery vehicle routing problem","volume":"42","author":"Archetti","year":"2008","journal-title":"Transp Sci"},{"issue":"4","key":"10.1007\/s13675-017-0089-z_CR6","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1002\/net.20467","article-title":"A column generation approach for the split delivery vehicle routing problem","volume":"58","author":"Archetti","year":"2011","journal-title":"Networks"},{"issue":"3","key":"10.1007\/s13675-017-0089-z_CR7","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1016\/j.ejor.2014.04.026","article-title":"Branch-and-cut algorithms for the split delivery vehicle routing problem","volume":"238","author":"Archetti","year":"2014","journal-title":"Eur J Oper Res"},{"issue":"3","key":"10.1007\/s13675-017-0089-z_CR8","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/s101070100284","article-title":"On capacitated network design cut-set polyhedra","volume":"92","author":"Atamt\u00fcrk","year":"2002","journal-title":"Math Program"},{"issue":"5","key":"10.1007\/s13675-017-0089-z_CR9","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1287\/opre.48.5.801.12407","article-title":"A lower bound for the split delivery vehicle routing problem","volume":"48","author":"Belenguer","year":"2000","journal-title":"Oper Res"},{"issue":"1","key":"10.1007\/s13675-017-0089-z_CR10","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/s10479-012-1282-3","article-title":"A randomized granular tabu search heuristic for the split delivery vehicle routing problem","volume":"222","author":"Berbotto","year":"2014","journal-title":"Ann Oper Res"},{"key":"10.1007\/s13675-017-0089-z_CR11","doi-asserted-by":"crossref","unstructured":"Boudia M, Prins C, Reghioui M (2007) An effective memetic algorithm with population management for the split delivery vehicle routing problem. In: Hybrid metaheuristics. Springer, pp 16\u201330","DOI":"10.1007\/978-3-540-75514-2_2"},{"issue":"3","key":"10.1007\/s13675-017-0089-z_CR12","doi-asserted-by":"crossref","first-page":"552","DOI":"10.1016\/S0377-2217(03)00238-8","article-title":"A tabu search algorithm for the open vehicle routing problem","volume":"157","author":"Brand\u00e3o","year":"2004","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13675-017-0089-z_CR13","doi-asserted-by":"crossref","unstructured":"Ceselli A, Righini G, Salani M (2009a) Column generation for the split delivery vehicle routing problem. Technical report, University of Milan-DTI-Note del Polo","DOI":"10.1287\/trsc.1080.0256"},{"issue":"1","key":"10.1007\/s13675-017-0089-z_CR14","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1287\/trsc.1080.0256","article-title":"A column generation algorithm for a rich vehicle-routing problem","volume":"43","author":"Ceselli","year":"2009","journal-title":"Transp Sci"},{"issue":"4","key":"10.1007\/s13675-017-0089-z_CR15","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1002\/net.20181","article-title":"The split delivery vehicle routing problem: applications, algorithms, test problems, and computational results","volume":"49","author":"Chen","year":"2007","journal-title":"Networks"},{"key":"10.1007\/s13675-017-0089-z_CR16","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":"Transpn Rese E Logist Transpo Revi"},{"issue":"1","key":"10.1007\/s13675-017-0089-z_CR17","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1287\/opre.1090.0713","article-title":"Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows","volume":"58","author":"Desaulniers","year":"2010","journal-title":"Oper Res"},{"issue":"2","key":"10.1007\/s13675-017-0089-z_CR18","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1287\/trsc.23.2.141","article-title":"Savings by split delivery routing","volume":"23","author":"Dror","year":"1989","journal-title":"Transp Sci"},{"issue":"3","key":"10.1007\/s13675-017-0089-z_CR19","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1002\/nav.3800370304","volume":"37","author":"Dror","year":"1990","journal-title":"Split delivery routing. Nav Res Logist"},{"issue":"3","key":"10.1007\/s13675-017-0089-z_CR20","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0166-218X(92)00172-I","article-title":"Vehicle routing with split deliveries","volume":"50","author":"Dror","year":"1994","journal-title":"Discrete Appl Math"},{"issue":"3","key":"10.1007\/s13675-017-0089-z_CR21","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1057\/palgrave.jors.2601817","article-title":"A new tabu search heuristic for the open vehicle routing problem","volume":"56","author":"Fu","year":"2005","journal-title":"J Oper Res Soc"},{"issue":"3","key":"10.1007\/s13675-017-0089-z_CR22","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1016\/0377-2217(94)00025-8","article-title":"A result on projection for the vehicle routing problem","volume":"85","author":"Gouveia","year":"1995","journal-title":"Eur J Oper Res"},{"issue":"5","key":"10.1007\/s13675-017-0089-z_CR23","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1016\/j.tre.2009.12.007","article-title":"The split delivery vehicle routing problem with minimum delivery amounts","volume":"46","author":"Gulczynski","year":"2010","journal-title":"Transp Res E Logist Transpo Rev"},{"issue":"1","key":"10.1007\/s13675-017-0089-z_CR24","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/j.ijpe.2006.04.014","article-title":"A two-stage algorithm with valid inequalities for the split delivery vehicle routing problem","volume":"105","author":"Jin","year":"2007","journal-title":"Int J Prod Econ"},{"issue":"2","key":"10.1007\/s13675-017-0089-z_CR25","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/j.orl.2007.05.012","article-title":"A column generation approach for the split delivery vehicle routing problem","volume":"36","author":"Jin","year":"2008","journal-title":"Oper Res Lett"},{"issue":"1","key":"10.1007\/s13675-017-0089-z_CR26","first-page":"147","article-title":"A hybrid local search for the split delivery vehicle routing problem","volume":"13","author":"Khmelev","year":"2015","journal-title":"Int J Artif Intell"},{"issue":"4","key":"10.1007\/s13675-017-0089-z_CR27","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/j.trb.2004.11.004","article-title":"A shortest path approach to the multiple-vehicle routing problem with split pick-ups","volume":"40","author":"Lee","year":"2006","journal-title":"Transp Res B Methodol"},{"issue":"2-3","key":"10.1007\/s13675-017-0089-z_CR28","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/s10107-005-0652-x","article-title":"Projection results for vehicle routing","volume":"105","author":"Letchford","year":"2006","journal-title":"Math Program"},{"issue":"12","key":"10.1007\/s13675-017-0089-z_CR29","doi-asserted-by":"crossref","first-page":"1642","DOI":"10.1057\/palgrave.jors.2602345","article-title":"A branch-and-cut algorithm for the capacitated open vehicle routing problem","volume":"58","author":"Letchford","year":"2007","journal-title":"J Oper Res Soc"},{"issue":"10","key":"10.1007\/s13675-017-0089-z_CR30","doi-asserted-by":"crossref","first-page":"2918","DOI":"10.1016\/j.cor.2005.11.018","article-title":"The open vehicle routing problem: algorithms, large-scale test problems, and computational results","volume":"34","author":"Li","year":"2007","journal-title":"Comput Oper Res"},{"issue":"4","key":"10.1007\/s13675-017-0089-z_CR31","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/j.orl.2010.04.008","article-title":"Improved lower bounds for the split delivery vehicle routing problem","volume":"38","author":"Moreno","year":"2010","journal-title":"Oper Res Lett"},{"key":"10.1007\/s13675-017-0089-z_CR32","doi-asserted-by":"crossref","unstructured":"Mota E, Campos V, Corber\u00e1n \u00c1 (2007) A new metaheuristic for the vehicle routing problem with split demands. In: Evolutionary computation in combinatorial optimization. Springer, pp 121\u2013129","DOI":"10.1007\/978-3-540-71615-0_11"},{"key":"10.1007\/s13675-017-0089-z_CR33","doi-asserted-by":"crossref","unstructured":"Naddef D, Rinaldi G (2002) Branch-and-cut algorithms for the capacitated VRP. In: Toth P, Vigo D (eds) The vehicle routing problem, SIAM monographs on discrete mathematics and applications. SIAM, Philadelphia, PA, USA, pp 53\u201381","DOI":"10.1137\/1.9780898718515.ch3"},{"issue":"3","key":"10.1007\/s13675-017-0089-z_CR34","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1016\/j.tre.2011.11.003","article-title":"A hierarchical clustering and routing procedure for large scale disaster relief logistics planning","volume":"48","author":"Ozdamar","year":"2012","journal-title":"Transp Res E Logist Transp Revi"},{"issue":"2-3","key":"10.1007\/s13675-017-0089-z_CR35","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/s10107-002-0323-0","article-title":"On the capacitated vehicle routing problem","volume":"94","author":"Ralphs","year":"2003","journal-title":"Math Program"},{"key":"10.1007\/s13675-017-0089-z_CR36","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/j.trc.2012.04.014","article-title":"Aksu. An efficient heuristic for the multi-vehicle one-to-one pickup and delivery problem with split loads","volume":"27","author":"Sahin","year":"2013","journal-title":"Transp Res C Emerg Technol"},{"issue":"5","key":"10.1007\/s13675-017-0089-z_CR37","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1057\/palgrave.jors.2600924","article-title":"A heuristic method for the open vehicle routing problem","volume":"51","author":"Sariklis","year":"2000","journal-title":"J Oper Res Soc"},{"issue":"2","key":"10.1007\/s13675-017-0089-z_CR38","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"},{"key":"10.1007\/s13675-017-0089-z_CR39","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1023\/A:1018900705946","article-title":"Routing helicopters for crew exchanges on off-shore locations","volume":"76","author":"Sierksma","year":"1998","journal-title":"Ann Oper Res"},{"key":"10.1007\/s13675-017-0089-z_CR40","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1016\/j.cor.2014.08.005","article-title":"An iterated local search heuristic for the split delivery vehicle routing problem","volume":"53","author":"Silva","year":"2015","journal-title":"Comput Oper Res"},{"issue":"8","key":"10.1007\/s13675-017-0089-z_CR41","first-page":"1088","article-title":"The application of tabu search algorithm on split delivery open vehicle routing problem","volume":"8","author":"Song","year":"2013","journal-title":"BioTechnology"},{"issue":"1","key":"10.1007\/s13675-017-0089-z_CR42","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":"J Food Eng"},{"key":"10.1007\/s13675-017-0089-z_CR43","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/j.tre.2014.06.006","article-title":"Multi-objective open location-routing model with split delivery for optimized relief distribution in post-earthquake","volume":"69","author":"Wang","year":"2014","journal-title":"Transp Res E Logist Transp Rev"},{"key":"10.1007\/s13675-017-0089-z_CR44","first-page":"207","article-title":"A genetic algorithm for the split delivery vehicle routing problem","volume":"2","author":"Wilck","year":"2012","journal-title":"Am J Oper Res"},{"key":"10.1007\/s13675-017-0089-z_CR45","first-page":"153","article-title":"A construction heuristic for the split delivery vehicle routing problem","volume":"2","author":"Wilck","year":"2012","journal-title":"Am J Oper Res"},{"issue":"6","key":"10.1007\/s13675-017-0089-z_CR46","doi-asserted-by":"crossref","first-page":"660","DOI":"10.1016\/j.tre.2006.05.004","article-title":"Ant colony optimization for disaster relief operations","volume":"43","author":"Yi","year":"2007","journal-title":"Transp Res E Logist Transp Rev"}],"container-title":["EURO Journal on Computational Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13675-017-0089-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-017-0089-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621000964?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621000964?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-017-0089-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T03:46:38Z","timestamp":1761882398000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2192440621000964"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3]]},"references-count":46,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["S2192440621000964"],"URL":"https:\/\/doi.org\/10.1007\/s13675-017-0089-z","relation":{},"ISSN":["2192-4406"],"issn-type":[{"value":"2192-4406","type":"print"}],"subject":[],"published":{"date-parts":[[2018,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"New exact solution approaches for the split delivery vehicle routing problem","name":"articletitle","label":"Article Title"},{"value":"EURO Journal on Computational Optimization","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1007\/s13675-017-0089-z","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2018 The author(s). Published by Elsevier B.V. on behalf of Association of European Operational Research Societies (EURO). Published by Elsevier Ltd All rights reserved.","name":"copyright","label":"Copyright"}]}}