toulbar2
|
#include <incop.h>
Public Member Functions | |
int | acceptance (Move *move, Configuration *config) |
int | nontabumove (Move *move) |
void | executebeforemove (Move *move, Configuration *configuration, OpProblem *problem) |
void | reinit (OpProblem *problem) |
virtual void | executebeforemove (Move *move, Configuration *configuration, OpProblem *problem) |
virtual void | reinit (OpProblem *problem) |
virtual int | acceptance (Move *move, Configuration *config) |
Public Attributes | |
int | tabulength |
list< Move * > | move_list |
Walk with using a tabu list : this list of moves is implemented by a list<Move*> structure , the actual class of the moves depend on the problems
|
virtual |
acceptance of a move : not in the tabulist (the aspiration criterion of a best is in the configurationmove algorithm)
Reimplemented from Metaheuristic.
Reimplemented in TabuAcceptingrate.
References nontabumove().
|
virtual |
updating of the tabulist which is managed as a FIFO of maximum length tabulength
Reimplemented from Metaheuristic.
References Move::computetabumove(), move_list, and tabulength.
int TabuSearch::nontabumove | ( | Move * | move | ) |
test of non presence in the tabulist (use of eqmove method)
References move_list.
Referenced by acceptance(), and TabuAcceptingrate::acceptance().
|
virtual |
list<Move*> TabuSearch::move_list |
tabu list : implemented FIFO
Referenced by executebeforemove(), nontabumove(), and reinit().
int TabuSearch::tabulength |
maximum length of the tabulist
Referenced by executebeforemove().