net.sourceforge.cilib.cooperative.splitstrategies
Class IndexedSplitStrategy

java.lang.Object
  net.sourceforge.cilib.cooperative.splitstrategies.IndexedSplitStrategy

All Implemented Interfaces:

SplitStrategy

Direct Known Subclasses:

ImperfectSplitStrategy

public class IndexedSplitStrategy
extends Object
implements SplitStrategy

Author:

Wiehann Matthysen

Field Summary

protected ArrayList<Integer>

indices

Constructor Summary

IndexedSplitStrategy()

Method Summary

void	addSplitIndex(int index)
int	getSplitIndex(int position)
void	split(OptimisationProblem problem, CooperativeEntity context, List<PopulationBasedAlgorithm> populations) Splits up the given OptimisationProblem into sub-problems and assigns all the sub-problems to Algorithms in the population.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

indices

protected ArrayList<Integer> indices

Constructor Detail

IndexedSplitStrategy

public IndexedSplitStrategy()

Method Detail

addSplitIndex

public void addSplitIndex(int index)

getSplitIndex

public int getSplitIndex(int position)

split

public void split(OptimisationProblem problem,
                  CooperativeEntity context,
                  List<PopulationBasedAlgorithm> populations)

Description copied from interface: SplitStrategy

Splits up the given OptimisationProblem into sub-problems and assigns all the sub-problems to Algorithms in the population.

Specified by:

split in interface SplitStrategy

Parameters:

problem - The OptimisationProblem that will be split up.

context - The global entity context.

populations - The Algorithms participating in the SplitCooperativeAlgorithm.