Go beyond the limits of genetic algorithm in daily covariate selection practice

Covariate identification is an important step in the development of a population pharmacokinetic/pharmacodynamic model. Among the different available approaches, the stepwise covariate model (SCM) is the most used. However, SCM is based on a local search strategy, in which the model-building process iteratively tests the addition or elimination of a single covariate at a time given all the others. This introduces a heuristic to limit the searching space and then the computational complexity, but, at the same time, can lead to a suboptimal solution. The application of genetic algorithms (GAs) for covariate selection has been proposed as a possible solution to overcome these limitations. However, their actual use during model building is limited by the extremely high computational costs and convergence issues, both related to the number of models being tested. In this paper, we proposed a new GA for covariate selection to address these challenges. The GA was first developed on a simulated case study where the heuristics introduced to overcome the limitations affecting currently available GA approaches resulted able to limit the selection of redundant covariates, increase replicability of results and reduce convergence times. Then, we tested the proposed GA on a real-world problem related to remifentanil. It obtained good results both in terms of selected covariates and fitness optimization, outperforming the SCM.