net.sourceforge.cilib.cooperative.splitstrategies
Class ImperfectSplitStrategy

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

All Implemented Interfaces:

SplitStrategy

public class ImperfectSplitStrategy
extends IndexedSplitStrategy

Split an OptimisationProblem into sub-problems of unequal size/dimension. Defaults into a split of equal sizes if possible

Author:

Olusegun Olorunda

Field Summary

Fields inherited from class net.sourceforge.cilib.cooperative.splitstrategies.IndexedSplitStrategy

indices

Constructor Summary

ImperfectSplitStrategy()

Method Summary

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 net.sourceforge.cilib.cooperative.splitstrategies.IndexedSplitStrategy

addSplitIndex, getSplitIndex

Methods inherited from class java.lang.Object

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

Constructor Detail

ImperfectSplitStrategy

public ImperfectSplitStrategy()

Method Detail

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

Overrides:

split in class IndexedSplitStrategy

Parameters:

problem - The OptimisationProblem that will be split up.

context - The global entity context.

populations - The Algorithms participating in the SplitCooperativeAlgorithm.