Department of Oncology, Wayne State University, Detroit, Michigan, USA.
Department of Pharmacy, Uppsala University, Uppsala, Sweden.
CPT Pharmacometrics Syst Pharmacol. 2021 Nov;10(11):1297-1309. doi: 10.1002/psp4.12714. Epub 2021 Oct 22.
Metaheuristics is a powerful optimization tool that is increasingly used across disciplines to tackle general purpose optimization problems. Nature-inspired metaheuristic algorithms is a subclass of metaheuristic algorithms and have been shown to be particularly flexible and useful in solving complicated optimization problems in computer science and engineering. A common practice with metaheuristics is to hybridize it with another suitably chosen algorithm for enhanced performance. This paper reviews metaheuristic algorithms and demonstrates some of its utility in tackling pharmacometric problems. Specifically, we provide three applications using one of its most celebrated members, particle swarm optimization (PSO), and show that PSO can effectively estimate parameters in complicated nonlinear mixed-effects models and to gain insights into statistical identifiability issues in a complex compartment model. In the third application, we demonstrate how to hybridize PSO with sparse grid, which is an often-used technique to evaluate high dimensional integrals, to search for -efficient designs for estimating parameters in nonlinear mixed-effects models with a count outcome. We also show the proposed hybrid algorithm outperforms its competitors when sparse grid is replaced by its competitor, adaptive gaussian quadrature to approximate the integral, or when PSO is replaced by three notable nature-inspired metaheuristic algorithms.
元启发式算法是一种强大的优化工具,在各个学科中越来越多地被用于解决通用的优化问题。受自然启发的元启发式算法是元启发式算法的一个子类,在解决计算机科学和工程中的复杂优化问题方面表现出了特别的灵活性和有效性。元启发式算法的一个常见做法是将其与另一个选择合适的算法混合使用,以提高性能。本文回顾了元启发式算法,并展示了它在解决药物计量学问题中的一些应用。具体来说,我们提供了三个应用,使用了其中最著名的成员之一,粒子群优化(PSO),并表明 PSO 可以有效地估计复杂非线性混合效应模型中的参数,并深入了解复杂房室模型中的统计可识别性问题。在第三个应用中,我们展示了如何将 PSO 与稀疏网格混合,稀疏网格是一种常用于评估高维积分的技术,以搜索用于估计具有计数结果的非线性混合效应模型中的参数的高效设计。我们还表明,当稀疏网格被其竞争对手自适应高斯求积替换以逼近积分,或者当 PSO 被三个著名的受自然启发的元启发式算法取代时,所提出的混合算法的性能优于其竞争对手。