Package net.sf.tweety.math.opt.problem
Class CombinatoricsProblem
- java.lang.Object
- 
- java.util.AbstractCollection<E>
- 
- java.util.AbstractSet<E>
- 
- java.util.HashSet<ElementOfCombinatoricsProb>
- 
- net.sf.tweety.math.opt.problem.CombinatoricsProblem
 
 
 
 
- 
- All Implemented Interfaces:
- java.io.Serializable,- java.lang.Cloneable,- java.lang.Iterable<ElementOfCombinatoricsProb>,- java.util.Collection<ElementOfCombinatoricsProb>,- java.util.Set<ElementOfCombinatoricsProb>
 - Direct Known Subclasses:
- KnapSack,- TravelingSalesman
 
 public abstract class CombinatoricsProblem extends java.util.HashSet<ElementOfCombinatoricsProb> This class implements a combinatorial optimization problem- Author:
- Sebastian Franke
- See Also:
- Serialized Form
 
- 
- 
Constructor SummaryConstructors Constructor Description CombinatoricsProblem(java.util.List<ElementOfCombinatoricsProb> elements)
 - 
Method SummaryModifier and Type Method Description java.util.ArrayList<ElementOfCombinatoricsProb>createDifference(java.util.ArrayList<ElementOfCombinatoricsProb> c)abstract java.util.ArrayList<ElementOfCombinatoricsProb>createRandomNewSolution(java.util.ArrayList<ElementOfCombinatoricsProb> currSol)abstract doubleevaluate(java.util.ArrayList<ElementOfCombinatoricsProb> sol)java.util.ArrayList<java.util.ArrayList<ElementOfCombinatoricsProb>>formNeighborhood(java.util.ArrayList<ElementOfCombinatoricsProb> currSol, int minIterations, int maxIteration, double threshold)abstract booleanisValid(java.util.ArrayList<ElementOfCombinatoricsProb> sol)abstract doublesumOfWeights(java.util.ArrayList<ElementOfCombinatoricsProb> sol)- 
Methods inherited from class java.util.HashSetadd, clear, clone, contains, isEmpty, iterator, remove, size, spliterator
 
- 
 
- 
- 
- 
Field Detail- 
MINIMIZEpublic static final int MINIMIZE Static constant for the type "minimization"- See Also:
- Constant Field Values
 
 - 
MAXIMIZEpublic static final int MAXIMIZE Static constant for the type "maximization"- See Also:
- Constant Field Values
 
 
- 
 - 
Constructor Detail- 
CombinatoricsProblempublic CombinatoricsProblem(java.util.List<ElementOfCombinatoricsProb> elements) 
 
- 
 - 
Method Detail- 
createDifferencepublic java.util.ArrayList<ElementOfCombinatoricsProb> createDifference(java.util.ArrayList<ElementOfCombinatoricsProb> c) - Parameters:
- c- the List to be subtracted from "this" List
- Returns:
- the differnece of the lists
 
 - 
sumOfWeightspublic abstract double sumOfWeights(java.util.ArrayList<ElementOfCombinatoricsProb> sol) - Parameters:
- sol- is the solution to be viewd
- Returns:
- if the solution sol is valid under the constraints of the problem
 
 - 
formNeighborhoodpublic java.util.ArrayList<java.util.ArrayList<ElementOfCombinatoricsProb>> formNeighborhood(java.util.ArrayList<ElementOfCombinatoricsProb> currSol, int minIterations, int maxIteration, double threshold) 
 - 
createRandomNewSolutionpublic abstract java.util.ArrayList<ElementOfCombinatoricsProb> createRandomNewSolution(java.util.ArrayList<ElementOfCombinatoricsProb> currSol) 
 - 
evaluatepublic abstract double evaluate(java.util.ArrayList<ElementOfCombinatoricsProb> sol) 
 - 
isValidpublic abstract boolean isValid(java.util.ArrayList<ElementOfCombinatoricsProb> sol) 
 
- 
 
-