{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T01:04:51Z","timestamp":1768093491192,"version":"3.49.0"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,4,6]],"date-time":"2019-04-06T00:00:00Z","timestamp":1554508800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,4,6]],"date-time":"2019-04-06T00:00:00Z","timestamp":1554508800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003392","name":"Natural Science Foundation of Fujian Province","doi-asserted-by":"publisher","award":["2018J01091"],"award-info":[{"award-number":["2018J01091"]}],"id":[{"id":"10.13039\/501100003392","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003392","name":"Natural Science Foundation of Fujian Province","doi-asserted-by":"publisher","award":["2017J01111"],"award-info":[{"award-number":["2017J01111"]}],"id":[{"id":"10.13039\/501100003392","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003392","name":"Natural Science Foundation of Fujian Province","doi-asserted-by":"publisher","award":["2015J01258"],"award-info":[{"award-number":["2015J01258"]}],"id":[{"id":"10.13039\/501100003392","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003815","name":"Huaqiao University","doi-asserted-by":"publisher","award":["ZQN-PY410"],"award-info":[{"award-number":["ZQN-PY410"]}],"id":[{"id":"10.13039\/501100003815","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Evol. Intel."],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s12065-019-00224-7","type":"journal-article","created":{"date-parts":[[2019,4,7]],"date-time":"2019-04-07T02:57:29Z","timestamp":1554605849000},"page":"2283-2294","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Multiobjective memetic algorithm based on adaptive local search chains for vehicle routing problem with time windows"],"prefix":"10.1007","volume":"15","author":[{"given":"Kaikai","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yiqiao","family":"Cai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shunkai","family":"Fu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huizhen","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,6]]},"reference":[{"key":"224_CR1","volume-title":"The vehicle routing problem","year":"2002","unstructured":"Toth P, Vigo D (eds) (2002) The vehicle routing problem. Society for Industrial and Applied Mathematics, Philadelphia"},{"issue":"3","key":"224_CR2","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0377-2217(92)90192-C","volume":"59","author":"G Laporte","year":"1992","unstructured":"Laporte G (1992) The vehicle routing problem: an overview of exact and approximate algorithms. Eur J Oper Res 59(3):345\u2013358","journal-title":"Eur J Oper Res"},{"issue":"1","key":"224_CR3","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1287\/trsc.1030.0056","volume":"39","author":"O Br\u00e4ysy","year":"2005","unstructured":"Br\u00e4ysy O, Gendreau M (2005) Vehicle routing problem with time windows, part I: route construction and local search algorithms. Transp Sci 39(1):104\u2013118","journal-title":"Transp Sci"},{"issue":"1","key":"224_CR4","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1287\/trsc.1030.0057","volume":"39","author":"O Br\u00e4ysy","year":"2005","unstructured":"Br\u00e4ysy O, Gendreau M (2005) Vehicle routing problem with time windows, part II: metaheuristics. Transp Sci 39(1):119\u2013139","journal-title":"Transp Sci"},{"key":"224_CR5","doi-asserted-by":"crossref","unstructured":"Dixit A, Mishra A, Shukla A (2019) Vehicle routing problem with time windows using meta-heuristic algorithms: a survey. In: Harmony search and nature inspired optimization algorithms. Springer, Singapore, pp 539\u2013546","DOI":"10.1007\/978-981-13-0761-4_52"},{"key":"224_CR6","first-page":"67","volume-title":"Vehicle routing problem with time windows. Column generation","author":"B Kallehauge","year":"2005","unstructured":"Kallehauge B, Larsen J, Madsen OBG et al (2005) Vehicle routing problem with time windows. Column generation. Springer, Boston, pp 67\u201398"},{"issue":"1","key":"224_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2011.07.037","volume":"218","author":"R Baldacci","year":"2012","unstructured":"Baldacci R, Mingozzi A, Roberti R (2012) Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints. Eur J Oper Res 218(1):1\u20136","journal-title":"Eur J Oper Res"},{"issue":"4","key":"224_CR8","first-page":"419","volume":"28","author":"R Goel","year":"2017","unstructured":"Goel R, Maini R (2017) Vehicle routing problem and its solution methodologies: a survey. Int J Logist Syst Manag 28(4):419\u2013435","journal-title":"Int J Logist Syst Manag"},{"issue":"5","key":"224_CR9","doi-asserted-by":"publisher","first-page":"950","DOI":"10.1016\/j.cor.2009.08.002","volume":"37","author":"R Liu","year":"2010","unstructured":"Liu R, Jiang Z, Fung RYK et al (2010) Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration. Comput Oper Res 37(5):950\u2013959","journal-title":"Comput Oper Res"},{"issue":"04","key":"224_CR10","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1142\/S0219686718500282","volume":"17","author":"H Savitri","year":"2018","unstructured":"Savitri H, Kurniawati DA (2018) Sweep algorithm and mixed integer linear program for vehicle routing problem with time windows. J Adv Manuf Syst 17(04):505\u2013513","journal-title":"J Adv Manuf Syst"},{"key":"224_CR11","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/j.asoc.2018.11.029","volume":"75","author":"A Baniamerian","year":"2019","unstructured":"Baniamerian A, Bashiri M, Tavakkoli-Moghaddam R (2019) Modified variable neighborhood search and genetic algorithm for profitable heterogeneous vehicle routing problem with cross-docking. Appl Soft Comput 75:441\u2013460","journal-title":"Appl Soft Comput"},{"key":"224_CR12","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/j.ins.2018.12.086","volume":"481","author":"Y Marinakis","year":"2019","unstructured":"Marinakis Y, Marinaki M, Migdalas A (2019) A multi-adaptive particle swarm optimization for the vehicle routing problem with time windows. Inf Sci 481:311\u2013329","journal-title":"Inf Sci"},{"key":"224_CR13","unstructured":"Gambardella LM, Taillard \u00c9, Agazzi G (1999) Macs-vrptw: a multiple colony system for vehicle routing problems with time windows. In: New ideas in optimization, pp 63\u201376"},{"issue":"2","key":"224_CR14","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.tre.2010.09.010","volume":"47","author":"B Yu","year":"2011","unstructured":"Yu B, Yang Z (2011) An ant colony optimization model: the period vehicle routing problem with time windows. Transp Res Part E Logist Transp Rev 47(2):166\u2013181","journal-title":"Transp Res Part E Logist Transp Rev"},{"issue":"3","key":"224_CR15","doi-asserted-by":"publisher","first-page":"1100","DOI":"10.1109\/JSYST.2014.2300201","volume":"9","author":"Y Zhou","year":"2015","unstructured":"Zhou Y, Wang J (2015) A local search-based multiobjective optimization algorithm for multiobjective vehicle routing problem with time windows. IEEE Syst J 9(3):1100\u20131113","journal-title":"IEEE Syst J"},{"key":"224_CR16","first-page":"473","volume-title":"Guided local search for the vehicle routing problem with time windows. Meta-heuristics","author":"P Kilby","year":"1999","unstructured":"Kilby P, Prosser P, Shaw P (1999) Guided local search for the vehicle routing problem with time windows. Meta-heuristics. Springer, Boston, pp 473\u2013486"},{"key":"224_CR17","doi-asserted-by":"crossref","unstructured":"Castro-Gutierrez J, Landa-Silva D, P\u00e9rez JM (2011) Nature of real-world multi-objective vehicle routing with evolutionary algorithms. In: 2011 IEEE international conference on systems, man, and cybernetics. IEEE, pp 257\u2013264","DOI":"10.1109\/ICSMC.2011.6083675"},{"issue":"1","key":"224_CR18","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/j.cor.2010.05.004","volume":"38","author":"A Garcia-Najera","year":"2011","unstructured":"Garcia-Najera A, Bullinaria JA (2011) An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows. Comput Oper Res 38(1):287\u2013300","journal-title":"Comput Oper Res"},{"issue":"1","key":"224_CR19","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10589-005-3070-3","volume":"34","author":"KC Tan","year":"2006","unstructured":"Tan KC, Chew YH, Lee LH (2006) A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows. Comput Optim Appl 34(1):115\u2013151","journal-title":"Comput Optim Appl"},{"issue":"4","key":"224_CR20","doi-asserted-by":"publisher","first-page":"1096","DOI":"10.1016\/j.asoc.2010.04.001","volume":"10","author":"K Ghoseiri","year":"2010","unstructured":"Ghoseiri K, Ghannadpour SF (2010) Multi-objective vehicle routing problem with time windows using goal programming and genetic algorithm. Appl Soft Comput 10(4):1096\u20131107","journal-title":"Appl Soft Comput"},{"issue":"2","key":"224_CR21","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/MCI.2010.936309","volume":"5","author":"YS Ong","year":"2010","unstructured":"Ong YS, Lim MH, Chen X (2010) Memetic computation\u2014past, present & future. IEEE Comput Intell Mag 5(2):24\u201331","journal-title":"IEEE Comput Intell Mag"},{"key":"224_CR22","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.cie.2018.04.032","volume":"120","author":"J Brand\u00e3o","year":"2018","unstructured":"Brand\u00e3o J (2018) Iterated local search algorithm with ejection chains for the open vehicle routing problem with time windows. Comput Ind Eng 120:146\u2013159","journal-title":"Comput Ind Eng"},{"issue":"1","key":"224_CR23","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1109\/TSMCB.2006.883271","volume":"37","author":"A Caponio","year":"2007","unstructured":"Caponio A, Cascella GL, Neri F et al (2007) A fast adaptive memetic algorithm for online and offline control design of PMSM drives. IEEE Trans Syst Man Cybern Part B (Cybern) 37(1):28\u201341","journal-title":"IEEE Trans Syst Man Cybern Part B (Cybern)"},{"issue":"1","key":"224_CR24","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1162\/evco.2010.18.1.18102","volume":"18","author":"D Molina","year":"2010","unstructured":"Molina D, Lozano M, Garc\u00eda-Mart\u00ednez C et al (2010) Memetic algorithms for continuous optimisation based on local search chains. Evol Comput 18(1):27\u201363","journal-title":"Evol Comput"},{"key":"224_CR25","unstructured":"Chenghai G (2016) Multiobjective vehicle routing problems with backhauls and time windows: modelling, instances and algorithms. Master\u2019s Thesis, Sun Yat-sen University"},{"issue":"3","key":"224_CR26","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1287\/trsc.1120.0439","volume":"47","author":"CD Tarantilis","year":"2013","unstructured":"Tarantilis CD, Anagnostopoulou AK, Repoussis PP (2013) Adaptive path relinking for vehicle routing and scheduling problems with product returns. Transp Sci 47(3):356\u2013379","journal-title":"Transp Sci"},{"issue":"4","key":"224_CR27","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1162\/106365605774666895","volume":"13","author":"K Deb","year":"2005","unstructured":"Deb K, Mohan M, Mishra S (2005) Evaluating the \u03b5-domination based multi-objective evolutionary algorithm for a quick computation of Pareto-optimal solutions. Evol Comput 13(4):501\u2013525","journal-title":"Evol Comput"},{"issue":"2","key":"224_CR28","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper Res 35(2):254\u2013265","journal-title":"Oper Res"},{"issue":"6","key":"224_CR29","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang Q, Li H (2007) MOEA\/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11(6):712\u2013731","journal-title":"IEEE Trans Evol Comput"},{"key":"224_CR30","unstructured":"Zitzler E, Laumanns M, Thiele L (2002) SPEA2: Improving the strength Pareto evolutionary algorithm. In: Evolutionary methods for design, optimization and control with applications to industrial problems. CIMNE, Barcelona, pp 95\u2013100"},{"issue":"4","key":"224_CR31","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans Evol Comput 3(4):257\u2013271","journal-title":"IEEE Trans Evol Comput"},{"issue":"10","key":"224_CR32","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1007\/s00500-008-0392-y","volume":"13","author":"S Garc\u00eda","year":"2009","unstructured":"Garc\u00eda S, Fern\u00e1ndez A, Luengo J et al (2009) A study of statistical techniques and performance measures for genetics-based machine learning: accuracy and interpretability. Soft Comput 13(10):959\u2013977","journal-title":"Soft Comput"},{"issue":"1","key":"224_CR33","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","volume":"1","author":"J Derrac","year":"2011","unstructured":"Derrac J, Garc\u00eda S, Molina D et al (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evolut Comput 1(1):3\u201318","journal-title":"Swarm Evolut Comput"},{"issue":"1","key":"224_CR34","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1049\/iet-cps.2017.0010","volume":"2","author":"R Atat","year":"2017","unstructured":"Atat R, Liu L, Chen H et al (2017) Enabling cyber-physical communication in 5G cellular networks: challenges, spatial spectrum sensing, and cyber-security. IET Cyber Phys Syst Theory Appl 2(1):49\u201354","journal-title":"IET Cyber Phys Syst Theory Appl"},{"key":"224_CR35","doi-asserted-by":"publisher","first-page":"73603","DOI":"10.1109\/ACCESS.2018.2878681","volume":"6","author":"R Atat","year":"2018","unstructured":"Atat R, Liu L, Wu J et al (2018) Big data meet cyber-physical systems: a panoramic survey. IEEE Access 6:73603\u201373636","journal-title":"IEEE Access"},{"issue":"6","key":"224_CR36","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1109\/MCOM.2014.6829939","volume":"52","author":"J Wu","year":"2014","unstructured":"Wu J, Bisio I, Gniady C et al (2014) Context-aware networking and communications: part 1. IEEE Commun Mag 52(6):14\u201315","journal-title":"IEEE Commun Mag"},{"issue":"4","key":"224_CR37","doi-asserted-by":"publisher","first-page":"3249","DOI":"10.1109\/TVT.2016.2586382","volume":"66","author":"G Li","year":"2017","unstructured":"Li G, Boukhatem L, Wu J (2017) Adaptive quality-of-service-based routing for vehicular ad hoc networks with ant colony optimization. IEEE Trans Veh Technol 66(4):3249\u20133264","journal-title":"IEEE Trans Veh Technol"},{"issue":"3","key":"224_CR38","doi-asserted-by":"publisher","first-page":"61","DOI":"10.4018\/IJESMA.2018070104","volume":"10","author":"D Chaudhary","year":"2018","unstructured":"Chaudhary D, Bhushan K, Gupta B (2018) Survey on DDoS attacks and defense mechanisms in cloud and fog computing. Int J E-Serv Mobile Appl 10(3):61\u201383","journal-title":"Int J E-Serv Mobile Appl"},{"issue":"2","key":"224_CR39","first-page":"53","volume":"5","author":"S Ouf","year":"2015","unstructured":"Ouf S, Nasr M (2015) Cloud computing: the future of big data management. Int J Cloud Appl Comput 5(2):53\u201361","journal-title":"Int J Cloud Appl Comput"},{"issue":"4","key":"224_CR40","doi-asserted-by":"publisher","first-page":"4609","DOI":"10.1007\/s11042-017-4742-6","volume":"77","author":"K Bhushan","year":"2018","unstructured":"Bhushan K, Gupta B (2018) A novel approach to defend multimedia flash crowd in cloud environment. Multimed Tools Appl 77(4):4609\u20134639","journal-title":"Multimed Tools Appl"},{"issue":"2","key":"224_CR41","first-page":"36","volume":"5","author":"S Bagui","year":"2015","unstructured":"Bagui S, Nguyen LT (2015) Database sharding: to provide fault tolerance and scalability of big data on the cloud. Int J Cloud Appl Comput 5(2):36\u201352","journal-title":"Int J Cloud Appl Comput"},{"issue":"3","key":"224_CR42","doi-asserted-by":"publisher","first-page":"2389","DOI":"10.1109\/COMST.2018.2812301","volume":"20","author":"J Wu","year":"2018","unstructured":"Wu J, Guo S, Huang H et al (2018) Information and communications technologies for sustainable development goals: state-of-the-art, needs and perspectives. IEEE Commun Surv Tutor 20(3):2389\u20132406","journal-title":"IEEE Commun Surv Tutor"},{"issue":"3","key":"224_CR43","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1109\/JSYST.2016.2550530","volume":"10","author":"J Wu","year":"2016","unstructured":"Wu J, Guo S, Li J et al (2016) Big data meet green challenges: big data toward green applications. IEEE Syst J 10(3):888\u2013900","journal-title":"IEEE Syst J"}],"container-title":["Evolutionary Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-019-00224-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12065-019-00224-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-019-00224-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,29]],"date-time":"2022-10-29T11:31:35Z","timestamp":1667043095000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12065-019-00224-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,6]]},"references-count":43,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["224"],"URL":"https:\/\/doi.org\/10.1007\/s12065-019-00224-7","relation":{},"ISSN":["1864-5909","1864-5917"],"issn-type":[{"value":"1864-5909","type":"print"},{"value":"1864-5917","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,4,6]]},"assertion":[{"value":"25 November 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 February 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 March 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 April 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}