Suppr超能文献

带有变异个体的竞争群体优化算法用于寻找具有多个相互作用因子的非线性回归模型的最优设计

Competitive Swarm Optimizer with Mutated Agents for Finding Optimal Designs for Nonlinear Regression Models with Multiple Interacting Factors.

作者信息

Zhang Zizhao, Wong Weng Kee, Tan Kay Chen

机构信息

Department of Biostatistics, University of California at Los Angeles, Los Angeles, California 90095-1772, U.S.A.

Department of Computer Science, City University of Hong Kong, Hong Kong.

出版信息

Memet Comput. 2020 Sep;12(3):219-233. doi: 10.1007/s12293-020-00305-6. Epub 2020 Jun 23.

Abstract

This paper proposes a novel enhancement for Competitive Swarm Optimizer (CSO) by mutating loser particles (agents) from the swarm to increase the swarm diversity and improve space exploration capability, namely Competitive Swarm Optimizer with Mutated Agents (CSO-MA). The selection mechanism is carried out so that it does not retard the search if agents are exploring in promising areas. Simulation results show that CSO-MA has a better exploration-exploitation balance than CSO and generally outperforms CSO, which is one of the state-of-the-art metaheuristic algorithms for optimization. We show additionally that it also generally outperforms swarm based types of algorithms and an exemplary and popular non-swarm based algorithm called Cuckoo search, without requiring a lot more CPU time. We apply CSO-MA to find a -optimal approximate design for a high-dimensional optimal design problem when other swarm algorithms were not able to. As applications, we use the CSO-MA to search various optimal designs for a series of high-dimensional statistical models. The proposed CSO-MA algorithm is a general-purpose optimizing tool and can be directly amended to find other types of optimal designs for nonlinear models, including optimal exact designs under a convex or non-convex criterion.

摘要

本文提出了一种对竞争型群体优化算法(CSO)的新颖改进方法,即通过对群体中的失败粒子(智能体)进行变异来增加群体多样性并提高空间探索能力,也就是带变异智能体的竞争型群体优化算法(CSO-MA)。其选择机制的执行方式是,当智能体在有前景的区域进行探索时,不会阻碍搜索。仿真结果表明,CSO-MA比CSO具有更好的探索-利用平衡,并且总体上优于CSO,CSO是用于优化的最先进的元启发式算法之一。我们还表明,它通常也优于基于群体的算法类型以及一种名为布谷鸟搜索的典型且流行的非群体算法,而且不需要更多的CPU时间。当其他群体算法无法解决时,我们应用CSO-MA来找到一个高维优化设计问题的最优近似设计。作为应用,我们使用CSO-MA为一系列高维统计模型搜索各种最优设计。所提出的CSO-MA算法是一种通用的优化工具,可以直接修改以找到非线性模型的其他类型的最优设计,包括在凸或非凸准则下的最优精确设计。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/256a/7968042/e3e393c2426b/nihms-1606569-f0001.jpg

相似文献

2
A competitive swarm optimizer for large scale optimization.一种用于大规模优化的竞争型群体智能优化算法。
IEEE Trans Cybern. 2015 Feb;45(2):191-204. doi: 10.1109/TCYB.2014.2322602. Epub 2014 May 20.

本文引用的文献

3
A competitive swarm optimizer for large scale optimization.一种用于大规模优化的竞争型群体智能优化算法。
IEEE Trans Cybern. 2015 Feb;45(2):191-204. doi: 10.1109/TCYB.2014.2322602. Epub 2014 May 20.
4
Particle swarm optimization with scale-free interactions.具有无标度交互作用的粒子群优化。
PLoS One. 2014 May 23;9(5):e97822. doi: 10.1371/journal.pone.0097822. eCollection 2014.
6
Classification of adaptive memetic algorithms: a comparative study.自适应混合算法的分类:一项比较研究。
IEEE Trans Syst Man Cybern B Cybern. 2006 Feb;36(1):141-52. doi: 10.1109/tsmcb.2005.856143.

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验