Package org.moeaframework.problem.misc
Class Rendon
java.lang.Object
org.moeaframework.problem.AbstractProblem
org.moeaframework.problem.misc.Rendon
- All Implemented Interfaces:
- AutoCloseable,- Named,- Problem
The Rendon problem.
 
Properties:
- Connected Pareto set
- Convex Pareto front
References:
- Van Veldhuizen, D. A (1999). "Multiobjective Evolutionary Algorithms: Classifications, Analyses, and New Innovations." Air Force Institute of Technology, Ph.D. Thesis, Appendix B.
- Valenzuela-Rendon, M., et al. (1997). "A Non-Generational Genetic Algorithm for Multiobjective Optimization." Proceedings of the Seventh International Conference on Genetic Algorithms, pp. 658-665.
- 
Field SummaryFields inherited from class org.moeaframework.problem.AbstractProblemnumberOfConstraints, numberOfObjectives, numberOfVariables
- 
Constructor SummaryConstructors
- 
Method SummaryModifier and TypeMethodDescriptionvoidEvaluates the solution, updating the solution's objectives in place.Returns a new solution for this problem.Methods inherited from class org.moeaframework.problem.AbstractProblemclose, getNumberOfConstraints, getNumberOfObjectives, getNumberOfVariables
- 
Constructor Details- 
Rendonpublic Rendon()Constructs the Rendon problem.
 
- 
- 
Method Details- 
evaluateDescription copied from interface:ProblemEvaluates 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
 
- 
newSolutionDescription copied from interface:ProblemReturns 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
 
 
-