liveBook · Manning

Tournament selection

As explained in Advanced Algorithms and Data Structures

Tournament selection is a genetic-algorithm technique that randomly samples individuals and selects the one with the best fitness from the sample.

Tournament selection chooses individuals for mating by randomly sampling a subset of the population and selecting the sample member with the highest fitness. section 18.1.6

A tournament proceeds incrementally:

  • Return the retained individual for mating or further genetic-algorithm processing. section 18.1.6

0-1 knapsack

Applied to a 0-1 knapsack population, tournament selection compares randomly chosen candidate solutions and returns the highest-fitness candidate among them.

How Advanced Algorithms and Data Structures covers it

How deep it goes
Defines the sampling process and gives pseudocode, but does not develop a broader parameter or complexity analysis.
Examples
Uses a 0-1 knapsack population, a tournament-selection figure, and executable-style pseudocode.
What it assumes
Assumes a population with comparable fitness values and a genetic-algorithm selection context.
What you can do after
Apply tournament selection by implementing random sampling, fitness comparison, and best-candidate retention.
How it connects
Connects selection with genetic algorithms, fitness, mating, elitism, thresholding, and roulette wheel selection.

Also explained in

Compare how 4 books explain tournament selection →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Advanced Algorithms and Data Structures. The section links point to the parts of the book it draws on.