Added generated serial version identifier.
This commit is contained in:
Andreas Dräger
parent
cde9129555
commit
65ce36b901
@ -24,38 +24,52 @@ import eva2.tools.math.RNG;
|
||||
import eva2.tools.math.Jama.Matrix;
|
||||
|
||||
/**
|
||||
* For a double valued problem, there are two main methods to implement: {@link #getProblemDimension()}
|
||||
* must return the problem dimension, while {@link #eval(double[])} is to evaluate a single double
|
||||
* vector into the result fitness vector.
|
||||
* For a double valued problem, there are two main methods to implement:
|
||||
* {@link #getProblemDimension()} must return the problem dimension, while
|
||||
* {@link #eval(double[])} is to evaluate a single double vector into the result
|
||||
* fitness vector.
|
||||
*
|
||||
* To define the problem range, you may use the default range parameter resulting in a symmetric
|
||||
* double range [-defaultRange,defaulRange] in all dimensions.
|
||||
* Or you may implement {@link #getRangeLowerBound(int)} and {@link #getRangeUpperBound(int)}
|
||||
* to define an arbitrary problem range. In that case, the default range parameter is not used.
|
||||
* To define the problem range, you may use the default range parameter
|
||||
* resulting in a symmetric double range [-defaultRange,defaulRange] in all
|
||||
* dimensions. Or you may implement {@link #getRangeLowerBound(int)} and
|
||||
* {@link #getRangeUpperBound(int)} to define an arbitrary problem range. In
|
||||
* that case, the default range parameter is not used.
|
||||
*
|
||||
* Anything you want to do before any optimization is started on the problem should go into
|
||||
* {@link #initProblem()}, but remember to call the super-method in your implementation. The
|
||||
* individual template will be initialized to an ESIndividualDoubleData by then.
|
||||
* Anything you want to do before any optimization is started on the problem
|
||||
* should go into {@link #initProblem()}, but remember to call the super-method
|
||||
* in your implementation. The individual template will be initialized to an
|
||||
* ESIndividualDoubleData by then.
|
||||
*
|
||||
* For the GUI, it is also convenient to implement the {@link #globalInfo()} and {@link #getName()}
|
||||
* methods to provide some distinctive information for the user.
|
||||
* For the GUI, it is also convenient to implement the {@link #globalInfo()} and
|
||||
* {@link #getName()} methods to provide some distinctive information for the
|
||||
* user.
|
||||
*
|
||||
*
|
||||
* @author mkron
|
||||
*
|
||||
*/
|
||||
public abstract class AbstractProblemDouble extends AbstractOptimizationProblem implements InterfaceProblemDouble, Interface2DBorderProblem/*, InterfaceParamControllable */{
|
||||
public abstract class AbstractProblemDouble extends AbstractOptimizationProblem
|
||||
implements InterfaceProblemDouble, Interface2DBorderProblem/*
|
||||
* ,
|
||||
* InterfaceParamControllable
|
||||
*/{
|
||||
/**
|
||||
* Generated serial version identifier.
|
||||
*/
|
||||
private static final long serialVersionUID = -3904130243174390134L;
|
||||
private double m_DefaultRange = 10;
|
||||
private double m_Noise = 0;
|
||||
private boolean doRotation = false; // should really be false by default
|
||||
private Matrix rotation;
|
||||
private Matrix rotation;
|
||||
|
||||
// PropertySelectableList<AbstractConstraint> constraintList = new PropertySelectableList<AbstractConstraint>(new AbstractConstraint[]{new GenericConstraint()});
|
||||
private AbstractConstraint[] constraintArray = new AbstractConstraint[]{new GenericConstraint()};
|
||||
private boolean withConstraints = false;
|
||||
// PropertySelectableList<AbstractConstraint> constraintList = new
|
||||
// PropertySelectableList<AbstractConstraint>(new AbstractConstraint[]{new
|
||||
// GenericConstraint()});
|
||||
private AbstractConstraint[] constraintArray = new AbstractConstraint[] { new GenericConstraint() };
|
||||
private boolean withConstraints = false;
|
||||
private transient boolean isShowing = false;
|
||||
private double rotAngle = 22.5; // for default rotation along every axis
|
||||
public static String rawFitKey="UnconstrainedFitnessValue";
|
||||
public static String rawFitKey = "UnconstrainedFitnessValue";
|
||||
|
||||
public AbstractProblemDouble() {
|
||||
initTemplate();
|
||||
@ -66,10 +80,14 @@ public abstract class AbstractProblemDouble extends AbstractOptimizationProblem
|
||||
}
|
||||
|
||||
protected void initTemplate() {
|
||||
if (m_Template == null) m_Template = new ESIndividualDoubleData();
|
||||
if (getProblemDimension() > 0) { // avoid evil case setting dim to 0 during object init
|
||||
((InterfaceDataTypeDouble)this.m_Template).setDoubleDataLength(getProblemDimension());
|
||||
((InterfaceDataTypeDouble)this.m_Template).SetDoubleRange(makeRange());
|
||||
if (m_Template == null)
|
||||
m_Template = new ESIndividualDoubleData();
|
||||
if (getProblemDimension() > 0) { // avoid evil case setting dim to 0
|
||||
// during object init
|
||||
((InterfaceDataTypeDouble) this.m_Template)
|
||||
.setDoubleDataLength(getProblemDimension());
|
||||
((InterfaceDataTypeDouble) this.m_Template)
|
||||
.SetDoubleRange(makeRange());
|
||||
}
|
||||
}
|
||||
|
||||
@ -81,104 +99,123 @@ public abstract class AbstractProblemDouble extends AbstractOptimizationProblem
|
||||
this.m_DefaultRange = o.m_DefaultRange;
|
||||
this.m_Noise = o.m_Noise;
|
||||
this.SetDefaultAccuracy(o.getDefaultAccuracy());
|
||||
if (o.m_Template != null) this.m_Template = (AbstractEAIndividual)o.m_Template.clone();
|
||||
if (o.constraintArray!=null) {
|
||||
this.constraintArray=o.constraintArray.clone();
|
||||
for (int i=0; i<constraintArray.length; i++) constraintArray[i]=(AbstractConstraint)o.constraintArray[i].clone();
|
||||
if (o.m_Template != null)
|
||||
this.m_Template = (AbstractEAIndividual) o.m_Template.clone();
|
||||
if (o.constraintArray != null) {
|
||||
this.constraintArray = o.constraintArray.clone();
|
||||
for (int i = 0; i < constraintArray.length; i++)
|
||||
constraintArray[i] = (AbstractConstraint) o.constraintArray[i]
|
||||
.clone();
|
||||
}
|
||||
this.withConstraints=o.withConstraints;
|
||||
this.withConstraints = o.withConstraints;
|
||||
this.doRotation = o.doRotation;
|
||||
this.rotation = (o.rotation==null) ? null : (Matrix)o.rotation.clone();
|
||||
this.rotation = (o.rotation == null) ? null : (Matrix) o.rotation
|
||||
.clone();
|
||||
this.rotAngle = o.rotAngle;
|
||||
}
|
||||
|
||||
/**
|
||||
* Retrieve and copy the double solution representation from an individual. This
|
||||
* may also perform a coding adaption. The result is stored as phenotype within
|
||||
* the evaluate method.
|
||||
* Retrieve and copy the double solution representation from an individual.
|
||||
* This may also perform a coding adaption. The result is stored as
|
||||
* phenotype within the evaluate method.
|
||||
*
|
||||
* @param individual
|
||||
* @return the double solution representation
|
||||
*/
|
||||
protected double[] getEvalArray(AbstractEAIndividual individual){
|
||||
double[] x = new double[((InterfaceDataTypeDouble) individual).getDoubleData().length];
|
||||
System.arraycopy(((InterfaceDataTypeDouble) individual).getDoubleData(), 0, x, 0, x.length);
|
||||
return x;
|
||||
protected double[] getEvalArray(AbstractEAIndividual individual) {
|
||||
double[] x = new double[((InterfaceDataTypeDouble) individual)
|
||||
.getDoubleData().length];
|
||||
System.arraycopy(
|
||||
((InterfaceDataTypeDouble) individual).getDoubleData(), 0, x,
|
||||
0, x.length);
|
||||
return x;
|
||||
}
|
||||
|
||||
/**
|
||||
* When implementing a double problem, inheriting classes should not override this method (or only
|
||||
* extend it) and do the fitness calculations in the method eval(double[]).
|
||||
* When implementing a double problem, inheriting classes should not
|
||||
* override this method (or only extend it) and do the fitness calculations
|
||||
* in the method eval(double[]).
|
||||
*
|
||||
* @see eval(double[] x)
|
||||
*/
|
||||
public void evaluate(AbstractEAIndividual individual) {
|
||||
double[] x;
|
||||
double[] fitness;
|
||||
double[] x;
|
||||
double[] fitness;
|
||||
|
||||
x = getEvalArray(individual);
|
||||
((InterfaceDataTypeDouble)individual).SetDoublePhenotype(x);
|
||||
// evaluate the vector
|
||||
fitness = this.eval(x);
|
||||
// if indicated, add Gaussian noise
|
||||
if (m_Noise != 0) RNG.addNoise(fitness, m_Noise);
|
||||
// set the fitness
|
||||
setEvalFitness(individual, x, fitness);
|
||||
if (isWithConstraints()) {
|
||||
individual.putData(rawFitKey, individual.getFitness().clone());
|
||||
addConstraints(individual, x);
|
||||
}
|
||||
x = getEvalArray(individual);
|
||||
((InterfaceDataTypeDouble) individual).SetDoublePhenotype(x);
|
||||
// evaluate the vector
|
||||
fitness = this.eval(x);
|
||||
// if indicated, add Gaussian noise
|
||||
if (m_Noise != 0)
|
||||
RNG.addNoise(fitness, m_Noise);
|
||||
// set the fitness
|
||||
setEvalFitness(individual, x, fitness);
|
||||
if (isWithConstraints()) {
|
||||
individual.putData(rawFitKey, individual.getFitness().clone());
|
||||
addConstraints(individual, x);
|
||||
}
|
||||
}
|
||||
|
||||
protected double[] rotateMaybe(double[] x) {
|
||||
if (isDoRotation()) {
|
||||
if (rotation==null) initProblem();
|
||||
x = Mathematics.rotate(x, rotation);
|
||||
}
|
||||
if (rotation == null)
|
||||
initProblem();
|
||||
x = Mathematics.rotate(x, rotation);
|
||||
}
|
||||
return x;
|
||||
}
|
||||
|
||||
protected double[] inverseRotateMaybe(double[] x) {
|
||||
if (isDoRotation()) {
|
||||
if (rotation==null) initProblem();
|
||||
x = Mathematics.rotate(x, rotation.inverse());
|
||||
}
|
||||
if (rotation == null)
|
||||
initProblem();
|
||||
x = Mathematics.rotate(x, rotation.inverse());
|
||||
}
|
||||
return x;
|
||||
}
|
||||
|
||||
/**
|
||||
* Add all constraint violations to the individual. Expect that the fitness has already been set.
|
||||
* Add all constraint violations to the individual. Expect that the fitness
|
||||
* has already been set.
|
||||
*
|
||||
* @param individual
|
||||
* @param indyPos may contain the decoded individual position
|
||||
* @param indyPos
|
||||
* may contain the decoded individual position
|
||||
*/
|
||||
protected void addConstraints(AbstractEAIndividual individual, double[] indyPos) {
|
||||
protected void addConstraints(AbstractEAIndividual individual,
|
||||
double[] indyPos) {
|
||||
AbstractConstraint[] cnstr = getConstraints();
|
||||
for (int i=0; i<cnstr.length; i++) {
|
||||
// String name= (String)BeanInspector.callIfAvailable(cnstr[i], "getName", new Object[]{});
|
||||
// System.out.println("checking constraint " + (name==null ? cnstr[i].getClass().getSimpleName() : name));
|
||||
((AbstractConstraint)cnstr[i]).addViolation(individual, indyPos);
|
||||
for (int i = 0; i < cnstr.length; i++) {
|
||||
// String name= (String)BeanInspector.callIfAvailable(cnstr[i],
|
||||
// "getName", new Object[]{});
|
||||
// System.out.println("checking constraint " + (name==null ?
|
||||
// cnstr[i].getClass().getSimpleName() : name));
|
||||
((AbstractConstraint) cnstr[i]).addViolation(individual, indyPos);
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* Write a fitness value back to an individual. May be overridden to add constraints.
|
||||
* Write a fitness value back to an individual. May be overridden to add
|
||||
* constraints.
|
||||
*
|
||||
* @param individual
|
||||
* @param x
|
||||
* @param fit
|
||||
*/
|
||||
protected void setEvalFitness(AbstractEAIndividual individual, double[] x, double[] fit) {
|
||||
protected void setEvalFitness(AbstractEAIndividual individual, double[] x,
|
||||
double[] fit) {
|
||||
individual.SetFitness(fit);
|
||||
}
|
||||
|
||||
/**
|
||||
* Evaluate a double vector, representing the target function.
|
||||
* If you implement this, you should take care of the offsets and rotation,
|
||||
* e.g. by using x=rotateMaybe(x) before further evaluation.
|
||||
* Evaluate a double vector, representing the target function. If you
|
||||
* implement this, you should take care of the offsets and rotation, e.g. by
|
||||
* using x=rotateMaybe(x) before further evaluation.
|
||||
*
|
||||
* @param x the vector to evaluate
|
||||
* @return the target function value
|
||||
* @param x
|
||||
* the vector to evaluate
|
||||
* @return the target function value
|
||||
*/
|
||||
public abstract double[] eval(double[] x);
|
||||
|
||||
@ -191,119 +228,135 @@ public abstract class AbstractProblemDouble extends AbstractOptimizationProblem
|
||||
|
||||
@Override
|
||||
public void initPopulation(Population population) {
|
||||
initTemplate();
|
||||
AbstractOptimizationProblem.defaultInitPopulation(population, m_Template, this);
|
||||
initTemplate();
|
||||
AbstractOptimizationProblem.defaultInitPopulation(population,
|
||||
m_Template, this);
|
||||
}
|
||||
|
||||
/**
|
||||
* Create a new range array by using the getRangeLowerBound and getRangeUpperBound methods.
|
||||
* Create a new range array by using the getRangeLowerBound and
|
||||
* getRangeUpperBound methods.
|
||||
*
|
||||
* @return a range array
|
||||
*/
|
||||
public double[][] makeRange() {
|
||||
double[][] range = new double[this.getProblemDimension()][2];
|
||||
for (int i = 0; i < range.length; i++) {
|
||||
range[i][0] = getRangeLowerBound(i);
|
||||
range[i][1] = getRangeUpperBound(i);
|
||||
}
|
||||
return range;
|
||||
}
|
||||
public double[][] makeRange() {
|
||||
double[][] range = new double[this.getProblemDimension()][2];
|
||||
for (int i = 0; i < range.length; i++) {
|
||||
range[i][0] = getRangeLowerBound(i);
|
||||
range[i][1] = getRangeUpperBound(i);
|
||||
}
|
||||
return range;
|
||||
}
|
||||
|
||||
/**
|
||||
* Get the lower bound of the double range in the given dimension. Override
|
||||
* this to implement non-symmetric ranges. Use setDefaultRange for symmetric ranges.
|
||||
*
|
||||
* @see makeRange()
|
||||
* @see getRangeUpperBound(int dim)
|
||||
* @param dim
|
||||
* @return the lower bound of the double range in the given dimension
|
||||
*/
|
||||
public double getRangeLowerBound(int dim) {
|
||||
return -getDefaultRange();
|
||||
}
|
||||
/**
|
||||
* Get the lower bound of the double range in the given dimension. Override
|
||||
* this to implement non-symmetric ranges. Use setDefaultRange for symmetric
|
||||
* ranges.
|
||||
*
|
||||
* @see makeRange()
|
||||
* @see getRangeUpperBound(int dim)
|
||||
* @param dim
|
||||
* @return the lower bound of the double range in the given dimension
|
||||
*/
|
||||
public double getRangeLowerBound(int dim) {
|
||||
return -getDefaultRange();
|
||||
}
|
||||
|
||||
/**
|
||||
* Get the upper bound of the double range in the given dimension. Override
|
||||
* this to implement non-symmetric ranges. User setDefaultRange for symmetric ranges.
|
||||
*
|
||||
* @see makeRange()
|
||||
* @see getRangeLowerBound(int dim)
|
||||
* @param dim
|
||||
* @return the upper bound of the double range in the given dimension
|
||||
*/
|
||||
public double getRangeUpperBound(int dim) {
|
||||
return getDefaultRange();
|
||||
}
|
||||
/**
|
||||
* Get the upper bound of the double range in the given dimension. Override
|
||||
* this to implement non-symmetric ranges. User setDefaultRange for
|
||||
* symmetric ranges.
|
||||
*
|
||||
* @see makeRange()
|
||||
* @see getRangeLowerBound(int dim)
|
||||
* @param dim
|
||||
* @return the upper bound of the double range in the given dimension
|
||||
*/
|
||||
public double getRangeUpperBound(int dim) {
|
||||
return getDefaultRange();
|
||||
}
|
||||
|
||||
@Override
|
||||
public void initProblem() {
|
||||
initTemplate();
|
||||
if (isDoRotation()) {
|
||||
rotation = initDefaultRotationMatrix(rotAngle , getProblemDimension());
|
||||
} else rotation = null;
|
||||
if (isDoRotation()) {
|
||||
rotation = initDefaultRotationMatrix(rotAngle,
|
||||
getProblemDimension());
|
||||
} else
|
||||
rotation = null;
|
||||
}
|
||||
|
||||
/**
|
||||
* Initialize rotation matrix which rotates around the given angle in every axis.
|
||||
* Initialize rotation matrix which rotates around the given angle in every
|
||||
* axis.
|
||||
*
|
||||
* @param rotAngle
|
||||
* @param dim
|
||||
* @return
|
||||
*/
|
||||
public static Matrix initDefaultRotationMatrix(double rotAngle, int dim) {
|
||||
Matrix rotation=null;
|
||||
// Matrix vec = new Matrix(dim, 1);
|
||||
// for (int i=0; i<dim; i++) vec.set(i,0, i+1);
|
||||
// System.out.println(BeanInspector.toString(eval(vec.getColumnPackedCopy())));
|
||||
// rotation = new Matrix(dim, dim);
|
||||
// rotation = Mathematics.getRotationMatrix(vec).transpose();
|
||||
rotation = Mathematics.getRotationMatrix((rotAngle*Math.PI/180.), dim).transpose();
|
||||
//double[] t= new double[dim]; Arrays.fill(t, 1.);
|
||||
//System.out.println(BeanInspector.toString(rotation.times(t)));
|
||||
Matrix rotation = null;
|
||||
// Matrix vec = new Matrix(dim, 1);
|
||||
// for (int i=0; i<dim; i++) vec.set(i,0, i+1);
|
||||
// System.out.println(BeanInspector.toString(eval(vec.getColumnPackedCopy())));
|
||||
// rotation = new Matrix(dim, dim);
|
||||
// rotation = Mathematics.getRotationMatrix(vec).transpose();
|
||||
rotation = Mathematics.getRotationMatrix((rotAngle * Math.PI / 180.),
|
||||
dim).transpose();
|
||||
// double[] t= new double[dim]; Arrays.fill(t, 1.);
|
||||
// System.out.println(BeanInspector.toString(rotation.times(t)));
|
||||
return rotation;
|
||||
}
|
||||
|
||||
/**
|
||||
* This method allows you to choose how much noise is to be added to the
|
||||
* fitness. This can be used to make the optimization problem more difficult.
|
||||
* @param noise The sigma for a gaussian random number.
|
||||
*/
|
||||
public void setNoise(double noise) {
|
||||
if (noise < 0) noise = 0;
|
||||
this.m_Noise = noise;
|
||||
}
|
||||
/**
|
||||
* Get the current noise level.
|
||||
* @return the current noise level
|
||||
*/
|
||||
public double getNoise() {
|
||||
return this.m_Noise;
|
||||
}
|
||||
public String noiseTipText() {
|
||||
return "Gaussian noise level on the fitness value.";
|
||||
}
|
||||
/**
|
||||
* This method allows you to choose how much noise is to be added to the
|
||||
* fitness. This can be used to make the optimization problem more
|
||||
* difficult.
|
||||
*
|
||||
* @param noise
|
||||
* The sigma for a gaussian random number.
|
||||
*/
|
||||
public void setNoise(double noise) {
|
||||
if (noise < 0)
|
||||
noise = 0;
|
||||
this.m_Noise = noise;
|
||||
}
|
||||
|
||||
/**
|
||||
* This method allows you to choose the EA individual used by the problem.
|
||||
*
|
||||
* @param indy The EAIndividual type
|
||||
*/
|
||||
public void setEAIndividual(InterfaceDataTypeDouble indy) {
|
||||
this.m_Template = (AbstractEAIndividual)indy;
|
||||
}
|
||||
/**
|
||||
* Get the current noise level.
|
||||
*
|
||||
* @return the current noise level
|
||||
*/
|
||||
public double getNoise() {
|
||||
return this.m_Noise;
|
||||
}
|
||||
|
||||
/**
|
||||
* Get the EA individual template currently used by the problem.
|
||||
*
|
||||
* @return the EA individual template currently used
|
||||
*/
|
||||
public InterfaceDataTypeDouble getEAIndividual() {
|
||||
return (InterfaceDataTypeDouble)this.m_Template;
|
||||
}
|
||||
public String noiseTipText() {
|
||||
return "Gaussian noise level on the fitness value.";
|
||||
}
|
||||
|
||||
public String EAIndividualTipText() {
|
||||
return "Set the base individual type defining the data representation and mutation/crossover operators";
|
||||
}
|
||||
/**
|
||||
* This method allows you to choose the EA individual used by the problem.
|
||||
*
|
||||
* @param indy
|
||||
* The EAIndividual type
|
||||
*/
|
||||
public void setEAIndividual(InterfaceDataTypeDouble indy) {
|
||||
this.m_Template = (AbstractEAIndividual) indy;
|
||||
}
|
||||
|
||||
/**
|
||||
* Get the EA individual template currently used by the problem.
|
||||
*
|
||||
* @return the EA individual template currently used
|
||||
*/
|
||||
public InterfaceDataTypeDouble getEAIndividual() {
|
||||
return (InterfaceDataTypeDouble) this.m_Template;
|
||||
}
|
||||
|
||||
public String EAIndividualTipText() {
|
||||
return "Set the base individual type defining the data representation and mutation/crossover operators";
|
||||
}
|
||||
|
||||
/**
|
||||
* A (symmetric) absolute range limit.
|
||||
@ -313,6 +366,7 @@ public abstract class AbstractProblemDouble extends AbstractOptimizationProblem
|
||||
public double getDefaultRange() {
|
||||
return m_DefaultRange;
|
||||
}
|
||||
|
||||
/**
|
||||
* Set a (symmetric) absolute range limit.
|
||||
*
|
||||
@ -322,64 +376,73 @@ public abstract class AbstractProblemDouble extends AbstractOptimizationProblem
|
||||
this.m_DefaultRange = defaultRange;
|
||||
initTemplate();
|
||||
}
|
||||
|
||||
public String defaultRangeTipText() {
|
||||
return "Absolute limit for the symmetric range in any dimension";
|
||||
}
|
||||
|
||||
public void setDoRotation(boolean doRotation) {
|
||||
this.doRotation = doRotation;
|
||||
if (!doRotation) rotation=null;
|
||||
if (!doRotation)
|
||||
rotation = null;
|
||||
}
|
||||
|
||||
public boolean isDoRotation() {
|
||||
return doRotation;
|
||||
}
|
||||
|
||||
public String doRotationTipText() {
|
||||
return "If marked, the function is rotated by 22.5 degrees along every axis.";
|
||||
}
|
||||
/**********************************************************************************************************************
|
||||
* These are for InterfaceParamControllable
|
||||
*/
|
||||
|
||||
/**********************************************************************************************************************
|
||||
* These are for InterfaceParamControllable
|
||||
*/
|
||||
public Object[] getParamControl() {
|
||||
if (isWithConstraints()) {
|
||||
return constraintArray;
|
||||
// return constraintList.getObjects();
|
||||
} else return null;
|
||||
// return constraintList.getObjects();
|
||||
} else
|
||||
return null;
|
||||
}
|
||||
/**********************************************************************************************************************
|
||||
* These are for Interface2DBorderProblem
|
||||
*/
|
||||
public double[][] get2DBorder() {
|
||||
return makeRange();
|
||||
}
|
||||
|
||||
public double[] project2DPoint(double[] point) {
|
||||
return Mathematics.expandVector(point, getProblemDimension(), 0.);
|
||||
}
|
||||
/**********************************************************************************************************************
|
||||
* These are for Interface2DBorderProblem
|
||||
*/
|
||||
public double[][] get2DBorder() {
|
||||
return makeRange();
|
||||
}
|
||||
|
||||
public double[] project2DPoint(double[] point) {
|
||||
return Mathematics.expandVector(point, getProblemDimension(), 0.);
|
||||
}
|
||||
|
||||
public double functionValue(double[] point) {
|
||||
double[] x=project2DPoint(point);
|
||||
double[] x = project2DPoint(point);
|
||||
double v = eval(x)[0];
|
||||
return v;
|
||||
}
|
||||
|
||||
/**
|
||||
* Add a position as a known optimum to a list of optima. This method evaluates the fitness
|
||||
* and applies inverse rotation if necessary.
|
||||
* Add a position as a known optimum to a list of optima. This method
|
||||
* evaluates the fitness and applies inverse rotation if necessary.
|
||||
*
|
||||
* @param optimas
|
||||
* @param prob
|
||||
* @param pos
|
||||
*/
|
||||
public static void addUnrotatedOptimum(Population optimas, AbstractProblemDouble prob, double[] pos) {
|
||||
public static void addUnrotatedOptimum(Population optimas,
|
||||
AbstractProblemDouble prob, double[] pos) {
|
||||
InterfaceDataTypeDouble tmpIndy;
|
||||
tmpIndy = (InterfaceDataTypeDouble)prob.getIndividualTemplate().clone();
|
||||
tmpIndy = (InterfaceDataTypeDouble) prob.getIndividualTemplate()
|
||||
.clone();
|
||||
tmpIndy.SetDoubleGenotype(pos);
|
||||
if (prob.isDoRotation()) {
|
||||
pos = prob.inverseRotateMaybe(pos); // theres an inverse rotation required
|
||||
pos = prob.inverseRotateMaybe(pos); // theres an inverse rotation
|
||||
// required
|
||||
tmpIndy.SetDoubleGenotype(pos);
|
||||
}
|
||||
((AbstractEAIndividual)tmpIndy).SetFitness(prob.eval(pos));
|
||||
((AbstractEAIndividual) tmpIndy).SetFitness(prob.eval(pos));
|
||||
if (!Mathematics.isInRange(pos, prob.makeRange())) {
|
||||
System.err.println("Warning, add optimum which is out of range!");
|
||||
}
|
||||
@ -388,36 +451,43 @@ public abstract class AbstractProblemDouble extends AbstractOptimizationProblem
|
||||
|
||||
/**
|
||||
* Refine a potential solution using Nelder-Mead-Simplex.
|
||||
*
|
||||
* @param prob
|
||||
* @param pos
|
||||
* @return
|
||||
*/
|
||||
public static double[] refineSolutionNMS(AbstractProblemDouble prob, double[] pos) {
|
||||
public static double[] refineSolutionNMS(AbstractProblemDouble prob,
|
||||
double[] pos) {
|
||||
Population pop = new Population();
|
||||
InterfaceDataTypeDouble tmpIndy;
|
||||
tmpIndy = (InterfaceDataTypeDouble)prob.getIndividualTemplate().clone();
|
||||
tmpIndy = (InterfaceDataTypeDouble) prob.getIndividualTemplate()
|
||||
.clone();
|
||||
tmpIndy.SetDoubleGenotype(pos);
|
||||
((AbstractEAIndividual)tmpIndy).SetFitness(prob.eval(pos));
|
||||
((AbstractEAIndividual) tmpIndy).SetFitness(prob.eval(pos));
|
||||
pop.add(tmpIndy);
|
||||
FitnessConvergenceTerminator convTerm = new FitnessConvergenceTerminator(1e-25, 10, StagnationTypeEnum.generationBased, ChangeTypeEnum.absoluteChange, DirectionTypeEnum.decrease);
|
||||
int calls = PostProcess.processSingleCandidatesNMCMA(PostProcessMethod.nelderMead, pop, convTerm, 0.001, prob);
|
||||
return ((InterfaceDataTypeDouble)pop.getBestEAIndividual()).getDoubleData();
|
||||
FitnessConvergenceTerminator convTerm = new FitnessConvergenceTerminator(
|
||||
1e-25, 10, StagnationTypeEnum.generationBased,
|
||||
ChangeTypeEnum.absoluteChange, DirectionTypeEnum.decrease);
|
||||
int calls = PostProcess.processSingleCandidatesNMCMA(
|
||||
PostProcessMethod.nelderMead, pop, convTerm, 0.001, prob);
|
||||
return ((InterfaceDataTypeDouble) pop.getBestEAIndividual())
|
||||
.getDoubleData();
|
||||
}
|
||||
|
||||
|
||||
/**
|
||||
* Refine a candidate solution vector regarding rotations. Saves the
|
||||
* new solution vector in pos and returns the number of dimensions
|
||||
* that had to be modified after rotation due to range restrictions.
|
||||
* Refine a candidate solution vector regarding rotations. Saves the new
|
||||
* solution vector in pos and returns the number of dimensions that had to
|
||||
* be modified after rotation due to range restrictions.
|
||||
*
|
||||
* The given position is expected to be unrotated! The returned solution
|
||||
* is unrotated as well.
|
||||
* The given position is expected to be unrotated! The returned solution is
|
||||
* unrotated as well.
|
||||
*
|
||||
* @param pos
|
||||
* @param prob
|
||||
* @return
|
||||
*/
|
||||
public static int refineWithRotation(double[] pos, AbstractProblemDouble prob) {
|
||||
public static int refineWithRotation(double[] pos,
|
||||
AbstractProblemDouble prob) {
|
||||
double[] res = prob.inverseRotateMaybe(pos);
|
||||
int modifiedInPrjct = Mathematics.projectToRange(res, prob.makeRange());
|
||||
res = AbstractProblemDouble.refineSolutionNMS(prob, res);
|
||||
@ -426,51 +496,56 @@ public abstract class AbstractProblemDouble extends AbstractOptimizationProblem
|
||||
return modifiedInPrjct;
|
||||
}
|
||||
|
||||
/**********************************************************************************************************************
|
||||
* These are for GUI
|
||||
*/
|
||||
/**********************************************************************************************************************
|
||||
* These are for GUI
|
||||
*/
|
||||
|
||||
/**
|
||||
* This method allows the GUI to read the
|
||||
* name to the current object.
|
||||
* @return the name of the object
|
||||
*/
|
||||
public String getName() {
|
||||
return "AbstractProblemDouble";
|
||||
}
|
||||
/**
|
||||
* This method allows the GUI to read the name to the current object.
|
||||
*
|
||||
* @return the name of the object
|
||||
*/
|
||||
public String getName() {
|
||||
return "AbstractProblemDouble";
|
||||
}
|
||||
|
||||
/**
|
||||
* This method returns a global info string.
|
||||
* @return description
|
||||
*/
|
||||
public static String globalInfo() {
|
||||
return "The programmer did not give further details.";
|
||||
}
|
||||
/**
|
||||
* This method returns a global info string.
|
||||
*
|
||||
* @return description
|
||||
*/
|
||||
public static String globalInfo() {
|
||||
return "The programmer did not give further details.";
|
||||
}
|
||||
|
||||
/** This method returns a string describing the optimization problem.
|
||||
* @param opt The Optimizer that is used or had been used.
|
||||
* @return The description.
|
||||
*/
|
||||
public String getStringRepresentationForProblem(InterfaceOptimizer opt) {
|
||||
StringBuffer sb = new StringBuffer(200);
|
||||
sb.append("A double valued problem: ");
|
||||
sb.append(this.getName());
|
||||
sb.append("\n");
|
||||
sb.append(globalInfo());
|
||||
sb.append("Dimension : ");
|
||||
sb.append(this.getProblemDimension());
|
||||
sb.append("\nNoise level : ");
|
||||
sb.append(this.m_Noise);
|
||||
return sb.toString();
|
||||
}
|
||||
/**
|
||||
* This method returns a string describing the optimization problem.
|
||||
*
|
||||
* @param opt
|
||||
* The Optimizer that is used or had been used.
|
||||
* @return The description.
|
||||
*/
|
||||
public String getStringRepresentationForProblem(InterfaceOptimizer opt) {
|
||||
StringBuffer sb = new StringBuffer(200);
|
||||
sb.append("A double valued problem: ");
|
||||
sb.append(this.getName());
|
||||
sb.append("\n");
|
||||
sb.append(globalInfo());
|
||||
sb.append("Dimension : ");
|
||||
sb.append(this.getProblemDimension());
|
||||
sb.append("\nNoise level : ");
|
||||
sb.append(this.m_Noise);
|
||||
return sb.toString();
|
||||
}
|
||||
|
||||
// public PropertySelectableList<AbstractConstraint> getConstraints() {
|
||||
// return constraintList;
|
||||
// }
|
||||
//
|
||||
// public void setConstraints(PropertySelectableList<AbstractConstraint> constraintArray) {
|
||||
// this.constraintList = constraintArray;
|
||||
// }
|
||||
// public PropertySelectableList<AbstractConstraint> getConstraints() {
|
||||
// return constraintList;
|
||||
// }
|
||||
//
|
||||
// public void setConstraints(PropertySelectableList<AbstractConstraint>
|
||||
// constraintArray) {
|
||||
// this.constraintList = constraintArray;
|
||||
// }
|
||||
|
||||
public AbstractConstraint[] getConstraints() {
|
||||
return constraintArray;
|
||||
@ -490,7 +565,8 @@ public abstract class AbstractProblemDouble extends AbstractOptimizationProblem
|
||||
|
||||
public void setWithConstraints(boolean withConstraints) {
|
||||
this.withConstraints = withConstraints;
|
||||
GenericObjectEditor.setShowProperty(this.getClass(), "constraints", withConstraints);
|
||||
GenericObjectEditor.setShowProperty(this.getClass(), "constraints",
|
||||
withConstraints);
|
||||
}
|
||||
|
||||
public String withConstraintsTipText() {
|
||||
@ -500,59 +576,79 @@ public abstract class AbstractProblemDouble extends AbstractOptimizationProblem
|
||||
@Override
|
||||
public String[] getAdditionalFileStringHeader(PopulationInterface pop) {
|
||||
String[] superHeader = super.getAdditionalFileStringHeader(pop);
|
||||
if (isWithConstraints()) return ToolBox.appendArrays(superHeader, new String[]{"rawFit","numViol","sumViol"});
|
||||
else return superHeader;
|
||||
if (isWithConstraints())
|
||||
return ToolBox.appendArrays(superHeader, new String[] { "rawFit",
|
||||
"numViol", "sumViol" });
|
||||
else
|
||||
return superHeader;
|
||||
}
|
||||
|
||||
@Override
|
||||
public String[] getAdditionalFileStringInfo(PopulationInterface pop) {
|
||||
String[] superInfo = super.getAdditionalFileStringInfo(pop);
|
||||
if (isWithConstraints())
|
||||
return ToolBox.appendArrays(superInfo, new String[]{"Raw fitness (unpenalized) of the current best individual",
|
||||
"The number of constraints violated by the current best individual",
|
||||
"The sum of constraint violations of the current best individual"});
|
||||
else return superInfo;
|
||||
return ToolBox
|
||||
.appendArrays(
|
||||
superInfo,
|
||||
new String[] {
|
||||
"Raw fitness (unpenalized) of the current best individual",
|
||||
"The number of constraints violated by the current best individual",
|
||||
"The sum of constraint violations of the current best individual" });
|
||||
else
|
||||
return superInfo;
|
||||
}
|
||||
|
||||
@Override
|
||||
public Object[] getAdditionalFileStringValue(PopulationInterface pop) {
|
||||
Object[] superVal = super.getAdditionalFileStringValue(pop);
|
||||
if (isWithConstraints()) {
|
||||
AbstractEAIndividual indy = (AbstractEAIndividual)pop.getBestIndividual();
|
||||
Pair<Integer,Double> violation= getConstraintViolation(indy);
|
||||
return ToolBox.appendArrays(superVal, new Object[]{indy.getData(rawFitKey),
|
||||
violation.head(),
|
||||
violation.tail()});
|
||||
// return superVal + " \t" + BeanInspector.toString(indy.getData(rawFitKey)) + " \t" + violation.head() + " \t" + violation.tail();
|
||||
} else return superVal;
|
||||
AbstractEAIndividual indy = (AbstractEAIndividual) pop
|
||||
.getBestIndividual();
|
||||
Pair<Integer, Double> violation = getConstraintViolation(indy);
|
||||
return ToolBox.appendArrays(superVal,
|
||||
new Object[] { indy.getData(rawFitKey), violation.head(),
|
||||
violation.tail() });
|
||||
// return superVal + " \t" +
|
||||
// BeanInspector.toString(indy.getData(rawFitKey)) + " \t" +
|
||||
// violation.head() + " \t" + violation.tail();
|
||||
} else
|
||||
return superVal;
|
||||
}
|
||||
|
||||
protected Pair<Integer,Double> getConstraintViolation(AbstractEAIndividual indy) {
|
||||
double sum=0;
|
||||
int numViol=0;
|
||||
protected Pair<Integer, Double> getConstraintViolation(
|
||||
AbstractEAIndividual indy) {
|
||||
double sum = 0;
|
||||
int numViol = 0;
|
||||
for (AbstractConstraint constr : constraintArray) {
|
||||
double v= constr.getViolation(getEvalArray(indy));
|
||||
if (v>0) numViol++;
|
||||
double v = constr.getViolation(getEvalArray(indy));
|
||||
if (v > 0)
|
||||
numViol++;
|
||||
sum += v;
|
||||
}
|
||||
return new Pair<Integer,Double>(numViol, sum);
|
||||
return new Pair<Integer, Double>(numViol, sum);
|
||||
}
|
||||
|
||||
public boolean isShowPlot() {
|
||||
return isShowing ;
|
||||
return isShowing;
|
||||
}
|
||||
|
||||
public void setShowPlot(boolean showP) {
|
||||
if (!isShowing && showP) {
|
||||
TopoPlot plot = new TopoPlot(getName(), "x1", "x2");
|
||||
plot.setParams(60,60, ColorBarCalculator.BLUE_TO_RED);
|
||||
plot.setParams(60, 60, ColorBarCalculator.BLUE_TO_RED);
|
||||
this.initProblem();
|
||||
plot.setTopology(this, makeRange(), true);
|
||||
if (this instanceof InterfaceMultimodalProblemKnown && ((InterfaceMultimodalProblemKnown)this).fullListAvailable()) {
|
||||
plot.drawPopulation("Opt", ((InterfaceMultimodalProblemKnown)this).getRealOptima());
|
||||
if (this instanceof InterfaceMultimodalProblemKnown
|
||||
&& ((InterfaceMultimodalProblemKnown) this)
|
||||
.fullListAvailable()) {
|
||||
plot.drawPopulation("Opt",
|
||||
((InterfaceMultimodalProblemKnown) this)
|
||||
.getRealOptima());
|
||||
}
|
||||
}
|
||||
isShowing = showP;
|
||||
}
|
||||
|
||||
public String showPlotTipText() {
|
||||
return "Produce an exemplary 2D plot of the function (dimensional cut at x_i=0 for n>1).";
|
||||
}
|
||||
|
||||
Loading…
x
Reference in New Issue
Block a user