Publication

Genetic Algorithms for the Discovery of Homogeneous Catalysts

Abstract

In this account, we discuss the use of genetic algorithms in the inverse design process of homogeneous catalysts for chemical transformations. We describe the main components of evolutionary experiments, specifically the nature of the fitness function to optimize, the library of molecular fragments from which potential catalysts are assembled, and the settings of the genetic algorithm itself. While not exhaustive, this review summarizes the key challenges and characteristics of our own (i.e., NaviCatGA) and other GAs for the discovery of new catalysts.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Related concepts (32)
Genetic algorithm
In computer science and operations research, a genetic algorithm (GA) is a metaheuristic inspired by the process of natural selection that belongs to the larger class of evolutionary algorithms (EA). Genetic algorithms are commonly used to generate high-quality solutions to optimization and search problems by relying on biologically inspired operators such as mutation, crossover and selection. Some examples of GA applications include optimizing decision trees for better performance, solving sudoku puzzles, hyperparameter optimization, causal inference, etc.
Crossover (genetic algorithm)
In genetic algorithms and evolutionary computation, crossover, also called recombination, is a genetic operator used to combine the genetic information of two parents to generate new offspring. It is one way to stochastically generate new solutions from an existing population, and is analogous to the crossover that happens during sexual reproduction in biology. Solutions can also be generated by cloning an existing solution, which is analogous to asexual reproduction. Newly generated solutions may be mutated before being added to the population.
Chromosome (genetic algorithm)
In genetic algorithms (GA), or more general, evolutionary algorithms (EA), a chromosome (also sometimes called a genotype) is a set of parameters which define a proposed solution of the problem that the evolutionary algorithm is trying to solve. The set of all solutions, also called individuals according to the biological model, is known as the population. The genome of an individual consists of one, more rarely of several, chromosomes and corresponds to the genetic representation of the task to be solved.
Show more
Related publications (63)

Data from: Optimal blade pitch control for enhanced vertical-axis wind turbine performance

Karen Ann J Mulleners, Sébastien Le Fouest

This directory contains open-source data obtained using a single-bladed H-type vertical-axis wind turbine prototype with individual blade pitching. This data results from the optimisation of the blade's pitching kinematics using a genetic algorithm at two ...
Zenodo2024

A combined genetic algorithm and active learning approach to build and test surrogate models in Process Systems Engineering

François Maréchal, Julia Granacher

In Process Systems Engineering, computationally-demanding models are frequent and plentiful. Handling such complexity in an optimization framework in a fast and reliable way is essential, not only for generating meaningful solutions but also for providing ...
Oxford2023

Enriching the Computational Toolbox for Organocatalysis

Simone Gallarati

Organocatalysis has evolved significantly over the last decades, becoming a pillar of synthetic chemistry, but traditional theoretical approaches based on quantum mechanical computations to investigate reaction mechanisms and provide rationalizations of ca ...
EPFL2023
Show more
Related MOOCs (7)
SES Swiss-Energyscope
La transition énergique suisse / Energiewende in der Schweiz
SES Swiss-Energyscope
La transition énergique suisse / Energiewende in der Schweiz
Introduction to optimization on smooth manifolds: first order methods
Learn to optimize on smooth, nonlinear spaces: Join us to build your foundations (starting at "what is a manifold?") and confidently implement your first algorithm (Riemannian gradient descent).
Show more

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.