{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T15:06:42Z","timestamp":1773414402918,"version":"3.50.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,1,6]],"date-time":"2010-01-06T00:00:00Z","timestamp":1262736000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2010,9]]},"DOI":"10.1007\/s11047-009-9176-2","type":"journal-article","created":{"date-parts":[[2010,1,5]],"date-time":"2010-01-05T05:53:41Z","timestamp":1262670821000},"page":"703-725","source":"Crossref","is-referenced-by-count":34,"title":["A particle swarm optimization based memetic algorithm for dynamic optimization problems"],"prefix":"10.1007","volume":"9","author":[{"given":"Hongfeng","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shengxiang","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W. H.","family":"Ip","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dingwei","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,1,6]]},"reference":[{"key":"9176_CR2","unstructured":"Blackwell TM, Bentley P (2002) Dynamic search with charged swarms. In: Proceedings of the 2002 genetic and evolutionary computation conference, pp 19\u201326"},{"issue":"4","key":"9176_CR3","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1109\/TEVC.2005.857074","volume":"10","author":"TM Blackwell","year":"2006","unstructured":"Blackwell TM, Branke J (2006) Multiswarms, exclusion, and anti-convergence in dynamic environments. IEEE Trans Evol Comput 10(4):459\u2013472","journal-title":"IEEE Trans Evol Comput"},{"key":"9176_CR4","unstructured":"Branke J. The moving peaks benchmark website. Online: http:\/\/www.aifb.unikarl-sruhe.de\/jbr\/MovPeaks"},{"key":"9176_CR5","doi-asserted-by":"crossref","unstructured":"Branke J (1999) Memory enhanced evolutionary algorithms for changing optimization problems. In: Proceedings of the 1999 congress on evolutionary computation, pp 1875\u20131882","DOI":"10.1109\/CEC.1999.785502"},{"key":"9176_CR6","doi-asserted-by":"crossref","unstructured":"Branke J, Kaubler T, Schmidt C, Schmeck H (2000) A multi-population approach to dynamic optimization problems. In: Proceedings of the 4th international conference on adaptive computing in design and manufacturing, pp 299\u2013308","DOI":"10.1007\/978-1-4471-0519-0_24"},{"key":"9176_CR7","unstructured":"Carlisle A, Dozier G (2000) Adapting particle swarm optimization to dynamic environments. In: Proceedings of the 2000 international conference on artificial intelligence, pp 429\u2013434"},{"key":"9176_CR8","doi-asserted-by":"crossref","unstructured":"Cobb HG (1990) An investigation into the use of hypermutation as an adaptive operator in genetic algorithms having continuous, time-dependent nonstationary environment. Technical report AIC-90-001, Naval Research Laboratory, Washington","DOI":"10.21236\/ADA229159"},{"key":"9176_CR9","doi-asserted-by":"crossref","unstructured":"Eberhart RC, Shi Y (2001) Tracking and optimizing dynamic systems with particle swarms. In: Proceedings of the 2001 IEEE congress on evolutionary computation, pp 94\u201397","DOI":"10.1109\/CEC.2001.934376"},{"issue":"1","key":"9176_CR10","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1109\/TSMCB.2006.883266","volume":"37","author":"JE Gallardo","year":"2007","unstructured":"Gallardo JE, Cotta C, Ferandez AJ (2007) On the hybridization of memetic algorithms with branch-and-bound techniques. IEEE Trans Syst Man Cybern B 37(1):77\u201383","journal-title":"IEEE Trans Syst Man Cybern B"},{"issue":"1","key":"9176_CR11","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1109\/TEVC.2008.920671","volume":"13","author":"CK Goh","year":"2009","unstructured":"Goh CK, Tan KC (2009) A competitive-cooperation coevolutionary paradigm for dynamic multi-objective optimization. IEEE Trans Evol Comput 13(1):103\u2013127","journal-title":"IEEE Trans Evol Comput"},{"key":"9176_CR12","unstructured":"Grefenstette JJ (1992) Genetic algorithms for changing environments. In: Proceedings of the 2nd international conference on parallel problem solving from nature, pp 137\u2013144"},{"key":"9176_CR13","doi-asserted-by":"crossref","unstructured":"Hatzakis I, Wallace D (2006) Dynamic multi-objective optimization with evolutionary algorithms: a forward-looking approach. In: Proceedings of the 2006 genetic and evolutionary computation conference, pp 1201\u20131208","DOI":"10.1145\/1143997.1144187"},{"key":"9176_CR14","unstructured":"Hu X, Eberhart R (2002) Adaptive particle swarm optimization: detection and response to dynamic systems. In: Proceedings of the 2002 IEEE congress on evolutionary computation, pp 1666\u20131670"},{"issue":"2","key":"9176_CR15","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1109\/TEVC.2003.810752","volume":"7","author":"H Ishibuchi","year":"2003","unstructured":"Ishibuchi H, Yoshida T, Murata T (2003) Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling. IEEE Trans Evol Comput 7(2):204\u2013223","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"9176_CR16","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/s10710-006-9014-6","volume":"7","author":"S Janson","year":"2006","unstructured":"Janson S, Middendorf M (2006) A hierarchical particle swarm optimizer for noisy and dynamic environments. Genet Program Evolvable Mach 7(3):329\u2013354","journal-title":"Genet Program Evolvable Mach"},{"issue":"3","key":"9176_CR17","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 (2005) Evolutionary pptimization in uncertain environments\u2014a survey. IEEE Trans Evol Comput 9(3): 303\u2013317","journal-title":"IEEE Trans Evol Comput"},{"key":"9176_CR18","doi-asserted-by":"crossref","unstructured":"Kennedy J (1997) The particle swarm: social adaptation of knowledge. In: Proceedings of the IEEE international conference on evolutionary computation, pp 303\u2013308","DOI":"10.1109\/ICEC.1997.592326"},{"issue":"5","key":"9176_CR19","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1109\/TEVC.2005.850260","volume":"9","author":"N Krasnogor","year":"2005","unstructured":"Krasnogor N, Smith JE (2005) A tutorial for competent memetic algorithms: model, taxonomy and design issues. IEEE Trans Evol Comput 9(5):474\u2013488","journal-title":"IEEE Trans Evol Comput"},{"key":"9176_CR20","unstructured":"Li X, Dam KH (2003) Comparing particles swarms for tracking extrema in dynamic environments. In: Proceedings of the IEEE 2003 congress on evolutionary computation, pp 1772\u20131779"},{"issue":"1","key":"9176_CR21","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1109\/TSMCB.2006.883270","volume":"37","author":"D Liu","year":"2007","unstructured":"Liu D, Tan KC, Goh CK, Ho WK (2007a) A multiobjective memetic algorithm based on particle swarm optimization. IEEE Trans Syst Man Cybern B 37(1):42\u201350","journal-title":"IEEE Trans Syst Man Cybern B"},{"issue":"1","key":"9176_CR22","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1109\/TSMCB.2006.883272","volume":"37","author":"B Liu","year":"2007","unstructured":"Liu B, Wang L, Jin YH (2007b) An effective PSO-based memetic algorithm for flow shop scheduling. IEEE Trans Syst Man Cybern B 37(1):18\u201327","journal-title":"IEEE Trans Syst Man Cybern B"},{"key":"9176_CR23","doi-asserted-by":"crossref","unstructured":"Liu L, Yang S, Wang D (2008) Compound particle swarm optimization in dynamic environments. In: Proceedins of the evoworkshops 2008, pp 616\u2013625","DOI":"10.1007\/978-3-540-78761-7_67"},{"issue":"1","key":"9176_CR24","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1109\/TSMCB.2006.883265","volume":"37","author":"S Man","year":"2007","unstructured":"Man S, Liang Y, Leung KS, Lee KH, Mok TSK (2007) A memetic algorithm for multiple-drug cancer chemotherapy schedule optimization. IEEE Trans Syst Man Cybern B 37(1):84\u201391","journal-title":"IEEE Trans Syst Man Cybern B"},{"issue":"4","key":"9176_CR25","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1109\/TEVC.2005.859468","volume":"10","author":"D Parrott","year":"2006","unstructured":"Parrott D, Li X (2006) Locating and tracking multiple dynamic optima by a particle swarm model using speciation. IEEE Trans Evol Comput 10(4):440\u2013458","journal-title":"IEEE Trans Evol Comput"},{"key":"9176_CR26","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s10479-007-0224-y","volume":"156","author":"YG Petalas","year":"2007","unstructured":"Petalas YG, Parsopoulos KE, Vrahatis MN (2007) Memetic particle swarm optimization. Ann Oper Res 156:99\u2013127","journal-title":"Ann Oper Res"},{"issue":"1","key":"9176_CR27","first-page":"6","volume":"37","author":"JE Smith","year":"2007","unstructured":"Smith JE (2007) Coevolving memetic algorithms: a review and progress report. IEEE Trans SMC B 37(1):6\u201317","journal-title":"IEEE Trans SMC B"},{"issue":"1","key":"9176_CR28","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1109\/TSMCB.2006.883268","volume":"37","author":"M Tang","year":"2007","unstructured":"Tang M, Yao X (2007) A memetic algorithm for VLSI floorplanning. IEEE Trans Syst Man Cybern B 37(1):62\u201369","journal-title":"IEEE Trans Syst Man Cybern B"},{"issue":"10","key":"9176_CR29","doi-asserted-by":"crossref","first-page":"957","DOI":"10.1007\/s00500-006-0145-8","volume":"11","author":"J Tang","year":"2007","unstructured":"Tang J, Lim MH, Ong Y-S (2007) Diversity-adaptive parallel memetic algorithm for solving large scale combinatorial optimization problems. Soft Comput 11(10):957\u2013971","journal-title":"Soft Comput"},{"issue":"3","key":"9176_CR30","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s10710-007-9024-z","volume":"8","author":"R Tinos","year":"2007","unstructured":"Tinos R, Yang S (2007) A self-organizing random immigrants genetic algorithm for dynamic optimization problems. Genet Program Evolvable Mach 8(3):255\u2013286","journal-title":"Genet Program Evolvable Mach"},{"issue":"11","key":"9176_CR31","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1007\/s00500-004-0421-4","volume":"9","author":"AS Uyar","year":"2005","unstructured":"Uyar AS, Harmanci AE (2005) A new population based adaptive dominance change mechanism for diploid genetic algorithms in dynamic environments. Soft Comput 9(11):803\u2013815","journal-title":"Soft Comput"},{"key":"9176_CR1","unstructured":"van den Bergh F (2002) An analysis of particle swarm optimizers. PhD thesis, University of Pretoria, South Africa"},{"key":"9176_CR32","doi-asserted-by":"crossref","unstructured":"Wang H, Wang D (2006) An improved primal-dual genetic algorithm for optimization in dynamic environments. In: Proceedings of the 13th international conference on neural information processing, part III, pp 836\u2013844","DOI":"10.1007\/11893295_92"},{"key":"9176_CR33","doi-asserted-by":"crossref","unstructured":"Wang H, Wang D, Yang S (2007) Triggered memory-based swarm optimization in dynamic environments. In: Proceedings of the evoworkshop 2007, pp 637\u2013646","DOI":"10.1007\/978-3-540-71805-5_70"},{"issue":"6","key":"9176_CR34","doi-asserted-by":"crossref","first-page":"1348","DOI":"10.1109\/TSMCB.2009.2015281","volume":"39","author":"H Wang","year":"2009","unstructured":"Wang H, Yang S, Ip WH, Wang D (2009a) Adaptive primal-dual genetic algorithms in dynamic environments. IEEE Trans Syst Man Cybern B 39(6):1348\u20131361","journal-title":"IEEE Trans Syst Man Cybern B"},{"issue":"8\u20139","key":"9176_CR35","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1007\/s00500-008-0347-3","volume":"13","author":"H Wang","year":"2009","unstructured":"Wang H, Yang S, Wang D (2009b) A memetic algorithm with adaptive hill climbing strategy for dynamic optimization problems. Soft Comput 13(8\u20139):763\u2013780","journal-title":"Soft Comput"},{"key":"9176_CR36","unstructured":"Yang S (2003) Non-stationary problem optimization using the primal-dual genetic algorithm. In: Proceedingds of the 2003 congress on evolutionary computation, vol 3, pp 2246\u20132253"},{"issue":"3","key":"9176_CR37","doi-asserted-by":"crossref","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. Evol Comput 16(3):385\u2013416","journal-title":"Evol Comput"},{"issue":"11","key":"9176_CR38","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 (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":"9176_CR39","doi-asserted-by":"crossref","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"},{"key":"9176_CR40","volume-title":"Evolutionary computation in dynamic and uncertain environments","year":"2007","unstructured":"Yang S, Ong Y-S, Jin Y (eds) (2007) Evolutionary computation in dynamic and uncertain environments. Springer, Berlin"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-009-9176-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11047-009-9176-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-009-9176-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T03:46:05Z","timestamp":1559360765000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11047-009-9176-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1,6]]},"references-count":40,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,9]]}},"alternative-id":["9176"],"URL":"https:\/\/doi.org\/10.1007\/s11047-009-9176-2","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"value":"1567-7818","type":"print"},{"value":"1572-9796","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,1,6]]}}}