Search results for "dist:Algorithm-Evolutionary JMERELO"
tide_float.pl - Optimization of the tide function using A::E
A simple example of how to run an Evolutionary algorithm based on Algorithm::Evolutionary. Tries to find the max of the bidimensional Tide , and outputs the x and y coordinates, along with fitness. Best fitness is close to 1. Around 50 generations sh...
JMERELO/Algorithm-Evolutionary-0.82.1 - 29 Mar 2021 11:30:17 UTC
tide_bitstring.pl - Implementation of the Tide optimization using A::E
A simple example of how to run an Evolutionary algorithm based on Algorithm::Evolutionary. Tries to find the max of the bidimensional Tide , and outputs the x and y coordinates, along with fitness. Best fitness is close to 1. Around 50 generations sh...
JMERELO/Algorithm-Evolutionary-0.82.1 - 29 Mar 2021 11:30:17 UTC
rectangle-coverage.pl - Find the dot maximally covered by (random) rectangles
A demo that combines the Algorithm::Evolutionary::Op::Easy module with Tk to create a visual demo of the evolutionary algorithm. It generates randomly a number of rectangles, and shows how the population evolves to find the solution. The best point i...
JMERELO/Algorithm-Evolutionary-0.82.1 - 29 Mar 2021 11:30:17 UTC
Algorithm::Evolutionary::Wheel - Random selector of things depending on probabilities
Creates a "roulette wheel" for spinning and selecting stuff. It will be used in several places; mainly in the Algorithm::Evolutionary::Op::CanonicalGA. Take care that fitness must be non-zero positives; since if they aren't, roulette wheel won't work...
JMERELO/Algorithm-Evolutionary-0.82.1 - 29 Mar 2021 11:30:17 UTC
canonical-genetic-algorithm.pl - Canonical Genetic Algorithm on a simple fitness function
A canonical GA uses mutation, crossover, binary representation, and roulette wheel selection. Here mainly for reference, and so that you can peruse to start your own programs. In this case, we are optimizing the Royal Road function, <http://web.cecs....
JMERELO/Algorithm-Evolutionary-0.82.1 - 29 Mar 2021 11:30:17 UTC
Algorithm::Evolutionary::Hash_Wheel - Random selector of things depending on probabilities
Creates a "roulette wheel" for spinning and selecting stuff. It will be used in several places; mainly in the Algorithm::Evolutionary::Op::CanonicalGA. It's similar to Algorithm::Evolutionary::Wheel, but with a hash instead of an array. Probably shou...
JMERELO/Algorithm-Evolutionary-0.82.1 - 29 Mar 2021 11:30:17 UTC
Algorithm::Evolutionary::Op::Storing - Applies the op and keeps the result
Applies an operator and stores the result in a hash (can be a tied database), so that the whole population is stored. It creates an operator whose results are cached, which could be useful for expensive operators....
JMERELO/Algorithm-Evolutionary-0.82.1 - 29 Mar 2021 11:30:17 UTC
Algorithm::Evolutionary::Op::Easy_MO - Multiobjecttive evolutionary algorithm, single generation, with variable operators
"Easy" to use, single generation of an evolutionary algorithm. Takes an arrayref of operators as input, or defines bitflip-mutation and 2-point crossover as default. The "apply" method applies a single iteration of the algorithm to the population it ...
JMERELO/Algorithm-Evolutionary-0.82.1 - 29 Mar 2021 11:30:17 UTC
Algorithm::Evolutionary::Op::Creator - Operator that generates groups of individuals, of the intended class
Base class for operators applied to Individuals and Populations and all the rest...
JMERELO/Algorithm-Evolutionary-0.82.1 - 29 Mar 2021 11:30:17 UTC
Algorithm::Evolutionary::Op::Selector - Abstract base class for population selectors
Abstract base class for population selectors; defines a few instance variables and interface elements...
JMERELO/Algorithm-Evolutionary-0.82.1 - 29 Mar 2021 11:30:17 UTC
Algorithm::Evolutionary::Fitness::ECC - Error Correcting codes problem generator
Extracted from article "Effects of scale-free and small-world topologies on binary coded self-adaptive CEA", by Giacobini et al [Ga]. Quoting: " The ECC problem was presented in [MW]. We will consider a three-tuple (n, M, d), where n is the length of...
JMERELO/Algorithm-Evolutionary-0.82.1 - 29 Mar 2021 11:30:17 UTC
Algorithm::Evolutionary::Op::EDA_step - Single step for a Estimation of Distribution Algorithm
Estimation of Distribution Algorithms shun operators and instead try to model the distribution of "good" solutions in the population. This version corresponds to the most basic one....
JMERELO/Algorithm-Evolutionary-0.82.1 - 29 Mar 2021 11:30:17 UTC
Algorithm::Evolutionary::Op::QuadXOver - N-point crossover operator that changes operands
Crossover operator for a GA, takes args by reference and issues two children from two parents...
JMERELO/Algorithm-Evolutionary-0.82.1 - 29 Mar 2021 11:30:17 UTC
Algorithm::Evolutionary::Op::Inverover - Michalewicz's inver-over Operator.
Inver-over operator for a GA. Created by Michalewicz et al., mainly for the travelling salesman problem. Takes two chromosomes, which are permutations of each other. There is some information on this operator in this interview with Michalewicz: <http...
JMERELO/Algorithm-Evolutionary-0.82.1 - 29 Mar 2021 11:30:17 UTC
Algorithm::Evolutionary::Fitness::ZDT1 - Zitzler-Deb-Thiele #1 Multiobjective test function
Implementation of the first ZDT test function, found at "Comparison of Multiobjective Evolutionary Algorithms: Empirical Results" by Zitzler, Deb and Thiele...
JMERELO/Algorithm-Evolutionary-0.82.1 - 29 Mar 2021 11:30:17 UTC
Algorithm::Evolutionary::Op::Crossover - n-point crossover operator; puts fragments of the second operand into the first operand
Crossover operator for a Individuals of type Algorithm::Evolutionary::Individual::String and their descendants (Algorithm::Evolutionary::Individual::BitString). Crossover for Algorithm::Evolutionary::Individual::Vector would be Algorithm::Evolutionar...
JMERELO/Algorithm-Evolutionary-0.82.1 - 29 Mar 2021 11:30:17 UTC
Algorithm::Evolutionary::Op::DeltaTerm - Termination condition for an algorithm; checks that the difference of the best to a target is less than a delta
Termination condition for evolutionary algorithm loops; the "apply" method returns false when the first element in the array is as close to the target as the differente indicated....
JMERELO/Algorithm-Evolutionary-0.82.1 - 29 Mar 2021 11:30:17 UTC
Algorithm::Evolutionary::Op::StringRand - randomly change chars in a string
Mutation operator for a GA; changes a single element in a string by changing it to the next in the sequence deducted from the chromosome itself....
JMERELO/Algorithm-Evolutionary-0.82.1 - 29 Mar 2021 11:30:17 UTC
Algorithm::Evolutionary::Fitness::ONEMAX - Fitness function for the ONEMAX or count-ones problem
ONEMAX is the classical count-ones optimization function. Fast to implement, and good for early prototyping of new evolutionary algorithms....
JMERELO/Algorithm-Evolutionary-0.82.1 - 29 Mar 2021 11:30:17 UTC
Algorithm::Evolutionary::Op::Permutation - Per-mutation. Got it?
Class independent permutation operator; any individual that has the "_str" instance variable (like Algorithm::Evolutionary::Individual::String and Algorithm::Evolutionary::Individual::BitString) will have some of its elements swapped. Each string of ...
JMERELO/Algorithm-Evolutionary-0.82.1 - 29 Mar 2021 11:30:17 UTC