halfdan/elixir-genetic-algorithms
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

More changes

Browse Source
This commit is contained in:
Fabian Becker
2022-06-28 08:57:51 +02:00
parent 0b318ac0e4
commit e367229253
6 changed files with 129 additions and 20 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
lib/genetic.ex
View File

@@ -6,7 +6,7 @@ defmodule Genetic do
for _ <- 1..population_size, do: genotype.()
end
def evaluate(population, fitness_function, opts \\ []) do
def evaluate(population, fitness_function, _opts \\ []) do
population
|> Enum.map(
fn chromosome ->
@@ -18,13 +18,13 @@ defmodule Genetic do
|> Enum.sort_by(& &1.fitness, &>=/2)
end
def select(population, opts \\ []) do
def select(population, _opts \\ []) do
population
|> Enum.chunk_every(2)
|> Enum.map(&List.to_tuple(&1))
end
def crossover(population, opts \\ []) do
def crossover(population, _opts \\ []) do
population
|> Enum.reduce([],
fn {p1, p2}, acc ->
@@ -38,12 +38,12 @@ defmodule Genetic do
)
end
def mutation(population, opts \\ []) do
def mutation(population, _opts \\ []) do
population
|> Enum.map(
fn chromosome ->
if :rand.uniform() < 0.05 do
%Chromosome{chromosome | genes: Enum.shuffle(chromosome)}
%Chromosome{chromosome | genes: Enum.shuffle(chromosome.genes)}
else
chromosome
end
@@ -53,22 +53,24 @@ defmodule Genetic do
def run(problem, opts \\ []) do
population = initialize(&problem.genotype/0)
first_generation = 0
population
|> evolve(problem, opts)
|> evolve(problem, first_generation, opts)
end
def evolve(population, problem, opts \\ []) do
def evolve(population, problem, generation, opts \\ []) do
population = evaluate(population, &problem.fitness_function/1, opts)
best = hd(population)
IO.write("\rCurrent Best: #{best.fitness}")
if problem.terminate?(population) do
if problem.terminate?(population, generation) do
best
else
population
|> select(opts)
|> crossover(opts)
|> mutation(opts)
|> evolve(problem, opts)
|> evolve(problem, generation+1, opts)
end