Class Belegundu

java.lang.Object
org.moeaframework.problem.AbstractProblem
org.moeaframework.problem.misc.Belegundu
All Implemented Interfaces:
AutoCloseable, Problem

public class Belegundu extends AbstractProblem
The Belegundu problem.

Properties:

  • Connected Pareto set
  • Connected Pareto front
  • Constrained

References:

  1. Belegundu, A. D., et al (1994). "Multi-Objective Optimization of Laminated Ceramic Composites Using Genetic Algorithms." Proceedings of the 5th AIAA/NASA/USAF/ISSMO Symposium on Multidisciplinary Analysis and Optimization, Washington, D.C., pp. 1015-1022.
  2. Van Veldhuizen, D. A (1999). "Multiobjective Evolutionary Algorithms: Classifications, Analyses, and New Innovations." Air Force Institute of Technology, Ph.D. Thesis, Appendix B.
  • Constructor Details

    • Belegundu

      public Belegundu()
      Constructs the Belegundu problem.
  • Method Details

    • evaluate

      public void evaluate(Solution solution)
      Description copied from interface: Problem
      Evaluates the solution, updating the solution's objectives in place. Algorithms must explicitly call this method when appropriate to evaluate new solutions or reevaluate modified solutions.
      Parameters:
      solution - the solution to be evaluated
    • newSolution

      public Solution newSolution()
      Description copied from interface: Problem
      Returns a new solution for this problem. Implementations must initialize the variables so that the valid range of values is defined, but typically leave the actual value at a default or undefined state.
      Returns:
      a new solution for this problem