22 papers · ranked by Valyu relevance
Eugene Eberbach
Evolution by natural selection, which is one of the most compelling themes of modern science, brought forth evolutionary algorithms and evolutionary computation, applying mechanisms of evolution in nature to various problems solved by computers. In this paper we concentrate on evolutionary automata that constitute an…
Sizhe Yuen, Thomas H. G. Ezard, Adam J. Sobey
Evolutionary computation is a group of biologically inspired algorithms used to solve complex optimization problems. It can be split into evolutionary algorithms, which take inspiration from genetic inheritance, and swarm intelligence algorithms, that take inspiration from cultural inheritance. However, much of the…
Roman V. Yampolskiy
In this paper, we review the state-of-the-art results in evolutionary computation and observe that we don't evolve non-trivial software from scratch and with no human intervention. A number of possible explanations are considered, but we conclude that computational complexity of the problem prevents it from being…
Licheng Jiao, Jiaxuan Zhao, Chao Wang, Xu Liu + 6 more
'Lingling Li' 'Ronghua Shang' 'Yangyang Li' 'Wenping Ma' 'Shuyuan Yang'] Nature, with its numerous surprising rules, serves as a rich source of creativity for the development of artificial intelligence, inspiring researchers to create several nature-inspired intelligent computing paradigms based on natural mechanisms.…
Hassan A. Bashir, R.S. Neville
This material represents the opinion of the author only and does not necessarily represent the opinion of the School or the University. While every attempt has been made to ensure the accuracy of this publication, neither the author, the School or the University can accept liability for mistakes that may exist. Please…
Alexander Lalejini, Emily Dolson, Anya E. Vostinar, Luis Zaman
Directed microbial evolution harnesses evolutionary processes in the laboratory to construct microorganisms with enhanced or novel functional traits. Attempting to direct evolutionary processes for applied goals is fundamental to evolutionary computation, which harnesses the principles of Darwinian evolution as a…
Mihai Oltean
A new model for evolving Evolutionary Algorithms (EAs) is proposed in this paper. The model is based on the Multi Expression Programming (MEP) technique. Each MEP chromosome encodes an evolutionary pattern which is repeatedly used for generating the individuals of a new generation. The evolved pattern is embedded into…
Olga Speck, Thomas Speck, Sabine Baur, Michael Herdy + 3 more
'Laith Abualigah' 'Xuewen Xia'] With a focus on education and teaching, we provide general background information on bioinspired optimization methods by comparing the concept of optimization and the search for an optimum in engineering and biology. We introduce both the principles of Darwinian evolution and the basic…
Lillian T. Tatka, Lucian P. Smith, Herbert M. Sauro
Evolutionary algorithms, a class of optimization techniques inspired by biological evolution, have emerged as powerful tools for the optimization of complex systems, including the evolution of mass-action chemical reaction networks. This work explores the application of evolutionary algorithms in this domain…
Mihai Oltean
A new model for evolving Evolutionary Algorithms is proposed in this paper. The model is based on the Linear Genetic Programming (LGP) technique. Every LGP chromosome encodes an EA which is used for solving a particular problem. Several Evolutionary Algorithms for function optimization, the Traveling Salesman Problem…
Mihai Oltean, Crina Groşan
Finding the optimal parameter setting (i.e. the optimal population size, the optimal mutation probability, the optimal evolutionary model etc) for an Evolutionary Algorithm (EA) is a difficult task. Instead of evolving only the parameters of the algorithm we will evolve an entire EA capable of solving a particular…
Artem Kaznatcheev
Valiant [1] proposed to treat Darwinian evolution as a special kind of computational learning from statistical queries. The statistical queries represent a genotype’s fitness over a distribution of challenges. And this distribution of challenges along with the best response to them specify a given abiotic environment…
Brianna Greenstein, Danielle Elsey, Geoffrey Hutchison
Genetic algorithms (GAs) are a powerful tool to search large chemical spaces for inverse molecular design. However, GAs have multiple hyperparameters that have not been thoroughly investigated for chemical space searches. In this work, we examine the general effects of a number of hyperparameters, such as population…
Oliver Attie, Brian Sulkow, Chong Di, Wei-Gang Qiu
Learning algorithms have been proposed as a non-selective mechanism capable of creating complex adaptive systems in life. Evolutionary learning however has not been demonstrated to be a plausible cause for the origin of a specific molecular system. Here we show that genetic codes as optimal as the Standard Genetic Code…
Chun-Wei Tsai, Shih-Pang Tseng, Ming-Chao Chiang, Chu-Sing Yang + 1 more
'Tzung-Pei Hong'] This paper presents a simple but efficient algorithm for reducing the computation time of genetic algorithm (GA) and its variants. The proposed algorithm is motivated by the observation that genes common to all the individuals of a GA have a high probability of surviving the evolution and ending up…
Authors not listed
Designing molecules with specific target properties remains a fundamental challenge in computational chemistry. While existing approaches show promise, most rely on simplified representations like SMILES strings or 2D graphs that lack essential three-dimensional geometric information. We present EvoDiffMol, a…
Alan Godoy, Pedro Tabacof, Fernando J. Von Zuben, Dante R. Chialvo
How can systems in which individuals’ inner workings are very similar to each other, as neural networks or ant colonies, produce so many qualitatively different behaviors, giving rise to roles and specialization? In this work, we bring new perspectives to this question by focusing on the underlying network that defines…
Kangbien Park
Directed evolution of asexual populations is expected to offer a wide range of benefits to humanity. Achieving efficient directed evolution (DE) requires a quantitative formulation of the experimental methodologies—or logics—that can address potential challenges throughout the evolutionary process. In this article, I…
Jonas Verhellen
Computer-assisted design of small molecules has experienced a resurgence in academic and indus- trial interest due to the widespread use of data-driven techniques such as deep generative models. While the ability to generate molecules that fulfill required chemical properties is encouraging, the use of deep learning…
Authors not listed
Genetic Algorithms are a powerful method to solve optimization problems with complex cost functions over vast search spaces that rely in particular on recombining parts of previous solutions. Crossover operators play a crucial role in this context. Here, we describe a large class of these operators designed for…
Stefano Nolfi, Paolo Pagliuca
We investigate the use of competitive co-evolution for synthesizing progressively better solutions. Specifically, we introduce a set of methods to measure historical and global progress. We discuss the factors that facilitate genuine progress. Finally, we compare the efficacy of four qualitatively different algorithms.…
Authors not listed
Quantum mechanics/molecular mechanics (QM/MM) simulations are crucial for understanding enzymatic reactions, but their accuracy depends heavily on the quantum-mechanical method used. Semiempirical methods offer computational efficiency but often struggle with accuracy in complex systems. This work presents a novel…