{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T05:31:09Z","timestamp":1774935069599,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"S6","license":[{"start":{"date-parts":[[2018,3,29]],"date-time":"2018-03-29T00:00:00Z","timestamp":1522281600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71271220"],"award-info":[{"award-number":["71271220"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"The China Society of Logistics","award":["2016CSLKT3-077"],"award-info":[{"award-number":["2016CSLKT3-077"]}]},{"name":"Fundamental Research Funds for the Central Universities of Central South University","award":["2017zzts198"],"award-info":[{"award-number":["2017zzts198"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1007\/s10586-018-2635-8","type":"journal-article","created":{"date-parts":[[2018,4,3]],"date-time":"2018-04-03T21:51:29Z","timestamp":1522792289000},"page":"15447-15457","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["A tabu search algorithm for distribution network optimization with discrete split deliveries and soft time windows"],"prefix":"10.1007","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3212-5337","authenticated-orcid":false,"given":"Yangkun","family":"Xia","sequence":"first","affiliation":[]},{"given":"Zhuo","family":"Fu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,29]]},"reference":[{"issue":"2","key":"2635_CR1","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.: Savings by split delivery routing. Transp. Sci. 23(2), 141\u2013145 (1989)","journal-title":"Transp. Sci."},{"issue":"1","key":"2635_CR2","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1287\/trsc.1040.0103","volume":"40","author":"C Archetti","year":"2006","unstructured":"Archetti, C., Hertz, A., Speranza, M.G.: A tabu search algorithm for the split delivery vehicle routing problem. Transp. Sci. 40(1), 64\u201373 (2006)","journal-title":"Transp. Sci."},{"issue":"5","key":"2635_CR3","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1299\/jamdsm.6.687","volume":"6","author":"S Yin","year":"2012","unstructured":"Yin, S., Nishi, T., Izuno, T.: A heuristic approach for international crude oil transportation scheduling problems. J. Adv. Mech. Des. Syst. Manuf. 6(5), 687\u2013702 (2012)","journal-title":"J. Adv. Mech. Des. Syst. Manuf."},{"issue":"2","key":"2635_CR4","first-page":"207","volume":"2","author":"JH Wilck","year":"2012","unstructured":"Wilck, J.H., Cavalier, T.M.: A genetic algorithm for the split delivery vehicle routing problem. Am. J. Oper. Res. 2(2), 207\u2013216 (2012)","journal-title":"Am. J. Oper. Res."},{"issue":"2","key":"2635_CR5","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/j.compchemeng.2013.09.019","volume":"60","author":"T Nishi","year":"2014","unstructured":"Nishi, T., Izuno, T.: Column generation heuristics for ship routing and scheduling problems in crude oil transportation with split deliveries. Comput. Chem. Eng. 60(2), 329\u2013338 (2014)","journal-title":"Comput. Chem. Eng."},{"issue":"3","key":"2635_CR6","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/j.tre.2014.06.006","volume":"69","author":"H Wang","year":"2014","unstructured":"Wang, H., Du, L., Ma, S.: Multi-objective open location-routing model with split delivery for optimized relief distribution in post-earthquake. Transp. Res. Part E: Log. Transp. Rev. 69(3), 160\u2013179 (2014)","journal-title":"Transp. Res. Part E: Log. Transp. Rev."},{"key":"2635_CR7","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/j.cie.2015.05.034","volume":"87","author":"S Yan","year":"2015","unstructured":"Yan, S., Chu, J.C., Hsiao, F.Y., et al.: A planning model and solution algorithm for multi-trip split-delivery vehicle routing and scheduling problems with time windows. Comput. Ind. Eng. 87, 383\u2013393 (2015)","journal-title":"Comput. Ind. Eng."},{"key":"2635_CR8","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.tre.2016.01.014","volume":"88","author":"FW Han","year":"2016","unstructured":"Han, F.W., Chu, Y.C.: A multi-start heuristic approach for the split-delivery vehicle routing problem with minimum delivery amounts. Transp. Res. Part E Log. Transp. Rev. 88, 11\u201331 (2016)","journal-title":"Transp. Res. Part E Log. Transp. Rev."},{"issue":"1","key":"2635_CR9","doi-asserted-by":"publisher","first-page":"55","DOI":"10.4018\/IJAIE.2016010104","volume":"3","author":"GP Rajappa","year":"2016","unstructured":"Rajappa, G.P., Wilck, J.H., Bell, J.E.: An ant colony optimization and hybrid metaheuristics algorithm to solve the split delivery vehicle routing problem. Int. J. Appl. Indus. Eng. 3(1), 55\u201373 (2016)","journal-title":"Int. J. Appl. Indus. Eng."},{"issue":"1","key":"2635_CR10","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1111\/itor.12250","volume":"24","author":"P Chen","year":"2017","unstructured":"Chen, P., Golden, B., Wang, X., et al.: A novel approach to solve the split delivery vehicle routing problem. Int. Transp. Oper. Res. 24(1), 27\u201341 (2017)","journal-title":"Int. Transp. Oper. Res."},{"issue":"3","key":"2635_CR11","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1016\/j.ejor.2011.03.023","volume":"213","author":"M Salani","year":"2011","unstructured":"Salani, M., Vacca, I.: Branch and price for the vehicle routing problem with discrete split deliveries and time windows. Eur. J. Oper. Res. 213(3), 470\u2013477 (2011)","journal-title":"Eur. J. Oper. Res."},{"key":"2635_CR12","doi-asserted-by":"publisher","unstructured":"Xia Y. K., Fu Z., Xie J. Y.: Material distribution route planning for multiple automated guided vehicles with split deliveries by order. Comput. Int. Manuf. Syst. 23(7), 1520\u20131528 (2017) \nhttps:\/\/doi.org\/10.13196\/j.cims.2017.07.017\n\n (in Chinese)","DOI":"10.13196\/j.cims.2017.07.017"},{"issue":"5","key":"2635_CR13","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1057\/palgrave.jors.2602371","volume":"59","author":"Z Fu","year":"2008","unstructured":"Fu, Z., Eglese, R., Li, L.Y.O.: A unified tabu search algorithm for vehicle routing problems with soft time windows. J. of the Oper. Res. Soc. 59(5), 663\u2013673 (2008)","journal-title":"J. of the Oper. Res. Soc."},{"issue":"12","key":"2635_CR14","doi-asserted-by":"publisher","first-page":"1947","DOI":"10.1016\/S0305-0548(03)00155-2","volume":"31","author":"SC Ho","year":"2004","unstructured":"Ho, S.C., Haugland, D.: A tabu search heuristic for the vehicle routing problem with time windows and split deliveries. Comput. Oper. Res. 31(12), 1947\u20131964 (2004)","journal-title":"Comput. Oper. Res."},{"issue":"7","key":"2635_CR15","doi-asserted-by":"publisher","first-page":"1222","DOI":"10.1057\/jors.2014.123","volume":"66","author":"M Lai","year":"2015","unstructured":"Lai, M., Battarra, M., Francesco, M.D., et al.: An adaptive guidance meta-heuristic for vehicle routing problem with splits and clustered backhauls. J. Oper. Res. Soc. 66(7), 1222\u20131236 (2015)","journal-title":"J. Oper. Res. Soc."},{"issue":"2","key":"2635_CR16","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1989","unstructured":"Solomon, M.M.: Algorithms for vehicle routing problem and scheduling problem with time windows constraints. Oper. Res. 35(2), 254\u2013265 (1989)","journal-title":"Oper. Res."},{"issue":"3","key":"2635_CR17","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1057\/palgrave.jors.2601817","volume":"56","author":"Z Fu","year":"2005","unstructured":"Fu, Z., Eglese, R., Li, L.Y.O.: A new tabu search heuristic for the open vehicle routing problem. J. Oper. Res. Soc. 56(3), 267\u2013274 (2005)","journal-title":"J. Oper. Res. Soc."},{"key":"2635_CR18","doi-asserted-by":"publisher","unstructured":"Fu Z., Liu W., Qiu M.: A tabu search algorithm for the vehicle routing problem with soft time windows and split deliveries by order. Chinese J. Manag. Sci. 25(5), 78\u201386 (2017) \nhttps:\/\/doi.org\/10.16381\/j.cnki.issn1003-207x.2017.05.010\n\n (in Chinese)","DOI":"10.16381\/j.cnki.issn1003-207x.2017.05.010"},{"issue":"2","key":"2635_CR19","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1016\/j.cie.2012.11.007","volume":"64","author":"P Belfiore","year":"2013","unstructured":"Belfiore, P., Yoshizaki, H.T.Y.: Heuristic methods for the fleet size and mix vehicle routing problem with time windows and split deliveries. Comput. Ind. Eng. 64(2), 589\u2013601 (2013)","journal-title":"Comput. Ind. Eng."},{"issue":"4","key":"2635_CR20","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1057\/jors.2010.19","volume":"62","author":"Q Mu","year":"2011","unstructured":"Mu, Q., Fu, Z., Lysgaard, J., et al.: Disruption management of the vehicle routing problem with vehicle breakdown. J. Oper. Res. Soc. 62(4), 742\u2013749 (2011)","journal-title":"J. Oper. Res. Soc."},{"key":"2635_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-018-1957-x","author":"YK Xia","year":"2018","unstructured":"Xia, Y.K., Fu, Z.: Improved tabu search algorithm for open vehicle routing problem with soft time windows and satisfaction rate. Clus. Comput. (2018). \nhttps:\/\/doi.org\/10.1007\/s10586-018-1957-x","journal-title":"Clus. Comput."},{"key":"2635_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/s11277-018-5464-4","author":"YK Xia","year":"2018","unstructured":"Xia, Y.K., Fu, Z.: An adaptive tabu search algorithm for the open vehicle routing problem with split deliveries by order. Wireless Pers. Commun. (2018). \nhttps:\/\/doi.org\/10.1007\/s11277-018-5464-4","journal-title":"Wireless Pers. Commun."},{"issue":"1","key":"2635_CR23","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s10586-016-0719-x","volume":"20","author":"M Wei","year":"2017","unstructured":"Wei, M., Sun, B.: Bi-level programming model for multi-modal regional bus timetable and vehicle\u00a0dispatch\u00a0with stochastic travel time. Clus. Comput. 20(1), 401\u2013411 (2017)","journal-title":"Clus. Comput."},{"issue":"1","key":"2635_CR24","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1299\/jamdsm.1.217","volume":"1","author":"Y Nakao","year":"2007","unstructured":"Nakao, Y., Nagamochi, H.: A DP-based heuristic algorithm for the discrete split delivery vehicle routing problem. J. Adv. Mech. Des. Syst. Manuf. 1(1), 217\u2013226 (2007)","journal-title":"J. Adv. Mech. Des. Syst. Manuf."},{"issue":"24","key":"2635_CR25","doi-asserted-by":"publisher","first-page":"7436","DOI":"10.1080\/00207543.2014.932932","volume":"52","author":"F Chan","year":"2014","unstructured":"Chan, F., Shekhar, P., Tiwari, M.: Dynamic scheduling of oil tankers with splitting of cargo at pickup and delivery locations: a Multi-objective Ant Colony-based approach. Int. J. Product. 52(24), 7436\u20137453 (2014)","journal-title":"Int. J. Product."},{"key":"2635_CR26","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/j.eswa.2016.12.013","volume":"72","author":"Y Shi","year":"2017","unstructured":"Shi, Y., Boudouh, T., Grunder, O.: A hybrid genetic algorithm for a home health care routing problem with time window and fuzzy demand. Expert Syst. Appl. 72, 160\u2013176 (2017)","journal-title":"Expert Syst. Appl."}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-018-2635-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10586-018-2635-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-018-2635-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,26]],"date-time":"2019-11-26T07:34:50Z","timestamp":1574753690000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10586-018-2635-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,29]]},"references-count":26,"journal-issue":{"issue":"S6","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["2635"],"URL":"https:\/\/doi.org\/10.1007\/s10586-018-2635-8","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"value":"1386-7857","type":"print"},{"value":"1573-7543","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,3,29]]},"assertion":[{"value":"28 January 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 March 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 March 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 March 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}