Multi-and many-objective optimization: present and future in de novo drug design

Front Chem. 2023 Dec 18:11:1288626. doi: 10.3389/fchem.2023.1288626. eCollection 2023.

Abstract

de novo Drug Design (dnDD) aims to create new molecules that satisfy multiple conflicting objectives. Since several desired properties can be considered in the optimization process, dnDD is naturally categorized as a many-objective optimization problem (ManyOOP), where more than three objectives must be simultaneously optimized. However, a large number of objectives typically pose several challenges that affect the choice and the design of optimization methodologies. Herein, we cover the application of multi- and many-objective optimization methods, particularly those based on Evolutionary Computation and Machine Learning techniques, to enlighten their potential application in dnDD. Additionally, we comprehensively analyze how molecular properties used in the optimization process are applied as either objectives or constraints to the problem. Finally, we discuss future research in many-objective optimization for dnDD, highlighting two important possible impacts: i) its integration with the development of multi-target approaches to accelerate the discovery of innovative and more efficacious drug therapies and ii) its role as a catalyst for new developments in more fundamental and general methodological frameworks in the field.

Keywords: de novo drug design; drug discovery; evolutionary algorithms; many-objective optimization; multi-objective optimization.

Publication types

  • Review

Grants and funding

The author(s) declare financial support was received for the research, authorship, and/or publication of this article. This work was supported by the Brazilian agencies Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) (grant numbers 301524/2023-8, 309744/2022-9); and the Fundação Carlos Chagas Filho de Apoio à Ciência (FAPERJ) (grant numbers E-26/010.001415/2019, E-26/211.357/2021, E-26/200.393/2023, E-26/200.608/2022, E-26/210.372/2022).