Browse free open source Java Genetic Algorithms and projects below. Use the toggles on the left to filter open source Java Genetic Algorithms by OS, license, language, programming language, and project status.

  • $300 in Free Credit Towards Top Cloud Services Icon
    $300 in Free Credit Towards Top Cloud Services

    Build VMs, containers, AI, databases, storage—all in one place.

    Start your project in minutes. After credits run out, 20+ products include free monthly usage. Only pay when you're ready to scale.
    Get Started
  • AI-powered service management for IT and enterprise teams Icon
    AI-powered service management for IT and enterprise teams

    Enterprise-grade ITSM, for every business

    Give your IT, operations, and business teams the ability to deliver exceptional services—without the complexity. Maximize operational efficiency with refreshingly simple, AI-powered Freshservice.
    Try it Free
  • 1
    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: 17 This Week
    Last Update:
    See Project
  • 2
    This site hosts the source code for C++ version of the Broker for SBW, NOM module, advanced simulation suite, analysis applications and model editors.
    Leader badge
    Downloads: 23 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: 4 This Week
    Last Update:
    See Project
  • 4
    Java·Applied·Geodesy·3D

    Java·Applied·Geodesy·3D

    Least-Squares Adjustment Software for Geodetic Sciences

    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.
    Downloads: 7 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
  • 5
    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: 2 This Week
    Last Update:
    See Project
  • 6
    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 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.
    Downloads: 2 This Week
    Last Update:
    See Project
  • 7
    FJSP Software

    FJSP Software

    A Software for Flexible Job Shop Scheduling

    Flexible job shop scheduling problem (FJSP) is very important in many fields such as production management, resource allocation and combinatorial optimization. In the real manufacturing systems, each operation could be processed on more than one machine and each machine can also process several operations. This feature is known as flexibility. You can define your problem in this software and get an optimal solution as a Gantt Chart. This software is based on my M.Sc. thesis of Shahed university (Tehran, Iran).
    Downloads: 1 This Week
    Last Update:
    See Project
  • 8
    An attempt to design minimum cost broadband networks with the use of a modified version of the Particle Swarm Optimization method. A GIS subsystem is used for the visualization of data and results.
    Downloads: 1 This Week
    Last Update:
    See Project
  • 9
    JCLEC
    JCLEC is a general purpose evolutionary computation framework developed in Java. Some of its mains features are: multilevel architecture, highly reusable and integrable with other systems, easy to use and a lot of implemented algorithms and operation
    Downloads: 1 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
  • 10

    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: 1 This Week
    Last Update:
    See Project
  • 11
    a framework library with a template method interface and inheritable classes for an executable process design which produces an executable which is both a GUI and a console application. It provides multi-threading for work items of the provider process .
    Downloads: 0 This Week
    Last Update:
    See Project
  • 12
    a sandbox for trying my engine ideas
    Downloads: 0 This Week
    Last Update:
    See Project
  • 13
    Agenda desenvolvida em Java, utilizando banco PostGreSQL. Itens: Cadastro de Contatos Cadastro de Tarefas
    Downloads: 0 This Week
    Last Update:
    See Project
  • 14
    The Gene Expression Programming Framework in Java. It separates the process of evolution from the process of interpretation of the chromosome, allowing the use of various schemes in the chromosome.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 15
    The main goal of the Analytical Customer Relationship Management system is to improve services provided to customers, and to use customer contact information for targeted marketing.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 16
    Test of Artificial Life
    Downloads: 0 This Week
    Last Update:
    See Project
  • 17
    Awakener aims to provide a Java library for solving practical, real world optimisation problems by means of genetic algorithms (turnkey algorithms for >= 90% of industry problems). Awakener extends Sleepwalker with specific algorithms.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 18
    Beagle is Java open source framework for running and managing nondeterministic algorithms such as genetic algorithms for solving complex problems. Beagle is fully modular and maintains whole history of algorithm progress for further analysis.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 19
    Bin Packing with Genectic Algorithm

    Bin Packing with Genectic Algorithm

    Bin Packing problem solved using Genectic Algorithm

    This project contains a solution for a Bin Packing problem solved using Genectic Algorithms. The code in the project was created as a solution for a problem in a combinatorial optimization class at the Univeridade Federal do Rio Grande do Sul (UFRGS - Brasil) in 2007.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 20
    It moves by itself inside networks like virus infection & plagues, it is being written to solve computer virus problem drastically and responsibly. It is legal, free and open for public domain to improve W3 ICT Security.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 21
    Calamari is a collection of Java APIs for implementing genetic algorithms, neural networks, and vehicle simulation. It is still being designed and developed.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 22
    CILib is a framework for developing Computational Intelligence software in swarm intelligence, evolutionary computing, neural networks, artificial immune systems, fuzzy logic and robotics.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 23
    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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 24
    This chess program changes its strength to give the best match against you. Eventually it learns to beat you specifically through learning alogirthms. Features included transposition tables and a elementary 3-piece endgame tablebase.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 25

    EGA

    A novel and effictive GA algorithm to solve optimization problem

    Classical genetic algorithm suffers heavy pressure of fitness evaluation for time-consuming optimization problems. To address this problem, we present an efficient genetic algorithm by the combination with clustering methods. The high efficiency of the proposed method results from the fitness estimation and the schema discovery of partial individuals in current population and. Specifically, the clustering method used in this paper is affinity propagation. The numerical experiments demonstrate that the proposed method performs promisingly for well-known benchmark problems in the term of optimization accuracy.
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • 2
  • 3
  • 4
  • Next
MongoDB Logo MongoDB