Class BinaryNSGAII

java.lang.Object
org.uma.evolver.algorithm.base.nsgaii.BaseNSGAII<org.uma.jmetal.solution.binarysolution.BinarySolution>
org.uma.evolver.algorithm.base.nsgaii.BinaryNSGAII
All Implemented Interfaces:
BaseLevelAlgorithm<org.uma.jmetal.solution.binarysolution.BinarySolution>

public class BinaryNSGAII extends BaseNSGAII<org.uma.jmetal.solution.binarysolution.BinarySolution>
A configurable implementation of the Non-dominated Sorting Genetic Algorithm II (NSGA-II) specifically designed for binary-encoded optimization problems.

This class extends the base BaseNSGAII implementation to handle binary-encoded solutions, providing specialized support for binary-specific operations and parameters.

Key features include:

  • Support for binary-encoded solution spaces
  • Configurable genetic operators through the parameter space
  • Automatic handling of solution encoding/decoding
  • Integration with JMetal's binary problem interface

Example usage:


 // Create a binary problem instance
 BinaryProblem problem = new MyBinaryProblem();
 
 // Configure the algorithm
 int populationSize = 100;
 int maxEvaluations = 25000;
 ParameterSpace parameterSpace = new ParameterSpace();
 // Configure parameter space with desired operators and parameters
 
 // Create and run the algorithm
 BinaryNSGAII algorithm = new BinaryNSGAII(problem, populationSize, maxEvaluations, parameterSpace);
 algorithm.run();
 
 // Get results
 List<BinarySolution> population = algorithm.result();
 

The algorithm automatically configures non-configurable parameters such as the number of bits in the solution based on the problem definition. For binary problems, the total number of bits is automatically determined from the problem instance.

Since:
version
Author:
Your Name (your.email@example.com)
See Also: