#include <mets.h>
Inheritance diagram for mets::simple_tabu_list:
This class implements one of the simplest and less memory hungry tabu lists. This tabu list memorizes only the moves (not the solutions).
Moves must be of mets::mana_move type.
The comparison between moves is demanded to the move implementation.
A mets::mana_move is tabu if it's in the tabu list by means of its operator== and hash function.
Public Types | |
typedef std::deque< move * >::const_iterator | const_iterator |
Tabu list iterator. | |
typedef std::deque< move * >::size_type | size_type |
Tabu list size type. | |
Public Member Functions | |
simple_tabu_list (unsigned int tenure) | |
Ctor. Makes a tabu list of the specified tenure. | |
simple_tabu_list (tabu_list_chain *next, unsigned int tenure) | |
Ctor. Makes a tabu list of the specified tenure. | |
~simple_tabu_list () | |
Destructor. | |
const_iterator | begin () const |
const_iterator | end () const |
void | tabu (feasible_solution &sol, move &mov) |
Make move a tabu. | |
bool | is_tabu (feasible_solution &sol, move &mov) |
True if the move is tabu for the given solution. | |
virtual unsigned int | tenure () |
Tenure of this tabu list. | |
unsigned int | tenure (unsigned int tenure_value) |
Change the tenure (length) of this tabu list. | |
Protected Types | |
typedef std::deque< move * > | move_list_type |
typedef std::tr1::unordered_map< mana_move *, int, mana_move_hash, dereferenced_equal_to< mana_move * > > | move_map_type |
Protected Attributes | |
move_list_type | tabu_moves_m |
move_map_type | tabu_hash_m |
mets::simple_tabu_list::simple_tabu_list | ( | unsigned int | tenure | ) | [inline] |
Ctor. Makes a tabu list of the specified tenure.
tenure | Tenure (length) of the tabu list |
mets::simple_tabu_list::simple_tabu_list | ( | tabu_list_chain * | next, | |
unsigned int | tenure | |||
) | [inline] |
Ctor. Makes a tabu list of the specified tenure.
tenure | Tenure (length) of the tabu list | |
next | Next list to invoke when this returns false |
bool mets::simple_tabu_list::is_tabu | ( | feasible_solution & | sol, | |
move & | mov | |||
) | [virtual] |
True if the move is tabu for the given solution.
This implementation considers tabu each move already made less then tenure() moves ago.
sol | The current working solution | |
mov | The move to make tabu |
Implements mets::tabu_list_chain.
void mets::simple_tabu_list::tabu | ( | feasible_solution & | sol, | |
move & | mov | |||
) | [virtual] |
Make move a tabu.
This implementation simply remembers "tenure" moves.
sol | The current working solution | |
mov | The move to make tabu |
Implements mets::tabu_list_chain.
unsigned int mets::simple_tabu_list::tenure | ( | unsigned int | tenure_value | ) | [inline, virtual] |
Change the tenure (length) of this tabu list.
tenure,: | the new tenure of the list. |
Implements mets::tabu_list_chain.
virtual unsigned int mets::simple_tabu_list::tenure | ( | ) | [inline, virtual] |
Tenure of this tabu list.
The tenure is the length of the tabu-list (the order of the tabu memory)
Reimplemented from mets::tabu_list_chain.
Return to METSlib home page