Metaheuristics for pharmacometrics. (22nd October 2021)

• Record Type: Journal Article
• Authors: Kim, Seongho; Hooker, Andrew C.; Shi, Yu; Kim, Grace Hyun J.; Wong, Weng Kee
• Is Part Of: CPT: pharmacometrics & systems pharmacology. Volume 10:Number 11(2021)
• Page Start: 1297
• Page End: 1309
• Publication Date: 2021-10-22
• Subjects: Pharmacokinetics -- Periodicals; Pharmacology -- Periodicals; Pharmacokinetics; Periodicals; 615.05
• DOI: 10.1002/psp4.12714
• Languages: English
• ISSNs: 2163-8306

Abstract

Abstract: 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 D ‐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.