#include <incop.h>
Inheritance diagram for GWWAlgorithm:
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 |
LSAlgorithm * | walkalgorithm |
|
intialization of the threshold Reimplemented from IncompleteAlgorithm. Reimplemented in ThresholdGWWAlgorithm. |
|
the number of particles at the threshold (for statistics) , the population being yet sorted at the function call Reimplemented in ThresholdGWWAlgorithm. |
|
in case of elitism, the best particle is put into the population |
|
local search on the whole population |
|
a local search for a particle Reimplemented from IncompleteAlgorithm. |
|
regrouping of the best particles on the good ones Reimplemented in StandardGWWAlgorithm, AdaptiveGWWAlgorithm, and NothresholdGWWAlgorithm. |
|
main function for running the algorithm Reimplemented from IncompleteAlgorithm. |
|
incrementing the threshold updates counter (for the statistics) Reimplemented in ThresholdGWWAlgorithm. |
|
method for computing the threshold decrement Reimplemented in StandardGWWAlgorithm, FastStandardGWWAlgorithm, AdaptiveGWWAlgorithm, FastAdaptGWWAlgorithm, MedianAdaptGWWAlgorithm, and BestAdaptGWWAlgorithm. |
|
method for lowering the threshold( the delta has already been computed) Reimplemented in ThresholdGWWAlgorithm. |
|
elitism parameter : is the best particle put again in the population at each regroupment ( 1 yes, 0 no) |
|
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) |
|
the maximum number of iterations : useful when no threshold is managed (NothresholdGWWAlgorithm) |
|
parameter for stopping the walk in case of stagnation (1 yes, 0 no) |
|
number of particles |
|
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)) |
|
number of threshold changes (for the statistics) |
|
the threshold decrement (compted by thresholdcomputedelta) |
|
total number of moves between 2 regroupments (for the statistics) |
|
total number of move tries between 2 regroupments (for the statistics) |
|
the local search algorithm used |