{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T12:39:04Z","timestamp":1774269544875,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,6,22]],"date-time":"2020-06-22T00:00:00Z","timestamp":1592784000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,22]],"date-time":"2020-06-22T00:00:00Z","timestamp":1592784000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"FORDECYT-CONACYT","award":["265667"],"award-info":[{"award-number":["265667"]}]},{"name":"PROFIDES-UAdeC","award":["000000"],"award-info":[{"award-number":["000000"]}]},{"name":"Fomento a la Investigaci\u00f3n UP 2019","award":["UP-CI-2019-ING-GDL-08"],"award-info":[{"award-number":["UP-CI-2019-ING-GDL-08"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s12351-020-00580-8","type":"journal-article","created":{"date-parts":[[2020,6,22]],"date-time":"2020-06-22T04:03:31Z","timestamp":1592798611000},"page":"1017-1037","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Open vehicle routing problem with split deliveries: mathematical formulations and a cutting-plane method"],"prefix":"10.1007","volume":"22","author":[{"given":"Efra\u00edn","family":"Ruiz y Ruiz","sequence":"first","affiliation":[]},{"given":"Irma","family":"Garc\u00eda-Calvillo","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4169-3395","authenticated-orcid":false,"given":"Samuel","family":"Nucamendi-Guill\u00e9n","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,22]]},"reference":[{"key":"580_CR1","unstructured":"Araque JR, Hall LA, Magnanti TL (1990) Capacitated trees, capacitated routing, and associated polyhedra"},{"key":"580_CR2","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-0-387-77778-8_5","volume-title":"The vehicle routing problem: latest advances and new challenges","author":"C Archetti","year":"2008","unstructured":"Archetti C, Speranza MG (2008) The split delivery vehicle routing problem: a survey. In: Golden B, Raghavan S, Wasil E (eds) The vehicle routing problem: latest advances and new challenges. Springer, Boston, pp 103\u2013122"},{"issue":"1","key":"580_CR3","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1287\/trsc.1040.0103","volume":"40","author":"C Archetti","year":"2006","unstructured":"Archetti C, Speranza MG, Hertz A (2006) A tabu search algorithm for the split delivery vehicle routing problem. Transp Sci 40(1):64\u201373","journal-title":"Transp Sci"},{"issue":"1","key":"580_CR4","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.tre.2006.04.003","volume":"44","author":"C Archetti","year":"2008","unstructured":"Archetti C, Savelsbergh MW, Speranza MG (2008) To split or not to split: that is the question. Transp Res Part E Logist Transp Rev 44(1):114\u2013123","journal-title":"Transp Res Part E Logist Transp Rev"},{"key":"580_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/s12351-019-00471-7","author":"MV Batsyn","year":"2019","unstructured":"Batsyn MV, Batsyna EK, Bychkov IS, Pardalos PM (2019) Vehicle assignment in site-dependent vehicle routing problems with split deliveries. Oper Res. https:\/\/doi.org\/10.1007\/s12351-019-00471-7","journal-title":"Oper Res"},{"issue":"2","key":"580_CR6","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1287\/trsc.23.2.141","volume":"23","author":"M Dror","year":"1989","unstructured":"Dror M, Trudeau P (1989) Savings by split delivery routing. Transp Sci 23(2):141\u2013145","journal-title":"Transp Sci"},{"issue":"1","key":"580_CR7","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s00291-015-0408-9","volume":"38","author":"E Lalla-Ruiz","year":"2016","unstructured":"Lalla-Ruiz E, Exp\u00f3sito-Izquierdo C, Taheripour S, Vo\u00df S (2016) An improved formulation for the multi-depot open vehicle routing problem. OR Spectr 38(1):175\u2013187","journal-title":"OR Spectr"},{"issue":"10","key":"580_CR8","doi-asserted-by":"publisher","first-page":"2918","DOI":"10.1016\/j.cor.2005.11.018","volume":"34","author":"F Li","year":"2007","unstructured":"Li F, Golden B, Wasil E (2007) The open vehicle routing problem: algorithms, large-scale test problems and computational results. Comput Oper Res 34(10):2918\u20132930. https:\/\/doi.org\/10.1016\/j.cor.2005.11.018","journal-title":"Comput Oper Res"},{"issue":"1","key":"580_CR9","first-page":"27","volume":"7","author":"Y Marinakis","year":"2007","unstructured":"Marinakis Y, Migdalas A (2007) Annotated bibliography in vehicle routing. Oper Res 7(1):27\u201346","journal-title":"Oper Res"},{"issue":"3","key":"580_CR10","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1002\/nav.3800370304","volume":"37","author":"D Moshe","year":"1990","unstructured":"Moshe D, Pierre T (1990) Split delivery routing. Naval Res Logist (NRL) 37(3):383\u2013402","journal-title":"Naval Res Logist (NRL)"},{"key":"580_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2018.07.025","author":"S Nucamendi","year":"2018","unstructured":"Nucamendi S, Angel Bello F, Mart\u00ednez-Salazar I, Cordero Franco A (2018) The cumulative capacitated vehicle routing problem: new formulations and iterated greedy algorithms. Expert Syst Appl. https:\/\/doi.org\/10.1016\/j.eswa.2018.07.025","journal-title":"Expert Syst Appl"},{"issue":"1","key":"580_CR12","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s13675-017-0089-z","volume":"6","author":"G Ozbaygin","year":"2018","unstructured":"Ozbaygin G, Karasan O, Yaman H (2018) New exact solution approaches for the split delivery vehicle routing problem. EURO J Comput Optim 6(1):85\u2013115","journal-title":"EURO J Comput Optim"},{"key":"580_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/s12351-019-00452-w","author":"M Rajabi-Bahaabadi","year":"2019","unstructured":"Rajabi-Bahaabadi M, Shariat-Mohaymany A, Babaei M, Vigo D (2019) Reliable vehicle routing problem in stochastic networks with correlated travel times. Oper Res. https:\/\/doi.org\/10.1007\/s12351-019-00452-w","journal-title":"Oper Res"},{"issue":"3","key":"580_CR14","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1057\/palgrave.jors.2602143","volume":"58","author":"PP Repoussis","year":"2007","unstructured":"Repoussis PP, Tarantilis CD, Ioannou G (2007) The open vehicle routing problem with time windows. J Oper Res Soc 58(3):355\u2013367. https:\/\/doi.org\/10.1057\/palgrave.jors.2602143","journal-title":"J Oper Res Soc"},{"issue":"1137\/1","key":"580_CR15","first-page":"9780898718515","volume":"10","author":"P Toth","year":"2002","unstructured":"Toth P, Vigo D (2002) The vehicle routing problem. Soc Ind Appl Math 10(1137\/1):9780898718515","journal-title":"Soc Ind Appl Math"},{"key":"580_CR16","doi-asserted-by":"crossref","unstructured":"Xia Y, Fu Z (2018a) An adaptive tabu search algorithm for the open vehicle routing problem with split deliveries by order. Wirel Pers Commun, 1\u201315","DOI":"10.1007\/s11277-018-5464-4"},{"issue":"4","key":"580_CR17","first-page":"1","volume":"22","author":"Y Xia","year":"2018","unstructured":"Xia Y, Fu Z (2018b) Improved tabu search algorithm for the open vehicle routing problem with soft time windows and satisfaction rate. Cluster Comput 22(4):1\u20139","journal-title":"Cluster Comput"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-020-00580-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-020-00580-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-020-00580-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T05:06:53Z","timestamp":1647407213000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-020-00580-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,22]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["580"],"URL":"https:\/\/doi.org\/10.1007\/s12351-020-00580-8","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,6,22]]},"assertion":[{"value":"9 September 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 May 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 June 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 June 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}