Gain insights into building genetic algorithm frameworks in Elixir. Learn about statistics, genealogy tracking, and solving practical problems with customizable genetic algorithm frameworks.

elixir.tar.gz

Default-elixir

Elixir-genetic

Elixir-genetic-v1

Elixir-genetic-v2

Elixir-breaker

Mix-command

Elixir-encode

Elixir-evaluate

Elixir-encode-speller

Elixir-evaluate-complete

Elixir-evaluate-v2

Elixir-evaluate-v3

Elixir-evaluate-portfolio

Elixir-selection

Elixir-generate

Elixir-generate-orderone

Elixir-selection-random

Elixir-selection-tournament

Elixir-selection-roulette

Elixir-generate-singlepoint

Elixir-generate-uniform

Elixir-generate-whole

Elixir-prematureconverge

Elixir-prematureconverge-complete

Elixir-prematureconverge-complete-nqueens

Elixir-replacing

Elixir-tiger

Elixir-tiger_nogene

Elixir-tiger_gene

Elixir-tiger_visualize-gui

Elixir-tiger_visualize-gui-two

Elixir-tetris

Elixir-benchee

Elixir-profiling

Elixir-pmap

Elixir-nifs

Elixir-testing

Elixir-testing-credo

Elixir-testing-dialyzer

Elixir-tiger_visualize-mtpaint

Elixir-tetris-copy

Elixir-agent-onemax

Elixir-testing-dialyzer-updated

Elixir-tiger_deps.get

Elixir-writing_deps

This course has been designed to introduce you to a field of programming you might have never been exposed to. In this course, you’ll learn everything you need to know to start working with genetic algorithms. As you work through the course, you’ll build a framework for problems using genetic algorithms. By the end, you’ll have a full-featured, customizable framework complete with statistics, genealogy tracking, and more, and you’ll have learned everything you need to solve practical problems with genetic algorithms.

Genetic Algorithms in Elixir

## Tournament selection introduction

Tournament selection is a strategy that pits chromosomes against one another in a tournament. While selections are still based on fitness, tournament selection introduces a strategy to choose parents that are both diverse and strong.

Tournament selection works like this:

1. Choose a pool of `n` chromosomes where `n` is the “tournament size.”

2. Choose the fittest chromosome from the tournament.
3. Repeat.

The image given below might help to visualize tournament selection a little better.

# Tournament selection introduction

Tournament selection is a strategy that pits chromosomes against one another in a tournament. While selections are still based on fitness, tournament selection introduces a strategy to choose parents that are both diverse and strong.

Tournament selection works like this:

1. Choose a pool of `n` chromosomes where `n` is the “tournament size.”

2. Choose the fittest chromosome from the tournament.
3. Repeat.

The image given below might help to visualize tournament selection a little better.

Learn about the implementation of tournament selection.

Tournament Selection

Introduction

Writing Your First Genetic Algorithm

Breaking Down Genetic Algorithms

Encoding Problems and Solutions

Evaluating Solutions and Populations

Selecting the Best

Generating New Solutions

Preventing Premature Convergence

Replacing and Transitioning

Tracking Genetic Algorithms

Visualizing the Results

Optimizing Your Algorithms

Writing Tests and Code Quality

Moving Forward

Tournament Selection

Tournament selection introduction