Wong Weng Kee, Chen Ray-Bing, Huang Chien-Chih, Wang Weichung
Department of Biostatistics, University of California, Los Angeles, USA.
Department of Statistics, National Cheng Kung University, Taiwan.
PLoS One. 2015 Jun 19;10(6):e0124720. doi: 10.1371/journal.pone.0124720. eCollection 2015.
Particle Swarm Optimization (PSO) is a meta-heuristic algorithm that has been shown to be successful in solving a wide variety of real and complicated optimization problems in engineering and computer science. This paper introduces a projection based PSO technique, named ProjPSO, to efficiently find different types of optimal designs, or nearly optimal designs, for mixture models with and without constraints on the components, and also for related models, like the log contrast models. We also compare the modified PSO performance with Fedorov's algorithm, a popular algorithm used to generate optimal designs, Cocktail algorithm, and the recent algorithm proposed by [1].
粒子群优化算法(PSO)是一种元启发式算法,已被证明在解决工程和计算机科学中各种实际且复杂的优化问题方面很成功。本文介绍了一种基于投影的PSO技术,称为ProjPSO,以有效地找到具有和不具有成分约束的混合模型以及相关模型(如对数对比模型)的不同类型的最优设计或近似最优设计。我们还将改进后的PSO性能与费多罗夫算法(一种用于生成最优设计的常用算法)、鸡尾酒算法以及文献[1]最近提出的算法进行了比较。