{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T12:38:54Z","timestamp":1774269534396,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,2,5]],"date-time":"2018-02-05T00:00:00Z","timestamp":1517788800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"the China Society of Logistics","award":["2016CSLKT3-077"],"award-info":[{"award-number":["2016CSLKT3-077"]}]},{"name":"the Fundamental Research Funds for the Central Universities","award":["2017zzts198"],"award-info":[{"award-number":["2017zzts198"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Wireless Pers Commun"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s11277-018-5464-4","type":"journal-article","created":{"date-parts":[[2018,2,5]],"date-time":"2018-02-05T01:22:18Z","timestamp":1517793738000},"page":"595-609","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["An Adaptive Tabu Search Algorithm for the Open Vehicle Routing Problem with Split Deliveries by Order"],"prefix":"10.1007","volume":"103","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,2,5]]},"reference":[{"issue":"1","key":"5464_CR1","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig, G. B., & Ramser, J. H. (1959). The truck dispatching problem. Management Science, 6(1), 80\u201391.","journal-title":"Management Science"},{"issue":"3","key":"5464_CR2","doi-asserted-by":"publisher","first-page":"2345","DOI":"10.1007\/s11277-017-4107-5","volume":"95","author":"E Pu","year":"2017","unstructured":"Pu, E., Wang, F., Yang, Z. L., et al. (2017). Hybrid differential evolution optimization for the vehicle routing problem with time windows and driver-specific times. Wireless Personal Communications, 95(3), 2345\u20132357.","journal-title":"Wireless Personal Communications"},{"key":"5464_CR3","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. (2016). A multi-start heuristic approach for the split-delivery vehicle routing problem with minimum delivery amounts. Transportation Research Part E Logistics & Transportation Review., 88, 11\u201331.","journal-title":"Transportation Research Part E Logistics & Transportation Review."},{"issue":"3","key":"5464_CR4","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. (2005). A new tabu search heuristic for the open vehicle routing problem. Journal of the Operational Research Society, 56(3), 267\u2013274.","journal-title":"Journal of the Operational Research Society"},{"issue":"7","key":"5464_CR5","doi-asserted-by":"publisher","first-page":"1520","DOI":"10.13196\/j.cims.2017.07.017","volume":"23","author":"YK Xia","year":"2017","unstructured":"Xia, Y. K., Fu, Z., & Xie, J. Y. (2017). Material distribution route planning for multiple automated guided vehicles with split deliveries by order. Computer Integrated Manufacturing Systems, 23(7), 1520\u20131528. \n                    https:\/\/doi.org\/10.13196\/j.cims.2017.07.017\n                    \n                  . (in Chinese).","journal-title":"Computer Integrated Manufacturing Systems"},{"issue":"2","key":"5464_CR6","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1287\/trsc.23.2.141","volume":"23","author":"M Dror","year":"2006","unstructured":"Dror, M., & Trudeau, P. (2006). Savings by split delivery routing. Transportation Science, 23(2), 141\u2013145.","journal-title":"Transportation Science"},{"issue":"1","key":"5464_CR7","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. (2006). A tabu search algorithm for the split delivery vehicle routing problem. Transportation Science, 40(1), 64\u201373.","journal-title":"Transportation Science"},{"issue":"5","key":"5464_CR8","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. (2008). A unified tabu search algorithm for vehicle routing problems with soft time windows. Journal of the Operational Research Society, 59(5), 663\u2013673.","journal-title":"Journal of the Operational Research Society"},{"issue":"3","key":"5464_CR9","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1016\/j.ejor.2014.04.026","volume":"238","author":"C Archetti","year":"2014","unstructured":"Archetti, C., Bianchessi, N., & Speranza, M. G. (2014). Branch-and-cut algorithms for the split delivery vehicle routing problem. European Journal of Operational Research, 238(3), 685\u2013698.","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"5464_CR10","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1057\/palgrave.jors.2600924","volume":"51","author":"D Sariklis","year":"2000","unstructured":"Sariklis, D., & Powell, S. A. (2000). A heuristic method for the open vehicle routing problem. Journal of the Operational Research Society, 51(5), 564\u2013573.","journal-title":"Journal of the Operational Research Society"},{"issue":"2","key":"5464_CR11","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/S0377-2217(03)00035-3","volume":"152","author":"CD Tarantilis","year":"2004","unstructured":"Tarantilis, C. D., Diakoulaki, D., & Kiranoudis, C. T. (2004). Combination of geographical information system and efficient routing algorithms for real life distribution operations. European Journal of Operational Research, 152(2), 437\u2013453.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"5464_CR12","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1051\/ro:2004029","volume":"38","author":"CD Tarantilis","year":"2004","unstructured":"Tarantilis, C. D., Ioannou, G., Kiranoudis, C. T., et al. (2004). A threshold accepting approach to the open vehicle routing problem. Rairo Operations Research., 38(4), 345\u2013360.","journal-title":"Rairo Operations Research."},{"issue":"5","key":"5464_CR13","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1057\/palgrave.jors.2601848","volume":"56","author":"CD Tarantilis","year":"2005","unstructured":"Tarantilis, C. D., Ioannou, G., Kiranoudis, C. T., et al. (2005). Solving the open vehicle routing problem via a single parameter metaheuristic algorithm. The Journal of Operational Research Society, 56(5), 588\u2013596.","journal-title":"The Journal of Operational Research Society"},{"issue":"2","key":"5464_CR14","doi-asserted-by":"publisher","first-page":"207","DOI":"10.4236\/ajor.2012.22024","volume":"2","author":"IV Joseph","year":"2012","unstructured":"Joseph, I. V., & Cavalier, T. M. (2012). A Genetic algorithm for the split delivery vehicle routing problem. American Journal of Operations Research, 2(2), 207\u2013216.","journal-title":"American Journal of Operations Research"},{"issue":"1","key":"5464_CR15","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s10479-012-1282-3","volume":"222","author":"L Berbotto","year":"2014","unstructured":"Berbotto, L., Garcia, S., & Nogales, F. J. (2014). A randomized granular tabu search heuristic for the split delivery vehicle routing problem. Annals of Operations Research, 222(1), 153\u2013173.","journal-title":"Annals of Operations Research"},{"issue":"6","key":"5464_CR16","doi-asserted-by":"publisher","first-page":"168","DOI":"10.3969\/j.issn.1000-3428.2011.06.064","volume":"37","author":"SB Li","year":"2011","unstructured":"Li, S. B., Chai, Y. M., & Wang, L. M. (2011). Research on split delivery open vehicle routing problem. Computer Engineering, 37(6), 168\u2013171. \n                    https:\/\/doi.org\/10.3969\/j.issn.1000-3428.2011.06.064\n                    \n                  . (in Chinese).","journal-title":"Computer Engineering"},{"issue":"8","key":"5464_CR17","doi-asserted-by":"publisher","first-page":"1801","DOI":"10.12011\/1000-6788(2012)8-1801","volume":"32","author":"GH Sun","year":"2012","unstructured":"Sun, G. H. (2012). Modeling and algorithm for open vehicle routing problem with full-truckloads and time windows. Systems Engineering-Theory & Practice, 32(8), 1801\u20131807. \n                    https:\/\/doi.org\/10.12011\/1000-6788(2012)8-1801\n                    \n                  . (in Chinese).","journal-title":"Systems Engineering-Theory & Practice"},{"issue":"3","key":"5464_CR18","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. (2011). Branch and price for the vehicle routing problem with discrete split deliveries and time windows. European Journal of Operational Research, 213(3), 470\u2013477.","journal-title":"European Journal of Operational Research"},{"key":"5464_CR19","volume-title":"Discrete optimization algorithms with pascal programs","author":"M Syslo","year":"1983","unstructured":"Syslo, M., Deo, N., & Kowalski, J. S. (1983). Discrete optimization algorithms with pascal programs. New Jersey: Prentice Hall Inc."},{"issue":"3","key":"5464_CR20","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1016\/S0377-2217(03)00238-8","volume":"157","author":"J Btandao","year":"2004","unstructured":"Btandao, J. (2004). A tabu search algorithm for the open vehicle routing problem. European Journal of Operational Research, 157(3), 552\u2013564.","journal-title":"European Journal of Operational Research"},{"issue":"8","key":"5464_CR21","doi-asserted-by":"publisher","first-page":"2349","DOI":"10.1007\/s11590-014-0752-8","volume":"8","author":"X Wang","year":"2014","unstructured":"Wang, X., Golden, B., & Gulczynski, D. (2014). A worst-case analysis for the split delivery capacitated team orienteering problem with minimum delivery amounts. Optimization Letters, 8(8), 2349\u20132356.","journal-title":"Optimization Letters"},{"issue":"7","key":"5464_CR22","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. (2015). An adaptive guidance meta-heuristic for vehicle routing problem with splits and clustered backhauls. Journal of the Operational Research Society, 66(7), 1222\u20131236.","journal-title":"Journal of the Operational Research Society"},{"issue":"2","key":"5464_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10479-015-1792-x","volume":"242","author":"B Yao","year":"2016","unstructured":"Yao, B., Yu, B., Hu, P., et al. (2016). An improved particle swarm optimization for carton heterogeneous vehicle routing problem with a collection depot. Annals of Operations Research, 242(2), 1\u201318.","journal-title":"Annals of Operations Research"},{"issue":"5","key":"5464_CR24","doi-asserted-by":"publisher","first-page":"78","DOI":"10.16381\/j.cnki.issn1003-207x.2017.05.010","volume":"25","author":"Z Fu","year":"2017","unstructured":"Fu, Z., Liu, W., & Qiu, M. (2017). A tabu search algorithm for the vehicle routing problem with soft time windows and split deliveries by order. Chinese Journal of Management Science, 25(5), 78\u201386. \n                    https:\/\/doi.org\/10.16381\/j.cnki.issn1003-207x.2017.05.010\n                    \n                  . (in Chinese).","journal-title":"Chinese Journal of Management Science"},{"key":"5464_CR25","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.asoc.2015.03.026","volume":"32","author":"J Brito","year":"2015","unstructured":"Brito, J., Martinez, F. J., Moreno, J. A., et al. (2015). An ACO hybrid metaheuristic for close-open vehicle routing problems with time windows and fuzzy constraints. Applied Soft Computing, 32, 154\u2013163.","journal-title":"Applied Soft Computing"},{"issue":"2","key":"5464_CR26","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1016\/j.eswa.2013.07.078","volume":"41","author":"Y Wang","year":"2014","unstructured":"Wang, Y., Ma, X. L., Lao, Y. T., et al. (2014). A fuzzy-based customer clustering approach with hierarchical structure for logistics network optimization. Expert Systems with Applications, 41(2), 521\u2013534.","journal-title":"Expert Systems with Applications"},{"issue":"12","key":"5464_CR27","doi-asserted-by":"publisher","first-page":"5019","DOI":"10.1016\/j.eswa.2015.02.058","volume":"42","author":"Y Wang","year":"2015","unstructured":"Wang, Y., Ma, X. L., Xu, M. Z., et al. (2015). Two-echelon logistics distribution region partitioning problem based on a hybrid particle swarm optimization-genetic algorithm. Expert Systems with Applications, 42(12), 5019\u20135031.","journal-title":"Expert Systems with Applications"},{"issue":"3","key":"5464_CR28","doi-asserted-by":"publisher","first-page":"3271","DOI":"10.1007\/s11277-017-3994-9","volume":"95","author":"TS Alemayehu","year":"2017","unstructured":"Alemayehu, T. S., & Kim, J. H. (2017). Efficient nearest neighbor heuristic TSP algorithms for reducing data acquisition latency of UAV relay WSN. Wireless Personal Communications, 95(3), 3271\u20133285.","journal-title":"Wireless Personal Communications"},{"issue":"1","key":"5464_CR29","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s11277-017-4515-6","volume":"97","author":"MM Rabik","year":"2017","unstructured":"Rabik, M. M., & Balasubada, K. (2017). Distributive aware probabilistic back propagation (DAPBP) routing scheme for vehicular networks. Wireless Personal Communications, 97(1), 483\u2013493.","journal-title":"Wireless Personal Communications"}],"container-title":["Wireless Personal Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11277-018-5464-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-018-5464-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-018-5464-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T19:59:25Z","timestamp":1549310365000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11277-018-5464-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,5]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["5464"],"URL":"https:\/\/doi.org\/10.1007\/s11277-018-5464-4","relation":{},"ISSN":["0929-6212","1572-834X"],"issn-type":[{"value":"0929-6212","type":"print"},{"value":"1572-834X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,2,5]]},"assertion":[{"value":"5 February 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}