#include <incop.h>
Inheritance diagram for LSAlgorithm:
Public Member Functions | |
LSAlgorithm (int nbmov) | |
virtual int | isfeasible (Move *move) |
void | randomwalk (OpProblem *problem, Configuration *configuration) |
virtual int | configurationmove (OpProblem *problem, Configuration *configuration) |
void | initthreshold (Configuration **population, int popsize) |
void | run (OpProblem *problem, Configuration **population) |
int | test_bestfound (Move *move) |
Public Attributes | |
int | walklength |
NeighborhoodSearch * | nbhsearch |
Metaheuristic * | mheur |
int | nhtries |
double | avgnhtries |
double | avgsqnhtries |
int | nbmoves |
|
Neighborhood exploration algorithm for selecting and do a move from the current configuration : returns 1 if a move has been done and 0 if no move has been done |
|
feasability of a move (under or at threshold level pour GWW walks) |
|
walk for a particule Reimplemented from IncompleteAlgorithm. |
|
Run the algorithm on a population (array of configurations) Reimplemented from IncompleteAlgorithm. |
|
test if a global best configuration has been found (returns 1 in that case) |
|
the metaheuristics used |
|
the way the neighborhood is explored |
|
number of moves done |
|
number of move tries (for statistics) |
|
walk length |