Combining aggregation with Pareto optimization: A case study in evolutionary molecular design

19Citations
Citations of this article
26Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper is motivated by problem scenarios in automated drug design. It discusses a modeling approach for design optimization problems with many criteria that can be partitioned into objectives and fuzzy constraints. The purpose of this remodeling is to transform the original criteria such that, when using them in an evolutionary search method, a good view on the trade-off between the different objectives and the satisfaction of constraints is obtained. Instead of reducing a many objective problem to a single-objective problem, it is proposed to reduce it to a multi-objective optimization problem with a low number of objectives, for which the visualization of the Pareto front is still possible and the size of a high-resolution approximation set is affordable. For design problems where it is reasonable to combine certain objectives and/or constraints into logical groups by means of desirability indexes, this method will yield good trade-off results with reduced computational effort. The proposed methodology is evaluated in a case-study on automated drug design where we aim to find molecular structures that could serve as estrogen receptor antagonists. © Springer-Verlag 2009.

Cite

CITATION STYLE

APA

Kruisselbrink, J. W., Emmerich, M. T. M., Bäck, T., Bender, A., IJzerman, A. P., & Van Der Horst, E. (2010). Combining aggregation with Pareto optimization: A case study in evolutionary molecular design. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5467 LNCS, pp. 453–467). https://doi.org/10.1007/978-3-642-01020-0_36

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free