Based on the introduction of Genetic Algorithms in the excellent book "Collective Intelligence" I have put together some python classes to extend the original concepts.
This library is a lightweight implementation of geneticalgorithm, contains the most popular types of chromosomes and the basic algorithms for selection, elitism, crossing and mutation.
Game Toolbox is a C# assembly designed to facilitate the creation of games and game prototypes. It contains no graphics code, does not depend on XNA, and is Mono-compatible. It provides implementations of A*, GOAP, a geneticalgorithm, and more.
Geneur is an Open Source scheduler for GRID. It is based on variation of genetic algorithms. Geneur uses backfill scheduling algorithm to create first genetic population.
Java API for implementing any kind of GeneticAlgorithm and Genetic Programming applications quickly and easily. Contains a wide range of ready-to-use GA and GP algorithms and operators to be plugged-in or extended. Includes Tutorials and Examples.
The Automatic Model Optimization Reference Implementation, AMORI, is a framework that integrates the modelling and the optimization processes by providing a plug-in interface for both. A geneticalgorithm and Markov simulations are currently implemented.
Deploy in 115+ regions with the modern database for every enterprise.
MongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
The Distributed Genetic Programming Framework is a scalable Java genetic programming environment. It comes with an optional specialization for evolving assembler-syntax algorithms. The evolution can be performed in parallel in any computer network.
PyLife is an implementation of the game of life algorithm featuring parallel programming. It uses MPI and python to achieve a consistent software architecture and reliably performance.
A flexible programming library for evolutionary computation. Steady-state, generational and island model genetic algorithms are supported, using Darwinian, Lamarckian or Baldwinian evolution. Includes support for multiprocessor and distributed systems.
A Java implementation of the NEAT algorithm as created by Kenneth O Stanley. Also provides a toolkit for further experiments to be created and can provide both local and distributed learning environments.
musicomp is a program which most important element is an evolutionary algorithm which uses data mining methods as a fitness function to generate monophone melodies.
Galileo is a library for developing custom distributed genetic algorithms developed in Python. It provides a robust set of objects that can be used directly or as the basis of derived objects. Its modularity makes it easy to extend the functionality. The
ga2 is a simple C++ library providing the necessary base classes to implement a geneticalgorithm in C++. It is based loosely on Goldberg's canonical GA, but with many modifications, improvements and additional features. Essentially feature-complete, and
The SBMLevolver is an evolutionary algorithm package that creates SBML models with user-specified properties and behaviour from a given set of building blocks. Applications lie in network reconstruction and synthetic biology.