liveBook · Manning

Selection

Selection is an evolutionary optimization operation that chooses candidate solutions for continuation or reproduction according to their fitness or quality.

How 6 Manning books explain it

Optimization Algorithms: AI techniques for design, planning, and control problems

A genetic-algorithm procedure that chooses individuals from a population to serve as parents for reproduction.

How it is used
Uses selection to choose promising parents for generating offspring in an evolving population of candidate solutions.
How deep it goes
Explains selection probabilities, selective pressure, and survivor methods with a worked ticket-pricing example.
Examples
Uses ticket-pricing candidates and their fitness values to calculate roulette-wheel probabilities and illustrate elitist selection.
What you can do after
Supports evaluating selection methods by their selective pressure and effects on population diversity.

Read how Optimization Algorithms: AI techniques for design, planning, and control problems explains selection →

Evolutionary Deep Learning: Genetic algorithms and neural networks

A selection operator chooses individuals from a population for reproduction or survival according to their fitness.

How it is used
Chooses parents for reproduction so fitness-guided evolution can produce later generations.
How deep it goes
Implements fitness sorting and elite parent choice, then compares operator behavior without deriving selection theory.
Examples
Uses a trait-based cell simulation, a binary One Max population, and a simplified traveling-salesperson problem.
What you can do after
Apply it via Colab forms by swapping selection operators and inspecting diversity and genealogy changes.

Read how Evolutionary Deep Learning: Genetic algorithms and neural networks explains selection →

Advanced Algorithms and Data Structures

A selection technique is a genetic-algorithm method for choosing individuals that survive or reproduce in the next generation.

How it is used
Uses selection to decide which organisms reproduce or transmit genomes to the next generation.
How deep it goes
Defines four techniques and gives pseudocode for tournament and roulette-wheel implementation, but does not develop full algorithm integration.
Examples
Demonstrates selection with a 0-1 knapsack population, including elitism, thresholding, tournament selection, and roulette-wheel diagrams.
What you can do after
Apply it via tournament or roulette-wheel pseudocode to choose mating candidates from a population.

Read how Advanced Algorithms and Data Structures explains selection →

Grokking AI Algorithms, Second Edition

Selection is an evolutionary algorithm operation that chooses candidate solutions for continuation or reproduction based on their quality.

How it is used
Coordinates parent choice and next-generation survival within a genetic algorithm.
How deep it goes
Explains parent and survivor selection, elitism, and diversity trade-offs, but does not detail each alternative strategy.
Examples
Uses knapsack fitness scores, overweight-solution penalties, elitism, and genetic algorithm lifecycle diagrams.
What you can do after
Operate/configure selection in a genetic algorithm while recognizing convergence, stagnation, and diversity trade-offs.

Read how Grokking AI Algorithms, Second Edition explains selection →

Inside AI

Selection is a genetic-algorithm operation that retains candidate solutions with comparatively high fitness for further evolution.

How it is used
Optimizes complex resource-allocation and routing problems by retaining stronger candidate solutions for further evolution.
How deep it goes
Explains fitness evaluation, sorting, retention, and repeated generations, but does not specify a particular selection rule.
Examples
Uses delivery routes, distribution plans, schedules, costs, delivery times, and resource allocations as candidate-solution examples.
What you can do after
Apply it via a genetic algorithm to retain promising solutions during iterative optimization.

Read how Inside AI explains selection →

Self-Improving Agents

An evolutionary search operator that evaluates candidates and chooses among them according to their fitness.

How it is used
Scores candidates in an evolutionary improvement loop.
How deep it goes
Explains candidate scoring, choosing parents for crossover, and fitness-based termination without specifying a broader selection policy.
Examples
Uses a toy genome fitness function and a Signal measuring a mutated artifact.
What you can do after
Apply selection by scoring candidates and choosing high-scoring parents for crossover.

Read how Self-Improving Agents explains selection →

Also covered in

What to know first

Related concepts

Questions about selection

What is selection?

Selection is an evolutionary optimization operation that chooses candidate solutions for continuation or reproduction according to their fitness or quality.

Which Manning books explain selection?

Optimization Algorithms: AI techniques for design, planning, and control problems, Evolutionary Deep Learning: Genetic algorithms and neural networks, Advanced Algorithms and Data Structures, Grokking AI Algorithms, Second Edition, Inside AI and Self-Improving Agents.

What should I know before learning selection?

Manning books that teach selection usually introduce genetic algorithm, mutation, population and diversity first.

What kinds of selection are there?

Kinds of selection include tournament selection, elitism, roulette-wheel selection and fitness-proportionate selection.

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.