Main Page | Class Hierarchy | Compound List | File List | Compound Members

GWWAlgorithm Class Reference

#include <incop.h>

Inheritance diagram for GWWAlgorithm:

IncompleteAlgorithm NothresholdGWWAlgorithm ThresholdGWWAlgorithm AdaptiveGWWAlgorithm StandardGWWAlgorithm BestAdaptGWWAlgorithm FastAdaptGWWAlgorithm MedianAdaptGWWAlgorithm FastStandardGWWAlgorithm List of all members.

Public Member Functions

virtual void populationrandomwalk (OpProblem *problem, Configuration **population)
virtual int nb_threshold_population (Configuration **population)
void randomwalk (OpProblem *problem, Configuration *configuration)
void initthreshold (Configuration **population, int popsize)
virtual void thresholdupdate ()
virtual void thresholdcomputedelta (Configuration **population)
void run (OpProblem *problem, Configuration **population)
virtual void regrouping (Configuration **population)
void populationkeepbest (OpProblem *problem, Configuration **population)
virtual void thresholdchangesupdate ()

Public Attributes

int populationsize
int regrouptest
int lastmovedescent
int elitism
int nomovestop
int thresholddelta
int nbiteration
int thresholdchanges
int total_nhtries
int total_nbmoves
LSAlgorithmwalkalgorithm

Detailed Description

the GWW (Go with the winners) algorithms : the different subclasses differ by the way a threshold is managed and the particles are regrouped


Member Function Documentation

void GWWAlgorithm::initthreshold Configuration **  population,
int  popsize
[virtual]
 

intialization of the threshold

Reimplemented from IncompleteAlgorithm.

Reimplemented in ThresholdGWWAlgorithm.

int GWWAlgorithm::nb_threshold_population Configuration **  population  )  [virtual]
 

the number of particles at the threshold (for statistics) , the population being yet sorted at the function call

Reimplemented in ThresholdGWWAlgorithm.

void GWWAlgorithm::populationkeepbest OpProblem problem,
Configuration **  population
 

in case of elitism, the best particle is put into the population

void GWWAlgorithm::populationrandomwalk OpProblem problem,
Configuration **  population
[virtual]
 

local search on the whole population

void GWWAlgorithm::randomwalk OpProblem problem,
Configuration configuration
[virtual]
 

a local search for a particle

Reimplemented from IncompleteAlgorithm.

void GWWAlgorithm::regrouping Configuration **  population  )  [virtual]
 

regrouping of the best particles on the good ones

Reimplemented in StandardGWWAlgorithm, AdaptiveGWWAlgorithm, and NothresholdGWWAlgorithm.

void GWWAlgorithm::run OpProblem problem,
Configuration **  population
[virtual]
 

main function for running the algorithm

Reimplemented from IncompleteAlgorithm.

void GWWAlgorithm::thresholdchangesupdate  )  [virtual]
 

incrementing the threshold updates counter (for the statistics)

Reimplemented in ThresholdGWWAlgorithm.

void GWWAlgorithm::thresholdcomputedelta Configuration **  population  )  [virtual]
 

method for computing the threshold decrement

Reimplemented in StandardGWWAlgorithm, FastStandardGWWAlgorithm, AdaptiveGWWAlgorithm, FastAdaptGWWAlgorithm, MedianAdaptGWWAlgorithm, and BestAdaptGWWAlgorithm.

void GWWAlgorithm::thresholdupdate  )  [virtual]
 

method for lowering the threshold( the delta has already been computed)

Reimplemented in ThresholdGWWAlgorithm.


Member Data Documentation

int GWWAlgorithm::elitism
 

elitism parameter : is the best particle put again in the population at each regroupment ( 1 yes, 0 no)

int GWWAlgorithm::lastmovedescent
 

parameter if the threshold is lowered at the last move of the walk (for trying to avoid the particle to be redistributed (1 yes, 0 no)

int GWWAlgorithm::nbiteration
 

the maximum number of iterations : useful when no threshold is managed (NothresholdGWWAlgorithm)

int GWWAlgorithm::nomovestop
 

parameter for stopping the walk in case of stagnation (1 yes, 0 no)

int GWWAlgorithm::populationsize
 

number of particles

int GWWAlgorithm::regrouptest
 

walk indicator : a walk is performed only is the particle has been regrouped : (1 yes, 0 no) (useful for a standard GWW with random walk (and no local search))

int GWWAlgorithm::thresholdchanges
 

number of threshold changes (for the statistics)

int GWWAlgorithm::thresholddelta
 

the threshold decrement (compted by thresholdcomputedelta)

int GWWAlgorithm::total_nbmoves
 

total number of moves between 2 regroupments (for the statistics)

int GWWAlgorithm::total_nhtries
 

total number of move tries between 2 regroupments (for the statistics)

LSAlgorithm* GWWAlgorithm::walkalgorithm
 

the local search algorithm used


The documentation for this class was generated from the following files:
Generated on Fri Sep 26 17:27:26 2003 for INCOP by doxygen 1.3.3