{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T11:40:40Z","timestamp":1768650040072,"version":"3.49.0"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,1,16]],"date-time":"2019-01-16T00:00:00Z","timestamp":1547596800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61762001"],"award-info":[{"award-number":["61762001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s11047-018-09725-3","type":"journal-article","created":{"date-parts":[[2019,1,16]],"date-time":"2019-01-16T06:50:15Z","timestamp":1547621415000},"page":"913-932","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["An enhanced genetic algorithm for constrained knapsack problems in dynamic environments"],"prefix":"10.1007","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1442-0279","authenticated-orcid":false,"given":"Shuqu","family":"Qian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanmin","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongqiang","family":"Ye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guofeng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,1,16]]},"reference":[{"issue":"9","key":"9725_CR1","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.cor.2016.03.009","volume":"73","author":"E Ahmadi","year":"2016","unstructured":"Ahmadi E, Zandieh M, Farrokh M, Emami SM (2016) A multi objective optimization approach for flexible job shop scheduling problem under random machine breakdown by evolutionary algorithms. Comput Oper Res 73(9):56\u201366","journal-title":"Comput Oper Res"},{"issue":"5","key":"9725_CR2","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1016\/S0305-0548(02)00051-5","volume":"30","author":"BM Baker","year":"2003","unstructured":"Baker BM, Ayechew MA (2003) A genetic algorithm for the vehicle routing problem. Comput Oper Res 30(5):787\u2013800","journal-title":"Comput Oper Res"},{"issue":"2","key":"9725_CR3","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/s00500-004-0438-8","volume":"10","author":"SK Basu","year":"2006","unstructured":"Basu SK, Bhatia AK (2006) A naive genetic approach for non-stationary constrained problems. Soft Comput 10(2):152\u2013162","journal-title":"Soft Comput"},{"key":"9725_CR4","unstructured":"Bosman PAN (2007) Learning and anticipation in online dynamic optimization with evolutionary algorithms:the stochastic case. In: Proceedings of genetic and evolutionary computation conference, GECCO 2007, London, vol\u00a01, pp 1165\u20131172"},{"key":"9725_CR5","first-page":"1875","volume":"3","author":"JU Branke","year":"2004","unstructured":"Branke JU (2004) Memory enhanced evolutionary algorithms for changing optimization problems. Congress Evolut Comput Cec 3:1875\u20131882","journal-title":"Congress Evolut Comput Cec"},{"issue":"4","key":"9725_CR6","doi-asserted-by":"publisher","first-page":"2276","DOI":"10.1016\/j.eswa.2014.09.006","volume":"42","author":"C Changdar","year":"2015","unstructured":"Changdar C, Mahapatra GS, Pal RK (2015) An improved genetic algorithm based approach to solve constrained knapsack problem in fuzzy environment. Expert Syst Appl 42(4):2276\u20132286","journal-title":"Expert Syst Appl"},{"issue":"5","key":"9725_CR7","doi-asserted-by":"publisher","first-page":"806","DOI":"10.1016\/j.engappai.2010.01.021","volume":"23","author":"H Cheng","year":"2010","unstructured":"Cheng H, Yang S (2010) Genetic algorithms with immigrants schemes for dynamic multicast problems in mobile ad hoc networks. Eng Appl Artif Intell 23(5):806\u2013819","journal-title":"Eng Appl Artif Intell"},{"key":"9725_CR8","unstructured":"Cobb HG, Grefenstette JJ (1993) Genetic algorithms for tracking changing environments. In: Fifth international conference on genetic algorithms, pp 523\u2013530"},{"issue":"7","key":"9725_CR9","doi-asserted-by":"publisher","first-page":"1427","DOI":"10.1007\/s00500-010-0681-0","volume":"15","author":"C Cruz","year":"2011","unstructured":"Cruz C, Gonz\u00e1lez JR, Pelta DA (2011) Optimization in dynamic environments: a survey on problems, methods and measures. Soft Comput 15(7):1427\u20131448","journal-title":"Soft Comput"},{"issue":"1","key":"9725_CR10","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, Herrera F (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":"423","key":"9725_CR11","doi-asserted-by":"publisher","first-page":"920","DOI":"10.1080\/01621459.1993.10476358","volume":"88","author":"H Finner","year":"1993","unstructured":"Finner H (1993) On a monotonicity problem in step-down multiple test procedures. J Am Stat Assoc 88(423):920\u2013923","journal-title":"J Am Stat Assoc"},{"issue":"1","key":"9725_CR12","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1214\/aoms\/1177731944","volume":"11","author":"M Friedman","year":"1939","unstructured":"Friedman M (1939) A comparison of alternative tests of significance for the problem of m rankings. Ann Math Stat 11(1):86\u201392","journal-title":"Ann Math Stat"},{"key":"9725_CR13","first-page":"139","volume":"2","author":"JJ Grefenstette","year":"1992","unstructured":"Grefenstette JJ (1992) Genetic algorithms for changing environments. Proc Paralle Prob Solving Nat 2:139\u2013146","journal-title":"Proc Paralle Prob Solving Nat"},{"issue":"4","key":"9725_CR14","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1093\/biomet\/75.4.800","volume":"75","author":"Y Hochberg","year":"1988","unstructured":"Hochberg Y (1988) A sharper bonferroni procedure for multiple tests of significance. Biometrika 75(4):800\u2013802","journal-title":"Biometrika"},{"issue":"2","key":"9725_CR15","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1214\/aoms\/1177704575","volume":"33","author":"JL Hodges","year":"1962","unstructured":"Hodges JL, Lehmann EL (1962) Rank methods for combination of independent experiments in analysis of variance. Ann Math Stat 33(2):482\u2013497","journal-title":"Ann Math Stat"},{"issue":"2","key":"9725_CR16","doi-asserted-by":"publisher","first-page":"417","DOI":"10.2307\/2531823","volume":"43","author":"BS Holland","year":"1987","unstructured":"Holland BS, Copenhaver DP (1987) An improved sequentially rejective bonferroni procedure. Biometrics 43(2):417\u2013423","journal-title":"Biometrics"},{"key":"9725_CR17","first-page":"65","volume":"6","author":"S Holm","year":"1979","unstructured":"Holm S (1979) A simple sequentially rejective multiple test procedure. Scand J Stat 6:65\u201370","journal-title":"Scand J Stat"},{"issue":"2","key":"9725_CR18","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1093\/biomet\/75.2.383","volume":"75","author":"G Hommel","year":"1988","unstructured":"Hommel G (1988) A stagewise rejective multiple test procedure on a modified boneferroni test. Biometrika 75(2):383\u2013386","journal-title":"Biometrika"},{"issue":"3","key":"9725_CR19","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1109\/TEVC.2005.846356","volume":"9","author":"Y Jin","year":"2005","unstructured":"Jin Y, Branke J (2005) Evolutionary optimization in uncertain environments\u2014a survey. IEEE Trans Evolut Comput 9(3):303\u2013317","journal-title":"IEEE Trans Evolut Comput"},{"issue":"4","key":"9725_CR20","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1109\/TEVC.2011.2169966","volume":"16","author":"C Li","year":"2012","unstructured":"Li C, Yang S (2012) A general framework of multipopulation methods with clustering in undetectable dynamic environments. IEEE Trans Evolut Comput 16(4):556\u2013577","journal-title":"IEEE Trans Evolut Comput"},{"issue":"6","key":"9725_CR21","doi-asserted-by":"publisher","first-page":"1521","DOI":"10.1016\/j.jspi.2007.04.032","volume":"138","author":"J Li","year":"2008","unstructured":"Li J (2008) A two-step rejection procedure for testing multiple hypotheses. J Stat Plan Inference 138(6):1521\u20131527","journal-title":"J Stat Plan Inference"},{"issue":"2","key":"9725_CR22","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1016\/j.cor.2015.05.001","volume":"66","author":"RRA Mendes","year":"2016","unstructured":"Mendes RRA, Paiva AP, Peruchi RS, Balestrassi PP, Leme RC, Silva MB (2016) Multiobjective portfolio optimization of ARMAGARCH time series based on experimental designs. Comput Oper Res 66(2):434\u2013444","journal-title":"Comput Oper Res"},{"key":"9725_CR23","first-page":"134","volume-title":"Lecture Notes in Computer Science","author":"Zbigniew Michalewicz","year":"1994","unstructured":"Michalewicz Z, Arabas J (1994) Genetic algorithms for the 0\/1 knapsack problem. In: Proceedings of the 8th international symposium on methodologies for intelligent systems, vol 869, pp 134\u2013143"},{"key":"9725_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2012.05.001","volume":"6","author":"TT Nguyen","year":"2012","unstructured":"Nguyen TT, Yang S, Branke J (2012) Evolutionary dynamic optimization: a survey of the state of the art. Swarm Evolut Comput 6:1\u201324","journal-title":"Swarm Evolut Comput"},{"issue":"10","key":"9725_CR25","doi-asserted-by":"publisher","first-page":"1861","DOI":"10.1007\/s00500-013-1022-x","volume":"17","author":"P Novoa-Hern\u00e1ndez","year":"2013","unstructured":"Novoa-Hern\u00e1ndez P, Corona CC, Pelta DA (2013) Self-adaptive, multipopulation differential evolution in dynamic environments. Soft Comput 17(10):1861\u20131881","journal-title":"Soft Comput"},{"issue":"2","key":"9725_CR26","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s00500-010-0547-5","volume":"15","author":"X Peng","year":"2011","unstructured":"Peng X, Gao X, Yang S (2011) Environment identification-based memory scheme for estimation of distribution algorithms in dynamic environments. Soft Comput 15(2):311\u2013326","journal-title":"Soft Comput"},{"issue":"367","key":"9725_CR27","doi-asserted-by":"publisher","first-page":"680","DOI":"10.1080\/01621459.1979.10481670","volume":"74","author":"D Quade","year":"1979","unstructured":"Quade D (1979) Using weighted rankings in the analysis of complete blocks with additive block effects. J Am Stat Assoc 74(367):680\u2013683","journal-title":"J Am Stat Assoc"},{"issue":"12","key":"9725_CR28","doi-asserted-by":"publisher","first-page":"1163","DOI":"10.1007\/s00500-009-0420-6","volume":"13","author":"H Richter","year":"2009","unstructured":"Richter H, Yang S (2009) Learning behavior in abstract memory schemes for dynamic optimization problems. Soft Comput 13(12):1163\u20131173","journal-title":"Soft Comput"},{"issue":"3","key":"9725_CR29","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1093\/biomet\/77.3.663","volume":"77","author":"DM Rom","year":"1990","unstructured":"Rom DM (1990) A sequentially rejective test procedure based on a modified Bonferroni inequality. Biometrika 77(3):663\u2013665","journal-title":"Biometrika"},{"key":"9725_CR30","doi-asserted-by":"crossref","unstructured":"Singh HK, Isaacs A, Nguyen TT, Ray T (2009) Performance of infeasibility driven evolutionary algorithm (IDEA) on constrained dynamic single objective optimization problems. In: Eleventh conference on congress on evolutionary computation, vol 1, pp 3127\u20133134","DOI":"10.1109\/CEC.2009.4983339"},{"issue":"5","key":"9725_CR31","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1016\/j.asoc.2014.04.032","volume":"22","author":"AM Turky","year":"2014","unstructured":"Turky AM, Abdullah S (2014a) A multi-population electromagnetic algorithm for dynamic optimisation problems. Appl Soft Comput 22(5):474\u2013482","journal-title":"Appl Soft Comput"},{"issue":"8","key":"9725_CR32","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.ins.2014.02.084","volume":"272","author":"AM Turky","year":"2014","unstructured":"Turky AM, Abdullah S (2014b) A multi-population harmony search algorithm with external archive for dynamic optimization problems. Inf Sci 272(8):84\u201395","journal-title":"Inf Sci"},{"key":"9725_CR33","doi-asserted-by":"crossref","unstructured":"Wang Y, Li B (2009) Investigation of memory-based multi-objective optimization evolutionary algorithm in dynamic environment. In: iEEE congress on evolutionary computation cec, pp 630\u2013637","DOI":"10.1109\/CEC.2009.4983004"},{"key":"9725_CR34","doi-asserted-by":"crossref","unstructured":"Yang S (2003) Non-stationary problem optimization using the primal-dual genetic algorithm. In: The 2003 congress on evolutionary computation, vol\u00a03, pp 2246\u20132253","DOI":"10.1109\/CEC.2003.1299951"},{"key":"9725_CR35","doi-asserted-by":"crossref","unstructured":"Yang S (2005) Memory-based immigrants for genetic algorithms in dynamic environments. In: The 2005 congress on evolutionary computation, pp 1115\u20131122","DOI":"10.1145\/1068009.1068196"},{"key":"9725_CR36","doi-asserted-by":"crossref","unstructured":"Yang S (2007) Genetic algorithms with elitism-based immigrants for changing optimization problems. Lecture Notes in Computer Science, vol\u00a04448, pp 627\u2013636","DOI":"10.1007\/978-3-540-71805-5_69"},{"issue":"3","key":"9725_CR37","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1162\/evco.2008.16.3.385","volume":"16","author":"S Yang","year":"2008","unstructured":"Yang S (2008) Genetic algorithms with memory- and elitism-based immigrants in dynamic environments. Evolut Comput 16(3):385\u2013416","journal-title":"Evolut Comput"},{"issue":"3","key":"9725_CR38","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s11633-007-0243-9","volume":"4","author":"S Yang","year":"2007","unstructured":"Yang S, Tin\u00f3\u2019s R (2007) A hybrid immigrants scheme for genetic algorithms in dynamic environments. Int J Autom Comput 4(3):243\u2013254","journal-title":"Int J Autom Comput"},{"issue":"11","key":"9725_CR39","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1007\/s00500-004-0422-3","volume":"9","author":"S Yang","year":"2005","unstructured":"Yang S, Yao X (2005) Experimental study on population-based incremental learning algorithms for dynamic optimization problems. Soft Comput 9(11):815\u2013834","journal-title":"Soft Comput"},{"issue":"5","key":"9725_CR40","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1109\/TEVC.2007.913070","volume":"12","author":"S Yang","year":"2008","unstructured":"Yang S, Yao X (2008) Population-based incremental learning with associative memory for dynamic environments. IEEE Trans Evol Comput 12(5):542\u2013561","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"9725_CR41","doi-asserted-by":"publisher","first-page":"2144","DOI":"10.1016\/j.asoc.2012.12.020","volume":"13","author":"D Yazdani","year":"2013","unstructured":"Yazdani D, Nasiri B, Sepas-Moghaddam A, Meybodi MR (2013) A novel multi-swarm algorithm for optimization in dynamic environments based on particle swarm optimization. Appl Soft Comput 13(4):2144\u20132158","journal-title":"Appl Soft Comput"},{"issue":"1","key":"9725_CR42","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s12293-008-0003-6","volume":"1","author":"X Yu","year":"2009","unstructured":"Yu X, Tang K, Chen T, Yao X (2009) Empirical analysis of evolutionary algorithms with immigrants schemes for dynamic optimization. Memet Comput 1(1):3\u201324","journal-title":"Memet Comput"},{"issue":"2","key":"9725_CR43","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1016\/j.asoc.2007.07.005","volume":"8","author":"Z Zhang","year":"2008","unstructured":"Zhang Z (2008) Multiobjective optimization immune algorithm in dynamic environments and its application to greenhouse control. Appl Soft Comput 8(2):959\u2013971","journal-title":"Appl Soft Comput"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11047-018-09725-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-018-09725-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-018-09725-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,15]],"date-time":"2020-01-15T19:06:52Z","timestamp":1579115212000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11047-018-09725-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,16]]},"references-count":43,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["9725"],"URL":"https:\/\/doi.org\/10.1007\/s11047-018-09725-3","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"value":"1567-7818","type":"print"},{"value":"1572-9796","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,16]]},"assertion":[{"value":"16 January 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}