Open Source Genetic Algorithms

JGAP is a Genetic Algorithms and Genetic Programming package written in Java. It is designed to require minimum effort to use, but is also designed to be highly modular. JGAP features grid functionality and a lot of examples. Many unit tests included. Legal notice/Impressum: Klaus Meffert An der Struth 25 D-65510 Idstein sourceforge <at> klausmeffert.de

jMetal is an object-oriented Java-based framework for solving multi-objective optimization problems with metaheuristics.

The ASCO project aims to bring circuit optimization capabilities to existing SPICE simulators using a high-performance parallel differential evolution (DE) optimization algorithm. It supports Eldo, HSPICE, LTspice, Spectre, and Qucs.

La suite logicielle Monia est destinée à l'apprentissage de l'algorithmique en français. Elle permet de fabriquer un exécutable à partir d'un organigramme, en passant par un programme procédural écrit en pseudo-langage.

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 genetic algorithm, and more.

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

Genetic Algorithm File Fitter, GAFFitter for short, is a tool based on a genetic algorithm (GA) that tries to fit a collection of items, such as files/directories, into as few as possible volumes of a specific size (e.g. CDs or DVDs).

A univariate and multivariate analysis UI. This project is no longer under development. Please use as you wish.

JAG3D is no longer developed at source-forge, and has moved to GitHub. Please visit https://github.com/applied-geodesy/jag3d or https://software.applied-geodesy.org to get the latest version.

Sudoku Maker is a generator for Sudoku number puzzles. It uses a genetic algorithm internally, so it can serve as an introduction to genetic algorithms. The generated Sudokus are usually very hard to solve -- good for getting rid of a Sudoku addiction.

The source code has been migrated and is now hosted on Github: https://github.com/jenetics/jenetics Jenetics is an advanced Genetic Algorithm, Evolutionary Algorithm and Genetic Programming library, respectively, written in modern day Java. It is designed with a clear separation of the several algorithm concepts, e. g. Gene, Chromosome, Genotype, Phenotype, Population and fitness Function. Jenetics allows you to minimize or maximize the given fitness function without tweaking it. In contrast to other GA implementations, the library uses the concept of an evolution stream (EvolutionStream) for executing the evolution steps. Since the EvolutionStream implements the Java Stream interface, it works smoothly with the rest of the Java Stream API. Other repositories: - https://github.com/jenetics/jenetics Maven: - https://mvnrepository.com/artifact/io.jenetics

Critterding is a "Petri dish" universe in 3D that demonstrates evolving artificial life. Critters start out with completely random brains and bodies, but will automatically start evolving into something with much better survival skills.

OW.NET -- 1-Wire API port from Java (and J#) to C#. Use the Dallas 1-Wire and iButton chips with standard C# using a serial adapter (also CF.net) or the TMEX drivers on the Windows platform. No J# distribution installation required.

This sofware is designed to help different chess clubs to set up their own rating system. It uses USCF approximation formulas for rating calculations. Working example at newarkcc.vfutbole.ru

OpenDino is an open source Java platform for optimization, design of experiment and learning. It provides a graphical user interface (GUI) and a platform which simplifies integration of new algorithms as "Modules". Implemented Modules Evolutionary Algorithms: - CMA-ES - (1+1)-ES - Differential Evolution Deterministic optimization algorithm: - SIMPLEX Learning: - a simple Artificial Neural Net Optimization problems: - test functions - interface for executing other programs (solvers) - parallel execution of problems - distributed execution of problems via socket connection between computers Others: - data storage - data analyser and viewer

Gemi can be downloaded from the site (https://sites.google.com/site/haithamsobhy/software). Please, do not hesitate to contact Dr. Haitham Sobhy if you need help. Gemi, an automated, fast, and easy-to-use bioinformatics tool with a user-friendly interface to design primers and probes for polymerase chain reaction (PCR). Gemi accepts multiple aligned and long DNA and RNA sequences with degenerate nucleotide (non-A/C/G/T bases). Gemi can be used for quantitative, real-time and conventional PCR (qPCR, rt-PCR, etc.), and Sanger sequencing. Gemi can parse large dataset of sequences efficiently. Article: Gemi: PCR primers prediction from multiple alignments Comparative and functional genomics 2012;2012:783138 DOI: https://doi.org/10.1155/2012/783138 PMID: https://www.ncbi.nlm.nih.gov/pubmed/23316117 PMCID: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3535827/

Logi (Local Observations to Global Integration) transforms several local coordinate systems (composed of polar measurements) into a global spatial uniform network with respect to the Guide to the Expression of Uncertainty in Measurement (GUM).

Cutting Problem solved by Genetic algorithms. The goal is to cut a rectangular plate of material into more smaller rectangles. The cuts must be rectangular and guillotinable.

Evolutionary Structural Optimization Package (ESOP) consists of software for viewing, analyzing, and optimizing structures containing beam, truss, and membrane plate elements utilizing OpenGL and the Genetic Algorithm (GA). Created for use in M.S. theses

ECF is a framework intended for application of any type of evolutionary computation (GA/GP, DE, Clonalg, ES, PSO, ABC, GAn, local search...). It offers simplicity for the end-user (parameterless usage, tutorial) and customization for experienced EC practicioners.

This project is using genetics algorithms to complete scheduling tasks such as timetables for elementary / high schools etc. Currently NetBeans project with no GUI and simple HTML export.

GEP is an evolutionary algorithm for function finding. This framework is a powerful way of expressing and coding genetic-like structures and quickly finding solutions through evolution by common genetic operators.

JGAL is a Java Genetic Algorithms Library.

Opt4J is an open source Java-based framework for evolutionary computation. It contains a set of (multi-objective) optimization algorithms such as evolutionary algorithms (including SPEA2 and NSGA2), differential evolution, particle swarm optimization, and simulated annealing. The benchmarks that are included comprise ZDT, DTLZ, WFG, and the knapsack problem. The goal of Opt4J is to simplify the evolutionary optimization of user-defined problems as well as the implementation of arbitrary meta-heuristic optimization algorithms. For this purpose, Opt4J relies on a module-based implementation and offers a graphical user interface for the configuration as well as a visualization of the optimization process.

This site hosts the source code for C++ version of the Broker for SBW, NOM module, advanced simulation suite, analysis applications and model editors.