|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object net.sourceforge.cilib.problem.MOOptimisationProblem
public class MOOptimisationProblem
Field Summary | |
---|---|
protected List<OptimisationProblem> |
problems
|
Constructor Summary | |
---|---|
MOOptimisationProblem()
|
|
MOOptimisationProblem(MOOptimisationProblem copy)
|
Method Summary | ||
---|---|---|
void |
accept(ProblemVisitor visitor)
Accept the provided Visitor and
perform the Visitor.visit(Object) method. |
|
void |
add(int index,
OptimisationProblem problem)
|
|
boolean |
add(OptimisationProblem problem)
|
|
boolean |
addAll(Collection<? extends OptimisationProblem> problems)
|
|
boolean |
addAll(int index,
Collection<? extends OptimisationProblem> problems)
|
|
void |
changeEnvironment()
Change the environment. |
|
void |
clear()
|
|
boolean |
contains(Object object)
|
|
boolean |
containsAll(Collection<?> objects)
|
|
OptimisationProblem |
get(int index)
|
|
DomainRegistry |
getBehaviouralDomain()
Returns the domain component that describes the search space of the needed behavioral characteristics of the problem. |
|
MOOptimisationProblem |
getClone()
Create a cloned copy of the current object and return it. |
|
DataSetBuilder |
getDataSetBuilder()
Get the associated DataSetBuilder . |
|
DomainRegistry |
getDomain()
Returns the domain component that describes the search space for this problem. |
|
Fitness |
getFitness(int index,
Type solution,
boolean count)
|
|
MOFitness |
getFitness(Type[] solutions,
boolean count)
|
|
MOFitness |
getFitness(Type solution,
boolean count)
Returns the fitness of a potential solution to this problem. |
|
int |
getFitnessEvaluations()
Returns the number of times the underlying fitness function has been evaluated. |
|
int |
indexOf(Object object)
|
|
boolean |
isEmpty()
|
|
Iterator<OptimisationProblem> |
iterator()
|
|
int |
lastIndexOf(Object object)
|
|
ListIterator<OptimisationProblem> |
listIterator()
|
|
ListIterator<OptimisationProblem> |
listIterator(int index)
|
|
OptimisationProblem |
remove(int index)
|
|
boolean |
remove(Object object)
|
|
boolean |
removeAll(Collection<?> objects)
|
|
boolean |
retainAll(Collection<?> objects)
|
|
OptimisationProblem |
set(int index,
OptimisationProblem problem)
|
|
void |
setDataSetBuilder(DataSetBuilder dataSetBuilder)
Set the DataSetBuilder for this
optimistion problem . |
|
int |
size()
|
|
List<OptimisationProblem> |
subList(int fromIndex,
int toIndex)
|
|
Object[] |
toArray()
|
|
|
toArray(T[] a)
|
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Methods inherited from interface java.util.List |
---|
equals, hashCode |
Field Detail |
---|
protected List<OptimisationProblem> problems
Constructor Detail |
---|
public MOOptimisationProblem()
public MOOptimisationProblem(MOOptimisationProblem copy)
Method Detail |
---|
public MOOptimisationProblem getClone()
OptimisationProblem
getClone
in interface OptimisationProblem
getClone
in interface Problem
getClone
in interface Cloneable
Object.clone()
public MOFitness getFitness(Type[] solutions, boolean count)
public MOFitness getFitness(Type solution, boolean count)
OptimisationProblem
OptimisationProblem.getDomain()
. An instance of
InferiorFitness
should be returned if the solution
falls outside the search space of this problem.
getFitness
in interface OptimisationProblem
solution
- The potential solution found by the optimisation algorithm.count
- True if this call should contribute to the fitness evaluation count, see OptimisationProblem.getFitnessEvaluations()
.
public Fitness getFitness(int index, Type solution, boolean count)
public int getFitnessEvaluations()
OptimisationProblem
getFitnessEvaluations
in interface OptimisationProblem
public DomainRegistry getDomain()
OptimisationProblem
getDomain
in interface OptimisationProblem
DomainRegistry
object representing the search space.public DomainRegistry getBehaviouralDomain()
OptimisationProblem
getBehaviouralDomain
in interface OptimisationProblem
public DataSetBuilder getDataSetBuilder()
OptimisationProblem
DataSetBuilder
.
getDataSetBuilder
in interface OptimisationProblem
DataSetBuilder
.public void setDataSetBuilder(DataSetBuilder dataSetBuilder)
OptimisationProblem
DataSetBuilder
for this
optimistion problem
.
setDataSetBuilder
in interface OptimisationProblem
dataSetBuilder
- The DataSetBuilder
to be set on the current OptimisationProblem
.public void accept(ProblemVisitor visitor)
OptimisationProblem
Visitor
and
perform the Visitor.visit(Object)
method.
accept
in interface OptimisationProblem
visitor
- The visitor which has operations to perform.public void changeEnvironment()
Problem
changeEnvironment
in interface Problem
public boolean add(OptimisationProblem problem)
add
in interface Collection<OptimisationProblem>
add
in interface List<OptimisationProblem>
public boolean addAll(Collection<? extends OptimisationProblem> problems)
addAll
in interface Collection<OptimisationProblem>
addAll
in interface List<OptimisationProblem>
public void clear()
clear
in interface Collection<OptimisationProblem>
clear
in interface List<OptimisationProblem>
public boolean contains(Object object)
contains
in interface Collection<OptimisationProblem>
contains
in interface List<OptimisationProblem>
public boolean containsAll(Collection<?> objects)
containsAll
in interface Collection<OptimisationProblem>
containsAll
in interface List<OptimisationProblem>
public boolean isEmpty()
isEmpty
in interface Collection<OptimisationProblem>
isEmpty
in interface List<OptimisationProblem>
public Iterator<OptimisationProblem> iterator()
iterator
in interface Iterable<OptimisationProblem>
iterator
in interface Collection<OptimisationProblem>
iterator
in interface List<OptimisationProblem>
public boolean remove(Object object)
remove
in interface Collection<OptimisationProblem>
remove
in interface List<OptimisationProblem>
public boolean removeAll(Collection<?> objects)
removeAll
in interface Collection<OptimisationProblem>
removeAll
in interface List<OptimisationProblem>
public boolean retainAll(Collection<?> objects)
retainAll
in interface Collection<OptimisationProblem>
retainAll
in interface List<OptimisationProblem>
public int size()
size
in interface Collection<OptimisationProblem>
size
in interface List<OptimisationProblem>
public Object[] toArray()
toArray
in interface Collection<OptimisationProblem>
toArray
in interface List<OptimisationProblem>
public <T> T[] toArray(T[] a)
toArray
in interface Collection<OptimisationProblem>
toArray
in interface List<OptimisationProblem>
public void add(int index, OptimisationProblem problem)
add
in interface List<OptimisationProblem>
public boolean addAll(int index, Collection<? extends OptimisationProblem> problems)
addAll
in interface List<OptimisationProblem>
public OptimisationProblem get(int index)
get
in interface List<OptimisationProblem>
public int indexOf(Object object)
indexOf
in interface List<OptimisationProblem>
public int lastIndexOf(Object object)
lastIndexOf
in interface List<OptimisationProblem>
public ListIterator<OptimisationProblem> listIterator()
listIterator
in interface List<OptimisationProblem>
public ListIterator<OptimisationProblem> listIterator(int index)
listIterator
in interface List<OptimisationProblem>
public OptimisationProblem remove(int index)
remove
in interface List<OptimisationProblem>
public OptimisationProblem set(int index, OptimisationProblem problem)
set
in interface List<OptimisationProblem>
public List<OptimisationProblem> subList(int fromIndex, int toIndex)
subList
in interface List<OptimisationProblem>
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |