EO is a template-based, ANSI-C++ evolutionary computation library which helps you to write your own stochastic optimization algorithms insanely fast.
With the help of EO, you can easily design evolutionary algorithms that will find solutions to virtually all kind of hard optimization problems
... [More], from continuous to combinatorial ones.
Designing an algorithm with EO consists in choosing what components you want to use for your specific needs, just as building a structure with Lego blocks. [Less]
Java framework for applying optimization algorithms like Evolutionary Algorithms, Particle Swarm Optimizers, or Simulated Annealing to arbitrary optimization problems.
Geneva is a library written in C++ for performing parametric optimization in parallel on devices ranging from multi-processor machines over clusters to Grids and Cloud installations. Geneva currently supports Evolutionary Algorithms, Swarm Algorithms, Gradient Descents, a form of Simulated Annealing
... [More] as well as Parameter Scans. All algorithms act on the same data structures for the description of optimization problems, so that it becomes possible to "chain" different algorithms, making the result of one algorithm the input of another. [Less]
An object oriented library of an Genetic Algorithm, implemented in Java. Clear separation of the several concepts of the algorithm, e.g. Gene, Chromosome, Genotype, Phenotype, Population and Fitness Function. The fitness calculation is parallelized.
The MOEA Framework is an open source Java library for developing and experimenting with multiobjective evolutionary algorithms (MOEAs) and other general-purpose optimization algorithms and metaheuristics. A number of algorithms are provided out-of-the-box, including NSGA-II, ε-MOEA, GDE3 and MOEA/D.
... [More] In addition, third-party tools like JMetal and PISA directly integrate with the MOEA Framework.
The MOEA Framework targets an academic audience, providing the resources necessary to rapidly design, develop, execute and statistically test optimization algorithms. This includes over 40 test problems from the literature, and a suite of statistical tools for comparing and analyzing algorithm performance. [Less]
Meta-optimizing semantic evolutionary search (MOSES) is a new approach to program evolution, based on representation-building and probabilistic modeling. MOSES has been successfully applied to solve hard problems in domains such as computational biology, sentiment evaluation, and agent control.
... [More] Results tend to be more accurate, and require less objective function evaluations, in comparison to other program evolution systems. Best of all, the result of running MOSES is not a large nested structure or numerical vector, but a compact and comprehensible program written in a simple Lisp-like mini-language.
For more information see: http://metacog.org/doc.html.
Interested C++ developers, please drop in at #opencog on IRC.freenode.net. [Less]
This site uses cookies to give you the best possible experience.
By using the site, you consent to our use of cookies.
For more information, please see our
Privacy Policy