All Packages

Package Summary
Package
Description
Provides the classes for benchmark problems.
Provides the classes for the DTLZ benchmark.
Provides the classes for the knapsack benchmark.
Provides the classes for the LOTZ benchmark.
Provides the classes for the Queen Problem benchmark.
Provides the classes for the WFG (Walking Fish Group) benchmarks.
Provides the classes for the ZDT benchmarks.
Provides the classes that join the problem and optimizer.
Provides different implementations for the Archive.
Provides the classes for the IndividualCompleters.
Provides the classes for the data loggers.
Provides the classes for the random number generators.
Provides the classes for modules structure and configuration.
Provides the classes for the annotations for the modules.
Provides the classes for the configurator visualization (GUI).
Provides the classes for basic Genotypes.
Provides the classes for the optimizer.
Provides the classes for the optimization problem.
Provides the classes for the Opt4J configurator and starter.
Provides the classes for general (generic) operators.
Provides the classes for the algebra operator for genotypes.
Provides the classes for the copy operator for genotypes.
Provides the classes for the crossover operator for genotypes.
Provides the classes for the distance operator for genotypes.
Provides the classes for the mutate operator for genotypes.
Provides the classes for the neighbor operator for genotypes.
Provides the classes for the normalize operator for genotypes.
Provides the classes for a (Multi-Objective) Differential Evolution Algorithm.
Provides the classes for a (Multi-Objective) Evolutionary Algorithm (MOEA).
Package for the classes of the Adaptive ε-Sampling ε-Hood MOEA.
Provides the classes for the multi-objective particle swarm optimizer MOPSO.
Provides the classes for the random search optimization approach.
Provides classes for the simulated annealing optimization algorithm.
Provides classes for using a PB solver as Decoder.
Provides classes for solving (0-1) ILPs using the SAT4J package.
The tutorial provides three examples for user-defined problems, one example for an Optimizer implementation, and one example for a new Operator.
The helloworld example is a simple problem which shows the implementation of the Decoder, Evaluator and Creator interfaces which is the minimum requirement for own optimization problems.
The minones example is a simple problem which uses SAT decoding to hand infeasible individuals.
The operator example shows how to add own Operators for the modification of Genotypes.
The optimizer example shows the implementation of a simple optimizer which uses the Mutate operator.
The salesman example implements the Traveling Salesman Problem.
Provides the classes for the optimization visualization, i.e., the Viewer.