{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T20:58:19Z","timestamp":1775249899708,"version":"3.50.1"},"reference-count":64,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2021,9,24]],"date-time":"2021-09-24T00:00:00Z","timestamp":1632441600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,9,24]],"date-time":"2021-09-24T00:00:00Z","timestamp":1632441600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Evol. Intel."],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s12065-021-00658-y","type":"journal-article","created":{"date-parts":[[2021,9,24]],"date-time":"2021-09-24T15:34:43Z","timestamp":1632497683000},"page":"1-16","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Multi-objective algorithm based on tissue P system for solving tri-objective optimization problems"],"prefix":"10.1007","volume":"16","author":[{"given":"Zhixin","family":"He","sequence":"first","affiliation":[]},{"given":"Kang","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Hang","family":"Shu","sequence":"additional","affiliation":[]},{"given":"Xuan","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Xinyu","family":"Lyu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,24]]},"reference":[{"key":"658_CR1","doi-asserted-by":"crossref","first-page":"113609","DOI":"10.1016\/j.cma.2020.113609","volume":"376\u2013113609","author":"L Abualigah","year":"2021","unstructured":"Abualigah L, Diabat A et al (2021) The arithmetic optimization algorithm[J]. Comput Methods Appl Mech Eng 376\u2013113609:113609","journal-title":"Comput Methods Appl Mech Eng"},{"key":"658_CR2","doi-asserted-by":"crossref","unstructured":"Abualigah L, Diabat A (2021) Advances in sine cosine algorithm: a comprehensive survey. Artif Intell Rev. 2567\u20132608","DOI":"10.1007\/s10462-020-09909-3"},{"key":"658_CR3","doi-asserted-by":"crossref","unstructured":"Abualigah L, Diabat A (2020) A comprehensive survey of the Grasshopper optimization algorithm: results, variants, and applications[J]. Neural Comput Appl. 15533\u201315556","DOI":"10.1007\/s00521-020-04789-8"},{"key":"658_CR4","doi-asserted-by":"crossref","first-page":"113609","DOI":"10.1016\/j.cma.2020.113609","volume":"376","author":"L Abualigah","year":"2021","unstructured":"Abualigah L, Diabat A et al (2021) The arithmetic optimization algorithm. Comput Methods Appl Mech Eng 376:113609","journal-title":"Comput Methods Appl Mech Eng"},{"issue":"3","key":"658_CR5","first-page":"376","volume":"23","author":"W Meng","year":"2018","unstructured":"Meng W, Ke L, Kwong S (2018) Learning to decompose: a paradigm for decomposition-based multiobjective optimization. IEEE Trans Evol Comput 23(3):376","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"658_CR6","first-page":"14","volume":"23","author":"K Dbe","year":"2019","unstructured":"Dbe K, Hussein R, Roy PC, Toscano G (2019) A taxonomy for metamodeling frameworks for evolutionary multiobjective optimization. IEEE Trans Evol Comput 23(1):14\u2013116","journal-title":"IEEE Trans Evol Comput"},{"key":"658_CR7","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/j.compeleceng.2017.01.025","volume":"58","author":"DV Medhane","year":"2017","unstructured":"Medhane DV, Sangaiah AK (2017) Search space-based multi-objective optimization evolutionary algorithm. Comput Electr Eng 58:126\u2013143","journal-title":"Comput Electr Eng"},{"issue":"99","key":"658_CR8","first-page":"14710","volume":"6","author":"H Huang","year":"2018","unstructured":"Huang H (2018) A hybrid multiobjective particle swarm optimization algorithm based on R2 indicator. IEEE Access 6(99):14710\u201314721","journal-title":"IEEE Access"},{"key":"658_CR9","doi-asserted-by":"crossref","unstructured":"Wy J, Kim BI, Kim S (2013) The rollon-rolloff waste collection vehicle routing problem with time windows. Eur J Op Res","DOI":"10.1016\/j.ejor.2012.09.001"},{"key":"658_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tre.2013.12.003","volume":"62","author":"N Bhusiri","year":"2014","unstructured":"Bhusiri N, Qureshi AG, Taniguchi E (2014) The tradeoff between fixed vehicle costs and time-dependent arrival penalties in a routing problem. Transp Res E Logis Transp Rev 62:1\u201322","journal-title":"Transp Res E Logis Transp Rev"},{"issue":"2","key":"658_CR11","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/j.cie.2013.11.006","volume":"67","author":"P Amorim","year":"2014","unstructured":"Amorim P, Almada-Lobo B (2014) The impact of food perishability issues in the vehicle routing problem. Comput Ind Eng 67(2):223\u2013233","journal-title":"Comput Ind Eng"},{"key":"658_CR12","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1016\/j.asoc.2013.12.012","volume":"17","author":"B Meli\u00e1n-Batista","year":"2014","unstructured":"Meli\u00e1n-Batista B, De SA, Angelbello F (2014) A bi-objective vehicle routing problem with time windows: a real case in Tenerife. Appl Soft Comput J 17:140\u2013152","journal-title":"Appl Soft Comput J"},{"issue":"4","key":"658_CR13","first-page":"472","volume":"57","author":"B Eksioglu","year":"2009","unstructured":"Eksioglu B, Vural AV, Reisman A (2009) The vehicle routing problem: a taxonomic review. Comput Ind Eng 57(4):472\u20131483","journal-title":"Comput Ind Eng"},{"issue":"1","key":"658_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2014.07.048","volume":"241","author":"R Layani","year":"2015","unstructured":"Layani R, Khemakhem M, Semet F (2015) Rich vehicle routing problems: from a taxonomy to a definition. Eur J Op Res 241(1):1\u201314","journal-title":"Eur J Op Res"},{"issue":"1","key":"658_CR15","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.cie.2014.10.029","volume":"79","author":"JR Montoya","year":"2015","unstructured":"Montoya JR, Franco JL, Isaza SN, Jimenez HF, Herazo N (2015) A literature review on the vehicle routing problem with multiple depots. Comput Ind Eng 79(1):115\u2013129","journal-title":"Comput Ind Eng"},{"key":"658_CR16","doi-asserted-by":"crossref","unstructured":"Dorling K, Heinrichs J, Messier G, Magierowski S (2016) Vehicle routing problems for drone delivery. IEEE Trans Syst Man Cybern Syst 1\u201316","DOI":"10.1109\/TSMC.2016.2582745"},{"key":"658_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-11467-0","volume-title":"The Oxford Handbook of Membrane Computing","author":"G Paun","year":"2010","unstructured":"Paun G, Rozenberg G, Salomaa A (2010) The Oxford Handbook of Membrane Computing. Oxford University Press, Oxford"},{"issue":"12","key":"658_CR18","doi-asserted-by":"crossref","first-page":"1578","DOI":"10.1016\/j.jpdc.2005.05.018","volume":"65","author":"L Pan","year":"2005","unstructured":"Pan L, Carlos M (2005) Solving multidimensional 0\u20131 knapsack problem by P systems with input and active membranes. J Parallel Distrib Comput 65(12):1578\u20131584","journal-title":"J Parallel Distrib Comput"},{"issue":"1","key":"658_CR19","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1142\/S0129054111007800","volume":"22","author":"L Pan","year":"2011","unstructured":"Pan L, Daniel DP, Marip J (2011) Computation of Ramsey numbers by P systems with active membranes. Int J Found Comput Sci 22(1):29\u201358","journal-title":"Int J Found Comput Sci"},{"key":"658_CR20","volume-title":"A New Class of Symbolic Abstract Neural Nets: Tissue P Systems","author":"C Martin","year":"2002","unstructured":"Martin C, Pazos J, Paun G, Rodriguez A (2002) A New Class of Symbolic Abstract Neural Nets: Tissue P Systems. Springer, Berlin, Heidelberg"},{"issue":"3","key":"658_CR21","doi-asserted-by":"crossref","first-page":"295","DOI":"10.15837\/ijccc.2008.3.2397","volume":"3","author":"G Paun","year":"2008","unstructured":"Paun G, Perez-Jimenez MJ, Riscos-Nunez A (2008) Tissue P systems with cell division. Int J Comput Commun Control 3(3):295","journal-title":"Int J Comput Commun Control"},{"issue":"6","key":"658_CR22","doi-asserted-by":"crossref","first-page":"906","DOI":"10.1016\/j.tcs.2009.11.010","volume":"411","author":"L Pan","year":"2010","unstructured":"Pan L, Paun G (2010) Spiking neural P systems: an improved normal form. Theor Comput Sci 411(6):906\u2013918","journal-title":"Theor Comput Sci"},{"issue":"8","key":"658_CR23","doi-asserted-by":"crossref","first-page":"1596","DOI":"10.1007\/s11432-011-4303-y","volume":"54","author":"L Pan","year":"2011","unstructured":"Pan L, Paun G, Perez-Jimenez MJ (2011) Spiking neural P systems with neuron division and budding. Sci China Inform Sci 54(8):1596\u20131607","journal-title":"Sci China Inform Sci"},{"key":"658_CR24","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1016\/j.tcs.2015.12.038","volume":"623","author":"T Wu","year":"2016","unstructured":"Wu T, Zhang Z, Paun G, Pan L (2016) Cell-like spiking neural P systems. Theor Comput Sci 623:180\u2013189","journal-title":"Theor Comput Sci"},{"key":"658_CR25","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.3005538","author":"T Wu","year":"2020","unstructured":"Wu T, Pan L, Yu Q, Tan KC (2020) Numerical spiking neural P systems. IEEE Trans Neural Netw Learn Syst. https:\/\/doi.org\/10.1109\/TNNLS.2020.3005538","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"658_CR26","doi-asserted-by":"publisher","DOI":"10.1061\/j.tcs.2020.07.016","author":"T Wu","year":"2020","unstructured":"Wu T, Zhang L, Pan L (2020) Spiking neural P systems with target indications. Theor Comput Sci. https:\/\/doi.org\/10.1061\/j.tcs.2020.07.016","journal-title":"Theor Comput Sci"},{"issue":"8","key":"658_CR27","doi-asserted-by":"crossref","first-page":"3349","DOI":"10.1109\/TNNLS.2017.2726119","volume":"29","author":"T Wu","year":"2018","unstructured":"Wu T, Paun A, Zhang Z, Pan L (2018) Spiking neural P systems with polarizations. IEEE Trans Neural Netw Learn Syst 29(8):3349\u20133360","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"issue":"1\u20132","key":"658_CR28","first-page":"37","volume":"15","author":"HF Wang","year":"2020","unstructured":"Wang HF, Zhou K, Zhang GX, Paul P, Duan YY, Qi HQ (2020) Application of weighted spiking neural P systems with rules on synapses for breaking RSA encryption. Int J Unconven Comput 15(1\u20132):37\u201358","journal-title":"Int J Unconven Comput"},{"key":"658_CR29","unstructured":"NishidaTY (2005) Membrane algorithm: an approximate algorithm for NP-complete optimization problems exploiting P-systems. In: Proceedings of the 6th international workshop on membrane computing (WMC \u201905),pp. 26-43, Vienna, Austria"},{"issue":"1","key":"658_CR30","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1006\/jcss.1999.1693","volume":"61","author":"G Paun","year":"2000","unstructured":"Paun G (2000) Computing with membranes. J Comput Syst Sci 61(1):108\u2013143","journal-title":"J Comput Syst Sci"},{"issue":"1","key":"658_CR31","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0304-3975(02)00659-X","volume":"61","author":"C Martin","year":"2003","unstructured":"Martin C, Pazos J, Paun G (2003) Tissue P systems. Theor Comput Sci 61(1):295\u2013326","journal-title":"Theor Comput Sci"},{"key":"658_CR32","first-page":"528","volume":"279","author":"G Zhang","year":"2014","unstructured":"Zhang G, GHeorghe M, Pan L, Perez-Jimenez MJ (2014) Evolutionary membrane computing: a comprehensive survey and new results. Inform Sences 279:528\u2013551","journal-title":"Inform Sences"},{"issue":"5","key":"658_CR33","doi-asserted-by":"crossref","first-page":"732","DOI":"10.15837\/ijccc.2015.5.2030","volume":"10","author":"X Wang","year":"2015","unstructured":"Wang X, Zhang G, Junbo Z, Haina R, Floentin I, Raluca L (2015) A modified membrane-inspired algorithm based on particle swarm optimization for mobile robot path planning. Int J Comput Commun Control 10(5):732\u2013745","journal-title":"Int J Comput Commun Control"},{"issue":"4","key":"658_CR34","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1080\/10020070708541023","volume":"17","author":"L Huang","year":"2007","unstructured":"Huang L, He X, Wang N, Yi X (2007) P systems based multi-objective optimization algorithm. Prog Nat Sci Mater Int 17(4):458\u2013465","journal-title":"Prog Nat Sci Mater Int"},{"issue":"1","key":"658_CR35","first-page":"93","volume":"87","author":"G Zhang","year":"2008","unstructured":"Zhang G, Gheorghe M, Wu CZ (2008) A quantum-inspired evolutionary algorithm based on P systems for knapsack problem. Fundamenta Inform 87(1):93\u2013116","journal-title":"Fundamenta Inform"},{"key":"658_CR36","doi-asserted-by":"crossref","unstructured":"Zhang G, Liu C, GheorgheM (2010)Diversity and convergence analysis of membrane algorithms. In: Proceedings of the 5th IEEE International Conferen ce on Bio-Inspired Computing: Theories and Applications, pp. 596-603","DOI":"10.1109\/BICTA.2010.5645193"},{"issue":"3","key":"658_CR37","doi-asserted-by":"crossref","first-page":"1528","DOI":"10.1016\/j.asoc.2012.05.032","volume":"13","author":"G Zhang","year":"2013","unstructured":"Zhang G, Cheng J, Gheorghe M, Meng Q (2013) A hybrid approach based on differential evolution and tissue membrane systems for solving constrained manufacturing parameter optimization problems. Appl Soft Comput J 13(3):1528\u20131542","journal-title":"Appl Soft Comput J"},{"key":"658_CR38","doi-asserted-by":"crossref","first-page":"1377","DOI":"10.1016\/S0252-9602(14)60090-4","volume":"5","author":"J He","year":"2014","unstructured":"He J, Xiao J (2014) An adaptive membrane algorithm for solving combinatorial optimization problems. Acta Math Sci 5:1377\u20131394","journal-title":"Acta Math Sci"},{"key":"658_CR39","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/j.ins.2014.02.057","volume":"276","author":"M Han","year":"2014","unstructured":"Han M, Liu C, Xing J (2014) An evolutionary membrane algorithm for global numerical optimization problems. Inform Sci 276:219\u2013241","journal-title":"Inform Sci"},{"issue":"3","key":"658_CR40","doi-asserted-by":"crossref","first-page":"199","DOI":"10.3233\/FI-2015-1151","volume":"136","author":"J He","year":"2015","unstructured":"He J, Zhang K (2015) A hybrid distribution algorithm based on membrane computing for solving the multiobjective multiple traveling salesman problem. Fundamenta Inform 136(3):199\u2013208","journal-title":"Fundamenta Inform"},{"issue":"2","key":"658_CR41","doi-asserted-by":"crossref","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. Op Res 35(2):254\u2013265","journal-title":"Op Res"},{"key":"658_CR42","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/s41965-018-00004-9","volume":"1","author":"D Orellana-Mart\u00edn","year":"2019","unstructured":"Orellana-Mart\u00edn D, Valencia-Cabrera L, Riscos-N\u00fa\u00f1ez A (2019) Minimal cooperation as a way to achieve the efficiency in cell-like membrane systems. J Membr Comput 1:85\u201392","journal-title":"J Membr Comput"},{"issue":"1","key":"658_CR43","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1016\/j.ejor.2012.11.049","volume":"227","author":"A Ullrich Christian","year":"2013","unstructured":"Ullrich Christian A (2013) Integrated machine scheduling and vehicle routing with time windows. Eur J Op Res 227(1):152\u2013165","journal-title":"Eur J Op Res"},{"key":"658_CR44","doi-asserted-by":"crossref","first-page":"10568","DOI":"10.1016\/j.eswa.2011.02.108","volume":"38","author":"S Yu","year":"2011","unstructured":"Yu S, Ding C, Zhu K (2011) A hybrid GA-TS algorithm for open vehicle routing optimization of coal mines material. Exp Syst Appl 38:10568\u201310573","journal-title":"Exp Syst Appl"},{"key":"658_CR45","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s10489-006-6926-z","volume":"24","author":"B Ombuki","year":"2006","unstructured":"Ombuki B, Ross B, Hanshar F (2006) Multi-objective genetic algorithm for vehicle routing problem with time windows. Appl Intell 24:17\u201330","journal-title":"Appl Intell"},{"issue":"1","key":"658_CR46","doi-asserted-by":"crossref","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 algorithmfor solving vehicle routing problem with time windows. Comput Optim Appl 34(1):115\u2013151","journal-title":"Comput Optim Appl"},{"key":"658_CR47","first-page":"115","volume":"4","author":"K Ghoseiri","year":"2010","unstructured":"Ghoseiri K, Ghannadpour F (2010) Multi-objective vehicle routing problem withtime windows using goal programming and genetic algorithm. Appl Soft Comput 4:115\u2013151","journal-title":"Appl Soft Comput"},{"issue":"3","key":"658_CR48","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/S0925-5273(98)00250-3","volume":"62","author":"SC Hong","year":"1999","unstructured":"Hong SC, Park YB (1999) A heuristic for bi-objective vehicle routing with time window constraints. Int J Prod Econ 62(3):249\u2013258","journal-title":"Int J Prod Econ"},{"key":"658_CR49","unstructured":"Zakaria N (2014) Partially optimized cyclic shift crossover for multi-objective genetic algorithms for the multi-objective vehicle routing problem with time-windows. In: 2014 IEEE Symposium on Computational Intelligence in Multi-Criteria Decision-Making (MCDM), pp. 106\u2013115"},{"key":"658_CR50","unstructured":"Andreas K, Savvas P, Christoforos C (2014) Adaptive evolutionary algorithm for a multi-objective VRP. Int J Eng Intell Syst 22"},{"key":"658_CR51","doi-asserted-by":"crossref","unstructured":"Niu Y, He J, Wang Z, Xiao J (2014) A P-based hybrid evolutionary algorithm for vehicle routing problem with time windows. Math Prob Eng 1\u201311","DOI":"10.1155\/2014\/169481"},{"key":"658_CR52","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1016\/j.swevo.2017.11.001","volume":"39","author":"W Dong","year":"2018","unstructured":"Dong W, Zhou K, Qi H, Zhang J (2018) A tissue P system based evolutionary algorithm for multi-objective VRPTW. Swarm Evolut Comput 39:310\u2013322","journal-title":"Swarm Evolut Comput"},{"issue":"18","key":"658_CR53","doi-asserted-by":"crossref","first-page":"2370","DOI":"10.1016\/j.ins.2010.12.015","volume":"181","author":"L Huang","year":"2011","unstructured":"Huang L, Suh IH, Abraham H (2011) Dynamic multi-objective optimization based on membrane computing for control of time-varying unstable plants. Inform Sci 181(18):2370\u20132391","journal-title":"Inform Sci"},{"issue":"3","key":"658_CR54","first-page":"159","volume":"7","author":"J Cheng","year":"2011","unstructured":"Cheng J, Zhang G, Zeng X (2011) A novel membrane algorithm based on differential evolution for numerical optimization. Int J Unconvent Comput 7(3):159\u2013183","journal-title":"Int J Unconvent Comput"},{"key":"658_CR55","doi-asserted-by":"crossref","unstructured":"Zhang G, Liu C, Gheorghe M (2010) Diversity and convergence analysis of membrane algorithms. In: Fifth international conference on bio-inspired computing: theories applications, pp. 596-603","DOI":"10.1109\/BICTA.2010.5645193"},{"key":"658_CR56","unstructured":"Zhang G, Gheorghe M, Jixiang C, Dynamic behavior analysis of membrane algorithms. MATCH Communications in Mathematical and in Computer hemistry (in press)"},{"key":"658_CR57","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0304-3975(02)00659-X","volume":"296","author":"C Martin","year":"2003","unstructured":"Martin C, Paun G, PAzos J (2003) Tissue P systems. Theor Comput Sci 296:295\u2013326","journal-title":"Theor Comput Sci"},{"issue":"1","key":"658_CR58","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.swevo.2011.02.001","volume":"1","author":"AE Eiben","year":"2011","unstructured":"Eiben AE, Smit SK (2011) Parameter tuning for configuring and analyzing evolutionary algorithms. Swarm Evolut Comput 1(1):19\u201331","journal-title":"Swarm Evolut Comput"},{"issue":"4","key":"658_CR59","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/j.procs.2012.09.037","volume":"14","author":"W Zhang","year":"2012","unstructured":"Zhang W, Lin L, Gen M (2012) Hybrid multiobjective evolutionary algorithm with fast sampling strategy-based global search and route sequence difference based local search for VRPTW. Proc Comput Ence 14(4):96\u2013101","journal-title":"Proc Comput Ence"},{"key":"658_CR60","unstructured":"Davis L (1985) Applying adaptive algorithms to epistatic domains. In: Proceedings of the international joint conference on Arti$$\\text{\\textregistered} $$cial intelligence, pp. 156\u2013166"},{"key":"658_CR61","volume-title":"Genetic algorithms and engineering design","author":"M Gen","year":"1997","unstructured":"Gen M, Runwei C (1997) Genetic algorithms and engineering design. Wiley, Hoboken"},{"key":"658_CR62","doi-asserted-by":"crossref","unstructured":"Zhang H, Zhang Q, Ma L (2019) A hybrid ant colony optimization algorithm for a multi-objective vehicle routing problem with flexible time windows. Inform Sci","DOI":"10.1016\/j.ins.2019.03.070"},{"key":"658_CR63","unstructured":"Shu H, Zhou K, He Z, Hu X (2019) Two-Stage multi-objective evolutionary algorithm based on classified population for the tri-objective VRPTW. Int J Unconvent Comput"},{"key":"658_CR64","doi-asserted-by":"crossref","unstructured":"Sivaramkumar V, Thansekhar MR, Saravanan R (2018) Demonstrating the importance of using total time balance instead of route balance on a multi-objective vehicle routing problem with time windows. The Int J Adv Manuf Technol,1287\u20131306","DOI":"10.1007\/s00170-018-2346-6"}],"container-title":["Evolutionary Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-021-00658-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12065-021-00658-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-021-00658-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,30]],"date-time":"2023-10-30T12:11:12Z","timestamp":1698667872000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12065-021-00658-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,24]]},"references-count":64,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["658"],"URL":"https:\/\/doi.org\/10.1007\/s12065-021-00658-y","relation":{},"ISSN":["1864-5909","1864-5917"],"issn-type":[{"value":"1864-5909","type":"print"},{"value":"1864-5917","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,24]]},"assertion":[{"value":"26 February 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 May 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 June 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 September 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}