{"title":"基于粒子群算法的高效实验设计研究进展","authors":"Ping-Yang Chen, Ray‐Bing Chen, W. Wong","doi":"10.1002/wics.1578","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":47779,"journal":{"name":"Wiley Interdisciplinary Reviews-Computational Statistics","volume":" ","pages":""},"PeriodicalIF":4.4000,"publicationDate":"2022-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Particle swarm optimization for searching efficient experimental designs: A review\",\"authors\":\"Ping-Yang Chen, Ray‐Bing Chen, W. Wong\",\"doi\":\"10.1002/wics.1578\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":47779,\"journal\":{\"name\":\"Wiley Interdisciplinary Reviews-Computational Statistics\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":4.4000,\"publicationDate\":\"2022-02-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Wiley Interdisciplinary Reviews-Computational Statistics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1002/wics.1578\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"STATISTICS & PROBABILITY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Wiley Interdisciplinary Reviews-Computational Statistics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1002/wics.1578","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"STATISTICS & PROBABILITY","Score":null,"Total":0}
Particle swarm optimization for searching efficient experimental designs: A review
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.