toulbar2
Public Member Functions | Public Attributes | List of all members
LSAlgorithm Class Reference

#include <incop.h>

Inheritance diagram for LSAlgorithm:
Inheritance graph
[legend]
Collaboration diagram for LSAlgorithm:
Collaboration graph
[legend]

Public Member Functions

virtual int isfeasible (Move *move)
 
virtual int configurationmove (OpProblem *problem, Configuration *configuration)
 
int test_bestfound (Move *move)
 

Public Attributes

int walklength
 
NeighborhoodSearchnbhsearch
 
Metaheuristicmheur
 
int nhtries
 
int nbmoves
 
- Public Attributes inherited from IncompleteAlgorithm
Long threshold
 

Detailed Description

The class of local search algorithm on one particle : the random walk is parameterized with the walk lengh,a neighborhood and a metaheuristics

Member Function Documentation

◆ configurationmove()

int LSAlgorithm::configurationmove ( OpProblem problem,
Configuration configuration 
)
virtual

◆ isfeasible()

int LSAlgorithm::isfeasible ( Move move)
virtual

feasability of a move (under or at threshold level pour GWW walks)

Referenced by configurationmove().

◆ test_bestfound()

int LSAlgorithm::test_bestfound ( Move move)

test if a global best configuration has been found (returns 1 in that case)

References NeighborhoodSearch::maxneighbors, nbhsearch, nbmoves, and IncompleteAlgorithm::threshold.

Referenced by configurationmove().

Member Data Documentation

◆ mheur

Metaheuristic* LSAlgorithm::mheur

the metaheuristics used

Referenced by configurationmove().

◆ nbhsearch

NeighborhoodSearch* LSAlgorithm::nbhsearch

the way the neighborhood is explored

Referenced by configurationmove(), and test_bestfound().

◆ nbmoves

int LSAlgorithm::nbmoves

◆ nhtries

int LSAlgorithm::nhtries

number of move tries (for statistics)

Referenced by configurationmove(), and GWWAlgorithm::populationrandomwalk().

◆ walklength

int LSAlgorithm::walklength

walk length

Referenced by GWWAlgorithm::randomwalk().