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

# Looking at optimization techniques

One of the first general rules for optimizing code states: “You can’t optimize a bad algorithm.” The most significant performance gains in our code will often come from better algorithms. Efficient algorithms can make up for limitations in computing power.

> Note: A comprehensive introduction to data structure and algorithm design is outside of the scope of this course.

Instead, this lesson will cover some basic tips to increase the performance of the Elixir code. This is simply an overview and is not meant to be a comprehensive guide for writing fast Elixir.


## Reduce or map?

A basic optimization we can make when we don’t need to preserve the order of our lists is to replace `Enum.map/2` with `Enum.reduce/3`. The reason this works is that all of Elixir’s `Enum` functions are implemented using a reduce function. For example, in `crossover`, we could just as easily use `Enum.map/2` to apply crossover to every pair of parents in the population, like this:

Learn about the different optimization techniques and how lazy evaluation works.

Writing Fast Elixir

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

Writing Fast Elixir

Looking at optimization techniques