{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T02:40:13Z","timestamp":1741142413396,"version":"3.38.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2011,4,12]],"date-time":"2011-04-12T00:00:00Z","timestamp":1302566400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1007\/s11432-011-4211-1","type":"journal-article","created":{"date-parts":[[2011,4,13]],"date-time":"2011-04-13T13:15:31Z","timestamp":1302700531000},"page":"1352-1364","source":"Crossref","is-referenced-by-count":6,"title":["Immigrant schemes for evolutionary algorithms in dynamic environments: Adapting the replacement rate"],"prefix":"10.1007","volume":"54","author":[{"given":"Xin","family":"Yu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ke","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Yao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,4,12]]},"reference":[{"key":"4211_CR1","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1109\/TEVC.2005.846356","volume":"9","author":"Y. Jin","year":"2005","unstructured":"Jin Y, Branke J. Evolutionary optimization in uncertain environments: A survey. IEEE Trans Evol Comput, 2005, 9: 303\u2013317","journal-title":"IEEE Trans Evol Comput"},{"key":"4211_CR2","doi-asserted-by":"crossref","unstructured":"Rohlfshagen P, Yao X. Attributes of dynamic combinatorial optimisation. In: Proceedings of the 7th International Conference on Simulated Evolution And Learning (SEAL\u20192008), Melbourne, Australia, 2008. 442\u2013451","DOI":"10.1007\/978-3-540-89694-4_45"},{"key":"4211_CR3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s12293-008-0003-6","volume":"1","author":"X. Yu","year":"2009","unstructured":"Yu X, Tang K, Chen T, et al. Empirical analysis of evolutionary algorithms with immigrants schemes for dynamic optimization. Memetic Comput, 2009, 1: 3\u201324","journal-title":"Memetic Comput"},{"key":"4211_CR4","doi-asserted-by":"crossref","unstructured":"Yu X, Tang K, Yao X. An immigrants scheme based on environmental information for genetic algorithms in changing environments. In: Proceedings of the 2008 IEEE Congress on Evolutionary Computation, Hong Kong, China, 2008. 1141\u20131147","DOI":"10.1109\/CEC.2008.4630940"},{"key":"4211_CR5","unstructured":"Yang S. Genetic algorithms with elitism-based immigrants for changing optimization problems. In: Proceedings of the 2007 EvoWorkshops 2007 on EvoCoMnet, EvoFIN, EvoIASP,EvoINTERACTION, EvoMUSART, EvoSTOC and EvoTransLog: Applications of Evolutionary Computing, Valencia, Spain, 2007. 627\u2013636"},{"key":"4211_CR6","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/s11633-007-0243-9","volume":"4","author":"S. Yang","year":"2007","unstructured":"Yang S, Tin\u00f3s R. A hybrid immigrants scheme for genetic algorithms in dynamic environments. Int J Automat Comput, 2007, 4: 243\u2013254","journal-title":"Int J Automat Comput"},{"key":"4211_CR7","doi-asserted-by":"crossref","unstructured":"Tin\u00f3s R, Yang S. Genetic algorithms with self-organized criticality for dynamic optimization problems. In: Proceedings of the 2005 IEEE Congress on Evolutionary Computation, Edinburgh, UK, 2005. 2816\u20132823","DOI":"10.1109\/CEC.2005.1555048"},{"key":"4211_CR8","unstructured":"Hinterding R, Michalewicz Z, Eiben A E. Adaptation in evolutionary computation: A survey. In: Proceedings of the 4th International Conference on Evolutionary Computation, Indianapolis, USA, 1997. 65\u201369"},{"key":"4211_CR9","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/s11432-010-0032-x","volume":"53","author":"J. P. Shi","year":"2010","unstructured":"Shi J P, Zhang W G, Li G W, et al. Research on allocation efficiency of the redistributed pseudo inverse algorithm. Sci China Inf Sci, 2010, 53: 271\u2013277","journal-title":"Sci China Inf Sci"},{"key":"4211_CR10","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1109\/TSMCC.2005.855497","volume":"36","author":"J. Zhang","year":"2006","unstructured":"Zhang J, Lo W L, Chung H. Pseudo-coevolutionary genetic algorithms for power electronics regulators optimization. IEEE Trans Syst Man Cybern C Appl Rev, 2006, 36: 590\u2013598","journal-title":"IEEE Trans Syst Man Cybern C Appl Rev"},{"key":"4211_CR11","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1109\/TEVC.2006.880727","volume":"11","author":"J. Zhang","year":"2007","unstructured":"Zhang J, Chung H, Lo W L. Clustering-based adaptive crossover and mutation probabilities for genetic algorithms. IEEE Trans Evol Comput, 2007, 11: 326\u2013335","journal-title":"IEEE Trans Evol Comput"},{"key":"4211_CR12","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1109\/4235.771163","volume":"3","author":"X. Yao","year":"1999","unstructured":"Yao X, Liu Y, Lin G. Evolutionary programming made faster. IEEE Trans Evol Comput, 1999, 3: 82\u2013102","journal-title":"IEEE Trans Evol Comput"},{"key":"4211_CR13","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1162\/evco.1995.3.3.311","volume":"3","author":"H. G. Beyer","year":"1996","unstructured":"Beyer H G. Toward a theory of evolution strategies: Self-adaptation. Evol Comput, 1996, 3: 311\u2013347","journal-title":"Evol Comput"},{"key":"4211_CR14","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1109\/TEVC.2008.927706","volume":"13","author":"A. K. Qin","year":"2009","unstructured":"Qin A K, Liang V L, Suganthan P N. Differential evolution algorithm with strategy adaptation for global numerical optimization. IEEE Trans Evol Comput, 2009, 13: 398\u2013417","journal-title":"IEEE Trans Evol Comput"},{"key":"4211_CR15","doi-asserted-by":"crossref","first-page":"1362","DOI":"10.1109\/TSMCB.2009.2015956","volume":"39","author":"Z. H. Zhan","year":"2009","unstructured":"Zhan Z H, Zhang J, Li Y, et al. Adaptive particle swarm optimization. IEEE Trans Syst Man Cybern B Cybern, 2009, 39: 1362\u20131381","journal-title":"IEEE Trans Syst Man Cybern B Cybern"},{"key":"4211_CR16","unstructured":"Grefenstette J J. Genetic algorithms for changing environments. In: Proceedings of Parallel Problem Solving from Nature, Brussels, Belgium, 1992. 137\u2013144"},{"key":"4211_CR17","doi-asserted-by":"crossref","unstructured":"Cobb H G, Grefenstette J J. Genetic algorithms for tracking changing environments. In: Proceedings of the 5th International Conference on Genetic Algorithms, San Diego, USA, 1993. 523\u2013530","DOI":"10.21236\/ADA294075"},{"key":"4211_CR18","doi-asserted-by":"crossref","unstructured":"Yang S. Memory-based immigrants for genetic algorithms in dynamic environments. In: Proceedings of the 2005 Genetic and Evolutionary Computation Conference, Washington DC, USA, 2005. 1115\u20131122","DOI":"10.1145\/1068009.1068196"},{"key":"4211_CR19","doi-asserted-by":"crossref","unstructured":"Branke J. Memory enhanced evolutionary algorithms for changing optimization problems. In: Proceedings of the 1999 IEEE Congress on Evolutionary Computation, Washington DC, USA, 1999. 1875\u20131882","DOI":"10.1109\/CEC.1999.785502"},{"key":"4211_CR20","volume-title":"Introduction to algorithms","author":"T. H. Cormen","year":"2001","unstructured":"Cormen T H, Leiserson C E, Rivest R L, et al. Introduction to algorithms. 2nd ed. Cambridge: MIT Press and New York: McGraw-Hill, 2001","edition":"2nd ed."},{"key":"4211_CR21","volume-title":"Data structures and algorithms","author":"A. V. Aho","year":"1983","unstructured":"Aho A V, Hopcroft J E, Ullman J D. Data structures and algorithms. Reading: Addison-Wesley, 1983"},{"key":"4211_CR22","unstructured":"Yang S. Non-stationary problem optimization using the primal-dual genetic algorithm. In: Proceedings of the 2003 IEEE Congress on Evolutionary Computation, Canberra, Australia, 2003. 2246\u20132253"},{"key":"4211_CR23","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1007\/s00500-004-0422-3","volume":"9","author":"S. Yang","year":"2005","unstructured":"Yang S, Yao X. Experimental study on population-based incremental learning algorithms for dynamic optimization problems. Soft Comput, 2005, 9: 815\u2013834","journal-title":"Soft Comput"},{"key":"4211_CR24","unstructured":"Mitchell M, Forrest S, Holland J H. The royal road for genetic algorithms: Fitness landscapes and GA performance. In: Proceedings of the 1st European conference on artificial life, Paris, France, 1991. 245\u2013254"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-011-4211-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-011-4211-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-011-4211-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T01:42:00Z","timestamp":1741138920000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-011-4211-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4,12]]},"references-count":24,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2011,7]]}},"alternative-id":["4211"],"URL":"https:\/\/doi.org\/10.1007\/s11432-011-4211-1","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"type":"print","value":"1674-733X"},{"type":"electronic","value":"1869-1919"}],"subject":[],"published":{"date-parts":[[2011,4,12]]}}}