Particle swarm optimization for searching efficient experimental designs: A review
WIREs Computational Statistics · 2022-09 · 14 (5)
DOI: 10.1002/wics.1578 ↗Kurz gefasst
Fachartikel in der Zeitschrift WIREs Computational Statistics, online erschienen am 15.02.2022. Verfasst von Ping‐Yang Chen und 2 weiteren Autor:innen. Die Arbeit wurde bisher 26-mal zitiert (Crossref) und nennt 69 Literaturangaben.
Abstract (Originalsprache)
The class of nature‐inspired metaheuristic algorithms is increasingly used to tackle all kinds of optimization problems across disciplines. It also plays an important component in artificial intelligence and machine learning. Members in this class are general purpose optimization tools that virtually require no assumptions for them to be applicable. There are many such algorithms, and to fix ideas, we review one of its exemplary members called particle swarm optimization (PSO). We discuss the algorithm, its recent applications to find different types of efficient experimental designs, and provide resources, where codes for PSO and other metaheuristic algorithms and tutorials with examples are available. This article is categorized under: Algorithms and Computational Methods > Genetic Algorithms and Evolutionary Computing
Zitieren
APA
Chen, P., Chen, R., & Wong, W. K. (2022). Particle swarm optimization for searching efficient experimental designs: A review. WIREs Computational Statistics, 14(5). https://doi.org/10.1002/wics.1578
Vancouver
Chen P, Chen R, Wong WK. Particle swarm optimization for searching efficient experimental designs: A review. WIREs Computational Statistics. 2022;14(5). doi:10.1002/wics.1578
BibTeX
@article{Chen2022,
author = {Chen, Ping‐Yang and Chen, Ray‐Bing and Wong, Weng Kee},
title = {Particle swarm optimization for searching efficient experimental designs: A review},
journal = {WIREs Computational Statistics},
year = {2022},
volume = {14},
number = {5},
doi = {10.1002/wics.1578}
}
EUVIMED