Crossover (genetic algorithm) | EPFL Graph Search

Êtes-vous un étudiant de l'EPFL à la recherche d'un projet de semestre?

Travaillez avec nous sur des projets en science des données et en visualisation, et déployez votre projet sous forme d'application sur GraphSearch.

Découvrez-en plus sur les applications Graph.

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. Different algorithms in evolutionary computation may use different data structures to store genetic information, and each genetic representation can be recombined with different crossover operators. Typical data structures that can be recombined with crossover are bit arrays, vectors of real numbers, or trees. The list of operators presented below is by no means complete and serves mainly as an exemplary illustration of this dyadic genetic operator type. More operators and more details can be found in the literature. Traditional genetic algorithms store genetic information in a chromosome represented by a bit array. Crossover methods for bit arrays are popular and an illustrative example of genetic recombination. A point on both parents' chromosomes is picked randomly, and designated a 'crossover point'. Bits to the right of that point are swapped between the two parent chromosomes. This results in two offspring, each carrying some genetic information from both parents. In two-point crossover, two crossover points are picked randomly from the parent chromosomes. The bits in between the two points are swapped between the parent organisms. Two-point crossover is equivalent to performing two single-point crossovers with different crossover points. This strategy can be generalized to k-point crossover for any positive integer k, picking k crossover points. In uniform crossover, typically, each bit is chosen from either parent with equal probability.

À propos de ce résultat

Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Publications associées (6)

Personnes associées (4)

Unités associées (2)

Concepts associés (9)

Cours associés (1)

Séances de cours associées (12)

MOOCs associés (11)

ChE-605: AI in chemistry and beyond:Highlights in the field

Should have expertise in chemistry, physics or lite and material sciences. Although a very good knowledge in Al-based algorithms is required to fully understand the technical details, a basic knowledg

Thymio: un robot pour se former à l'informatique

On propose dans ce MOOC de se former à et avec Thymio : apprendre à programmer le robot Thymio et ce faisant, s’initier à l'informatique et la robotique.

Die digitale Welt mit dem Thymio Roboter entdecken

In diesem Kurs handelt es sich um das Verständnis der grundlegenden Mechanismen eines Roboters wie Thymio, seiner Programmierung mit verschiedenen Sprachen und seiner Verwendung im Unterricht mit den

Die digitale Welt mit dem Thymio Roboter entdecken (FHNW)

Fitness function

A fitness function is a particular type of objective function that is used to summarise, as a single figure of merit, how close a given design solution is to achieving the set aims. Fitness functions are used in evolutionary algorithms (EA), such as genetic programming and genetic algorithms to guide simulations towards optimal design solutions. In the field of EAs, each design solution is commonly represented as a string of numbers (referred to as a chromosome).

Crossover (genetic algorithm)

Mutation (genetic algorithm)

Mutation is a genetic operator used to maintain genetic diversity of the chromosomes of a population of a genetic or, more generally, an evolutionary algorithm (EA). It is analogous to biological mutation. The classic example of a mutation operator of a binary coded genetic algorithm (GA) involves a probability that an arbitrary bit in a genetic sequence will be flipped from its original state. A common method of implementing the mutation operator involves generating a random variable for each bit in a sequence.

The EBRAINS Hodgkin-Huxley Neuron Builder: An online resource for building data-driven neuron models

Jean-Denis Georges Emile Courcol, Michele Migliore, Genrich Ivaska, Carmen Alina Lupascu, Luca Leonardo Bologna, Shailesh Appukuttan

In the last decades, brain modeling has been established as a fundamental tool for understanding neural mechanisms and information processing in individual cells and circuits at different scales of observation. Building data-driven brain models requires the availability of experimental data and analysis tools as well as neural simulation environments and, often, large scale computing facilities. All these components are rarely found in a comprehensive framework and usually require ad hoc programming. To address this, we developed the EBRAINS Hodgkin-Huxley Neuron Builder (HHNB), a web resource for building single cell neural models via the extraction of activity features from electrophysiological traces, the optimization of the model parameters via a genetic algorithm executed on high performance computing facilities and the simulation of the optimized model in an interactive framework. Thanks to its inherent characteristics, the HHNB facilitates the data-driven model building workflow and its reproducibility, hence fostering a collaborative approach to brain modeling.

FRONTIERS MEDIA SA2022

Exploration of micro-acoustic spectrometry techniques

Florian Fernand Hartmann

This master’s thesis aimed at exploring the field of micro-acoustic spectrometry using surface acoustic waves. The objectives of this project were to design and fabricate a platform for the detection and characterization of bioentities. Design of a delay line based on the experience and knowledge of the ANEMS group and on investigation of existing solutions was performed. Different configurations and types of transducers were simulated to come up with some meaningful designs for fabrication. The devices were fabricated in the clean rooms at EPFL with a specific process flow used for the suspended structures. Extensive simulation of bidirectional and unidirectional transducers were carried out in order to understand their behavior and to be able to use them as the elements of the sensing platform. Setbacks prevented the completion of the fabrication and no real measurements could be done before the end of this project, but the simulations gave nice perspectives for the targeted application. The potential of surface acoustic waves to detect modifications in the elasticity or the density of a material could be witnessed in the last simulations.

2022

Superposition model for steady state visually evoked potentials

José del Rocio Millán Ruiz, Ricardo Andres Chavarriaga Lozano, Jaiber Evelio Cardona Aristizabal, Wilfredo Alfonso Morales

Steady State Visually Evoked Potentials (SSVEP) are signals produced in the occipital part of the brain when someone gaze a light flickering at a fixed frequency. These signals have been used for Brain Machine Interfacing (BMI), where one or more stimuli are presented and the system has to detect what is the stimulus the user is attending to. It has been proposed that the SSVEP signal is produced by superposition of Visually Evoked Potentials (VEP) but there is not a model that shows that. We propose a model for a SSVEP signal that is a superposition of the response to the rising and falling edges of the stimuli and that can be calculated for different frequencies. This model is based in the phase between the stimulus and the SSVEP signal considering that the phase is stable over the time. We fit the model for 4 volunteers that gazed stimuli in the frequencies of 9hz, 11hz, 13hz and 15hz, and duty-cycles of 20%, 35%, 50%, 65% and 80%. We found the parameters of the model for every volunteer using the data of Oz electrode and a genetic algorithm. The proposed model is useful for find the best duty-cycle of the stimulus and it can be useful for select a code in the stimuli different for a square signal, the model only consider one frequency at the same time, but the results showed that it could be possible to find a more generic model.

2016

Architecture reconfigurable : interconnexion statique tolérante aux pannes

Explore une architecture de reconfiguration pour les dispositifs semi-conducteurs, optimisant la cartographie et la gestion des défauts.

Physiologie cellulaire: modèles de tir neuronaux MOOC: Selected chapters form winterschool on multi-scale brain

Explore la recréation de modèles de tir neuronaux à travers des modèles de canaux ioniques et des algorithmes génétiques.

Optimisation en ingénierie PHYS-324: Classical electrodynamics

Explore les techniques d'optimisation en ingénierie pour résoudre efficacement des problèmes complexes.