Publications related to Memetic algorithm

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

Geometry-Driven Stock-Constrained Truss Design via Equilibrium-Based Structural Models

Corentin Jean Dominique Fivet, Tao Sun

This paper presents a geometry-driven approach to form-finding with reused stock elements. Our proposed workflow uses a K-mean algorithm to cluster stock elements and incorporate their geometrical values early in the form-finding process. A feedback loop i ...

Springer2024

Development of Sustainable Carbohydrate-Based Solvents by Acetal Functionalisation of Biomass

Anastasiia Komarova

Organic solvents are ubiquitous in industrial and domestic applications from the production of pharmaceuticals to household consumer products. The negative impact of most traditional solvents, especially aprotic types, on the environment, health, and safet ...

EPFL2024

Benchmarking informatics approaches for virus discovery: caution is needed when combining in silico identification methods

Jaspreet Singh Saini

Understanding the ecological impacts of viruses on natural and engineered ecosystems relies on the accurate identification of viral sequences from community sequencing data. To maximize viral recovery from metagenomes, researchers frequently combine viral ...

Amer Soc Microbiology2024

Genetic Algorithms for the Discovery of Homogeneous Catalysts

Rubén Laplaza Solanas, Anne-Clémence Corminboeuf, Puck Elisabeth van Gerwen, Alexandre Alain Schöpfer, Simone Gallarati

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 o ...

2023

Wind farm power density optimization according to the area size using a novel self-adaptive genetic algorithm

Fernando Porté Agel, Nicolas Otto Kirchner Bossi

This work studies the power density (PD) optimization in wind farms, and its sensitivity to the available area size. A novel genetic algorithm (PDGA) is introduced, which optimizes PD and the turbine layout, by self-adapting to the PD and to the solutions ...

Pergamon-Elsevier Science Ltd2023

Design and experimental investigation of a herringbone grooved gas bearing supported turbocharger

Jürg Alexander Schiffmann, Wanhui Liu

The design of an oil free turbocharger supported on herringbone grooved gas bearing was formulated as a multi-objective problem, which was solved by coupling a reduced order parametric model for gas bearing supported rotors with an evolutionary algorithm. ...

2023

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 ...

Pergamon-Elsevier Science Ltd2023

Optimization of elastic wave propagation in a reconfigurable medium by genetic algorithms with adaptive mutation probability

Romain Christophe Rémy Fleury, Janez Rus

We introduce a reconfigurable medium for the manipulation of elastic propagation properties of Lamb waves. It is based on a shape memory polymer (SMP) with temperature-dependent Young's modulus. Waves are excited by a laser pulse and detected by a laser vi ...

IOP Publishing Ltd2023

End-to-End Learning for Stochastic Optimization: A Bayesian Perspective

Daniel Kuhn, Tobias Sutter, Yves Rychener

We develop a principled approach to end-to-end learning in stochastic optimization. First, we show that the standard end-to-end learning algorithm admits a Bayesian interpretation and trains a posterior Bayes action map. Building on the insights of this an ...

2023

Byzantine-Resilient Learning Beyond Gradients: Distributing Evolutionary Search

Rachid Guerraoui, Andrei Kucharavy, Matteo Monti

Modern machine learning (ML) models are capable of impressive performances. However, their prowess is not due only to the improvements in their architecture and training algorithms but also to a drastic increase in computational power used to train them.|S ...

Assoc Computing Machinery2023

Advancing Computational Chemistry with Stochastic and Artificial Intelligence Approaches

Justin Villard

Computational chemistry aims to simulate reactions and molecular properties at the atomic scale, advancing the design of novel compounds and materials with economic, environmental, and societal implications. However, the field relies on approximate quantum ...

EPFL2023

Quality-Constrained Encoding Optimization for Omnidirectional Video Streaming

Pascal Frossard, Roberto Gerson De Albuquerque Azevedo, Chaofan He

Omnidirectional video streaming is usually implemented based on the representations of tiles, where the tiles are obtained by splitting the video frame into several rectangular areas and each tile is converted into multiple representations with different r ...

Ieee-Inst Electrical Electronics Engineers Inc2023

Online active and dynamic object shape exploration with a multi-fingered robotic hand

Aude Billard, Kunpeng Yao, Xiao Gao, Farshad Khadivar

The sense of touch can provide a robot with a wealth of information about the contact region when interacting with an unknown environment. Nevertheless, utilizing touch information to plan exploration paths and adjust robot posture to improve task efficien ...

Elsevier2023

Wind farm layout and unconstrained hub height optimization using genetic algorithms applied to different power densities

Fernando Porté Agel, Nicolas Otto Kirchner Bossi

LES and wind tunnel studies have shown significant benefit when allowing turbines (T) in a wind farm to adopt different heights. This work presents two new genetic algorithms (GA) that perform wind farm layout optimization (WFLO) involving continuous and t ...

2022

Exploration of static equilibrium representations; policies and genetic algorithms

Corentin Jean Dominique Fivet, Ioannis Mirtsopoulos

Design exploration consists in browsing the design space and through the incremental generation of diverse design candidates increases creativity and diversity. When integrated into the early stages of the structural design process, the task is expected to ...

CRC Press2022

A Critical Re-evaluation of Neural Methods for Entity Alignment

Robert West, Akhil Arora, Manuel Leone, Alberto Garcia Duran, Stefano Huber

Neural methods have become the de-facto choice for the vast majority of data analysis tasks, and entity alignment (EA) is no exception. Not surprisingly, more than 50 different neural EA methods have been published since 2017. However, surprisingly, an ana ...

ASSOC COMPUTING MACHINERY2022

Policy-based Exploration of Equilibrium Representations (PEER): A topology grammar for generative conceptual structural design

Ioannis Mirtsopoulos

Design exploration is a creative process that consists of the incremental generation of design candidates. Supported by digital means or not, the process handles the ill-structured nature of design and allows creativity to flourish through diversity of des ...

EPFL2022

A universal workflow for creation, validation and generalization of detailed neuronal models

Henry Markram, Srikanth Ramaswamy, Mustafa Anil Tuncel, Werner Alfons Hilda Van Geit, Alexis Arnaudon, Christian Andreas Rössert, Maria Reva, Tanguy Pierre Louis Damart, Darshan Mandge

Detailed single neuron modeling is widely used to study neuronal functions. While cellular and functional diversity across the mammalian cortex is vast, most of the available computational tools are dedicated to the reproduction of a small set of specific ...

Cambridge2023

Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs

Adam Teodor Polak, Alexandra Anna Lassota

We solve the Bin Packing problem in O^*(2^k) time, where k is the number of items less or equal to one third of the bin capacity. This parameter measures the distance from the polynomially solvable case of only large (i.e., greater than one third) items. O ...

Schloss Dagstuhl – Leibniz-Zentrum fur Informatik2022