{"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":1774935069323,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"S4","license":[{"start":{"date-parts":[[2018,2,17]],"date-time":"2018-02-17T00:00:00Z","timestamp":1518825600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"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,7]]},"DOI":"10.1007\/s10586-018-1957-x","type":"journal-article","created":{"date-parts":[[2018,2,17]],"date-time":"2018-02-17T09:11:14Z","timestamp":1518858674000},"page":"8725-8733","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":40,"title":["Improved tabu search algorithm for the open vehicle routing problem with soft time windows and satisfaction rate"],"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,2,17]]},"reference":[{"key":"1957_CR1","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.asoc.2015.06.035","volume":"35","author":"M Barkaoui","year":"2015","unstructured":"Barkaoui, M., Berger, J., Boukhtouta, A.: Customer satisfaction in dynamic vehicle routing problem with time windows. Appl. Soft Comput. 35, 423\u2013432 (2015)","journal-title":"Appl. Soft Comput."},{"issue":"2","key":"1957_CR2","doi-asserted-by":"publisher","first-page":"469","DOI":"10.3934\/jimo.2012.8.469","volume":"8","author":"M Lai","year":"2017","unstructured":"Lai, M., Tong, X.: A metaheuristic method for vehicle routing problem based on improved ant colony optimization and Tabu search. J. Ind. Manag. Optim. 8(2), 469\u2013484 (2017)","journal-title":"J. Ind. Manag. Optim."},{"issue":"5","key":"1957_CR3","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 heuristic method for the open vehicle routing problem. J. Oper. Res. Soc. 51(5), 564\u2013573 (2000)","journal-title":"J. Oper. Res. Soc."},{"issue":"3","key":"1957_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.: 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."},{"issue":"2","key":"1957_CR5","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/S0377-2217(03)00035-3","volume":"152","author":"C Tarantilis","year":"2004","unstructured":"Tarantilis, C., Diakoulaki, D., Kiranoudis, C.T.: Combination of geographical information system and efficient routing algorithms for real life distribution operations. Eur. J. Oper. Res. 152(2), 437\u2013453 (2004)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"1957_CR6","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1057\/palgrave.jors.2602143","volume":"58","author":"PP Repoussis","year":"2007","unstructured":"Repoussis, P.P., Tarantilis, C.D., Ioannou, G.: The open vehicle routing problem with time windows. J. Oper. Res. Soc. 58(3), 355\u2013367 (2007)","journal-title":"J. Oper. Res. Soc."},{"issue":"6","key":"1957_CR7","doi-asserted-by":"publisher","first-page":"187","DOI":"10.3969\/j.issn.1000-3428.2011.06.064","volume":"37","author":"SB Li","year":"2011","unstructured":"Li, S.B., Wang, L.M.: Multi-start tabu search algorithm for solving OVRPTW. Comput. Eng. 37(6), 187\u2013189 (2011). \nhttps:\/\/doi.org\/10.3969\/j.issn.1000-3428.2011.06.064","journal-title":"Comput. Eng."},{"issue":"2","key":"1957_CR8","first-page":"79","volume":"5","author":"TG Xiao","year":"2008","unstructured":"Xiao, T.G., Fu, Z.: A genetic algorithm for the open vehicle routing problem with soft time windows. J. Railw. Sci. Eng. 5(2), 79\u201383 (2008)","journal-title":"J. Railw. Sci. Eng."},{"key":"1957_CR9","unstructured":"Duan, F.H.: OVRPSTW and its improved genetic algorithm. Advanced Technology in Teaching: Proceedings of the 2009 3rd International Conference on Teaching and Computational Science (WTCS 2009), Springer Berlin Heidelberg, 117, 249\u2013255 (2012)"},{"key":"1957_CR10","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."},{"issue":"5","key":"1957_CR11","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. Oper. Res. Soc. 59(5), 663\u2013673 (2008)","journal-title":"J. Oper. Res. Soc."},{"issue":"2","key":"1957_CR12","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":"7","key":"1957_CR13","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.: Material distribution route planning for multiple automated guided vehicles with split deliveries by order. Comput. Integr. Manuf. Syst. 23(7), 1520\u20131528 (2017). \nhttps:\/\/doi.org\/10.13196\/j.cims.2017.07.017","journal-title":"Comput. Integr. Manuf. Syst."},{"issue":"2","key":"1957_CR14","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":"7","key":"1957_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":"4","key":"1957_CR16","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1109\/TEM.2013.2257794","volume":"60","author":"SF Ghannadpour","year":"2013","unstructured":"Ghannadpour, S.F., Noori, S., Tavakkoli-Moghaddam, R.: Multi objective dynamic vehicle routing problem with fuzzy travel times and customers\u2019 satisfaction in supply chain management. IEEE Trans. Eng. Manag. 60(4), 777\u2013790 (2013)","journal-title":"IEEE Trans. Eng. Manag."},{"issue":"2","key":"1957_CR17","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon, M.M.: Algorithms for vehicle routing problem and scheduling problem with time windows constraints. Oper. Res. 35(2), 254\u2013265 (1987)","journal-title":"Oper. Res."},{"key":"1957_CR18","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1016\/j.jclepro.2017.07.170","volume":"165","author":"R Accorsi","year":"2017","unstructured":"Accorsi, R., Gallo, A., Manzini, R.: A climate driven decision-support model for the distribution of perishable products. J. Clean. Prod. 165, 917\u2013929 (2017)","journal-title":"J. Clean. Prod."},{"key":"1957_CR19","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.: An ACO hybrid metaheuristic for close-open vehicle routing problems with time windows and fuzzy constraints. Appl. Soft Comput. 32, 154\u2013163 (2015)","journal-title":"Appl. Soft Comput."},{"issue":"5","key":"1957_CR20","doi-asserted-by":"publisher","first-page":"1079","DOI":"10.1111\/itor.12322","volume":"24","author":"CL Quintero-Araujo","year":"2017","unstructured":"Quintero-Araujo, C.L., Caballero-Villalobos, J.P., Juan, A.A., et al.: A biased-randomized metaheuristic for the capacitated location routing problem. Int. Trans. Oper. Res. 24(5), 1079\u20131098 (2017)","journal-title":"Int. Trans. Oper. Res."},{"issue":"6","key":"1957_CR21","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1007\/s12541-017-0095-3","volume":"18","author":"J Bae","year":"2017","unstructured":"Bae, J., Chung, W.: A heuristic for a heterogeneous automated guided vehicle routing problem. Int. J. Precis. Eng. Manuf. 18(6), 795\u2013801 (2017)","journal-title":"Int. J. Precis. Eng. Manuf."},{"issue":"5","key":"1957_CR22","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.: A tabu search algorithm for the vehicle routing problem with soft time windows and split deliveries by order. Chin. J. Manag. Sci. 25(5), 78\u201386 (2017). \nhttps:\/\/doi.org\/10.16381\/j.cnki.issn1003-207x.2017.05.010","journal-title":"Chin. J. Manag. Sci."},{"key":"1957_CR23","volume-title":"Discrete Optimization Algorithms with Pascal Programs","author":"M Syslo","year":"1983","unstructured":"Syslo, M., Deo, N., Kowalski, J.: Discrete Optimization Algorithms with Pascal Programs. Prentice Hall, New Tork (1983)"},{"issue":"3","key":"1957_CR24","doi-asserted-by":"publisher","first-page":"1489","DOI":"10.1007\/s10586-016-0618-1","volume":"19","author":"JY Wang","year":"2016","unstructured":"Wang, J.Y., Xu, H.C.: Transportation route optimization with cost object in China. Clust. Comput. 19(3), 1489\u20131501 (2016)","journal-title":"Clust. Comput."},{"issue":"1","key":"1957_CR25","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. Clust. Comput. 20(1), 401\u2013411 (2017)","journal-title":"Clust. Comput."}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10586-018-1957-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-018-1957-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-018-1957-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,2]],"date-time":"2019-12-02T14:15:41Z","timestamp":1575296141000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10586-018-1957-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,17]]},"references-count":25,"journal-issue":{"issue":"S4","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["1957"],"URL":"https:\/\/doi.org\/10.1007\/s10586-018-1957-x","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"value":"1386-7857","type":"print"},{"value":"1573-7543","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,2,17]]},"assertion":[{"value":"11 November 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 January 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 January 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 February 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}