Genetic operation
A genetic operation is an evolutionary-algorithm transformation that modifies or combines candidate solutions to produce new individuals.
Evolutionary Deep Learning: Genetic algorithms and neural networks
A genetic operator is a computational transformation, such as crossover or mutation, that changes or combines candidate solutions in an evolutionary algorithm.
- How it is used
- Drives generation-to-generation variation and selection while evolving candidate solutions in DEAP.
- How deep it goes
- Walks through toolbox registration, probabilities, representation-specific choices, visual comparisons, and custom autoencoder implementations.
- Examples
- Uses OneMax bit strings, N-Queens permutations, traveling-salesperson comparisons, and autoencoder architecture genes.
- What you can do after
- Apply it via DEAP by registering, swapping, and tuning evaluation, crossover, mutation, and selection operations.
Optimization Algorithms: AI techniques for design, planning, and control problems
A genetic operator is a variation operation that modifies or combines candidate individuals to generate evolutionary alternatives.
- How it is used
- Generates offspring during population-based optimization after parent selection and before fitness-based survival decisions.
- How deep it goes
- Works through binary one-point crossover and bit mutation in Python, then configures alternative operators in pymoo.
- Examples
- Uses eight-bit ticket-price candidates, generated offspring, a binary Python GA, and a pymoo GA configuration.
- What you can do after
- Build it from scratch in Python with crossover and mutation, or apply configured operators via pymoo.
Related concepts
- DEAPused by · DEAP is a Python framework for rapid prototyping of evolutionary algorithms and other computational intelligence techniques.
- genetic programmingused by · Genetic programming is an evolutionary computation technique that searches over program structures by selecting, recombining, and mutating candidate programs or symbolic expressions.
- evolutionary computationpart of · Evolutionary computation is a family of search and optimization methods that iteratively improve candidate solutions through variation and selection inspired by biological evolution.
- evolution strategyused by · An evolution strategy is a population-based evolutionary optimization method that searches through stochastic variation, selection, and adaptation of strategy parameters.
- mutation operatorincludes · A mutation operator modifies one or more components of a candidate solution to introduce variation during an optimization or evolutionary search.
- crossoverincludes · Crossover is an evolutionary recombination technique that combines material from parent candidate solutions to produce one or more offspring.
These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.