Showing 288 open source projects for "genetic algorithm java"

View related business solutions
  • AI-generated apps that pass security review Icon
    AI-generated apps that pass security review

    Stop waiting on engineering. Build production-ready internal tools with AI—on your company data, in your cloud.

    Retool lets you generate dashboards, admin panels, and workflows directly on your data. Type something like “Build me a revenue dashboard on my Stripe data” and get a working app with security, permissions, and compliance built in from day one. Whether on our cloud or self-hosted, create the internal software your team needs without compromising enterprise standards or control.
    Try Retool free
  • Custom VMs From 1 to 96 vCPUs With 99.95% Uptime Icon
    Custom VMs From 1 to 96 vCPUs With 99.95% Uptime

    General-purpose, compute-optimized, or GPU/TPU-accelerated. Built to your exact specs.

    Live migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
    Try Free
  • 1
    GFP- GAKNN
    GAKNN is a data mining software for gene annotation data. GAKNN is built with k- Nearest Neighbour algorithm optimized by the genetic algorithm. Gene annotation datasets saved under .csv or .arff formats with Gene Ontology or FunCat categorization can use GAKNN to predict gene functions.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 2

    Algorithm Database

    Efficient Algorithms implemented in Java

    The Aim of this project is to provide a collection of reusable Algorithms which can be used effectively in different scenarios. Algorithm implementations are in Java. Objective here is to implement algorithms which should be more efficient than the JDK implementation and also to create a platform for the researchers who works on Data Mining, Encryption algorithms, ect.. to collaborate and contribute to this project.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 3
    jMetal
    jMetal is an object-oriented Java-based framework for solving multi-objective optimization problems with metaheuristics.
    Downloads: 16 This Week
    Last Update:
    See Project
  • 4
    MicroGP

    MicroGP

    A multi-purpose extensible self-adaptive evolutionary algorithm

    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
    Downloads: 0 This Week
    Last Update:
    See Project
  • Go From AI Idea to AI App Fast Icon
    Go From AI Idea to AI App Fast

    One platform to build, fine-tune, and deploy ML models. No MLOps team required.

    Access Gemini 3 and 200+ models. Build chatbots, agents, or custom models with built-in monitoring and scaling.
    Try Free
  • 5
    Opt4J

    Opt4J

    Modular Java framework for meta-heuristic optimization

    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...
    Downloads: 3 This Week
    Last Update:
    See Project
  • 6
    Local Observations to Global Integration
    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).
    Downloads: 0 This Week
    Last Update:
    See Project
  • 7
    CCKDM

    CCKDM

    Concern Mining

    This is a tool for concern mining which uses a KDM model as input and the output is the same model with annotated concerns. It uses a Concern Library and a modified String Clustering K-means algorithm with Levenshtein metric to cluster the strings.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 8

    Java DSA extensions

    Java datastructures and algorithms extensions

    DSA extensions contains classes similar in purpose to the classes provided in java.util. Currently, it contains sortable Lists and Maps, as well as a balanced binary search tree and a binary array search algorithm.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 9
    Graphplan Implementations
    This project consists of various implementations of the Graphplan algorithm. At the moment we have two implementations of Graphplan: * Emplan - A C++ implementation for Linux, Windows and MacOS X * JavaGP - A Java implementation
    Downloads: 0 This Week
    Last Update:
    See Project
  • Full-stack observability with actually useful AI | Grafana Cloud Icon
    Full-stack observability with actually useful AI | Grafana Cloud

    Our generous forever free tier includes the full platform, including the AI Assistant, for 3 users with 10k metrics, 50GB logs, and 50GB traces.

    Built on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
    Create free account
  • 10

    serein

    A Framework to Model Metaheuristics

    Downloads: 0 This Week
    Last Update:
    See Project
  • 11

    Jafaran

    Fast and more random implementations of java.util.Random.

    ...Also provides an implementation of Ziggurat algorithm (based on J. A. Doornik paper, 2005), used by nextGaussian() methods of the provided implementations. Requires Java 5 or later. Also available on github since 2015/12/13: https://github.com/jeffhain/jafaran Principal classes: - Implementations using Mersenne-Twister algorithm (good pseudo-randomness): MTSyncRNG MTSeqRNG - Implementations using Marsaglia Xor-Shift (fast): MXSIntSeqRNG (32 bits) MXSLongSeqRNG (64 bits) (nextLong() faster, larger period) - Ziggurat: Random-based implementation of Ziggurat algorithm.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 12
    Animal-AV

    Animal-AV

    Animal Algorithm Animation System

    Animal is a Java-based system for visualizing and animating algorithms and data structures. Available since 1999, it is one of the established AV systems, and provides one of the largest collections of supported algorithms. Animations can be generated on the fly based on user input - for a large selection of algorithms and topic areas, including, but not limited to, the topic areas of backtracking algorithms, compression, cryptography, basing, searching and sorting.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 13
    Multidimensional optimization problems
    NEW OPTIMIZATION TECHNOLOGY & PLANNING EXPERIMENT. Technology is designed for multidimensional optimization practical problems with continuous object functions. Technology higher efficiency than traditional optimization methods.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 14
    Open Simplex Project

    Open Simplex Project

    A Simple GUI Implementation of the Simplex Algorithm

    Downloads: 0 This Week
    Last Update:
    See Project
  • 15
    A P2P overlay construction toolkit, which supports routing algorithm researchers in addition to application developers. It provides multiple routing (DHT) algorithms such as Chord, Kademlia, Koorde, Pastry and Tapestry, and a distributed environment emu
    Downloads: 1 This Week
    Last Update:
    See Project
  • 16
    TreeLayout

    TreeLayout

    Efficient and customizable TreeLayout Algorithm in Java, for NetBeans

    Efficiently create compact, highly customizable tree layouts - Based on Walker's algorithm with enhancements suggested by Buchheim, Jünger, and Leipert the software builds tree layouts in linear time. I.e. even trees with many nodes are built fast. Downloads are available at https://sourceforge.net/projects/treelayout/files/. For detailed documentation look at the TreeLayout web site http://treelayout.sourceforge.net/. Development for TreeLayout has moved to...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 17

    Java CoreWars Evolver

    A Java based, pMars compatible, CoreWars simulator with GA

    A Java based, pMars compatible, CoreWars simulator with Genetic Algorithm warrior evolver functionality. Java 8 is needed. See [Wiki:Tutorial]
    Downloads: 0 This Week
    Last Update:
    See Project
  • 18
    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
    Downloads: 23 This Week
    Last Update:
    See Project
  • 19
    Tetris Puzzle Solver

    Tetris Puzzle Solver

    Fills a rectangle using given tetris shapes

    Fills a rectangle using given tetris shapes (tetraminos) using an optimized brute force algorithm. A puzzle can have many different solutions; this solver will stop at the first one. Not all puzzles are solveable. Created to solve the annoying tetris puzzles in The Talos Principle and Sigils of Elohim.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 20
    MOEA Framework

    MOEA Framework

    A Free and Open Source Java Framework for Multiobjective Optimization

    The MOEA Framework is a free and open source Java library for developing and experimenting with multiobjective evolutionary algorithms (MOEAs) and other general-purpose multiobjective optimization algorithms. The MOEA Framework supports genetic algorithms, differential evolution, particle swarm optimization, genetic programming, grammatical evolution, and more. A number of algorithms are provided out-of-the-box, including NSGA-II, NSGA-III, ε-MOEA, GDE3 and MOEA/D. ...
    Downloads: 1 This Week
    Last Update:
    See Project
  • 21
    The project objective is the development of an optimization algorithm for the problem of stowing general cargo into platform supply vessels.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 22
    Neural Libs

    Neural Libs

    Neural network library for developers

    This project includes the implementation of a neural network MLP, RBF, SOM and Hopfield networks in several popular programming languages. The project also includes examples of the use of neural networks as function approximation and time series prediction. Includes a special program makes it easy to test neural network based on training data and the optimization of the network.
    Downloads: 2 This Week
    Last Update:
    See Project
  • 23
    Cyberphantom Alfa Colony
    This is an experimental project whose main objective is the creation of artificial intelligence (AI) new tipe. At the core of this idea is the use of special genetic algorithm that emulates the single-celled organism. The colony of such cybernetic organisms can give rise to a "reasonable" network that have a huge intellect and computing power.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 24

    Genetic Algorithms Engine - Blackjack

    A genetic algortihm engine that evolves blackjack basic strategy.

    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).
    Downloads: 0 This Week
    Last Update:
    See Project
  • 25

    deapheap

    Deap is a doubly heap for both min and max number access.

    A deap is a doubly priority queue for efficient data operations. Both insertion and deletion operations take O(log(N)) time. Access of min or max takes constant time. It can be useful when both min and max are needed in the queue. It can also be used in situations where the number of items is too large and items with low priorities can be dropped with keep memory footprint small.
    Downloads: 0 This Week
    Last Update:
    See Project
MongoDB Logo MongoDB