liveBook · Manning

Crossover

Also called recombination

Crossover is an evolutionary recombination technique that combines material from parent candidate solutions to produce one or more offspring.

How 8 Manning books explain it

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

Crossover is a genetic operator that combines genetic material from parent candidate solutions to produce offspring.

How it is used
Uses crossover to generate offspring from selected parents during genetic-algorithm search.
How deep it goes
Explains binary and real-valued crossover procedures, with a from-scratch implementation and a library configuration.
Examples
Uses binary ticket-price candidates and a real-valued ticket-price optimization configuration to illustrate crossover.
What you can do after
Builds one-point crossover from scratch and applies two-point crossover via pymoo in a genetic algorithm.

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

Advanced Algorithms and Data Structures

Crossover is a genetic-algorithm technique that recombines genetic material from selected parent solutions to produce one or more child solutions.

How it is used
Recombines selected parents to create candidate solutions during genetic-algorithm population updates.
How deep it goes
Develops bit-string and permutation operators with pseudocode, a probability wrapper, and tuning results; leaves operator choice problem-dependent.
Examples
Uses 0–1 knapsack bit strings, traveling-salesperson routes, pseudocode operators, and TSP tuning experiments.
What you can do after
Build it from scratch for bit-string or permutation chromosomes, then tune its probability against mutation and population size.

Read how Advanced Algorithms and Data Structures explains crossover →

Evolutionary Deep Learning: Genetic algorithms and neural networks

A crossover operator combines genetic sequences from parent individuals to produce offspring in an evolutionary algorithm.

How it is used
Produces offspring after parent selection in genetic algorithms and neuroevolution.
How deep it goes
Walks through one-point recombination, rate gating, and split-point code, then surveys encoding-specific operator choices.
Examples
Uses binary one-max evolution, index-sequence operators, traveling salesperson sequences, and autoencoder architectures.
What you can do after
Apply it via Python or DEAP by selecting an operator and tuning crossover rates for an encoded population.

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

Classic Computer Science Problems in Swift: Essential techniques for practicing programmers

A genetic algorithm technique that combines portions of parent chromosomes to produce offspring chromosomes.

How it is used
Deploys crossover as a stochastic reproduction operation within each genetic-algorithm generation.
How deep it goes
Explains random split-and-swap implementation and interface placement, but defers broader crossover variants and formal analysis.
Examples
Uses a random gene-array split in SEND+MORE=MONEY to demonstrate two swapped-segment offspring.
What you can do after
Build it from scratch as a Swift Chromosome method that returns two children from paired parents.

Read how Classic Computer Science Problems in Swift: Essential techniques for practicing programmers explains crossover →

Grokking AI Algorithms, Second Edition

A crossover method is a recombination technique that creates offspring by combining portions of parent chromosomes.

How it is used
Generates new candidate solutions from selected parents during genetic algorithm reproduction.
How deep it goes
Explains single-point, two-point, uniform, and arithmetic crossover, including offspring construction and encoding considerations.
Examples
Uses chromosome-slicing examples, a uniform-crossover exercise, and arithmetic operations on parent values.
What you can do after
Build single-point crossover from scratch using parent chromosome slices.

Read how Grokking AI Algorithms, Second Edition explains crossover →

Self-Improving Agents

Crossover is an evolutionary operation that combines material from two parent candidates to produce a child candidate.

How it is used
Combines complementary prompt rules during GEPA population search alongside reflected mutation and score-based selection.
How deep it goes
Defines two-parent prompt merging and follows scored children into artifact lineage, without specifying the model’s merge prompt.
Examples
Merges refund-rule and quarter-rule revenue prompts and shows a population spreading before it converges.
What you can do after
Build it from scratch as a scored prompt-population crossover step with recorded child lineage.

Read how Self-Improving Agents explains crossover →

Inside AI

Crossover is a genetic-algorithm operation that combines parts of two candidate solutions to create a new candidate.

How it is used
Optimizes complex allocation, routing, scheduling, and distribution problems within genetic algorithms.
How deep it goes
Explains crossover procedurally through selection, combination, mutation, repetition, and stopping conditions without implementation details.
Examples
Uses delivery routes, resource allocations, distribution plans, scheduling methods, and supply-chain costs as concrete examples.
What you can do after
Apply crossover within a genetic algorithm to combine promising candidate solutions during iterative optimization.

Read how Inside AI explains crossover →

Building LLM Applications with DSPy

Crossover is an optimization operation that combines parts or information from candidate solutions to produce a new candidate.

How it is used
Uses crossover to generate candidate prompts during prompt optimization.
How deep it goes
Explains candidate selection and evaluation, but does not specify how prompt content is merged.
Examples
Combines Prompts 1 and 2 to create Prompt 3, then evaluates it on validation examples.
What you can do after
Apply crossover by combining selected candidate prompts and evaluating the resulting prompt.

Read how Building LLM Applications with DSPy explains crossover →

Also covered in

What to know first

Related concepts

Questions about crossover

What is crossover?

Crossover is an evolutionary recombination technique that combines material from parent candidate solutions to produce one or more offspring.

Which Manning books explain crossover?

Optimization Algorithms: AI techniques for design, planning, and control problems, Advanced Algorithms and Data Structures, Evolutionary Deep Learning: Genetic algorithms and neural networks, Classic Computer Science Problems in Swift: Essential techniques for practicing programmers, Grokking AI Algorithms, Second Edition, Self-Improving Agents, Inside AI and Building LLM Applications with DSPy.

What should I know before learning crossover?

Manning books that teach crossover usually introduce chromosome, fitness, gene and generation first.

What is crossover also called?

Crossover is also called recombination.

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.