Uses of Interface
cz.cuni.mff.ksi.jinfer.iss.experiments.interfaces.ImprovementHeuristic

Packages that use ImprovementHeuristic

cz.cuni.mff.ksi.jinfer.iss.experiments
cz.cuni.mff.ksi.jinfer.iss.experiments.sets
cz.cuni.mff.ksi.jinfer.iss.heuristics.improvement

Uses of ImprovementHeuristic in cz.cuni.mff.ksi.jinfer.iss.experiments

Methods in cz.cuni.mff.ksi.jinfer.iss.experiments that return types with arguments of type ImprovementHeuristic

List<ImprovementHeuristic>

ExperimentParameters.getImprovementHeuristics()

Constructor parameters in cz.cuni.mff.ksi.jinfer.iss.experiments with type arguments of type ImprovementHeuristic

ExperimentParameters(InputFile file, int poolSize, double alpha, double beta, ConstructionHeuristic constructionHeuristic, List<ImprovementHeuristic> improvementHeuristics, QualityMeasurement measurement, TerminationCriterion terminationCriterion)
Almost full constructor.

ExperimentParameters(InputFile file, int poolSize, double alpha, double beta, Double knownOptimum, ConstructionHeuristic constructionHeuristic, List<ImprovementHeuristic> improvementHeuristics, QualityMeasurement measurement, TerminationCriterion terminationCriterion)
Full constructor.

Uses of ImprovementHeuristic in cz.cuni.mff.ksi.jinfer.iss.experiments.sets

Methods in cz.cuni.mff.ksi.jinfer.iss.experiments.sets that return types with arguments of type ImprovementHeuristic

protected List<ImprovementHeuristic>	ChainedIHs1.getIHs()
protected List<ImprovementHeuristic>	ChainedIHs2.getIHs()
protected List<ImprovementHeuristic>	ChainedIHs3.getIHs()
protected abstract List<ImprovementHeuristic>	AbstractChainedIHs.getIHs()

Uses of ImprovementHeuristic in cz.cuni.mff.ksi.jinfer.iss.heuristics.improvement

Classes in cz.cuni.mff.ksi.jinfer.iss.heuristics.improvement that implement ImprovementHeuristic

class	Crossover A slightly more complex improvement heuristic.
class	Hungry Tries to improve every solution in the pool by including as many good mappings as possible.
class	Identity This trivial improvement heuristic simply returns the provided solution pool.
class	LocalBranching This heuristic works by creating a constrained sub-problem and then solving it.
class	Mutation A slightly more complex improvement heuristic.
class	RandomRemove A simple improvement heuristic that removes a specified fraction of AMs at random from every solution in the pool.
class	RemoveWorst Simple "improvement" heuristic that works by removing the worst solution (IdSet) from the feasible pool.