public class RelationMismatchAutoFilterConstraint extends AbstractAutoFilterConstraint
Constructor and Description |
---|
RelationMismatchAutoFilterConstraint() |
Modifier and Type | Method and Description |
---|---|
double |
getAttachedCost(INode node,
ILogicEntityRoute curRoute,
IEntity en,
com.dna.jopt.framework.inputplausibility.properties.IPropertyProvider provider) |
double |
getQuotient(IAutoFilterViolationAndConstrainCollector collector) |
double |
getThreshold()
Gets the
threshold of the Node which the constraint factor has to reach in order to be
filtered out. |
double |
getThresholdLastRun()
Gets the threshold from the last run which usually is set to be lower, usually between 0.8 and 0.4.
|
String |
getTitle() |
getFilterReason, isAverageFilteringAllowed, isInConstraintState
public static final String MYREASON
public RelationMismatchAutoFilterConstraint()
public String getTitle()
getTitle
in class AbstractAutoFilterConstraint
public double getQuotient(IAutoFilterViolationAndConstrainCollector collector)
getQuotient
in class AbstractAutoFilterConstraint
public double getThreshold()
IAutoFilterNodeConstraint
threshold
of the Node
which the constraint factor
has to reach in order to be
filtered out.
The Nodes
are evaluated several times whether they are in a constraint
state or not.
The factor
of being in a constraint
state is calculated by number of evaluation divided by the times the Node
was in a
constraint
state.
The value is usually between 0.99 and 0.8
public double getThresholdLastRun()
IAutoFilterNodeConstraint
The very last run of an optimization
should have as few problems as possible. This is why the threshold
in the last run is lower in order to filter as many problematic Nodes
as possible.
public double getAttachedCost(INode node, ILogicEntityRoute curRoute, IEntity en, com.dna.jopt.framework.inputplausibility.properties.IPropertyProvider provider)
getAttachedCost
in class AbstractAutoFilterConstraint
Copyright © 2017–2023 DNA Evolutions GmbH. All rights reserved.