mets::tabu_list_chain Class Reference [Tabu Search]

An abstract tabu list. More...

#include <tabu-search.hh>

Inheritance diagram for mets::tabu_list_chain:

Collaboration diagram for mets::tabu_list_chain:

List of all members.

Public Member Functions
	tabu_list_chain (const tabu_list_chain &)
	purposely not implemented (see Effective C++)
tabu_list_chain &	operator= (const tabu_list_chain &)
	purposely not implemented (see Effective C++)
	tabu_list_chain (unsigned int tenure)
	Create an abstract tabu list with a certain tenure.
	tabu_list_chain (tabu_list_chain *next, unsigned int tenure)
	Create an abstract tabu list with a certain tenure and a chained tabu list that decorates this one.
virtual	~tabu_list_chain ()
	Virtual destructor.
virtual void	tabu (feasible_solution &sol, move &mov)=0
	Make a move tabu when starting from a certain solution.
virtual bool	is_tabu (feasible_solution &sol, move &mov) const =0
	True if the move is tabu for the given solution.
virtual unsigned int	tenure () const
	Tenure of this tabu list.
virtual void	tenure (unsigned int tenure)
	Tenure of this tabu list.
Protected Attributes
tabu_list_chain *	next_m
unsigned int	tenure_m

---

Detailed Description

An abstract tabu list.

This is chainable so that tabu lists can be decorated with other tabu lists.

---

Member Function Documentation

bool mets::tabu_list_chain::is_tabu	(	feasible_solution &	sol,
		move &	mov
	)			const [pure virtual]

True if the move is tabu for the given solution.

Different implementation can remember "tenure" moves, "tenure" solutions or some other peculiar fact that will avoid cycling. So it's not defined at this stage if a move will be tabu or not at a certain state of the search: this depends on the implementation.

Mind you! The solution here is the solution *before* applying the move: this is for efficiency reason.

Parameters:

	sol	The current working solution
	mov	The move to make tabu

Implemented in mets::simple_tabu_list.

void mets::tabu_list_chain::tabu	(	feasible_solution &	sol,
		move &	mov
	)			[pure virtual]

Make a move tabu when starting from a certain solution.

Different implementation can remember "tenure" moves, "tenure" solutions or some other peculiar fact that will avoid cycling.

Mind you! The solution here is the solution *before* applying the move: this is for efficiency reason.

Parameters:

	sol	The current working solution
	mov	The move to make tabu

Implemented in mets::simple_tabu_list.

virtual void mets::tabu_list_chain::tenure

(

unsigned int

tenure

)

[inline, virtual]

Tenure of this tabu list.

Parameters:

tenure,:

the new tenure of the list.

virtual unsigned int mets::tabu_list_chain::tenure

(

)

const [inline, virtual]

Tenure of this tabu list.

The tenure is the length of the tabu-list (the order of the tabu memory)

---

The documentation for this class was generated from the following file:

• metslib/tabu-search.hh