evosynth 0.1.0

data/lib/evosynth/evolvers/basic/population_hillclimber.rb

@@ -0,0 +1,69 @@
+#	Copyright (c) 2009, 2010 Yves Adler <yves.adler@googlemail.com>
+#
+#	Permission is hereby granted, free of charge, to any person
+#	obtaining a copy of this software and associated documentation
+#	files (the "Software"), to deal in the Software without
+#	restriction, including without limitation the rights to use,
+#	copy, modify, merge, publish, distribute, sublicense, and/or sell
+#	copies of the Software, and to permit persons to whom the
+#	Software is furnished to do so, subject to the following
+#	conditions:
+#
+#	The above copyright notice and this permission notice shall be
+#	included in all copies or substantial portions of the Software.
+#
+#	THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+#	EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
+#	OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+#	NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+#	HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+#	WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+#	FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
+#	OTHER DEALINGS IN THE SOFTWARE.
+
+
+module EvoSynth
+	module Evolvers
+
+		# POPULATIONSBASIERTES-BINÄRES-HILLCLIMBING (Weicker Page 65)
+
+		class PopulationHillclimber
+			include EvoSynth::Evolvers::Evolver
+
+			def initialize(profile)
+				init_profile :mutation, :population, :evaluator
+				use_profile profile
+
+				@population.each { |individual| @evaluator.calculate_and_set_initial_fitness(individual) }
+			end
+
+			def to_s
+				"population based hillclimber <mutation: #{@mutation}>"
+			end
+
+			def best_solution
+				@population.best
+			end
+
+			def worst_solution
+				@population.worst
+			end
+
+			def return_result
+				@population
+			end
+
+			def next_generation
+				@population.map! { |individual| mutate(individual) }
+			end
+
+			def mutate(individual)
+				child = @mutation.mutate(individual)
+				@evaluator.calculate_and_set_fitness(child)
+				child > individual ? child : individual
+			end
+
+		end
+
+	end
+end

data/lib/evosynth/evolvers/basic/steady_state_ga.rb

@@ -0,0 +1,85 @@
+#	Copyright (c) 2009, 2010 Yves Adler <yves.adler@googlemail.com>
+#
+#	Permission is hereby granted, free of charge, to any person
+#	obtaining a copy of this software and associated documentation
+#	files (the "Software"), to deal in the Software without
+#	restriction, including without limitation the rights to use,
+#	copy, modify, merge, publish, distribute, sublicense, and/or sell
+#	copies of the Software, and to permit persons to whom the
+#	Software is furnished to do so, subject to the following
+#	conditions:
+#
+#	The above copyright notice and this permission notice shall be
+#	included in all copies or substantial portions of the Software.
+#
+#	THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+#	EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
+#	OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+#	NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+#	HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+#	WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+#	FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
+#	OTHER DEALINGS IN THE SOFTWARE.
+
+
+module EvoSynth
+	module Evolvers
+
+		# STEADY-STATE-GA (Weicker Page 129)
+
+		class SteadyStateGA
+			include EvoSynth::Evolvers::Evolver
+
+			DEFAULT_SELECTION = EvoSynth::Selections::FitnessProportionalSelection.new
+			DEFAULT_RECOMBINATION = EvoSynth::Recombinations::OnePointCrossover.new
+			DEFAULT_RECOMBINATION_PROBABILITY = 0.75
+
+			def initialize(profile)
+				init_profile :population,
+				    :evaluator,
+				    :mutation,
+				    :parent_selection			=> DEFAULT_SELECTION,
+				    :recombination				=> DEFAULT_RECOMBINATION,
+				    :recombination_probability	=> DEFAULT_RECOMBINATION_PROBABILITY
+
+				use_profile profile
+
+				@population.each { |individual| @evaluator.calculate_and_set_initial_fitness(individual) }
+			end
+
+			def to_s
+				"steady-state genetic algoritm <mutation: #{@mutation}, parent selection: #{@parent_selection}, recombination: #{@recombination}>"
+			end
+
+			def best_solution
+				@population.best
+			end
+
+			def worst_solution
+				@population.worst
+			end
+
+			def return_result
+				@population
+			end
+
+			def next_generation
+				parents = @parent_selection.select(@population, 2)
+
+				if EvoSynth.rand < @recombination_probability
+					child = @recombination.recombine(parents[0], parents[1])[0]
+				else
+					child = parents[1]
+				end
+
+				child = @mutation.mutate(child)
+				@evaluator.calculate_and_set_fitness(child)
+
+				@population.remove(@population.worst)
+				@population.add(child)
+			end
+
+		end
+
+	end
+end

data/lib/evosynth/evolvers/coevolutionary/balanced_coevolutionary.rb

@@ -0,0 +1,125 @@
+#	Copyright (c) 2009, 2010 Yves Adler <yves.adler@googlemail.com>
+#
+#	Permission is hereby granted, free of charge, to any person
+#	obtaining a copy of this software and associated documentation
+#	files (the "Software"), to deal in the Software without
+#	restriction, including without limitation the rights to use,
+#	copy, modify, merge, publish, distribute, sublicense, and/or sell
+#	copies of the Software, and to permit persons to whom the
+#	Software is furnished to do so, subject to the following
+#	conditions:
+#
+#	The above copyright notice and this permission notice shall be
+#	included in all copies or substantial portions of the Software.
+#
+#	THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+#	EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
+#	OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+#	NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+#	HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+#	WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+#	FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
+#	OTHER DEALINGS IN THE SOFTWARE.
+
+
+module EvoSynth
+	module Evolvers
+
+		# based on "Coevolution, Memory and Balance" from Paredis, 1999
+		#
+		# evolves two populations (problems, solutions / predator, prey) in a balanced manner
+
+		class BalancedCoevolutionary
+			include EvoSynth::Evolvers::Evolver
+
+			attr_reader :solution_success
+
+			DEFAULT_PAIRING_RUNS = 20
+			DEFAULT_SELECTION = EvoSynth::Selections::FitnessProportionalSelection.new
+			DEFAULT_RECOMBINATION = EvoSynth::Recombinations::KPointCrossover.new(2)
+			DEFAULT_RECOMBINATION_PROBABILITY = 0.75
+
+			def initialize(profile)
+				init_profile :population,
+					:problems,
+				    :evaluator,
+					:mutation,
+				    :problem_mutation,
+					:recombination => DEFAULT_RECOMBINATION,
+				    :problem_recombination => DEFAULT_RECOMBINATION,
+					:parent_selection => DEFAULT_SELECTION,
+					:enviromental_selection => DEFAULT_SELECTION,
+					:pairing_runs => DEFAULT_PAIRING_RUNS
+
+				use_profile profile
+
+				# intialize fitnesses?! FIXME: find a better way to do this
+				solution = @parent_selection.select(@population, 1).first
+				@problems.each do |problem|
+					@evaluator.encounter(problem, solution)
+				end
+
+				problem = @parent_selection.select(@problems, 1).first
+				@population.each do |solution|
+					@evaluator.encounter(problem, solution)
+				end
+			end
+
+			def to_s
+				"C-M-B coevolutionary algorithm <mutation: #{@mutation}, recombination: #{@recombination}, parent selection: #{@parent_selection}, enviromental selection: #{@enviromental_selection}>"
+			end
+
+			def best_solution
+				@population.best
+			end
+
+			def worst_solution
+				@population.worst
+			end
+
+			def return_result
+				@population
+			end
+
+			def next_generation
+				problem_wins, solution_wins = 0, 0
+
+				@pairing_runs.times do
+					problem = @parent_selection.select(@problems, 1).first
+					solution = @parent_selection.select(@population, 1).first
+					winner = @evaluator.encounter(problem, solution)
+					winner == problem ? problem_wins += 1 : solution_wins += 1
+				end
+
+				@solution_success = solution_wins / @pairing_runs.to_f
+
+				if EvoSynth.rand < @solution_success
+					# select, recombine and mutate solution child
+					evolve_offspring(@population, @problems, @recombination,
+						@mutation) { |child, enemy| @evaluator.encounter(enemy, child, false, true) }
+				else
+					# select, recombine and mutate problem child
+					evolve_offspring(@problems, @population, @problem_recombination,
+						@problem_mutation) { |child, enemy| @evaluator.encounter(child, enemy, true, false) }
+				end				
+			end
+
+			private
+
+			def evolve_offspring(population, enemies, recombination, mutation)
+				parents = @parent_selection.select(population, 2)
+				child = recombination.recombine(parents[0], parents[1])[0] # only one offspring each generation!
+				child = mutation.mutate(child)
+
+				@pairing_runs.times do
+					enemy = @parent_selection.select(enemies, 1).first
+					yield child, enemy
+				end
+
+				population.add(child)
+				population.remove(population.worst)
+			end
+		end
+
+	end
+end

data/lib/evosynth/evolvers/coevolutionary/round_robin_coevolutionary.rb

@@ -0,0 +1,87 @@
+#	Copyright (c) 2009, 2010 Yves Adler <yves.adler@googlemail.com>
+#
+#	Permission is hereby granted, free of charge, to any person
+#	obtaining a copy of this software and associated documentation
+#	files (the "Software"), to deal in the Software without
+#	restriction, including without limitation the rights to use,
+#	copy, modify, merge, publish, distribute, sublicense, and/or sell
+#	copies of the Software, and to permit persons to whom the
+#	Software is furnished to do so, subject to the following
+#	conditions:
+#
+#	The above copyright notice and this permission notice shall be
+#	included in all copies or substantial portions of the Software.
+#
+#	THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+#	EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
+#	OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+#	NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+#	HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+#	WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+#	FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
+#	OTHER DEALINGS IN THE SOFTWARE.
+
+
+module EvoSynth
+	module Evolvers
+
+		# based on CCGA-1/2 (Mitchell A. Potter and Kenneth A. De Jong)
+
+		class RoundRobinCoevolutionary
+			include EvoSynth::Evolvers::Evolver
+
+			attr_reader :subevolvers
+
+			DEFAULT_SUBEVOLVERS_CREATOR = ->(profile) { evolver = EvoSynth::Evolvers::GeneticAlgorithm.new(profile);
+			                                             EvoSynth::Evolvers.add_weak_elistism(evolver); evolver }
+
+			def initialize(profile)
+				init_profile :populations,
+				    :subevolvers_creator => DEFAULT_SUBEVOLVERS_CREATOR
+
+				use_profile profile
+				initialize_sub_evolvers(profile)
+				@next_index = 0
+			end
+
+			def to_s
+				"cooperative coevolutionary algorithm"
+			end
+
+			def best_solution
+				best = []
+				@populations.each { |pop| best << pop.best }
+				best
+			end
+
+			def worst_solution
+				worst = []
+				@populations.each { |pop| worst << pop.worst }
+				worst
+			end
+
+			def return_result
+				@populations
+			end
+
+			def next_generation
+				@subevolvers[@next_index].next_generation
+				@next_index = (@next_index + 1) % @populations.size
+			end
+
+			private
+
+			def initialize_sub_evolvers(profile)
+				sub_profile = profile.clone
+
+				@subevolvers = []
+				@populations.each do |sub_population|
+					sub_profile.population = sub_population
+					@subevolvers << @subevolvers_creator.call(sub_profile)
+				end
+			end
+
+		end
+
+	end
+end

data/lib/evosynth/evolvers/elitism.rb

@@ -0,0 +1,108 @@
+#	Copyright (c) 2009, 2010 Yves Adler <yves.adler@googlemail.com>
+#
+#	Permission is hereby granted, free of charge, to any person
+#	obtaining a copy of this software and associated documentation
+#	files (the "Software"), to deal in the Software without
+#	restriction, including without limitation the rights to use,
+#	copy, modify, merge, publish, distribute, sublicense, and/or sell
+#	copies of the Software, and to permit persons to whom the
+#	Software is furnished to do so, subject to the following
+#	conditions:
+#
+#	The above copyright notice and this permission notice shall be
+#	included in all copies or substantial portions of the Software.
+#
+#	THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+#	EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
+#	OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+#	NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+#	HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+#	WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+#	FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
+#	OTHER DEALINGS IN THE SOFTWARE.
+
+
+module EvoSynth
+	module Evolvers
+
+		# FIXME: change these to use best solution or not?
+
+
+		# this function adds weak elistism to a evolver using instance_eval
+		#
+		# weak elitism: if fitness of childrens decreased, replace worst individual with best parent
+
+		def Evolvers.add_weak_elistism(evolver)
+			evolver.population rescue raise "Evolver not supported!"
+
+			evolver.instance_eval(%q{
+				alias :original_next_generation :next_generation
+				alias :original_to_s :to_s
+
+				def next_generation
+					best_individual = population.best
+
+					original_next_generation
+
+					if population.best < best_individual
+						population.remove(population.worst)
+						population.add(best_individual)
+					end
+				end
+
+				def to_s
+					"<< weak elitism >> " + original_to_s
+				end
+			})
+		end
+
+		# this function adds weak elistism to a evolver using instance_eval
+		#
+		# strong elitism: copy best n parents into offspring population (replace worst n childrens)
+		# 
+		# TODO: add some elegance to this code ;-)
+
+		def Evolvers.add_strong_elistism(evolver, n = 1)
+			evolver.population rescue raise "Evolver not supported!"
+
+			if (n == 1)
+				evolver.instance_eval("
+					alias :original_next_generation :next_generation
+					alias :original_to_s :to_s
+
+					def next_generation
+						best = population.best
+
+						original_next_generation
+
+						population.remove(population.worst)
+						population.add(best)
+					end
+
+					def to_s
+						'<< strong elitism >> ' + original_to_s
+					end
+				")
+			else
+				evolver.instance_eval("
+					alias :original_next_generation :next_generation
+					alias :original_to_s :to_s
+
+					def next_generation
+						best = population.best(#{n})
+
+						original_next_generation
+
+						worst = population.worst(#{n})
+						worst.each { |individual| population.remove(individual) }
+						best.each { |individual| population.add(individual) }
+					end
+
+					def to_s
+						'<< strong elitism >> ' + original_to_s
+					end
+				")
+			end
+		end
+	end
+end