Multi-swarm optimization in dynamic environments. Blackwell, T. & Branke, J. In Applications of Evolutionary Computing, volume 3005, of Lecture Notes in Computer Science, pages 489--500, 2004. Springer Berlin / Heidelberg. ![Multi-swarm optimization in dynamic environments [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper doi abstract bibtex Many real-world problems are dynamic, requiring an optimization algorithm which is able to continuously track a changing optimum over time. In this paper, we present new variants of Particle Swarm Optimization (PSO) specifically designed to work well in dynamic environments. The main idea is to extend the single population PSO and Charged Particle Swarm Optimization (CPSO) methods by constructing interacting multi-swarms. In addition, a new algorithmic variant, which broadens the implicit atomic analogy of CPSO to a quantum model, is introduced. The multi-swarm algorithms are tested on a multi-modal dynamic function - the moving peaks benchmark - and results are compared to the single population approach of PSO and CPSO, and to results obtained by a state-of-the-art evolutionary algorithm, namely self-organizing scouts (SOS). We show that our multi-swarm optimizer significantly outperforms single population PSO on this problem, and that multi-quantum swarms are superior to multi-charged swarms and SOS.
@inproceedings{blackwell_multi-swarm_2004,
series = {Lecture {Notes} in {Computer} {Science}},
title = {Multi-swarm optimization in dynamic environments},
volume = {3005},
isbn = {978-3-540-21378-9},
url = {http://www.springerlink.com/content/7mrn505r4rc16qab/},
doi = {10.1007/b96500},
abstract = {Many real-world problems are dynamic, requiring an optimization algorithm which is able to continuously track a changing optimum over time. In this paper, we present new variants of Particle Swarm Optimization (PSO) specifically designed to work well in dynamic environments. The main idea is to extend the single population PSO and Charged Particle Swarm Optimization (CPSO) methods by constructing interacting multi-swarms. In addition, a new algorithmic variant, which broadens the implicit atomic analogy of CPSO to a quantum model, is introduced. The multi-swarm algorithms are tested on a multi-modal dynamic function - the moving peaks benchmark - and results are compared to the single population approach of PSO and CPSO, and to results obtained by a state-of-the-art evolutionary algorithm, namely self-organizing scouts (SOS). We show that our multi-swarm optimizer significantly outperforms single population PSO on this problem, and that multi-quantum swarms are superior to multi-charged swarms and SOS.},
booktitle = {Applications of {Evolutionary} {Computing}},
publisher = {Springer Berlin / Heidelberg},
author = {Blackwell, T. and Branke, J.},
year = {2004},
keywords = {movingpeaks, pso},
pages = {489--500}
}
Downloads: 0
{"_id":"J7QSt9xQvMoePNbEn","bibbaseid":"blackwell-branke-multiswarmoptimizationindynamicenvironments-2004","downloads":0,"creationDate":"2018-04-11T12:50:02.690Z","title":"Multi-swarm optimization in dynamic environments","author_short":["Blackwell, T.","Branke, J."],"year":2004,"bibtype":"inproceedings","biburl":"https://api.zotero.org/users/1317729/collections/B8J28C3R/items?key=1QwVoCZkST7hnrVlLRsMgoNB&format=bibtex&limit=100","bibdata":{"bibtype":"inproceedings","type":"inproceedings","series":"Lecture Notes in Computer Science","title":"Multi-swarm optimization in dynamic environments","volume":"3005","isbn":"978-3-540-21378-9","url":"http://www.springerlink.com/content/7mrn505r4rc16qab/","doi":"10.1007/b96500","abstract":"Many real-world problems are dynamic, requiring an optimization algorithm which is able to continuously track a changing optimum over time. In this paper, we present new variants of Particle Swarm Optimization (PSO) specifically designed to work well in dynamic environments. The main idea is to extend the single population PSO and Charged Particle Swarm Optimization (CPSO) methods by constructing interacting multi-swarms. In addition, a new algorithmic variant, which broadens the implicit atomic analogy of CPSO to a quantum model, is introduced. The multi-swarm algorithms are tested on a multi-modal dynamic function - the moving peaks benchmark - and results are compared to the single population approach of PSO and CPSO, and to results obtained by a state-of-the-art evolutionary algorithm, namely self-organizing scouts (SOS). We show that our multi-swarm optimizer significantly outperforms single population PSO on this problem, and that multi-quantum swarms are superior to multi-charged swarms and SOS.","booktitle":"Applications of Evolutionary Computing","publisher":"Springer Berlin / Heidelberg","author":[{"propositions":[],"lastnames":["Blackwell"],"firstnames":["T."],"suffixes":[]},{"propositions":[],"lastnames":["Branke"],"firstnames":["J."],"suffixes":[]}],"year":"2004","keywords":"movingpeaks, pso","pages":"489--500","bibtex":"@inproceedings{blackwell_multi-swarm_2004,\n\tseries = {Lecture {Notes} in {Computer} {Science}},\n\ttitle = {Multi-swarm optimization in dynamic environments},\n\tvolume = {3005},\n\tisbn = {978-3-540-21378-9},\n\turl = {http://www.springerlink.com/content/7mrn505r4rc16qab/},\n\tdoi = {10.1007/b96500},\n\tabstract = {Many real-world problems are dynamic, requiring an optimization algorithm which is able to continuously track a changing optimum over time. In this paper, we present new variants of Particle Swarm Optimization (PSO) specifically designed to work well in dynamic environments. The main idea is to extend the single population PSO and Charged Particle Swarm Optimization (CPSO) methods by constructing interacting multi-swarms. In addition, a new algorithmic variant, which broadens the implicit atomic analogy of CPSO to a quantum model, is introduced. The multi-swarm algorithms are tested on a multi-modal dynamic function - the moving peaks benchmark - and results are compared to the single population approach of PSO and CPSO, and to results obtained by a state-of-the-art evolutionary algorithm, namely self-organizing scouts (SOS). We show that our multi-swarm optimizer significantly outperforms single population PSO on this problem, and that multi-quantum swarms are superior to multi-charged swarms and SOS.},\n\tbooktitle = {Applications of {Evolutionary} {Computing}},\n\tpublisher = {Springer Berlin / Heidelberg},\n\tauthor = {Blackwell, T. and Branke, J.},\n\tyear = {2004},\n\tkeywords = {movingpeaks, pso},\n\tpages = {489--500}\n}\n\n","author_short":["Blackwell, T.","Branke, J."],"key":"blackwell_multi-swarm_2004","id":"blackwell_multi-swarm_2004","bibbaseid":"blackwell-branke-multiswarmoptimizationindynamicenvironments-2004","role":"author","urls":{"Paper":"http://www.springerlink.com/content/7mrn505r4rc16qab/"},"keyword":["movingpeaks","pso"],"downloads":0},"search_terms":["multi","swarm","optimization","dynamic","environments","blackwell","branke"],"keywords":["movingpeaks","pso"],"authorIDs":[],"dataSources":["YYcd3qZWdjjLqC7YK"]}