nojhan/paradiseo
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@543 331e1502-861f-0410-8da2-ba01fb791d7f

Browse source
This commit is contained in:
legrand 2007-07-05 11:46:12 +00:00
commit c0aa650dbf
185 changed files with 2197 additions and 2794 deletions
Download patch file Download diff file Expand all files Collapse all files

32
trunk/paradiseo-mo/doc/man/man3/moTS.3
View file

@ -1,4 +1,4 @@
.TH "moTS" 3 "27 Jun 2007" "Version 0.1" "PARADISEO-MO" \" -*- nroff -*-
.TH "moTS" 3 "5 Jul 2007" "Version 0.1" "PARADISEO-MO" \" -*- nroff -*-
.ad l
.nh
.SH NAME
@ -26,7 +26,7 @@ Inherits \fBmoAlgo< M::EOType >\fP.
.ti -1c
.RI "bool \fBoperator()\fP (\fBEOT\fP &__sol)"
.br
.RI "\fIFunction which launchs the Tabu Search. \fP"
.RI "\fI\fBFunction\fP which launchs the Tabu Search. \fP"
.in -1c
.SS "Private Types"
@ -56,18 +56,6 @@ Inherits \fBmoAlgo< M::EOType >\fP.
.br
.RI "\fIFull evaluation function. \fP"
.in -1c
.SS "Static Private Attributes"
.in +1c
.ti -1c
.RI "static bool \fBfirst_time\fP = true"
.br
.RI "\fIBoolean allowing to initialise the ptread_mutex_t in the constructor. \fP"
.ti -1c
.RI "static pthread_mutex_t \fBmutex\fP"
.br
.RI "\fIThe lock. \fP"
.in -1c
.SH "Detailed Description"
.PP
@ -76,7 +64,7 @@ Tabu Search (TS).
Generic algorithm that describes a tabu search.
.PP
Definition at line 30 of file moTS.h.
Definition at line 29 of file moTS.h.
.SH "Constructor & Destructor Documentation"
.PP
.SS "template<class M> \fBmoTS\fP< M >::\fBmoTS\fP (\fBmoMoveInit\fP< M > & __move_init, \fBmoNextMove\fP< M > & __next_move, \fBmoMoveIncrEval\fP< M > & __incr_eval, \fBmoTabuList\fP< M > & __tabu_list, \fBmoAspirCrit\fP< M > & __aspir_crit, \fBmoSolContinue\fP< \fBEOT\fP > & __cont, \fBeoEvalFunc\fP< \fBEOT\fP > & __full_eval)\fC [inline]\fP"
@ -104,9 +92,7 @@ In this constructor, a \fBmoTSMoveLoopExpl\fP is instanciated.
.PP
.PP
Definition at line 59 of file moTS.h.
.PP
References moTS< M >::first_time, and moTS< M >::mutex.
Definition at line 58 of file moTS.h.
.SS "template<class M> \fBmoTS\fP< M >::\fBmoTS\fP (\fBmoMoveExpl\fP< M > & __move_expl, \fBmoSolContinue\fP< \fBEOT\fP > & __cont, \fBeoEvalFunc\fP< \fBEOT\fP > & __full_eval)\fC [inline]\fP"
.PP
Constructor with less parameters.
@ -124,14 +110,12 @@ The explorer is given in the parameters.
.PP
.PP
Definition at line 81 of file moTS.h.
.PP
References moTS< M >::first_time, and moTS< M >::mutex.
Definition at line 71 of file moTS.h.
.SH "Member Function Documentation"
.PP
.SS "template<class M> bool \fBmoTS\fP< M >::operator() (\fBEOT\fP & __sol)\fC [inline, virtual]\fP"
.PP
Function which launchs the Tabu Search.
\fBFunction\fP which launchs the Tabu Search.
.PP
Algorithm of the tabu search. As a \fBmoSA\fP or a \fBmoHC\fP, it can be used for HYBRIDATION in an evolutionary algorithm. For security a lock (pthread_mutex_t) is closed during the algorithm.
.PP
@ -149,9 +133,9 @@ TRUE.
.PP
Implements \fBeoUF< M::EOType &, bool >\fP.
.PP
Definition at line 104 of file moTS.h.
Definition at line 85 of file moTS.h.
.PP
References moTS< M >::cont, moTS< M >::full_eval, moTS< M >::move_expl, and moTS< M >::mutex.
References moTS< M >::cont, moTS< M >::full_eval, and moTS< M >::move_expl.
.SH "Author"
.PP