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

# Including the mutation step

Despite initializing your population to a seemingly random distribution, eventually, the parents became too genetically similar to make any improvements during the crossover process. This illustrates the importance of including the mutation step in our algorithm and how vital exploration is to informed search techniques.

After the `crossover` function in the algorithm, add the following:

```
|> mutation.()
```

Now, the structure of the algorithm looks like this:

```
population
|> fitness.()
|> selection.()
|> crossover.()
|> mutation.()
|> algorithm.(algorithm)
```

Mutation is similar to the other functions in that it accepts a population as a parameter. 

> **Note:** We only want to mutate a small percentage of your population — this is to preserve the progress that has already been made. 

To incorporate mutation to our algorithm, add the following function below the crossover definition:

Get to know how to implement the mutation process. 

Adding Mutation to our Genetic Algorithm

Get to know how to implement the mutation process.

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

Adding Mutation to our Genetic Algorithm

Including the mutation step