Open Source C++ Genetic Algorithms - Page 2

This project is a prototype of evolutionary computation algorithms implementations for Android. We, Tom BERNARD and Ugo PICHE, were asked to do this project as part of our electronic & computer science in the Polytech'Paris-UPMC engineer school, in France. We wanted to thank Mario Zechner and all contributors behind the fabulous libGDX project (https://code.google.com/p/libgdx/) which allowed us to use Box2D and OpenGL ES more, more easily than without this API.

See the new project page: https://nojhan.github.io/paradiseo/ (Archived project page: http://eodev.sourceforge.net/)

Implement a scheduling algorithm to schedule classes at a university

A genetic algorithm framework to allow the evolution of synapse weights and topologies of artificial neural networks.

The C++ library Geneva allows to run large scale parametric optimization problems. It can run in serial or multi-threaded mode or in a networked environment. The library currently covers Evolutionary Strategies, Genetic Algorithms and mixed scenarios.

A generic implementation of STL containers and some STL algorithms. The main intent is no make this STL implementation to work with any kind of pointers defined by allocator classes, e.g. memory_mgr::offset_ptr.

This project is a genetic algorithm engine able to be reused for other projects with minimal additional programming. The genetic algorithm engine currently plays many blackjack hands for the fitness function and produces a result similar to blackjack basic strategy. To see it in action, download the zip file and run either: GABlackjack_Demo.exe     (quick)   or GABlackjack_Long.exe       (slow, but it achieves better results). The code was written in C++, using MS Visual Studio 6.0 and MS Visual Source Safe 6.0. The genetic algorithm engine supports various mutation rates, ranked parental selection, stochastic sampling parental selection, cyclic crossover, crossover at each gene, cloning the best individual each generation, and creating random individuals each generation. To use the genetic algorithm engine to search for a different problem's solution, one needs to program a fitness function, the project settings, and a few virtual functions.

GFP use Genetic Programming and LISP-like language for growing program.

GP@home is a new group/project dedicated to fully utilizing the combined concepts of genetic programming and distributed computing to improve the quality of life for all human beings. Nothing is impossible working together.

Genetic Programming Classifier is a distributed evolutionary data classification program. It uses the ensemble method implemented under a parallel co-evolutionary Genetic Programming technique.

Genetic Programming in OpenCL is a parallel implementation of genetic programming targeted at heterogeneous devices, such as CPU and GPU. It is written in OpenCL, an open standard for portable parallel programming across many computing platforms.

This project aims at providing a set of tools for solving the class of monodimensional packing problems (such as cutting stock, bin packing and knapsack problem) mainly using genetic algoritms.

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.

An heuristic image stitcher made to test Genetic and PSO based algorithms

Integer Singular Value Decomposition Genetic Algorithm Function Fitter. This is an optimization algorithm that performs a similar role to a neural network.

This is implementation of parallel genetic algorithm with "ring" insular topology. Algorithm provides a dynamic choice of genetic operators in the evolution of. The library supports the 26 genetic operators. This is cross-platform GA written in С++.

A Visual Studio .NET C++ application can perform machine learning using genetic algorithm, naive bayes, KNN, and Artificial Neural Networks (ANNs) read and processed from any standard ARFF.

Multiclass machine learning

Video and files download for Visual trading idea to C++ or FPGA HFT Meetup File download sample: test model (Matlab 2014b with Visual Studio 2013 C++ project generated) Powerpoint MATLAB SIMULINK http://quantlabs.net/blog/2015/04/video-and-files-download-for-visual-trading-idea-to-c-or-fpga-hft-meetup/

MicroGP (µGP, ugp) is a versatile optimizer able to outperform both human experts and conventional heuristics in finding the optimal solution of hard problems. It is an evolutionary algorithm since it mimics some principles of the Neo-Darwinian paradigm. ⚠️ A new version is available on https://github.com/squillero/microgp4

Generic System for Data Processing

Open Metaheuristic (oMetah) is a library aimed at the conception and the rigourous testing of metaheuristics (i.e. genetic algorithms, simulated annealing, ...). The code design is separated in components : algorithms, problems and a test report generator

[Open Artificial Intelligence Library]. This library main goal is to provide a tool box to those who want to use algorithm such as neural network or genetics Algorithm and all algorithms that are commonly within the Artificial Intelligence field.

High-throughput next generation sequencing (NGS) technology has quickly emerged as a powerful tool in many aspects of biomedical research. However, along with its rapid development, the data magnitude and analysis complexity for NGS far exceed the capacity and capability of traditional small-scale computing facilities, such as multithreading algorithms on standalone workstations. To address this issue, here we present a solution using the ever-increasing supply of processing power by massive parallel processing (MPP) systems.