Uses of Class
net.sourceforge.cilib.problem.OptimisationSolution

Packages that use OptimisationSolution
net.sourceforge.cilib.algorithm The Algorithm package provides the generic algorithm foundation for all Algorithm instances. 
net.sourceforge.cilib.algorithm.population   
net.sourceforge.cilib.boa   
net.sourceforge.cilib.clustering.kmeans   
net.sourceforge.cilib.coevolution   
net.sourceforge.cilib.cooperative   
net.sourceforge.cilib.ec   
net.sourceforge.cilib.hs   
net.sourceforge.cilib.moo.archive   
net.sourceforge.cilib.moo.archive.constrained   
net.sourceforge.cilib.moo.archive.solutionweighing   
net.sourceforge.cilib.moo.archive.unconstrained   
net.sourceforge.cilib.neuralnetwork.foundation   
net.sourceforge.cilib.neuralnetwork.generic.evaluationmediators   
net.sourceforge.cilib.problem   
net.sourceforge.cilib.pso   
net.sourceforge.cilib.pso.niching   
 

Uses of OptimisationSolution in net.sourceforge.cilib.algorithm
 

Methods in net.sourceforge.cilib.algorithm that return OptimisationSolution
 OptimisationSolution MultistartOptimisationAlgorithm.getBestSolution()
          Get the best current solution.
abstract  OptimisationSolution Algorithm.getBestSolution()
          Get the best current solution.
 

Methods in net.sourceforge.cilib.algorithm that return types with arguments of type OptimisationSolution
 List<OptimisationSolution> MultistartOptimisationAlgorithm.getSolutions()
          Get the collection of best solutions.
abstract  List<OptimisationSolution> Algorithm.getSolutions()
          Get the collection of best solutions.
 

Uses of OptimisationSolution in net.sourceforge.cilib.algorithm.population
 

Methods in net.sourceforge.cilib.algorithm.population that return OptimisationSolution
abstract  OptimisationSolution PopulationBasedAlgorithm.getBestSolution()
          Get the best current solution.
 OptimisationSolution MultiPopulationCriterionBasedAlgorithm.getBestSolution()
           
 

Methods in net.sourceforge.cilib.algorithm.population that return types with arguments of type OptimisationSolution
abstract  List<OptimisationSolution> PopulationBasedAlgorithm.getSolutions()
          Get the collection of best solutions.
 List<OptimisationSolution> MultiPopulationCriterionBasedAlgorithm.getSolutions()
           
 

Uses of OptimisationSolution in net.sourceforge.cilib.boa
 

Methods in net.sourceforge.cilib.boa that return OptimisationSolution
 OptimisationSolution ABC.getBestSolution()
          Get the best current solution.
 

Methods in net.sourceforge.cilib.boa that return types with arguments of type OptimisationSolution
 List<OptimisationSolution> ABC.getSolutions()
          Get the collection of best solutions.
 

Uses of OptimisationSolution in net.sourceforge.cilib.clustering.kmeans
 

Methods in net.sourceforge.cilib.clustering.kmeans that return OptimisationSolution
 OptimisationSolution KMeans.getBestSolution()
          Get the best current solution.
 

Methods in net.sourceforge.cilib.clustering.kmeans that return types with arguments of type OptimisationSolution
 List<OptimisationSolution> KMeans.getSolutions()
          Get the collection of best solutions.
 

Uses of OptimisationSolution in net.sourceforge.cilib.coevolution
 

Methods in net.sourceforge.cilib.coevolution that return OptimisationSolution
 OptimisationSolution CoevolutionAlgorithm.getBestSolution()
          This doesnt really make sense since in co-evolution you have a best solution for each population
 

Methods in net.sourceforge.cilib.coevolution that return types with arguments of type OptimisationSolution
 List<OptimisationSolution> CoevolutionAlgorithm.getSolutions()
          Can be useful to compare how the different populations are performing.
 

Uses of OptimisationSolution in net.sourceforge.cilib.cooperative
 

Methods in net.sourceforge.cilib.cooperative that return OptimisationSolution
 OptimisationSolution HybridCooperativeAlgorithm.getBestSolution()
          Get the best current solution.
 OptimisationSolution SplitCooperativeAlgorithm.getBestSolution()
           
 

Methods in net.sourceforge.cilib.cooperative that return types with arguments of type OptimisationSolution
 List<OptimisationSolution> HybridCooperativeAlgorithm.getSolutions()
          Get the collection of best solutions.
 List<OptimisationSolution> SplitCooperativeAlgorithm.getSolutions()
           
 

Uses of OptimisationSolution in net.sourceforge.cilib.ec
 

Methods in net.sourceforge.cilib.ec that return OptimisationSolution
 OptimisationSolution EC.getBestSolution()
          Get the best current solution.
 

Methods in net.sourceforge.cilib.ec that return types with arguments of type OptimisationSolution
 List<OptimisationSolution> EC.getSolutions()
          Get the collection of best solutions.
 

Uses of OptimisationSolution in net.sourceforge.cilib.hs
 

Methods in net.sourceforge.cilib.hs that return OptimisationSolution
 OptimisationSolution HS.getBestSolution()
          Get the best current solution.
 

Methods in net.sourceforge.cilib.hs that return types with arguments of type OptimisationSolution
 List<OptimisationSolution> HS.getSolutions()
          Get the collection of best solutions.
 

Uses of OptimisationSolution in net.sourceforge.cilib.moo.archive
 

Methods in net.sourceforge.cilib.moo.archive that return types with arguments of type OptimisationSolution
abstract  Collection<OptimisationSolution> Archive.dominates(OptimisationSolution candidateSolution)
          Checks the entire archive and accumulates the solutions that dominates candidateSolution.
abstract  Collection<OptimisationSolution> Archive.isDominatedBy(OptimisationSolution candidateSolution)
          Checks the archive and accumulates all solutions that is dominated by candidateSolution.
 

Methods in net.sourceforge.cilib.moo.archive with parameters of type OptimisationSolution
abstract  Collection<OptimisationSolution> Archive.dominates(OptimisationSolution candidateSolution)
          Checks the entire archive and accumulates the solutions that dominates candidateSolution.
abstract  Collection<OptimisationSolution> Archive.isDominatedBy(OptimisationSolution candidateSolution)
          Checks the archive and accumulates all solutions that is dominated by candidateSolution.
 

Uses of OptimisationSolution in net.sourceforge.cilib.moo.archive.constrained
 

Methods in net.sourceforge.cilib.moo.archive.constrained that return OptimisationSolution
 OptimisationSolution SetBasedConstrainedArchive.get(int index)
           
 OptimisationSolution SetBasedConstrainedArchive.remove(int index)
           
 OptimisationSolution SetBasedConstrainedArchive.set(int index, OptimisationSolution element)
           
 

Methods in net.sourceforge.cilib.moo.archive.constrained that return types with arguments of type OptimisationSolution
 Collection<OptimisationSolution> SetBasedConstrainedArchive.dominates(OptimisationSolution candidateSolution)
           
 SelectionRecipe<OptimisationSolution> SetBasedConstrainedArchive.getPruningSelection()
           
 Collection<OptimisationSolution> SetBasedConstrainedArchive.isDominatedBy(OptimisationSolution candidateSolution)
           
 Iterator<OptimisationSolution> SetBasedConstrainedArchive.iterator()
           
 ListIterator<OptimisationSolution> SetBasedConstrainedArchive.listIterator()
           
 ListIterator<OptimisationSolution> SetBasedConstrainedArchive.listIterator(int index)
           
 List<OptimisationSolution> SetBasedConstrainedArchive.subList(int fromIndex, int toIndex)
           
 

Methods in net.sourceforge.cilib.moo.archive.constrained with parameters of type OptimisationSolution
 void SetBasedConstrainedArchive.add(int index, OptimisationSolution element)
           
 boolean ConstrainedArchive.add(OptimisationSolution candidateSolution)
          Adds the candidateSolution if no solution within the archive dominates it.
protected  boolean ConstrainedArchive.addNonDominatedSolution(OptimisationSolution candidateSolution)
           
 boolean SetBasedConstrainedArchive.addToStructure(OptimisationSolution optimisationSolution)
           
protected abstract  boolean ConstrainedArchive.addToStructure(OptimisationSolution candidateSolution)
          Adds a non-dominated candidateSolution into the archive.
 Collection<OptimisationSolution> SetBasedConstrainedArchive.dominates(OptimisationSolution candidateSolution)
           
 Collection<OptimisationSolution> SetBasedConstrainedArchive.isDominatedBy(OptimisationSolution candidateSolution)
           
 OptimisationSolution SetBasedConstrainedArchive.set(int index, OptimisationSolution element)
           
 

Method parameters in net.sourceforge.cilib.moo.archive.constrained with type arguments of type OptimisationSolution
 boolean ConstrainedArchive.addAll(Collection<? extends OptimisationSolution> candidateSolutions)
          Iterates through the collection of candidateSolutions and adds the non-dominated solutions to the archive.
 boolean SetBasedConstrainedArchive.addAll(int index, Collection<? extends OptimisationSolution> c)
           
 void SetBasedConstrainedArchive.setPruningSelection(SelectionRecipe<OptimisationSolution> pruningSelection)
           
 

Uses of OptimisationSolution in net.sourceforge.cilib.moo.archive.solutionweighing
 

Method parameters in net.sourceforge.cilib.moo.archive.solutionweighing with type arguments of type OptimisationSolution
 boolean SolutionWeighing.weigh(List<Selection.Entry<OptimisationSolution>> elements)
           
 boolean AntiClusterWeighing.weigh(List<Selection.Entry<OptimisationSolution>> solutions)
           
 

Uses of OptimisationSolution in net.sourceforge.cilib.moo.archive.unconstrained
 

Methods in net.sourceforge.cilib.moo.archive.unconstrained that return OptimisationSolution
 OptimisationSolution QuadTree.get(int index)
           
 OptimisationSolution QuadTree.remove(int index)
           
 OptimisationSolution QuadTree.set(int index, OptimisationSolution element)
           
 

Methods in net.sourceforge.cilib.moo.archive.unconstrained that return types with arguments of type OptimisationSolution
 Collection<OptimisationSolution> QuadTree.dominates(OptimisationSolution candidateSolution)
           
 Collection<OptimisationSolution> QuadTree.isDominatedBy(OptimisationSolution candidateSolution)
           
 Iterator<OptimisationSolution> QuadTree.iterator()
           
 ListIterator<OptimisationSolution> QuadTree.listIterator()
           
 ListIterator<OptimisationSolution> QuadTree.listIterator(int index)
           
 List<OptimisationSolution> QuadTree.subList(int fromIndex, int toIndex)
           
 

Methods in net.sourceforge.cilib.moo.archive.unconstrained with parameters of type OptimisationSolution
 void QuadTree.add(int index, OptimisationSolution element)
           
 boolean QuadTree.add(OptimisationSolution e)
           
 Collection<OptimisationSolution> QuadTree.dominates(OptimisationSolution candidateSolution)
           
 Collection<OptimisationSolution> QuadTree.isDominatedBy(OptimisationSolution candidateSolution)
           
 OptimisationSolution QuadTree.set(int index, OptimisationSolution element)
           
 

Method parameters in net.sourceforge.cilib.moo.archive.unconstrained with type arguments of type OptimisationSolution
 boolean QuadTree.addAll(Collection<? extends OptimisationSolution> c)
           
 boolean QuadTree.addAll(int index, Collection<? extends OptimisationSolution> c)
           
 

Uses of OptimisationSolution in net.sourceforge.cilib.neuralnetwork.foundation
 

Methods in net.sourceforge.cilib.neuralnetwork.foundation that return OptimisationSolution
 OptimisationSolution NeuralNetworkController.getBestSolution()
          Deprecated.  
 OptimisationSolution EvaluationMediator.getBestSolution()
           
 

Methods in net.sourceforge.cilib.neuralnetwork.foundation that return types with arguments of type OptimisationSolution
 List<OptimisationSolution> NeuralNetworkController.getSolutions()
          Deprecated.  
 List<OptimisationSolution> EvaluationMediator.getSolutions()
           
 

Uses of OptimisationSolution in net.sourceforge.cilib.neuralnetwork.generic.evaluationmediators
 

Methods in net.sourceforge.cilib.neuralnetwork.generic.evaluationmediators that return OptimisationSolution
 OptimisationSolution FFNNEvaluationMediator.getBestSolution()
          Deprecated.  
 OptimisationSolution SAILAEvaluationMediator.getBestSolution()
           
 

Methods in net.sourceforge.cilib.neuralnetwork.generic.evaluationmediators that return types with arguments of type OptimisationSolution
 List<OptimisationSolution> FFNNEvaluationMediator.getSolutions()
          Deprecated.  
 List<OptimisationSolution> SAILAEvaluationMediator.getSolutions()
           
 

Uses of OptimisationSolution in net.sourceforge.cilib.problem
 

Methods in net.sourceforge.cilib.problem with parameters of type OptimisationSolution
 int OptimisationSolution.compareTo(OptimisationSolution other)
          
 

Uses of OptimisationSolution in net.sourceforge.cilib.pso
 

Methods in net.sourceforge.cilib.pso that return OptimisationSolution
 OptimisationSolution PSO.getBestSolution()
          Get the best current solution.
 

Methods in net.sourceforge.cilib.pso that return types with arguments of type OptimisationSolution
 List<OptimisationSolution> PSO.getSolutions()
          Get the collection of best solutions.
 

Uses of OptimisationSolution in net.sourceforge.cilib.pso.niching
 

Methods in net.sourceforge.cilib.pso.niching that return OptimisationSolution
 OptimisationSolution Niche.getBestSolution()
           
 

Methods in net.sourceforge.cilib.pso.niching that return types with arguments of type OptimisationSolution
 List<OptimisationSolution> Niche.getSolutions()
           
 



Copyright © 2009 CIRG. All Rights Reserved.