moRandImprSelect.h minor correction
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@888 331e1502-861f-0410-8da2-ba01fb791d7f
This commit is contained in:
parent
a082e32513
commit
b3a9c32658
286 changed files with 1 additions and 27161 deletions
|
|
@ -1,27 +0,0 @@
|
|||
.TH "moAlgo" 3 "15 Jan 2008" "Version 1.0" "ParadisEO-MOMovingObjects" \" -*- nroff -*-
|
||||
.ad l
|
||||
.nh
|
||||
.SH NAME
|
||||
moAlgo \- Description of an algorithm of the paradiseo-mo library.
|
||||
|
||||
.PP
|
||||
.SH SYNOPSIS
|
||||
.br
|
||||
.PP
|
||||
\fC#include <moAlgo.h>\fP
|
||||
.PP
|
||||
Inherits \fBeoMonOp< EOT >\fP.
|
||||
.PP
|
||||
.SH "Detailed Description"
|
||||
.PP
|
||||
|
||||
.SS "template<class EOT> class moAlgo< EOT >"
|
||||
Description of an algorithm of the paradiseo-mo library.
|
||||
|
||||
\fBmoHC\fP, \fBmoTS\fP and \fBmoSA\fP are 3 examples of algorithm of the paradiseo-mo library.
|
||||
.PP
|
||||
Definition at line 46 of file moAlgo.h.
|
||||
|
||||
.SH "Author"
|
||||
.PP
|
||||
Generated automatically by Doxygen for ParadisEO-MOMovingObjects from the source code.
|
||||
|
|
@ -1,46 +0,0 @@
|
|||
.TH "moAspirCrit" 3 "15 Jan 2008" "Version 1.0" "ParadisEO-MOMovingObjects" \" -*- nroff -*-
|
||||
.ad l
|
||||
.nh
|
||||
.SH NAME
|
||||
moAspirCrit \- Description of the conditions in which a tabu move could be accepted.
|
||||
|
||||
.PP
|
||||
.SH SYNOPSIS
|
||||
.br
|
||||
.PP
|
||||
\fC#include <moAspirCrit.h>\fP
|
||||
.PP
|
||||
Inherits \fBeoBF< A1, A2, R >< const const M &, M::EOType::Fitness &, bool >\fP.
|
||||
.PP
|
||||
Inherited by \fBmoImprBestFitAspirCrit< M >\fP, and \fBmoNoAspirCrit< M >\fP.
|
||||
.PP
|
||||
.SS "Public Member Functions"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "virtual void \fBinit\fP ()=0"
|
||||
.br
|
||||
.RI "\fIProcedure which initialises all that needs an aspiration criterion. \fP"
|
||||
.in -1c
|
||||
.SH "Detailed Description"
|
||||
.PP
|
||||
|
||||
.SS "template<class M> class moAspirCrit< M >"
|
||||
Description of the conditions in which a tabu move could be accepted.
|
||||
|
||||
It is only a description... An object that herits from this class is needed to be used in a \fBmoTS\fP. See moNoAspriCrit for example.
|
||||
.PP
|
||||
Definition at line 47 of file moAspirCrit.h.
|
||||
.SH "Member Function Documentation"
|
||||
.PP
|
||||
.SS "template<class M> virtual void \fBmoAspirCrit\fP< M >::init ()\fC [pure virtual]\fP"
|
||||
.PP
|
||||
Procedure which initialises all that needs an aspiration criterion.
|
||||
.PP
|
||||
It can be possible that this procedure does nothing...
|
||||
.PP
|
||||
Implemented in \fBmoImprBestFitAspirCrit< M >\fP, and \fBmoNoAspirCrit< M >\fP.
|
||||
|
||||
.SH "Author"
|
||||
.PP
|
||||
Generated automatically by Doxygen for ParadisEO-MOMovingObjects from the source code.
|
||||
|
|
@ -1,128 +0,0 @@
|
|||
.TH "moBestImprSelect" 3 "15 Jan 2008" "Version 1.0" "ParadisEO-MOMovingObjects" \" -*- nroff -*-
|
||||
.ad l
|
||||
.nh
|
||||
.SH NAME
|
||||
moBestImprSelect \- One of the possible \fBmoMoveSelect\fP.
|
||||
|
||||
.PP
|
||||
.SH SYNOPSIS
|
||||
.br
|
||||
.PP
|
||||
\fC#include <moBestImprSelect.h>\fP
|
||||
.PP
|
||||
Inherits \fBmoMoveSelect< M >< M >\fP.
|
||||
.PP
|
||||
.SS "Public Types"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "typedef M::EOType::Fitness \fBFitness\fP"
|
||||
.br
|
||||
.RI "\fIAlias for the fitness. \fP"
|
||||
.in -1c
|
||||
.SS "Public Member Functions"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "void \fBinit\fP (const \fBFitness\fP &_fitness)"
|
||||
.br
|
||||
.RI "\fIProcedure which initialise the exploration. \fP"
|
||||
.ti -1c
|
||||
.RI "bool \fBupdate\fP (const M &_move, const \fBFitness\fP &_fitness)"
|
||||
.br
|
||||
.RI "\fI\fBFunction\fP that indicates if the current move has not improved the fitness. \fP"
|
||||
.ti -1c
|
||||
.RI "void \fBoperator()\fP (M &_move, \fBFitness\fP &_fitness)"
|
||||
.br
|
||||
.RI "\fIProcedure which saved the best move and fitness. \fP"
|
||||
.in -1c
|
||||
.SS "Private Attributes"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "bool \fBfirst_time\fP"
|
||||
.br
|
||||
.RI "\fIAllowing to know if at least one move has been generated. \fP"
|
||||
.ti -1c
|
||||
.RI "M \fBbest_move\fP"
|
||||
.br
|
||||
.RI "\fIThe best move. \fP"
|
||||
.ti -1c
|
||||
.RI "\fBFitness\fP \fBbest_fitness\fP"
|
||||
.br
|
||||
.RI "\fIThe best fitness. \fP"
|
||||
.in -1c
|
||||
.SH "Detailed Description"
|
||||
.PP
|
||||
|
||||
.SS "template<class M> class moBestImprSelect< M >"
|
||||
One of the possible \fBmoMoveSelect\fP.
|
||||
|
||||
All neighbors are considered, and the movement which enables the best improvement is selected.
|
||||
.PP
|
||||
Definition at line 47 of file moBestImprSelect.h.
|
||||
.SH "Member Function Documentation"
|
||||
.PP
|
||||
.SS "template<class M> void \fBmoBestImprSelect\fP< M >::init (const \fBFitness\fP & _fitness)\fC [inline, virtual]\fP"
|
||||
.PP
|
||||
Procedure which initialise the exploration.
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_fitness\fP The current fitness.
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Implements \fBmoMoveSelect< M >\fP.
|
||||
.PP
|
||||
Definition at line 58 of file moBestImprSelect.h.
|
||||
.PP
|
||||
References moBestImprSelect< M >::first_time.
|
||||
.SS "template<class M> bool \fBmoBestImprSelect\fP< M >::update (const M & _move, const \fBFitness\fP & _fitness)\fC [inline, virtual]\fP"
|
||||
.PP
|
||||
\fBFunction\fP that indicates if the current move has not improved the fitness.
|
||||
.PP
|
||||
If the given fitness enables an improvment, the move (\fBmoMove\fP) and the fitness linked to this move are saved.
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_move\fP a move.
|
||||
.br
|
||||
\fI_fitness\fP a fitness linked to the move.
|
||||
.RE
|
||||
.PP
|
||||
\fBReturns:\fP
|
||||
.RS 4
|
||||
TRUE if the move does not improve the fitness.
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Implements \fBmoMoveSelect< M >\fP.
|
||||
.PP
|
||||
Definition at line 76 of file moBestImprSelect.h.
|
||||
.PP
|
||||
References moBestImprSelect< M >::best_fitness, moBestImprSelect< M >::best_move, and moBestImprSelect< M >::first_time.
|
||||
.SS "template<class M> void \fBmoBestImprSelect\fP< M >::operator() (M & _move, \fBFitness\fP & _fitness)\fC [inline, virtual]\fP"
|
||||
.PP
|
||||
Procedure which saved the best move and fitness.
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_move\fP the current move (result of the procedure).
|
||||
.br
|
||||
\fI_fitness\fP the current fitness (result of the procedure).
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Implements \fBeoBF< M &, M::EOType::Fitness &, void >\fP.
|
||||
.PP
|
||||
Definition at line 94 of file moBestImprSelect.h.
|
||||
.PP
|
||||
References moBestImprSelect< M >::best_fitness, moBestImprSelect< M >::best_move, and moBestImprSelect< M >::first_time.
|
||||
|
||||
.SH "Author"
|
||||
.PP
|
||||
Generated automatically by Doxygen for ParadisEO-MOMovingObjects from the source code.
|
||||
|
|
@ -1,29 +0,0 @@
|
|||
.TH "moComparator" 3 "15 Jan 2008" "Version 1.0" "ParadisEO-MOMovingObjects" \" -*- nroff -*-
|
||||
.ad l
|
||||
.nh
|
||||
.SH NAME
|
||||
moComparator \- Template for classes which need to compare two EOT and indicate if the first is 'better' than the second.
|
||||
|
||||
.PP
|
||||
.SH SYNOPSIS
|
||||
.br
|
||||
.PP
|
||||
\fC#include <moComparator.h>\fP
|
||||
.PP
|
||||
Inherits \fBeoBF< A1, A2, R >< const const EOT &, EOT &, bool >\fP.
|
||||
.PP
|
||||
Inherited by \fBmoFitComparator< EOT >\fP.
|
||||
.PP
|
||||
.SH "Detailed Description"
|
||||
.PP
|
||||
|
||||
.SS "template<class EOT> class moComparator< EOT >"
|
||||
Template for classes which need to compare two EOT and indicate if the first is 'better' than the second.
|
||||
|
||||
The objects that extend this template describe how an EOT is 'better' than an other.
|
||||
.PP
|
||||
Definition at line 45 of file moComparator.h.
|
||||
|
||||
.SH "Author"
|
||||
.PP
|
||||
Generated automatically by Doxygen for ParadisEO-MOMovingObjects from the source code.
|
||||
|
|
@ -1,27 +0,0 @@
|
|||
.TH "moCoolingSchedule" 3 "15 Jan 2008" "Version 1.0" "ParadisEO-MOMovingObjects" \" -*- nroff -*-
|
||||
.ad l
|
||||
.nh
|
||||
.SH NAME
|
||||
moCoolingSchedule \- This class gives the description of a cooling schedule.
|
||||
|
||||
.PP
|
||||
.SH SYNOPSIS
|
||||
.br
|
||||
.PP
|
||||
\fC#include <moCoolingSchedule.h>\fP
|
||||
.PP
|
||||
Inherits \fBeoUF< double &, bool >\fP.
|
||||
.PP
|
||||
Inherited by \fBmoExponentialCoolingSchedule\fP, and \fBmoLinearCoolingSchedule\fP.
|
||||
.PP
|
||||
.SH "Detailed Description"
|
||||
.PP
|
||||
This class gives the description of a cooling schedule.
|
||||
|
||||
It is only a description... An object that herits from this class is needed to be used in a \fBmoSA\fP. See \fBmoExponentialCoolingSchedule\fP or \fBmoLinearCoolingSchedule\fP for example.
|
||||
.PP
|
||||
Definition at line 46 of file moCoolingSchedule.h.
|
||||
|
||||
.SH "Author"
|
||||
.PP
|
||||
Generated automatically by Doxygen for ParadisEO-MOMovingObjects from the source code.
|
||||
|
|
@ -1,90 +0,0 @@
|
|||
.TH "moExponentialCoolingSchedule" 3 "15 Jan 2008" "Version 1.0" "ParadisEO-MOMovingObjects" \" -*- nroff -*-
|
||||
.ad l
|
||||
.nh
|
||||
.SH NAME
|
||||
moExponentialCoolingSchedule \- One of the possible \fBmoCoolingSchedule\fP.
|
||||
|
||||
.PP
|
||||
.SH SYNOPSIS
|
||||
.br
|
||||
.PP
|
||||
\fC#include <moExponentialCoolingSchedule.h>\fP
|
||||
.PP
|
||||
Inherits \fBmoCoolingSchedule\fP.
|
||||
.PP
|
||||
.SS "Public Member Functions"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "\fBmoExponentialCoolingSchedule\fP (double _threshold, double _ratio)"
|
||||
.br
|
||||
.RI "\fISimple constructor. \fP"
|
||||
.ti -1c
|
||||
.RI "bool \fBoperator()\fP (double &_temperature)"
|
||||
.br
|
||||
.RI "\fI\fBFunction\fP which proceeds to the cooling. \fP"
|
||||
.in -1c
|
||||
.SS "Private Attributes"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "double \fBthreshold\fP"
|
||||
.br
|
||||
.RI "\fIThe temperature threhold. \fP"
|
||||
.ti -1c
|
||||
.RI "double \fBratio\fP"
|
||||
.br
|
||||
.RI "\fIThe decreasing factor of the temperature. \fP"
|
||||
.in -1c
|
||||
.SH "Detailed Description"
|
||||
.PP
|
||||
One of the possible \fBmoCoolingSchedule\fP.
|
||||
|
||||
An other very simple cooling schedule, the temperature decrease according to a ratio while the temperature is greater than a given threshold.
|
||||
.PP
|
||||
Definition at line 46 of file moExponentialCoolingSchedule.h.
|
||||
.SH "Constructor & Destructor Documentation"
|
||||
.PP
|
||||
.SS "moExponentialCoolingSchedule::moExponentialCoolingSchedule (double _threshold, double _ratio)\fC [inline]\fP"
|
||||
.PP
|
||||
Simple constructor.
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_threshold\fP the threshold.
|
||||
.br
|
||||
\fI_ratio\fP the ratio used to descrease the temperature.
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Definition at line 55 of file moExponentialCoolingSchedule.h.
|
||||
.SH "Member Function Documentation"
|
||||
.PP
|
||||
.SS "bool moExponentialCoolingSchedule::operator() (double & _temperature)\fC [inline, virtual]\fP"
|
||||
.PP
|
||||
\fBFunction\fP which proceeds to the cooling.
|
||||
.PP
|
||||
It decreases the temperature and indicates if it is greater than the threshold.
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_temperature\fP the current temperature.
|
||||
.RE
|
||||
.PP
|
||||
\fBReturns:\fP
|
||||
.RS 4
|
||||
if the new temperature (current temperature * ratio) is greater than the threshold.
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Implements \fBeoUF< double &, bool >\fP.
|
||||
.PP
|
||||
Definition at line 65 of file moExponentialCoolingSchedule.h.
|
||||
.PP
|
||||
References ratio, and threshold.
|
||||
|
||||
.SH "Author"
|
||||
.PP
|
||||
Generated automatically by Doxygen for ParadisEO-MOMovingObjects from the source code.
|
||||
|
|
@ -1,134 +0,0 @@
|
|||
.TH "moFirstImprSelect" 3 "15 Jan 2008" "Version 1.0" "ParadisEO-MOMovingObjects" \" -*- nroff -*-
|
||||
.ad l
|
||||
.nh
|
||||
.SH NAME
|
||||
moFirstImprSelect \- One possible \fBmoMoveSelect\fP.
|
||||
|
||||
.PP
|
||||
.SH SYNOPSIS
|
||||
.br
|
||||
.PP
|
||||
\fC#include <moFirstImprSelect.h>\fP
|
||||
.PP
|
||||
Inherits \fBmoMoveSelect< M >< M >\fP.
|
||||
.PP
|
||||
.SS "Public Types"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "typedef M::EOType::Fitness \fBFitness\fP"
|
||||
.br
|
||||
.RI "\fIAlias for the fitness. \fP"
|
||||
.in -1c
|
||||
.SS "Public Member Functions"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "virtual void \fBinit\fP (const \fBFitness\fP &_fitness)"
|
||||
.br
|
||||
.RI "\fIProcedure which initialise the exploration. \fP"
|
||||
.ti -1c
|
||||
.RI "bool \fBupdate\fP (const M &_move, const \fBFitness\fP &_fitness)"
|
||||
.br
|
||||
.RI "\fI\fBFunction\fP that indicates if the current move has not improved the fitness. \fP"
|
||||
.ti -1c
|
||||
.RI "void \fBoperator()\fP (M &_move, \fBFitness\fP &_fitness)"
|
||||
.br
|
||||
.RI "\fIProcedure which saved the best move and fitness. \fP"
|
||||
.in -1c
|
||||
.SS "Private Attributes"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "bool \fBvalid\fP"
|
||||
.br
|
||||
.RI "\fIAllow to know if at least one move has improved the solution. \fP"
|
||||
.ti -1c
|
||||
.RI "M \fBbest_move\fP"
|
||||
.br
|
||||
.RI "\fIBest stored movement. \fP"
|
||||
.ti -1c
|
||||
.RI "\fBFitness\fP \fBinitial_fitness\fP"
|
||||
.br
|
||||
.RI "\fIInitial fitness. \fP"
|
||||
.ti -1c
|
||||
.RI "\fBFitness\fP \fBbest_fitness\fP"
|
||||
.br
|
||||
.RI "\fIBest stored fitness. \fP"
|
||||
.in -1c
|
||||
.SH "Detailed Description"
|
||||
.PP
|
||||
|
||||
.SS "template<class M> class moFirstImprSelect< M >"
|
||||
One possible \fBmoMoveSelect\fP.
|
||||
|
||||
The neighborhood is explored until a move enables an improvment of the current solution.
|
||||
.PP
|
||||
Definition at line 48 of file moFirstImprSelect.h.
|
||||
.SH "Member Function Documentation"
|
||||
.PP
|
||||
.SS "template<class M> virtual void \fBmoFirstImprSelect\fP< M >::init (const \fBFitness\fP & _fitness)\fC [inline, virtual]\fP"
|
||||
.PP
|
||||
Procedure which initialise the exploration.
|
||||
.PP
|
||||
It save the current fitness as the initial value for the fitness.
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_fitness\fP The current fitness.
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Implements \fBmoMoveSelect< M >\fP.
|
||||
.PP
|
||||
Definition at line 60 of file moFirstImprSelect.h.
|
||||
.PP
|
||||
References moFirstImprSelect< M >::initial_fitness, and moFirstImprSelect< M >::valid.
|
||||
.SS "template<class M> bool \fBmoFirstImprSelect\fP< M >::update (const M & _move, const \fBFitness\fP & _fitness)\fC [inline, virtual]\fP"
|
||||
.PP
|
||||
\fBFunction\fP that indicates if the current move has not improved the fitness.
|
||||
.PP
|
||||
If the given fitness enables an improvment, the move (\fBmoMove\fP) should be applied to the current solution.
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_move\fP a move.
|
||||
.br
|
||||
\fI_fitness\fP a fitness linked to the move.
|
||||
.RE
|
||||
.PP
|
||||
\fBReturns:\fP
|
||||
.RS 4
|
||||
true if the move does not improve the fitness.
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Implements \fBmoMoveSelect< M >\fP.
|
||||
.PP
|
||||
Definition at line 75 of file moFirstImprSelect.h.
|
||||
.PP
|
||||
References moFirstImprSelect< M >::best_fitness, moFirstImprSelect< M >::best_move, moFirstImprSelect< M >::initial_fitness, and moFirstImprSelect< M >::valid.
|
||||
.SS "template<class M> void \fBmoFirstImprSelect\fP< M >::operator() (M & _move, \fBFitness\fP & _fitness)\fC [inline, virtual]\fP"
|
||||
.PP
|
||||
Procedure which saved the best move and fitness.
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_move\fP the current move (result of the procedure).
|
||||
.br
|
||||
\fI_fitness\fP the current fitness (result of the procedure).
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Implements \fBeoBF< M &, M::EOType::Fitness &, void >\fP.
|
||||
.PP
|
||||
Definition at line 96 of file moFirstImprSelect.h.
|
||||
.PP
|
||||
References moFirstImprSelect< M >::best_fitness, moFirstImprSelect< M >::best_move, and moFirstImprSelect< M >::valid.
|
||||
|
||||
.SH "Author"
|
||||
.PP
|
||||
Generated automatically by Doxygen for ParadisEO-MOMovingObjects from the source code.
|
||||
|
|
@ -1,56 +0,0 @@
|
|||
.TH "moFitComparator" 3 "15 Jan 2008" "Version 1.0" "ParadisEO-MOMovingObjects" \" -*- nroff -*-
|
||||
.ad l
|
||||
.nh
|
||||
.SH NAME
|
||||
moFitComparator \- Comparison according to the fitness.
|
||||
|
||||
.PP
|
||||
.SH SYNOPSIS
|
||||
.br
|
||||
.PP
|
||||
\fC#include <moFitComparator.h>\fP
|
||||
.PP
|
||||
Inherits \fBmoComparator< EOT >< EOT >\fP.
|
||||
.PP
|
||||
.SS "Public Member Functions"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "bool \fBoperator()\fP (const EOT &_solution1, const EOT &_solution2)"
|
||||
.br
|
||||
.RI "\fI\fBFunction\fP which makes the comparison and gives the result. \fP"
|
||||
.in -1c
|
||||
.SH "Detailed Description"
|
||||
.PP
|
||||
|
||||
.SS "template<class EOT> class moFitComparator< EOT >"
|
||||
Comparison according to the fitness.
|
||||
|
||||
An EOT is better than an other if its fitness is better.
|
||||
.PP
|
||||
Definition at line 46 of file moFitComparator.h.
|
||||
.SH "Member Function Documentation"
|
||||
.PP
|
||||
.SS "template<class EOT> bool \fBmoFitComparator\fP< EOT >::operator() (const EOT & _solution1, const EOT & _solution2)\fC [inline]\fP"
|
||||
.PP
|
||||
\fBFunction\fP which makes the comparison and gives the result.
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_solution1\fP The first solution.
|
||||
.br
|
||||
\fI_solution2\fP The second solution.
|
||||
.RE
|
||||
.PP
|
||||
\fBReturns:\fP
|
||||
.RS 4
|
||||
true if the fitness of the first solution is better than the second solution, false else.
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Definition at line 56 of file moFitComparator.h.
|
||||
|
||||
.SH "Author"
|
||||
.PP
|
||||
Generated automatically by Doxygen for ParadisEO-MOMovingObjects from the source code.
|
||||
|
|
@ -1,107 +0,0 @@
|
|||
.TH "moFitSolContinue" 3 "15 Jan 2008" "Version 1.0" "ParadisEO-MOMovingObjects" \" -*- nroff -*-
|
||||
.ad l
|
||||
.nh
|
||||
.SH NAME
|
||||
moFitSolContinue \- One possible stop criterion for a solution-based heuristic.
|
||||
|
||||
.PP
|
||||
.SH SYNOPSIS
|
||||
.br
|
||||
.PP
|
||||
\fC#include <moFitSolContinue.h>\fP
|
||||
.PP
|
||||
Inherits \fBmoSolContinue< EOT >< EOT >\fP.
|
||||
.PP
|
||||
.SS "Public Types"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "typedef EOT::Fitness \fBFitness\fP"
|
||||
.br
|
||||
.RI "\fIAlias for the fitness. \fP"
|
||||
.in -1c
|
||||
.SS "Public Member Functions"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "\fBmoFitSolContinue\fP (\fBFitness\fP _fitness)"
|
||||
.br
|
||||
.RI "\fIBasic constructor. \fP"
|
||||
.ti -1c
|
||||
.RI "bool \fBoperator()\fP (const EOT &_solution)"
|
||||
.br
|
||||
.RI "\fI\fBFunction\fP that activates the stopping criterion. \fP"
|
||||
.ti -1c
|
||||
.RI "void \fBinit\fP ()"
|
||||
.br
|
||||
.RI "\fIProcedure which allows to initialise all the stuff needed. \fP"
|
||||
.in -1c
|
||||
.SS "Private Attributes"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "\fBFitness\fP \fBfitness\fP"
|
||||
.br
|
||||
.RI "\fIFitness target. \fP"
|
||||
.in -1c
|
||||
.SH "Detailed Description"
|
||||
.PP
|
||||
|
||||
.SS "template<class EOT> class moFitSolContinue< EOT >"
|
||||
One possible stop criterion for a solution-based heuristic.
|
||||
|
||||
The stop criterion corresponds to a fitness threshold gained.
|
||||
.PP
|
||||
Definition at line 46 of file moFitSolContinue.h.
|
||||
.SH "Constructor & Destructor Documentation"
|
||||
.PP
|
||||
.SS "template<class EOT> \fBmoFitSolContinue\fP< EOT >::\fBmoFitSolContinue\fP (\fBFitness\fP _fitness)\fC [inline]\fP"
|
||||
.PP
|
||||
Basic constructor.
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_fitness\fP The fitness to reach.
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Definition at line 57 of file moFitSolContinue.h.
|
||||
.SH "Member Function Documentation"
|
||||
.PP
|
||||
.SS "template<class EOT> bool \fBmoFitSolContinue\fP< EOT >::operator() (const EOT & _solution)\fC [inline, virtual]\fP"
|
||||
.PP
|
||||
\fBFunction\fP that activates the stopping criterion.
|
||||
.PP
|
||||
Indicates if the fitness threshold has not yet been reached.
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_solution\fP the current solution.
|
||||
.RE
|
||||
.PP
|
||||
\fBReturns:\fP
|
||||
.RS 4
|
||||
true or false according to the value of the fitness.
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Implements \fBeoUF< const EOT &, bool >\fP.
|
||||
.PP
|
||||
Definition at line 67 of file moFitSolContinue.h.
|
||||
.PP
|
||||
References moFitSolContinue< EOT >::fitness.
|
||||
.SS "template<class EOT> void \fBmoFitSolContinue\fP< EOT >::init ()\fC [inline, virtual]\fP"
|
||||
.PP
|
||||
Procedure which allows to initialise all the stuff needed.
|
||||
.PP
|
||||
It can be also used to reinitialize all the needed things.
|
||||
.PP
|
||||
Implements \fBmoSolContinue< EOT >\fP.
|
||||
.PP
|
||||
Definition at line 81 of file moFitSolContinue.h.
|
||||
|
||||
.SH "Author"
|
||||
.PP
|
||||
Generated automatically by Doxygen for ParadisEO-MOMovingObjects from the source code.
|
||||
|
|
@ -1,105 +0,0 @@
|
|||
.TH "moGenSolContinue" 3 "15 Jan 2008" "Version 1.0" "ParadisEO-MOMovingObjects" \" -*- nroff -*-
|
||||
.ad l
|
||||
.nh
|
||||
.SH NAME
|
||||
moGenSolContinue \- One possible stop criterion for a solution-based heuristic.
|
||||
|
||||
.PP
|
||||
.SH SYNOPSIS
|
||||
.br
|
||||
.PP
|
||||
\fC#include <moGenSolContinue.h>\fP
|
||||
.PP
|
||||
Inherits \fBmoSolContinue< EOT >< EOT >\fP.
|
||||
.PP
|
||||
.SS "Public Member Functions"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "\fBmoGenSolContinue\fP (unsigned int _generationMaximumNumber)"
|
||||
.br
|
||||
.RI "\fISimple constructor. \fP"
|
||||
.ti -1c
|
||||
.RI "bool \fBoperator()\fP (const EOT &_solution)"
|
||||
.br
|
||||
.RI "\fI\fBFunction\fP that activates the stop criterion. \fP"
|
||||
.ti -1c
|
||||
.RI "void \fBinit\fP ()"
|
||||
.br
|
||||
.RI "\fIProcedure which allows to initialise the generation counter. \fP"
|
||||
.in -1c
|
||||
.SS "Private Attributes"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "unsigned int \fBgenerationMaximumNumber\fP"
|
||||
.br
|
||||
.RI "\fIIteration maximum number. \fP"
|
||||
.ti -1c
|
||||
.RI "unsigned int \fBgenerationNumber\fP"
|
||||
.br
|
||||
.RI "\fIIteration current number. \fP"
|
||||
.in -1c
|
||||
.SH "Detailed Description"
|
||||
.PP
|
||||
|
||||
.SS "template<class EOT> class moGenSolContinue< EOT >"
|
||||
One possible stop criterion for a solution-based heuristic.
|
||||
|
||||
The stop criterion corresponds to a maximum number of iteration.
|
||||
.PP
|
||||
Definition at line 46 of file moGenSolContinue.h.
|
||||
.SH "Constructor & Destructor Documentation"
|
||||
.PP
|
||||
.SS "template<class EOT> \fBmoGenSolContinue\fP< EOT >::\fBmoGenSolContinue\fP (unsigned int _generationMaximumNumber)\fC [inline]\fP"
|
||||
.PP
|
||||
Simple constructor.
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_generationMaximumNumber\fP The maximum number of generations.
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Definition at line 54 of file moGenSolContinue.h.
|
||||
.SH "Member Function Documentation"
|
||||
.PP
|
||||
.SS "template<class EOT> bool \fBmoGenSolContinue\fP< EOT >::operator() (const EOT & _solution)\fC [inline, virtual]\fP"
|
||||
.PP
|
||||
\fBFunction\fP that activates the stop criterion.
|
||||
.PP
|
||||
Increments the counter and returns TRUE if the current number of iteration is lower than the given maximum number of iterations.
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_solution\fP The current solution.
|
||||
.RE
|
||||
.PP
|
||||
\fBReturns:\fP
|
||||
.RS 4
|
||||
true or false according to the current generation number.
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Implements \fBeoUF< const EOT &, bool >\fP.
|
||||
.PP
|
||||
Definition at line 66 of file moGenSolContinue.h.
|
||||
.PP
|
||||
References moGenSolContinue< EOT >::generationMaximumNumber, and moGenSolContinue< EOT >::generationNumber.
|
||||
.SS "template<class EOT> void \fBmoGenSolContinue\fP< EOT >::init ()\fC [inline, virtual]\fP"
|
||||
.PP
|
||||
Procedure which allows to initialise the generation counter.
|
||||
.PP
|
||||
It can also be used to reset the iteration counter.
|
||||
.PP
|
||||
Implements \fBmoSolContinue< EOT >\fP.
|
||||
.PP
|
||||
Definition at line 78 of file moGenSolContinue.h.
|
||||
.PP
|
||||
References moGenSolContinue< EOT >::generationNumber.
|
||||
|
||||
.SH "Author"
|
||||
.PP
|
||||
Generated automatically by Doxygen for ParadisEO-MOMovingObjects from the source code.
|
||||
|
|
@ -1,132 +0,0 @@
|
|||
.TH "moHC" 3 "15 Jan 2008" "Version 1.0" "ParadisEO-MOMovingObjects" \" -*- nroff -*-
|
||||
.ad l
|
||||
.nh
|
||||
.SH NAME
|
||||
moHC \- Hill Climbing (HC).
|
||||
|
||||
.PP
|
||||
.SH SYNOPSIS
|
||||
.br
|
||||
.PP
|
||||
\fC#include <moHC.h>\fP
|
||||
.PP
|
||||
Inherits \fBmoAlgo< M::EOType >\fP.
|
||||
.PP
|
||||
.SS "Public Member Functions"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "\fBmoHC\fP (\fBmoMoveInit\fP< M > &_move_initializer, \fBmoNextMove\fP< M > &_next_move_generator, \fBmoMoveIncrEval\fP< M > &_incremental_evaluation, \fBmoMoveSelect\fP< M > &_move_selection, \fBeoEvalFunc\fP< \fBEOT\fP > &_full_evaluation)"
|
||||
.br
|
||||
.RI "\fIFull constructor. \fP"
|
||||
.ti -1c
|
||||
.RI "\fBmoHC\fP (\fBmoMoveExpl\fP< M > &_move_explorer, \fBeoEvalFunc\fP< \fBEOT\fP > &_full_evaluation)"
|
||||
.br
|
||||
.RI "\fILight constructor. \fP"
|
||||
.ti -1c
|
||||
.RI "bool \fBoperator()\fP (\fBEOT\fP &_solution)"
|
||||
.br
|
||||
.RI "\fI\fBFunction\fP which launches the HC. \fP"
|
||||
.in -1c
|
||||
.SS "Private Types"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "typedef M::EOType \fBEOT\fP"
|
||||
.br
|
||||
.RI "\fIAlias for the type. \fP"
|
||||
.ti -1c
|
||||
.RI "typedef EOT::Fitness \fBFitness\fP"
|
||||
.br
|
||||
.RI "\fIAlias for the fitness. \fP"
|
||||
.in -1c
|
||||
.SS "Private Attributes"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "\fBmoMoveExpl\fP< M > & \fBmove_explorer\fP"
|
||||
.br
|
||||
.RI "\fIComplete exploration of the neighborhood. \fP"
|
||||
.ti -1c
|
||||
.RI "\fBeoEvalFunc\fP< \fBEOT\fP > & \fBfull_evaluation\fP"
|
||||
.br
|
||||
.RI "\fIA full evaluation function. \fP"
|
||||
.in -1c
|
||||
.SH "Detailed Description"
|
||||
.PP
|
||||
|
||||
.SS "template<class M> class moHC< M >"
|
||||
Hill Climbing (HC).
|
||||
|
||||
Class which describes the algorithm for a hill climbing.
|
||||
.PP
|
||||
Definition at line 49 of file moHC.h.
|
||||
.SH "Constructor & Destructor Documentation"
|
||||
.PP
|
||||
.SS "template<class M> \fBmoHC\fP< M >::\fBmoHC\fP (\fBmoMoveInit\fP< M > & _move_initializer, \fBmoNextMove\fP< M > & _next_move_generator, \fBmoMoveIncrEval\fP< M > & _incremental_evaluation, \fBmoMoveSelect\fP< M > & _move_selection, \fBeoEvalFunc\fP< \fBEOT\fP > & _full_evaluation)\fC [inline]\fP"
|
||||
.PP
|
||||
Full constructor.
|
||||
.PP
|
||||
All the boxes are given in order the HC to use a \fBmoHCMoveLoopExpl\fP.
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_move_initializer\fP a move initialiser.
|
||||
.br
|
||||
\fI_next_move_generator\fP a neighborhood explorer.
|
||||
.br
|
||||
\fI_incremental_evaluation\fP a (generally) efficient evaluation function.
|
||||
.br
|
||||
\fI_move_selection\fP a move selector.
|
||||
.br
|
||||
\fI_full_evaluation\fP a full evaluation function.
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Definition at line 69 of file moHC.h.
|
||||
.SS "template<class M> \fBmoHC\fP< M >::\fBmoHC\fP (\fBmoMoveExpl\fP< M > & _move_explorer, \fBeoEvalFunc\fP< \fBEOT\fP > & _full_evaluation)\fC [inline]\fP"
|
||||
.PP
|
||||
Light constructor.
|
||||
.PP
|
||||
This constructor allow to use another \fBmoMoveExpl\fP (generally not a \fBmoHCMoveLoopExpl\fP).
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_move_explorer\fP a complete explorer.
|
||||
.br
|
||||
\fI_full_evaluation\fP a full evaluation function.
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Definition at line 82 of file moHC.h.
|
||||
.SH "Member Function Documentation"
|
||||
.PP
|
||||
.SS "template<class M> bool \fBmoHC\fP< M >::operator() (\fBEOT\fP & _solution)\fC [inline, virtual]\fP"
|
||||
.PP
|
||||
\fBFunction\fP which launches the HC.
|
||||
.PP
|
||||
The HC has to improve a current solution. As the \fBmoSA\fP and the mo TS, it can be used for HYBRIDATION in an evolutionnary algorithm.
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_solution\fP a current solution to improve.
|
||||
.RE
|
||||
.PP
|
||||
\fBReturns:\fP
|
||||
.RS 4
|
||||
true.
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Implements \fBeoUF< M::EOType &, bool >\fP.
|
||||
.PP
|
||||
Definition at line 94 of file moHC.h.
|
||||
.PP
|
||||
References moHC< M >::full_evaluation, and moHC< M >::move_explorer.
|
||||
|
||||
.SH "Author"
|
||||
.PP
|
||||
Generated automatically by Doxygen for ParadisEO-MOMovingObjects from the source code.
|
||||
|
|
@ -1,113 +0,0 @@
|
|||
.TH "moHCMoveLoopExpl" 3 "15 Jan 2008" "Version 1.0" "ParadisEO-MOMovingObjects" \" -*- nroff -*-
|
||||
.ad l
|
||||
.nh
|
||||
.SH NAME
|
||||
moHCMoveLoopExpl \- Iterative explorer used by a \fBmoHC\fP.
|
||||
|
||||
.PP
|
||||
.SH SYNOPSIS
|
||||
.br
|
||||
.PP
|
||||
\fC#include <moHCMoveLoopExpl.h>\fP
|
||||
.PP
|
||||
Inherits \fBmoMoveLoopExpl< M >< M >\fP.
|
||||
.PP
|
||||
.SS "Public Member Functions"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "\fBmoHCMoveLoopExpl\fP (\fBmoMoveInit\fP< M > &_move_initializer, \fBmoNextMove\fP< M > &_next_move_generator, \fBmoMoveIncrEval\fP< M > &_incremental_evaluation, \fBmoMoveSelect\fP< M > &_move_selection)"
|
||||
.br
|
||||
.RI "\fIConstructor. \fP"
|
||||
.ti -1c
|
||||
.RI "void \fBoperator()\fP (const \fBEOT\fP &_old_solution, \fBEOT\fP &_new_solution)"
|
||||
.br
|
||||
.RI "\fIProcedure which launches the explorer. \fP"
|
||||
.in -1c
|
||||
.SS "Private Types"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "typedef M::EOType \fBEOT\fP"
|
||||
.br
|
||||
.RI "\fIAlias for the type. \fP"
|
||||
.ti -1c
|
||||
.RI "typedef M::EOType::Fitness \fBFitness\fP"
|
||||
.br
|
||||
.RI "\fIAlias for the fitness. \fP"
|
||||
.in -1c
|
||||
.SS "Private Attributes"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "\fBmoMoveInit\fP< M > & \fBmove_initializer\fP"
|
||||
.br
|
||||
.RI "\fIMove initialiser. \fP"
|
||||
.ti -1c
|
||||
.RI "\fBmoNextMove\fP< M > & \fBnext_move_generator\fP"
|
||||
.br
|
||||
.RI "\fINeighborhood explorer. \fP"
|
||||
.ti -1c
|
||||
.RI "\fBmoMoveIncrEval\fP< M > & \fBincremental_evaluation\fP"
|
||||
.br
|
||||
.RI "\fI(generally) Efficient evaluation. \fP"
|
||||
.ti -1c
|
||||
.RI "\fBmoMoveSelect\fP< M > & \fBmove_selection\fP"
|
||||
.br
|
||||
.RI "\fIMove selector. \fP"
|
||||
.in -1c
|
||||
.SH "Detailed Description"
|
||||
.PP
|
||||
|
||||
.SS "template<class M> class moHCMoveLoopExpl< M >"
|
||||
Iterative explorer used by a \fBmoHC\fP.
|
||||
.PP
|
||||
Definition at line 47 of file moHCMoveLoopExpl.h.
|
||||
.SH "Constructor & Destructor Documentation"
|
||||
.PP
|
||||
.SS "template<class M> \fBmoHCMoveLoopExpl\fP< M >::\fBmoHCMoveLoopExpl\fP (\fBmoMoveInit\fP< M > & _move_initializer, \fBmoNextMove\fP< M > & _next_move_generator, \fBmoMoveIncrEval\fP< M > & _incremental_evaluation, \fBmoMoveSelect\fP< M > & _move_selection)\fC [inline]\fP"
|
||||
.PP
|
||||
Constructor.
|
||||
.PP
|
||||
All the boxes have to be specified.
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_move_initializer\fP The move initialiser.
|
||||
.br
|
||||
\fI_next_move_generator\fP The neighbourhood explorer.
|
||||
.br
|
||||
\fI_incremental_evaluation\fP (generally) Efficient evaluation function.
|
||||
.br
|
||||
\fI_move_selection\fP The move selector.
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Definition at line 66 of file moHCMoveLoopExpl.h.
|
||||
.SH "Member Function Documentation"
|
||||
.PP
|
||||
.SS "template<class M> void \fBmoHCMoveLoopExpl\fP< M >::operator() (const \fBEOT\fP & _old_solution, \fBEOT\fP & _new_solution)\fC [inline, virtual]\fP"
|
||||
.PP
|
||||
Procedure which launches the explorer.
|
||||
.PP
|
||||
The exploration starts from an old solution and provides a new solution.
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_old_solution\fP The current solution.
|
||||
.br
|
||||
\fI_new_solution\fP The new solution (result of the procedure).
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Implements \fBeoBF< const M::EOType &, M::EOType &, void >\fP.
|
||||
.PP
|
||||
Definition at line 79 of file moHCMoveLoopExpl.h.
|
||||
.PP
|
||||
References moHCMoveLoopExpl< M >::incremental_evaluation, moHCMoveLoopExpl< M >::move_initializer, moHCMoveLoopExpl< M >::move_selection, and moHCMoveLoopExpl< M >::next_move_generator.
|
||||
|
||||
.SH "Author"
|
||||
.PP
|
||||
Generated automatically by Doxygen for ParadisEO-MOMovingObjects from the source code.
|
||||
|
|
@ -1,220 +0,0 @@
|
|||
.TH "moILS" 3 "15 Jan 2008" "Version 1.0" "ParadisEO-MOMovingObjects" \" -*- nroff -*-
|
||||
.ad l
|
||||
.nh
|
||||
.SH NAME
|
||||
moILS \- Iterated Local Search (ILS).
|
||||
|
||||
.PP
|
||||
.SH SYNOPSIS
|
||||
.br
|
||||
.PP
|
||||
\fC#include <moILS.h>\fP
|
||||
.PP
|
||||
Inherits \fBmoAlgo< M::EOType >\fP.
|
||||
.PP
|
||||
.SS "Public Member Functions"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "\fBmoILS\fP (\fBmoAlgo\fP< \fBEOT\fP > &_algorithm, \fBmoSolContinue\fP< \fBEOT\fP > &_continue, \fBmoComparator\fP< \fBEOT\fP > &_acceptance_criterion, \fBeoMonOp\fP< \fBEOT\fP > &_perturbation, \fBeoEvalFunc\fP< \fBEOT\fP > &_full_evaluation)"
|
||||
.br
|
||||
.RI "\fIGeneric constructor. \fP"
|
||||
.ti -1c
|
||||
.RI "\fBmoILS\fP (\fBmoMoveInit\fP< M > &_move_initializer, \fBmoNextMove\fP< M > &_next_move_generator, \fBmoMoveIncrEval\fP< M > &_incremental_evaluation, \fBmoMoveSelect\fP< M > &_move_selection, \fBmoSolContinue\fP< \fBEOT\fP > &_continue, \fBmoComparator\fP< \fBEOT\fP > &_acceptance_criterion, \fBeoMonOp\fP< \fBEOT\fP > &_perturbation, \fBeoEvalFunc\fP< \fBEOT\fP > &_full_evaluation)"
|
||||
.br
|
||||
.RI "\fIConstructor for using a \fBmoHC\fP for the \fBmoAlgo\fP. \fP"
|
||||
.ti -1c
|
||||
.RI "\fBmoILS\fP (\fBmoMoveInit\fP< M > &_move_initializer, \fBmoNextMove\fP< M > &_next_move_generator, \fBmoMoveIncrEval\fP< M > &_incremental_evaluation, \fBmoTabuList\fP< M > &_tabu_list, \fBmoAspirCrit\fP< M > &_aspiration_criterion, \fBmoSolContinue\fP< \fBEOT\fP > &_moTS_continue, \fBmoSolContinue\fP< \fBEOT\fP > &_continue, \fBmoComparator\fP< \fBEOT\fP > &_acceptance_criterion, \fBeoMonOp\fP< \fBEOT\fP > &_perturbation, \fBeoEvalFunc\fP< \fBEOT\fP > &_full_evaluation)"
|
||||
.br
|
||||
.RI "\fIConstructor for using a \fBmoTS\fP for the \fBmoAlgo\fP. \fP"
|
||||
.ti -1c
|
||||
.RI "\fBmoILS\fP (\fBmoRandMove\fP< M > &_random_move_generator, \fBmoMoveIncrEval\fP< M > &_incremental_evaluation, \fBmoSolContinue\fP< \fBEOT\fP > &_moSA_continue, double _initial_temperature, \fBmoCoolingSchedule\fP &_cooling_schedule, \fBmoSolContinue\fP< \fBEOT\fP > &_continue, \fBmoComparator\fP< \fBEOT\fP > &_acceptance_criterion, \fBeoMonOp\fP< \fBEOT\fP > &_perturbation, \fBeoEvalFunc\fP< \fBEOT\fP > &_full_evaluation)"
|
||||
.br
|
||||
.RI "\fIConstructor for using a \fBmoSA\fP for the \fBmoAlgo\fP. \fP"
|
||||
.ti -1c
|
||||
.RI "bool \fBoperator()\fP (\fBEOT\fP &_solution)"
|
||||
.br
|
||||
.RI "\fI\fBFunction\fP which launches the ILS. \fP"
|
||||
.in -1c
|
||||
.SS "Private Types"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "typedef M::EOType \fBEOT\fP"
|
||||
.br
|
||||
.RI "\fIAlias for the type. \fP"
|
||||
.ti -1c
|
||||
.RI "typedef EOT::Fitness \fBFitness\fP"
|
||||
.br
|
||||
.RI "\fIAlias for the fitness. \fP"
|
||||
.in -1c
|
||||
.SS "Private Attributes"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "\fBmoAlgo\fP< \fBEOT\fP > & \fBalgorithm\fP"
|
||||
.br
|
||||
.RI "\fIThe solution based heuristic. \fP"
|
||||
.ti -1c
|
||||
.RI "\fBmoSolContinue\fP< \fBEOT\fP > & \fBcontinu\fP"
|
||||
.br
|
||||
.RI "\fIThe stopping criterion. \fP"
|
||||
.ti -1c
|
||||
.RI "\fBmoComparator\fP< \fBEOT\fP > & \fBacceptance_criterion\fP"
|
||||
.br
|
||||
.RI "\fIThe acceptance criterion. \fP"
|
||||
.ti -1c
|
||||
.RI "\fBeoMonOp\fP< \fBEOT\fP > & \fBperturbation\fP"
|
||||
.br
|
||||
.RI "\fIThe perturbation generator. \fP"
|
||||
.ti -1c
|
||||
.RI "\fBeoEvalFunc\fP< \fBEOT\fP > & \fBfull_evaluation\fP"
|
||||
.br
|
||||
.RI "\fIThe full evaluation function. \fP"
|
||||
.in -1c
|
||||
.SH "Detailed Description"
|
||||
.PP
|
||||
|
||||
.SS "template<class M> class moILS< M >"
|
||||
Iterated Local Search (ILS).
|
||||
|
||||
Class which describes the algorithm for a iterated local search.
|
||||
.PP
|
||||
Definition at line 50 of file moILS.h.
|
||||
.SH "Constructor & Destructor Documentation"
|
||||
.PP
|
||||
.SS "template<class M> \fBmoILS\fP< M >::\fBmoILS\fP (\fBmoAlgo\fP< \fBEOT\fP > & _algorithm, \fBmoSolContinue\fP< \fBEOT\fP > & _continue, \fBmoComparator\fP< \fBEOT\fP > & _acceptance_criterion, \fBeoMonOp\fP< \fBEOT\fP > & _perturbation, \fBeoEvalFunc\fP< \fBEOT\fP > & _full_evaluation)\fC [inline]\fP"
|
||||
.PP
|
||||
Generic constructor.
|
||||
.PP
|
||||
Generic constructor using a \fBmoAlgo\fP
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_algorithm\fP The solution based heuristic to use.
|
||||
.br
|
||||
\fI_continue\fP The stopping criterion.
|
||||
.br
|
||||
\fI_acceptance_criterion\fP The acceptance criterion.
|
||||
.br
|
||||
\fI_perturbation\fP The pertubation generator.
|
||||
.br
|
||||
\fI_full_evaluation\fP The evaluation function.
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Definition at line 70 of file moILS.h.
|
||||
.SS "template<class M> \fBmoILS\fP< M >::\fBmoILS\fP (\fBmoMoveInit\fP< M > & _move_initializer, \fBmoNextMove\fP< M > & _next_move_generator, \fBmoMoveIncrEval\fP< M > & _incremental_evaluation, \fBmoMoveSelect\fP< M > & _move_selection, \fBmoSolContinue\fP< \fBEOT\fP > & _continue, \fBmoComparator\fP< \fBEOT\fP > & _acceptance_criterion, \fBeoMonOp\fP< \fBEOT\fP > & _perturbation, \fBeoEvalFunc\fP< \fBEOT\fP > & _full_evaluation)\fC [inline]\fP"
|
||||
.PP
|
||||
Constructor for using a \fBmoHC\fP for the \fBmoAlgo\fP.
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_move_initializer\fP The move initialisation (for the \fBmoHC\fP).
|
||||
.br
|
||||
\fI_next_move_generator\fP The move generator (for the \fBmoHC\fP).
|
||||
.br
|
||||
\fI_incremental_evaluation\fP The partial evaluation function (for the \fBmoHC\fP).
|
||||
.br
|
||||
\fI_move_selection\fP The move selection strategy (for the \fBmoHC\fP).
|
||||
.br
|
||||
\fI_continue\fP The stopping criterion.
|
||||
.br
|
||||
\fI_acceptance_criterion\fP The acceptance criterion.
|
||||
.br
|
||||
\fI_perturbation\fP The pertubation generator.
|
||||
.br
|
||||
\fI_full_evaluation\fP The evaluation function.
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Definition at line 87 of file moILS.h.
|
||||
.SS "template<class M> \fBmoILS\fP< M >::\fBmoILS\fP (\fBmoMoveInit\fP< M > & _move_initializer, \fBmoNextMove\fP< M > & _next_move_generator, \fBmoMoveIncrEval\fP< M > & _incremental_evaluation, \fBmoTabuList\fP< M > & _tabu_list, \fBmoAspirCrit\fP< M > & _aspiration_criterion, \fBmoSolContinue\fP< \fBEOT\fP > & _moTS_continue, \fBmoSolContinue\fP< \fBEOT\fP > & _continue, \fBmoComparator\fP< \fBEOT\fP > & _acceptance_criterion, \fBeoMonOp\fP< \fBEOT\fP > & _perturbation, \fBeoEvalFunc\fP< \fBEOT\fP > & _full_evaluation)\fC [inline]\fP"
|
||||
.PP
|
||||
Constructor for using a \fBmoTS\fP for the \fBmoAlgo\fP.
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_move_initializer\fP The move initialisation (for the \fBmoTS\fP).
|
||||
.br
|
||||
\fI_next_move_generator\fP The move generator (for the \fBmoTS\fP).
|
||||
.br
|
||||
\fI_incremental_evaluation\fP The partial evaluation function (for the \fBmoTS\fP).
|
||||
.br
|
||||
\fI_tabu_list\fP The tabu list (for the \fBmoTS\fP !!!!).
|
||||
.br
|
||||
\fI_aspiration_criterion\fP The aspiration criterion (for the \fBmoTS\fP).
|
||||
.br
|
||||
\fI_moTS_continue\fP The stopping criterion (for the \fBmoTS\fP).
|
||||
.br
|
||||
\fI_continue\fP The stopping criterion.
|
||||
.br
|
||||
\fI_acceptance_criterion\fP The acceptance criterion.
|
||||
.br
|
||||
\fI_perturbation\fP The pertubation generator.
|
||||
.br
|
||||
\fI_full_evaluation\fP The evaluation function.
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Definition at line 108 of file moILS.h.
|
||||
.SS "template<class M> \fBmoILS\fP< M >::\fBmoILS\fP (\fBmoRandMove\fP< M > & _random_move_generator, \fBmoMoveIncrEval\fP< M > & _incremental_evaluation, \fBmoSolContinue\fP< \fBEOT\fP > & _moSA_continue, double _initial_temperature, \fBmoCoolingSchedule\fP & _cooling_schedule, \fBmoSolContinue\fP< \fBEOT\fP > & _continue, \fBmoComparator\fP< \fBEOT\fP > & _acceptance_criterion, \fBeoMonOp\fP< \fBEOT\fP > & _perturbation, \fBeoEvalFunc\fP< \fBEOT\fP > & _full_evaluation)\fC [inline]\fP"
|
||||
.PP
|
||||
Constructor for using a \fBmoSA\fP for the \fBmoAlgo\fP.
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_random_move_generator\fP The random move generator (for the \fBmoSA\fP).
|
||||
.br
|
||||
\fI_incremental_evaluation\fP The partial evaluation function (for the \fBmoSA\fP).
|
||||
.br
|
||||
\fI_moSA_continue\fP The stopping criterion (for the \fBmoSA\fP).
|
||||
.br
|
||||
\fI_initial_temperature\fP The initial temperature (for the \fBmoSA\fP).
|
||||
.br
|
||||
\fI_cooling_schedule\fP The cooling schedule (for the \fBmoSA\fP).
|
||||
.br
|
||||
\fI_continue\fP The stopping criterion.
|
||||
.br
|
||||
\fI_acceptance_criterion\fP The acceptance criterion.
|
||||
.br
|
||||
\fI_perturbation\fP The pertubation generator.
|
||||
.br
|
||||
\fI_full_evaluation\fP The evaluation function.
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Definition at line 130 of file moILS.h.
|
||||
.SH "Member Function Documentation"
|
||||
.PP
|
||||
.SS "template<class M> bool \fBmoILS\fP< M >::operator() (\fBEOT\fP & _solution)\fC [inline, virtual]\fP"
|
||||
.PP
|
||||
\fBFunction\fP which launches the ILS.
|
||||
.PP
|
||||
The ILS has to improve a current solution. As the \fBmoSA\fP, the \fBmoTS\fP and the \fBmoHC\fP, it can be used for HYBRIDATION in an evolutionnary algorithm.
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_solution\fP a current solution to improve.
|
||||
.RE
|
||||
.PP
|
||||
\fBReturns:\fP
|
||||
.RS 4
|
||||
true.
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Implements \fBeoUF< M::EOType &, bool >\fP.
|
||||
.PP
|
||||
Definition at line 146 of file moILS.h.
|
||||
.PP
|
||||
References moILS< M >::acceptance_criterion, moILS< M >::algorithm, moILS< M >::continu, moILS< M >::full_evaluation, and moILS< M >::perturbation.
|
||||
|
||||
.SH "Author"
|
||||
.PP
|
||||
Generated automatically by Doxygen for ParadisEO-MOMovingObjects from the source code.
|
||||
|
|
@ -1,88 +0,0 @@
|
|||
.TH "moImprBestFitAspirCrit" 3 "15 Jan 2008" "Version 1.0" "ParadisEO-MOMovingObjects" \" -*- nroff -*-
|
||||
.ad l
|
||||
.nh
|
||||
.SH NAME
|
||||
moImprBestFitAspirCrit \- One of the possible \fBmoAspirCrit\fP.
|
||||
|
||||
.PP
|
||||
.SH SYNOPSIS
|
||||
.br
|
||||
.PP
|
||||
\fC#include <moImprBestFitAspirCrit.h>\fP
|
||||
.PP
|
||||
Inherits \fBmoAspirCrit< M >< M >\fP.
|
||||
.PP
|
||||
.SS "Public Types"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "typedef M::EOType::Fitness \fBFitness\fP"
|
||||
.br
|
||||
.RI "\fIAlias for the fitness. \fP"
|
||||
.in -1c
|
||||
.SS "Public Member Functions"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "\fBmoImprBestFitAspirCrit\fP ()"
|
||||
.br
|
||||
.RI "\fIContructor. \fP"
|
||||
.ti -1c
|
||||
.RI "void \fBinit\fP ()"
|
||||
.br
|
||||
.RI "\fIInitialisation procedure. \fP"
|
||||
.ti -1c
|
||||
.RI "bool \fBoperator()\fP (const M &_move, const \fBFitness\fP &_fitness)"
|
||||
.br
|
||||
.RI "\fI\fBFunction\fP that indicates if the current fitness is better that the already saved fitness. \fP"
|
||||
.in -1c
|
||||
.SS "Private Attributes"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "\fBFitness\fP \fBbest_fitness\fP"
|
||||
.br
|
||||
.RI "\fIBest fitness found until now. \fP"
|
||||
.ti -1c
|
||||
.RI "bool \fBfirst_time\fP"
|
||||
.br
|
||||
.RI "\fIIndicates that a fitness has been already saved or not. \fP"
|
||||
.in -1c
|
||||
.SH "Detailed Description"
|
||||
.PP
|
||||
|
||||
.SS "template<class M> class moImprBestFitAspirCrit< M >"
|
||||
One of the possible \fBmoAspirCrit\fP.
|
||||
|
||||
This criterion is satisfied when a given fitness is the best ever considered.
|
||||
.PP
|
||||
Definition at line 47 of file moImprBestFitAspirCrit.h.
|
||||
.SH "Member Function Documentation"
|
||||
.PP
|
||||
.SS "template<class M> bool \fBmoImprBestFitAspirCrit\fP< M >::operator() (const M & _move, const \fBFitness\fP & _fitness)\fC [inline]\fP"
|
||||
.PP
|
||||
\fBFunction\fP that indicates if the current fitness is better that the already saved fitness.
|
||||
.PP
|
||||
The first time, the function only saved the current move and fitness.
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_move\fP A move.
|
||||
.br
|
||||
\fI_fitness\fP A fitness linked to the move.
|
||||
.RE
|
||||
.PP
|
||||
\fBReturns:\fP
|
||||
.RS 4
|
||||
true The first time and if _fitntess > best_fitness, else false.
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Definition at line 75 of file moImprBestFitAspirCrit.h.
|
||||
.PP
|
||||
References moImprBestFitAspirCrit< M >::best_fitness, and moImprBestFitAspirCrit< M >::first_time.
|
||||
|
||||
.SH "Author"
|
||||
.PP
|
||||
Generated automatically by Doxygen for ParadisEO-MOMovingObjects from the source code.
|
||||
|
|
@ -1,106 +0,0 @@
|
|||
.TH "moItRandNextMove" 3 "15 Jan 2008" "Version 1.0" "ParadisEO-MOMovingObjects" \" -*- nroff -*-
|
||||
.ad l
|
||||
.nh
|
||||
.SH NAME
|
||||
moItRandNextMove \- One of the possible \fBmoNextMove\fP.
|
||||
|
||||
.PP
|
||||
.SH SYNOPSIS
|
||||
.br
|
||||
.PP
|
||||
\fC#include <moItRandNextMove.h>\fP
|
||||
.PP
|
||||
Inherits \fBmoNextMove< M >< M >\fP.
|
||||
.PP
|
||||
.SS "Public Member Functions"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "\fBmoItRandNextMove\fP (\fBmoRandMove\fP< M > &_random_move_generator, unsigned int _iteration_maximum_number)"
|
||||
.br
|
||||
.RI "\fIThe constructor. \fP"
|
||||
.ti -1c
|
||||
.RI "bool \fBoperator()\fP (M &_move, const \fBEOT\fP &_solution)"
|
||||
.br
|
||||
.RI "\fIGeneration of a new move. \fP"
|
||||
.in -1c
|
||||
.SS "Private Types"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "typedef M::EOType \fBEOT\fP"
|
||||
.br
|
||||
.RI "\fIAlias for the type. \fP"
|
||||
.in -1c
|
||||
.SS "Private Attributes"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "\fBmoRandMove\fP< M > & \fBrandom_move_generator\fP"
|
||||
.br
|
||||
.RI "\fIA move generator (generally randomly). \fP"
|
||||
.ti -1c
|
||||
.RI "unsigned int \fBiteration_maximum_number\fP"
|
||||
.br
|
||||
.RI "\fIIteration maximum number. \fP"
|
||||
.ti -1c
|
||||
.RI "unsigned int \fBiteration_number\fP"
|
||||
.br
|
||||
.RI "\fIIteration current number. \fP"
|
||||
.in -1c
|
||||
.SH "Detailed Description"
|
||||
.PP
|
||||
|
||||
.SS "template<class M> class moItRandNextMove< M >"
|
||||
One of the possible \fBmoNextMove\fP.
|
||||
|
||||
This class is a move (\fBmoMove\fP) generator with a bound for the maximum number of iterations.
|
||||
.PP
|
||||
Definition at line 47 of file moItRandNextMove.h.
|
||||
.SH "Constructor & Destructor Documentation"
|
||||
.PP
|
||||
.SS "template<class M> \fBmoItRandNextMove\fP< M >::\fBmoItRandNextMove\fP (\fBmoRandMove\fP< M > & _random_move_generator, unsigned int _iteration_maximum_number)\fC [inline]\fP"
|
||||
.PP
|
||||
The constructor.
|
||||
.PP
|
||||
\fBParameters\fP only for initialising the attributes.
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_random_move_generator\fP The random move generator.
|
||||
.br
|
||||
\fI_iteration_maximum_number\fP The iteration maximum number.
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Definition at line 61 of file moItRandNextMove.h.
|
||||
.SH "Member Function Documentation"
|
||||
.PP
|
||||
.SS "template<class M> bool \fBmoItRandNextMove\fP< M >::operator() (M & _move, const \fBEOT\fP & _solution)\fC [inline]\fP"
|
||||
.PP
|
||||
Generation of a new move.
|
||||
.PP
|
||||
If the maximum number is not already reached, the current move is forgotten and remplaced by another one.
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_move\fP the current move.
|
||||
.br
|
||||
\fI_solution\fP the current solution.
|
||||
.RE
|
||||
.PP
|
||||
\fBReturns:\fP
|
||||
.RS 4
|
||||
false if the maximum number of iteration is reached, else true.
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Definition at line 73 of file moItRandNextMove.h.
|
||||
.PP
|
||||
References moItRandNextMove< M >::iteration_maximum_number, moItRandNextMove< M >::iteration_number, and moItRandNextMove< M >::random_move_generator.
|
||||
|
||||
.SH "Author"
|
||||
.PP
|
||||
Generated automatically by Doxygen for ParadisEO-MOMovingObjects from the source code.
|
||||
|
|
@ -1,83 +0,0 @@
|
|||
.TH "moLSCheckPoint" 3 "15 Jan 2008" "Version 1.0" "ParadisEO-MOMovingObjects" \" -*- nroff -*-
|
||||
.ad l
|
||||
.nh
|
||||
.SH NAME
|
||||
moLSCheckPoint \- Class which allows a checkpointing system.
|
||||
|
||||
.PP
|
||||
.SH SYNOPSIS
|
||||
.br
|
||||
.PP
|
||||
\fC#include <moLSCheckPoint.h>\fP
|
||||
.PP
|
||||
Inherits \fBeoBF< A1, A2, R >< const const M &, M::EOType &, void >\fP.
|
||||
.PP
|
||||
.SS "Public Member Functions"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "void \fBoperator()\fP (const M &_move, const typename M::EOType &_solution)"
|
||||
.br
|
||||
.RI "\fI\fBFunction\fP which launches the checkpointing. \fP"
|
||||
.ti -1c
|
||||
.RI "void \fBadd\fP (\fBeoBF\fP< const M &, const typename M::EOType &, void > &_function)"
|
||||
.br
|
||||
.RI "\fIProcedure which add a new function to the function vector. \fP"
|
||||
.in -1c
|
||||
.SS "Private Attributes"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "std::vector< \fBeoBF\fP< const M &, const typename M::EOType &, void > * > \fBfunctions\fP"
|
||||
.br
|
||||
.RI "\fIVector of functions. \fP"
|
||||
.in -1c
|
||||
.SH "Detailed Description"
|
||||
.PP
|
||||
|
||||
.SS "template<class M> class moLSCheckPoint< M >"
|
||||
Class which allows a checkpointing system.
|
||||
|
||||
Thanks to this class, at each iteration, additionnal function can be used (and not only one).
|
||||
.PP
|
||||
Definition at line 46 of file moLSCheckPoint.h.
|
||||
.SH "Member Function Documentation"
|
||||
.PP
|
||||
.SS "template<class M> void \fBmoLSCheckPoint\fP< M >::operator() (const M & _move, const typename M::EOType & _solution)\fC [inline]\fP"
|
||||
.PP
|
||||
\fBFunction\fP which launches the checkpointing.
|
||||
.PP
|
||||
Each saved function is used on the current move and the current solution.
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_move\fP a move.
|
||||
.br
|
||||
\fI_solution\fP a solution.
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Definition at line 57 of file moLSCheckPoint.h.
|
||||
.PP
|
||||
References moLSCheckPoint< M >::functions.
|
||||
.SS "template<class M> void \fBmoLSCheckPoint\fP< M >::add (\fBeoBF\fP< const M &, const typename M::EOType &, void > & _function)\fC [inline]\fP"
|
||||
.PP
|
||||
Procedure which add a new function to the function vector.
|
||||
.PP
|
||||
The new function is added at the end of the vector.
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_function\fP a new function to add.
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Definition at line 72 of file moLSCheckPoint.h.
|
||||
.PP
|
||||
References moLSCheckPoint< M >::functions.
|
||||
|
||||
.SH "Author"
|
||||
.PP
|
||||
Generated automatically by Doxygen for ParadisEO-MOMovingObjects from the source code.
|
||||
|
|
@ -1,90 +0,0 @@
|
|||
.TH "moLinearCoolingSchedule" 3 "15 Jan 2008" "Version 1.0" "ParadisEO-MOMovingObjects" \" -*- nroff -*-
|
||||
.ad l
|
||||
.nh
|
||||
.SH NAME
|
||||
moLinearCoolingSchedule \- One of the possible \fBmoCoolingSchedule\fP.
|
||||
|
||||
.PP
|
||||
.SH SYNOPSIS
|
||||
.br
|
||||
.PP
|
||||
\fC#include <moLinearCoolingSchedule.h>\fP
|
||||
.PP
|
||||
Inherits \fBmoCoolingSchedule\fP.
|
||||
.PP
|
||||
.SS "Public Member Functions"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "\fBmoLinearCoolingSchedule\fP (double _threshold, double _quantity)"
|
||||
.br
|
||||
.RI "\fISimple constructor. \fP"
|
||||
.ti -1c
|
||||
.RI "bool \fBoperator()\fP (double &_current_temperature)"
|
||||
.br
|
||||
.RI "\fI\fBFunction\fP which proceeds to the cooling. \fP"
|
||||
.in -1c
|
||||
.SS "Private Attributes"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "double \fBthreshold\fP"
|
||||
.br
|
||||
.RI "\fIThe temperature threhold. \fP"
|
||||
.ti -1c
|
||||
.RI "double \fBquantity\fP"
|
||||
.br
|
||||
.RI "\fIThe quantity that allows the temperature to decrease. \fP"
|
||||
.in -1c
|
||||
.SH "Detailed Description"
|
||||
.PP
|
||||
One of the possible \fBmoCoolingSchedule\fP.
|
||||
|
||||
An another very simple cooling schedule, the temperature decrease according to a quantity while the temperature is greater than a threshold.
|
||||
.PP
|
||||
Definition at line 46 of file moLinearCoolingSchedule.h.
|
||||
.SH "Constructor & Destructor Documentation"
|
||||
.PP
|
||||
.SS "moLinearCoolingSchedule::moLinearCoolingSchedule (double _threshold, double _quantity)\fC [inline]\fP"
|
||||
.PP
|
||||
Simple constructor.
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_threshold\fP the threshold.
|
||||
.br
|
||||
\fI_quantity\fP the quantity used to descrease the temperature.
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Definition at line 55 of file moLinearCoolingSchedule.h.
|
||||
.SH "Member Function Documentation"
|
||||
.PP
|
||||
.SS "bool moLinearCoolingSchedule::operator() (double & _current_temperature)\fC [inline, virtual]\fP"
|
||||
.PP
|
||||
\fBFunction\fP which proceeds to the cooling.
|
||||
.PP
|
||||
It decreases the temperature and indicates if it is greater than the threshold.
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_current_temperature\fP The current temperature.
|
||||
.RE
|
||||
.PP
|
||||
\fBReturns:\fP
|
||||
.RS 4
|
||||
true if the new temperature (current temperature - quantity) is greater than the threshold, false otherwise.
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Implements \fBeoUF< double &, bool >\fP.
|
||||
.PP
|
||||
Definition at line 65 of file moLinearCoolingSchedule.h.
|
||||
.PP
|
||||
References quantity, and threshold.
|
||||
|
||||
.SH "Author"
|
||||
.PP
|
||||
Generated automatically by Doxygen for ParadisEO-MOMovingObjects from the source code.
|
||||
|
|
@ -1,35 +0,0 @@
|
|||
.TH "moMove" 3 "15 Jan 2008" "Version 1.0" "ParadisEO-MOMovingObjects" \" -*- nroff -*-
|
||||
.ad l
|
||||
.nh
|
||||
.SH NAME
|
||||
moMove \- Definition of a move.
|
||||
|
||||
.PP
|
||||
.SH SYNOPSIS
|
||||
.br
|
||||
.PP
|
||||
\fC#include <moMove.h>\fP
|
||||
.PP
|
||||
Inherits \fBeoUF< EOT &, void >\fP.
|
||||
.PP
|
||||
.SS "Public Types"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "typedef EOT \fBEOType\fP"
|
||||
.br
|
||||
.RI "\fIAlias for the type. \fP"
|
||||
.in -1c
|
||||
.SH "Detailed Description"
|
||||
.PP
|
||||
|
||||
.SS "template<class EOT> class moMove< EOT >"
|
||||
Definition of a move.
|
||||
|
||||
A move transforms a solution to another close solution. It describes how a solution can be modified to another one.
|
||||
.PP
|
||||
Definition at line 49 of file moMove.h.
|
||||
|
||||
.SH "Author"
|
||||
.PP
|
||||
Generated automatically by Doxygen for ParadisEO-MOMovingObjects from the source code.
|
||||
|
|
@ -1,29 +0,0 @@
|
|||
.TH "moMoveExpl" 3 "15 Jan 2008" "Version 1.0" "ParadisEO-MOMovingObjects" \" -*- nroff -*-
|
||||
.ad l
|
||||
.nh
|
||||
.SH NAME
|
||||
moMoveExpl \- Description of a move (\fBmoMove\fP) explorer.
|
||||
|
||||
.PP
|
||||
.SH SYNOPSIS
|
||||
.br
|
||||
.PP
|
||||
\fC#include <moMoveExpl.h>\fP
|
||||
.PP
|
||||
Inherits \fBeoBF< const M::EOType &, M::EOType &, void >\fP.
|
||||
.PP
|
||||
Inherited by \fBmoMoveLoopExpl< M >\fP.
|
||||
.PP
|
||||
.SH "Detailed Description"
|
||||
.PP
|
||||
|
||||
.SS "template<class M> class moMoveExpl< M >"
|
||||
Description of a move (\fBmoMove\fP) explorer.
|
||||
|
||||
Only a description...See \fBmoMoveLoopExpl\fP.
|
||||
.PP
|
||||
Definition at line 45 of file moMoveExpl.h.
|
||||
|
||||
.SH "Author"
|
||||
.PP
|
||||
Generated automatically by Doxygen for ParadisEO-MOMovingObjects from the source code.
|
||||
|
|
@ -1,27 +0,0 @@
|
|||
.TH "moMoveIncrEval" 3 "15 Jan 2008" "Version 1.0" "ParadisEO-MOMovingObjects" \" -*- nroff -*-
|
||||
.ad l
|
||||
.nh
|
||||
.SH NAME
|
||||
moMoveIncrEval \- (generally) Efficient evaluation function based a move and a solution.
|
||||
|
||||
.PP
|
||||
.SH SYNOPSIS
|
||||
.br
|
||||
.PP
|
||||
\fC#include <moMoveIncrEval.h>\fP
|
||||
.PP
|
||||
Inherits \fBeoBF< A1, A2, R >< const const M &, M::EOType &, M::EOType::Fitness >\fP.
|
||||
.PP
|
||||
.SH "Detailed Description"
|
||||
.PP
|
||||
|
||||
.SS "template<class M> class moMoveIncrEval< M >"
|
||||
(generally) Efficient evaluation function based a move and a solution.
|
||||
|
||||
From a move and a solution, it computes a new fitness that could be associated to the solution if this one is updated.
|
||||
.PP
|
||||
Definition at line 49 of file moMoveIncrEval.h.
|
||||
|
||||
.SH "Author"
|
||||
.PP
|
||||
Generated automatically by Doxygen for ParadisEO-MOMovingObjects from the source code.
|
||||
|
|
@ -1,27 +0,0 @@
|
|||
.TH "moMoveInit" 3 "15 Jan 2008" "Version 1.0" "ParadisEO-MOMovingObjects" \" -*- nroff -*-
|
||||
.ad l
|
||||
.nh
|
||||
.SH NAME
|
||||
moMoveInit \- Move (\fBmoMove\fP) initializer.
|
||||
|
||||
.PP
|
||||
.SH SYNOPSIS
|
||||
.br
|
||||
.PP
|
||||
\fC#include <moMoveInit.h>\fP
|
||||
.PP
|
||||
Inherits \fBeoBF< A1, A2, R >< const M &, M::EOType &, void >\fP.
|
||||
.PP
|
||||
.SH "Detailed Description"
|
||||
.PP
|
||||
|
||||
.SS "template<class M> class moMoveInit< M >"
|
||||
Move (\fBmoMove\fP) initializer.
|
||||
|
||||
Class which allows to initiase a move. Only a description... An object that herits from this class needs to be designed to be used.
|
||||
.PP
|
||||
Definition at line 47 of file moMoveInit.h.
|
||||
|
||||
.SH "Author"
|
||||
.PP
|
||||
Generated automatically by Doxygen for ParadisEO-MOMovingObjects from the source code.
|
||||
|
|
@ -1,29 +0,0 @@
|
|||
.TH "moMoveLoopExpl" 3 "15 Jan 2008" "Version 1.0" "ParadisEO-MOMovingObjects" \" -*- nroff -*-
|
||||
.ad l
|
||||
.nh
|
||||
.SH NAME
|
||||
moMoveLoopExpl \- Class which describes an iterative explorer.
|
||||
|
||||
.PP
|
||||
.SH SYNOPSIS
|
||||
.br
|
||||
.PP
|
||||
\fC#include <moMoveLoopExpl.h>\fP
|
||||
.PP
|
||||
Inherits \fBmoMoveExpl< M >< M >\fP.
|
||||
.PP
|
||||
Inherited by \fBmoHCMoveLoopExpl< M >\fP, and \fBmoTSMoveLoopExpl< M >\fP.
|
||||
.PP
|
||||
.SH "Detailed Description"
|
||||
.PP
|
||||
|
||||
.SS "template<class M> class moMoveLoopExpl< M >"
|
||||
Class which describes an iterative explorer.
|
||||
|
||||
Only a description... \fBmoHCMoveLoopExpl\fP and \fBmoTSMoveLoopExpl\fP are exemples of class that are a \fBmoMoveLoopExpl\fP.
|
||||
.PP
|
||||
Definition at line 47 of file moMoveLoopExpl.h.
|
||||
|
||||
.SH "Author"
|
||||
.PP
|
||||
Generated automatically by Doxygen for ParadisEO-MOMovingObjects from the source code.
|
||||
|
|
@ -1,84 +0,0 @@
|
|||
.TH "moMoveSelect" 3 "15 Jan 2008" "Version 1.0" "ParadisEO-MOMovingObjects" \" -*- nroff -*-
|
||||
.ad l
|
||||
.nh
|
||||
.SH NAME
|
||||
moMoveSelect \- Class that describes a move selector (\fBmoMove\fP).
|
||||
|
||||
.PP
|
||||
.SH SYNOPSIS
|
||||
.br
|
||||
.PP
|
||||
\fC#include <moMoveSelect.h>\fP
|
||||
.PP
|
||||
Inherits \fBeoBF< M &, M::EOType::Fitness &, void >\fP.
|
||||
.PP
|
||||
Inherited by \fBmoBestImprSelect< M >\fP, \fBmoFirstImprSelect< M >\fP, and \fBmoRandImprSelect< M >\fP.
|
||||
.PP
|
||||
.SS "Public Types"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "typedef M::EOType::Fitness \fBFitness\fP"
|
||||
.br
|
||||
.RI "\fIAlias for the fitness. \fP"
|
||||
.in -1c
|
||||
.SS "Public Member Functions"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "virtual void \fBinit\fP (const \fBFitness\fP &_fitness)=0"
|
||||
.br
|
||||
.RI "\fIProcedure which initialises all that the move selector needs including the initial fitness. \fP"
|
||||
.ti -1c
|
||||
.RI "virtual bool \fBupdate\fP (const M &_move, const \fBFitness\fP &_fitness)=0"
|
||||
.br
|
||||
.RI "\fI\fBFunction\fP which updates the best solutions. \fP"
|
||||
.in -1c
|
||||
.SH "Detailed Description"
|
||||
.PP
|
||||
|
||||
.SS "template<class M> class moMoveSelect< M >"
|
||||
Class that describes a move selector (\fBmoMove\fP).
|
||||
|
||||
It iteratively considers some moves (\fBmoMove\fP) and their associated fitnesses. The best move is so regularly updated. At any time, it could be accessed.
|
||||
.PP
|
||||
Definition at line 50 of file moMoveSelect.h.
|
||||
.SH "Member Function Documentation"
|
||||
.PP
|
||||
.SS "template<class M> virtual void \fBmoMoveSelect\fP< M >::init (const \fBFitness\fP & _fitness)\fC [pure virtual]\fP"
|
||||
.PP
|
||||
Procedure which initialises all that the move selector needs including the initial fitness.
|
||||
.PP
|
||||
In order to know the fitness of the solution, for which the neighborhood will be soon explored
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_fitness\fP the current fitness.
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Implemented in \fBmoBestImprSelect< M >\fP, \fBmoFirstImprSelect< M >\fP, and \fBmoRandImprSelect< M >\fP.
|
||||
.SS "template<class M> virtual bool \fBmoMoveSelect\fP< M >::update (const M & _move, const \fBFitness\fP & _fitness)\fC [pure virtual]\fP"
|
||||
.PP
|
||||
\fBFunction\fP which updates the best solutions.
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_move\fP a new move.
|
||||
.br
|
||||
\fI_fitness\fP a fitness linked to the new move.
|
||||
.RE
|
||||
.PP
|
||||
\fBReturns:\fP
|
||||
.RS 4
|
||||
a boolean that expresses the need to resume the exploration.
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Implemented in \fBmoBestImprSelect< M >\fP, \fBmoFirstImprSelect< M >\fP, and \fBmoRandImprSelect< M >\fP.
|
||||
|
||||
.SH "Author"
|
||||
.PP
|
||||
Generated automatically by Doxygen for ParadisEO-MOMovingObjects from the source code.
|
||||
|
|
@ -1,29 +0,0 @@
|
|||
.TH "moNextMove" 3 "15 Jan 2008" "Version 1.0" "ParadisEO-MOMovingObjects" \" -*- nroff -*-
|
||||
.ad l
|
||||
.nh
|
||||
.SH NAME
|
||||
moNextMove \- Class which allows to generate a new move (\fBmoMove\fP).
|
||||
|
||||
.PP
|
||||
.SH SYNOPSIS
|
||||
.br
|
||||
.PP
|
||||
\fC#include <moNextMove.h>\fP
|
||||
.PP
|
||||
Inherits \fBeoBF< A1, A2, R >< const M &, M::EOType &, bool >\fP.
|
||||
.PP
|
||||
Inherited by \fBmoItRandNextMove< M >\fP.
|
||||
.PP
|
||||
.SH "Detailed Description"
|
||||
.PP
|
||||
|
||||
.SS "template<class M> class moNextMove< M >"
|
||||
Class which allows to generate a new move (\fBmoMove\fP).
|
||||
|
||||
Useful for the explorer (for \fBmoTS\fP or \fBmoHC\fP). Does nothing... An object that herits from this class needs to be designed for being used.
|
||||
.PP
|
||||
Definition at line 47 of file moNextMove.h.
|
||||
|
||||
.SH "Author"
|
||||
.PP
|
||||
Generated automatically by Doxygen for ParadisEO-MOMovingObjects from the source code.
|
||||
|
|
@ -1,71 +0,0 @@
|
|||
.TH "moNoAspirCrit" 3 "15 Jan 2008" "Version 1.0" "ParadisEO-MOMovingObjects" \" -*- nroff -*-
|
||||
.ad l
|
||||
.nh
|
||||
.SH NAME
|
||||
moNoAspirCrit \- One of the possible aspiration criterion (\fBmoAspirCrit\fP).
|
||||
|
||||
.PP
|
||||
.SH SYNOPSIS
|
||||
.br
|
||||
.PP
|
||||
\fC#include <moNoAspirCrit.h>\fP
|
||||
.PP
|
||||
Inherits \fBmoAspirCrit< M >< M >\fP.
|
||||
.PP
|
||||
.SS "Private Member Functions"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "bool \fBoperator()\fP (const M &_move, const typename M::EOType::Fitness &_fitness)"
|
||||
.br
|
||||
.RI "\fI\fBFunction\fP which describes the aspiration criterion behaviour. \fP"
|
||||
.ti -1c
|
||||
.RI "void \fBinit\fP ()"
|
||||
.br
|
||||
.RI "\fIProcedure which initialises all that needs a \fBmoNoAspirCrit\fP. \fP"
|
||||
.in -1c
|
||||
.SH "Detailed Description"
|
||||
.PP
|
||||
|
||||
.SS "template<class M> class moNoAspirCrit< M >"
|
||||
One of the possible aspiration criterion (\fBmoAspirCrit\fP).
|
||||
|
||||
The simplest : never satisfied.
|
||||
.PP
|
||||
Definition at line 47 of file moNoAspirCrit.h.
|
||||
.SH "Member Function Documentation"
|
||||
.PP
|
||||
.SS "template<class M> bool \fBmoNoAspirCrit\fP< M >::operator() (const M & _move, const typename M::EOType::Fitness & _fitness)\fC [inline, private]\fP"
|
||||
.PP
|
||||
\fBFunction\fP which describes the aspiration criterion behaviour.
|
||||
.PP
|
||||
Does nothing.
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_move\fP a move.
|
||||
.br
|
||||
\fI_fitness\fP a fitness.
|
||||
.RE
|
||||
.PP
|
||||
\fBReturns:\fP
|
||||
.RS 4
|
||||
false.
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Definition at line 57 of file moNoAspirCrit.h.
|
||||
.SS "template<class M> void \fBmoNoAspirCrit\fP< M >::init ()\fC [inline, private, virtual]\fP"
|
||||
.PP
|
||||
Procedure which initialises all that needs a \fBmoNoAspirCrit\fP.
|
||||
.PP
|
||||
Nothing...
|
||||
.PP
|
||||
Implements \fBmoAspirCrit< M >\fP.
|
||||
.PP
|
||||
Definition at line 66 of file moNoAspirCrit.h.
|
||||
|
||||
.SH "Author"
|
||||
.PP
|
||||
Generated automatically by Doxygen for ParadisEO-MOMovingObjects from the source code.
|
||||
|
|
@ -1,121 +0,0 @@
|
|||
.TH "moNoFitImprSolContinue" 3 "15 Jan 2008" "Version 1.0" "ParadisEO-MOMovingObjects" \" -*- nroff -*-
|
||||
.ad l
|
||||
.nh
|
||||
.SH NAME
|
||||
moNoFitImprSolContinue \- One possible stop criterion for a solution-based heuristic.
|
||||
|
||||
.PP
|
||||
.SH SYNOPSIS
|
||||
.br
|
||||
.PP
|
||||
\fC#include <moNoFitImprSolContinue.h>\fP
|
||||
.PP
|
||||
Inherits \fBmoSolContinue< EOT >< EOT >\fP.
|
||||
.PP
|
||||
.SS "Public Types"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "typedef EOT::Fitness \fBFitness\fP"
|
||||
.br
|
||||
.RI "\fIAlias for the fitness. \fP"
|
||||
.in -1c
|
||||
.SS "Public Member Functions"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "\fBmoNoFitImprSolContinue\fP (unsigned int _maxNumberOfIterationWithoutImprovement)"
|
||||
.br
|
||||
.RI "\fIBasic constructor. \fP"
|
||||
.ti -1c
|
||||
.RI "bool \fBoperator()\fP (const EOT &_solution)"
|
||||
.br
|
||||
.RI "\fI\fBFunction\fP that activates the stopping criterion. \fP"
|
||||
.ti -1c
|
||||
.RI "void \fBinit\fP ()"
|
||||
.br
|
||||
.RI "\fIProcedure which allows to initialise all the stuff needed. \fP"
|
||||
.in -1c
|
||||
.SS "Private Attributes"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "unsigned int \fBmaxNumberOfIterationsWithoutImprovement\fP"
|
||||
.br
|
||||
.RI "\fIMaximum number of iterations without improvement allowed. \fP"
|
||||
.ti -1c
|
||||
.RI "bool \fBfirstFitnessSaved\fP"
|
||||
.br
|
||||
.RI "\fIFlag that this is the first time that the fitness is used. \fP"
|
||||
.ti -1c
|
||||
.RI "\fBFitness\fP \fBfitness\fP"
|
||||
.br
|
||||
.RI "\fICurrent Fitness. \fP"
|
||||
.ti -1c
|
||||
.RI "unsigned int \fBcounter\fP"
|
||||
.br
|
||||
.RI "\fIThe iteration couter. \fP"
|
||||
.in -1c
|
||||
.SH "Detailed Description"
|
||||
.PP
|
||||
|
||||
.SS "template<class EOT> class moNoFitImprSolContinue< EOT >"
|
||||
One possible stop criterion for a solution-based heuristic.
|
||||
|
||||
The stop criterion corresponds to a maximum number of iterations without improvement.
|
||||
.PP
|
||||
Definition at line 46 of file moNoFitImprSolContinue.h.
|
||||
.SH "Constructor & Destructor Documentation"
|
||||
.PP
|
||||
.SS "template<class EOT> \fBmoNoFitImprSolContinue\fP< EOT >::\fBmoNoFitImprSolContinue\fP (unsigned int _maxNumberOfIterationWithoutImprovement)\fC [inline]\fP"
|
||||
.PP
|
||||
Basic constructor.
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_maxNumberOfIterationWithoutImprovement\fP The number of iterations without fitness improvement to reach for stop.
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Definition at line 57 of file moNoFitImprSolContinue.h.
|
||||
.SH "Member Function Documentation"
|
||||
.PP
|
||||
.SS "template<class EOT> bool \fBmoNoFitImprSolContinue\fP< EOT >::operator() (const EOT & _solution)\fC [inline, virtual]\fP"
|
||||
.PP
|
||||
\fBFunction\fP that activates the stopping criterion.
|
||||
.PP
|
||||
Indicates if the fitness has not been improved since a given number of iterations (after a minimum of iterations).
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_solution\fP the current solution.
|
||||
.RE
|
||||
.PP
|
||||
\fBReturns:\fP
|
||||
.RS 4
|
||||
true or false.
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Implements \fBeoUF< const EOT &, bool >\fP.
|
||||
.PP
|
||||
Definition at line 67 of file moNoFitImprSolContinue.h.
|
||||
.PP
|
||||
References moNoFitImprSolContinue< EOT >::counter, moNoFitImprSolContinue< EOT >::firstFitnessSaved, moNoFitImprSolContinue< EOT >::fitness, and moNoFitImprSolContinue< EOT >::maxNumberOfIterationsWithoutImprovement.
|
||||
.SS "template<class EOT> void \fBmoNoFitImprSolContinue\fP< EOT >::init ()\fC [inline, virtual]\fP"
|
||||
.PP
|
||||
Procedure which allows to initialise all the stuff needed.
|
||||
.PP
|
||||
It can be also used to reinitialize all the needed things.
|
||||
.PP
|
||||
Implements \fBmoSolContinue< EOT >\fP.
|
||||
.PP
|
||||
Definition at line 102 of file moNoFitImprSolContinue.h.
|
||||
.PP
|
||||
References moNoFitImprSolContinue< EOT >::counter, and moNoFitImprSolContinue< EOT >::firstFitnessSaved.
|
||||
|
||||
.SH "Author"
|
||||
.PP
|
||||
Generated automatically by Doxygen for ParadisEO-MOMovingObjects from the source code.
|
||||
|
|
@ -1,132 +0,0 @@
|
|||
.TH "moRandImprSelect" 3 "15 Jan 2008" "Version 1.0" "ParadisEO-MOMovingObjects" \" -*- nroff -*-
|
||||
.ad l
|
||||
.nh
|
||||
.SH NAME
|
||||
moRandImprSelect \- One of the possible \fBmoMove\fP selector (\fBmoMoveSelect\fP).
|
||||
|
||||
.PP
|
||||
.SH SYNOPSIS
|
||||
.br
|
||||
.PP
|
||||
\fC#include <moRandImprSelect.h>\fP
|
||||
.PP
|
||||
Inherits \fBmoMoveSelect< M >< M >\fP.
|
||||
.PP
|
||||
.SS "Public Types"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "typedef M::EOType::Fitness \fBFitness\fP"
|
||||
.br
|
||||
.RI "\fIAlias for the fitness. \fP"
|
||||
.in -1c
|
||||
.SS "Public Member Functions"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "void \fBinit\fP (const \fBFitness\fP &_fitness)"
|
||||
.br
|
||||
.RI "\fIProcedure which all that needs a \fBmoRandImprSelect\fP. \fP"
|
||||
.ti -1c
|
||||
.RI "bool \fBupdate\fP (const M &_move, const \fBFitness\fP &_fitness)"
|
||||
.br
|
||||
.RI "\fI\fBFunction\fP that updates the fitness and move vectors. \fP"
|
||||
.ti -1c
|
||||
.RI "void \fBoperator()\fP (M &_move, \fBFitness\fP &_fitness)"
|
||||
.br
|
||||
.RI "\fIThe move selection. \fP"
|
||||
.in -1c
|
||||
.SS "Private Attributes"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "\fBFitness\fP \fBinitial_fitness\fP"
|
||||
.br
|
||||
.RI "\fIFitness of the current solution. \fP"
|
||||
.ti -1c
|
||||
.RI "std::vector< \fBFitness\fP > \fBbetter_fitnesses\fP"
|
||||
.br
|
||||
.RI "\fICandidate fitnesse vector. \fP"
|
||||
.ti -1c
|
||||
.RI "std::vector< M > \fBbetter_moves\fP"
|
||||
.br
|
||||
.RI "\fICandidate move vector. \fP"
|
||||
.in -1c
|
||||
.SH "Detailed Description"
|
||||
.PP
|
||||
|
||||
.SS "template<class M> class moRandImprSelect< M >"
|
||||
One of the possible \fBmoMove\fP selector (\fBmoMoveSelect\fP).
|
||||
|
||||
All the neighbors are considered. One of them that enables an improvment of the objective function is choosen.
|
||||
.PP
|
||||
Definition at line 49 of file moRandImprSelect.h.
|
||||
.SH "Member Function Documentation"
|
||||
.PP
|
||||
.SS "template<class M> void \fBmoRandImprSelect\fP< M >::init (const \fBFitness\fP & _fitness)\fC [inline, virtual]\fP"
|
||||
.PP
|
||||
Procedure which all that needs a \fBmoRandImprSelect\fP.
|
||||
.PP
|
||||
Give a value to the initialise fitness. Clean the move and fitness vectors.
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_fitness\fP the current best fitness
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Implements \fBmoMoveSelect< M >\fP.
|
||||
.PP
|
||||
Definition at line 63 of file moRandImprSelect.h.
|
||||
.PP
|
||||
References moRandImprSelect< M >::better_fitnesses, moRandImprSelect< M >::better_moves, and moRandImprSelect< M >::initial_fitness.
|
||||
.SS "template<class M> bool \fBmoRandImprSelect\fP< M >::update (const M & _move, const \fBFitness\fP & _fitness)\fC [inline, virtual]\fP"
|
||||
.PP
|
||||
\fBFunction\fP that updates the fitness and move vectors.
|
||||
.PP
|
||||
if a move give a better fitness than the initial fitness, it is saved and the fitness too.
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_move\fP a new move.
|
||||
.br
|
||||
\fI_fitness\fP a new fitness associated to the new move.
|
||||
.RE
|
||||
.PP
|
||||
\fBReturns:\fP
|
||||
.RS 4
|
||||
true.
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Implements \fBmoMoveSelect< M >\fP.
|
||||
.PP
|
||||
Definition at line 79 of file moRandImprSelect.h.
|
||||
.PP
|
||||
References moRandImprSelect< M >::better_fitnesses, moRandImprSelect< M >::better_moves, and moRandImprSelect< M >::initial_fitness.
|
||||
.SS "template<class M> void \fBmoRandImprSelect\fP< M >::operator() (M & _move, \fBFitness\fP & _fitness)\fC [inline, virtual]\fP"
|
||||
.PP
|
||||
The move selection.
|
||||
.PP
|
||||
One the saved move is randomly chosen.
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_move\fP the reference of the move that can be initialised by the function.
|
||||
.br
|
||||
\fI_fitness\fP the reference of the fitness that can be initialised by the function.
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Implements \fBeoBF< M &, M::EOType::Fitness &, void >\fP.
|
||||
.PP
|
||||
Definition at line 98 of file moRandImprSelect.h.
|
||||
.PP
|
||||
References moRandImprSelect< M >::better_fitnesses, moRandImprSelect< M >::better_moves, and eoRng::random().
|
||||
|
||||
.SH "Author"
|
||||
.PP
|
||||
Generated automatically by Doxygen for ParadisEO-MOMovingObjects from the source code.
|
||||
|
|
@ -1,27 +0,0 @@
|
|||
.TH "moRandMove" 3 "15 Jan 2008" "Version 1.0" "ParadisEO-MOMovingObjects" \" -*- nroff -*-
|
||||
.ad l
|
||||
.nh
|
||||
.SH NAME
|
||||
moRandMove \- Random move generator.
|
||||
|
||||
.PP
|
||||
.SH SYNOPSIS
|
||||
.br
|
||||
.PP
|
||||
\fC#include <moRandMove.h>\fP
|
||||
.PP
|
||||
Inherits \fBeoUF< M &, void >\fP.
|
||||
.PP
|
||||
.SH "Detailed Description"
|
||||
.PP
|
||||
|
||||
.SS "template<class M> class moRandMove< M >"
|
||||
Random move generator.
|
||||
|
||||
Only a description... An object that herits from this class needs to be designed in order to use a \fBmoSA\fP.
|
||||
.PP
|
||||
Definition at line 46 of file moRandMove.h.
|
||||
|
||||
.SH "Author"
|
||||
.PP
|
||||
Generated automatically by Doxygen for ParadisEO-MOMovingObjects from the source code.
|
||||
|
|
@ -1,130 +0,0 @@
|
|||
.TH "moSA" 3 "15 Jan 2008" "Version 1.0" "ParadisEO-MOMovingObjects" \" -*- nroff -*-
|
||||
.ad l
|
||||
.nh
|
||||
.SH NAME
|
||||
moSA \- Simulated Annealing (SA).
|
||||
|
||||
.PP
|
||||
.SH SYNOPSIS
|
||||
.br
|
||||
.PP
|
||||
\fC#include <moSA.h>\fP
|
||||
.PP
|
||||
Inherits \fBmoAlgo< M::EOType >\fP.
|
||||
.PP
|
||||
.SS "Public Member Functions"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "\fBmoSA\fP (\fBmoRandMove\fP< M > &_random_move_generator, \fBmoMoveIncrEval\fP< M > &_incremental_evaluation, \fBmoSolContinue\fP< \fBEOT\fP > &_continue, double _initial_temperature, \fBmoCoolingSchedule\fP &_cooling_schedule, \fBeoEvalFunc\fP< \fBEOT\fP > &_full_evaluation)"
|
||||
.br
|
||||
.RI "\fISA constructor. \fP"
|
||||
.ti -1c
|
||||
.RI "bool \fBoperator()\fP (\fBEOT\fP &_solution)"
|
||||
.br
|
||||
.RI "\fIfunction that launches the SA algorithm. \fP"
|
||||
.in -1c
|
||||
.SS "Private Types"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "typedef M::EOType \fBEOT\fP"
|
||||
.br
|
||||
.RI "\fIAlias for the type. \fP"
|
||||
.ti -1c
|
||||
.RI "typedef EOT::Fitness \fBFitness\fP"
|
||||
.br
|
||||
.RI "\fIAlias for the fitness. \fP"
|
||||
.in -1c
|
||||
.SS "Private Attributes"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "\fBmoRandMove\fP< M > & \fBrandom_move_generator\fP"
|
||||
.br
|
||||
.RI "\fIA move generator (generally randomly). \fP"
|
||||
.ti -1c
|
||||
.RI "\fBmoMoveIncrEval\fP< M > & \fBincremental_evaluation\fP"
|
||||
.br
|
||||
.RI "\fIA (generally) efficient evaluation function. \fP"
|
||||
.ti -1c
|
||||
.RI "\fBmoSolContinue\fP< \fBEOT\fP > & \fBcontinu\fP"
|
||||
.br
|
||||
.RI "\fIStopping criterion before temperature update. \fP"
|
||||
.ti -1c
|
||||
.RI "double \fBinitial_temperature\fP"
|
||||
.br
|
||||
.RI "\fIInitial temperature. \fP"
|
||||
.ti -1c
|
||||
.RI "\fBmoCoolingSchedule\fP & \fBcooling_schedule\fP"
|
||||
.br
|
||||
.RI "\fIThe cooling schedule. \fP"
|
||||
.ti -1c
|
||||
.RI "\fBeoEvalFunc\fP< \fBEOT\fP > & \fBfull_evaluation\fP"
|
||||
.br
|
||||
.RI "\fIA full evaluation function. \fP"
|
||||
.in -1c
|
||||
.SH "Detailed Description"
|
||||
.PP
|
||||
|
||||
.SS "template<class M> class moSA< M >"
|
||||
Simulated Annealing (SA).
|
||||
|
||||
Class that describes a Simulated Annealing algorithm.
|
||||
.PP
|
||||
Definition at line 53 of file moSA.h.
|
||||
.SH "Constructor & Destructor Documentation"
|
||||
.PP
|
||||
.SS "template<class M> \fBmoSA\fP< M >::\fBmoSA\fP (\fBmoRandMove\fP< M > & _random_move_generator, \fBmoMoveIncrEval\fP< M > & _incremental_evaluation, \fBmoSolContinue\fP< \fBEOT\fP > & _continue, double _initial_temperature, \fBmoCoolingSchedule\fP & _cooling_schedule, \fBeoEvalFunc\fP< \fBEOT\fP > & _full_evaluation)\fC [inline]\fP"
|
||||
.PP
|
||||
SA constructor.
|
||||
.PP
|
||||
All the boxes used by a SA need to be given.
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_random_move_generator\fP The move generator (generally randomly).
|
||||
.br
|
||||
\fI_incremental_evaluation\fP The (generally) efficient evaluation function
|
||||
.br
|
||||
\fI_continue\fP The stopping criterion.
|
||||
.br
|
||||
\fI_initial_temperature\fP The initial temperature.
|
||||
.br
|
||||
\fI_cooling_schedule\fP The cooling schedule, describes how the temperature is modified.
|
||||
.br
|
||||
\fI_full_evaluation\fP The full evaluation function.
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Definition at line 74 of file moSA.h.
|
||||
.SH "Member Function Documentation"
|
||||
.PP
|
||||
.SS "template<class M> bool \fBmoSA\fP< M >::operator() (\fBEOT\fP & _solution)\fC [inline, virtual]\fP"
|
||||
.PP
|
||||
function that launches the SA algorithm.
|
||||
.PP
|
||||
As a \fBmoTS\fP or a \fBmoHC\fP, the SA can be used for HYBRIDATION in an evolutionary algorithm.
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_solution\fP A solution to improve.
|
||||
.RE
|
||||
.PP
|
||||
\fBReturns:\fP
|
||||
.RS 4
|
||||
TRUE.
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Implements \fBeoUF< M::EOType &, bool >\fP.
|
||||
.PP
|
||||
Definition at line 89 of file moSA.h.
|
||||
.PP
|
||||
References moSA< M >::continu, moSA< M >::cooling_schedule, moSA< M >::full_evaluation, moSA< M >::incremental_evaluation, moSA< M >::initial_temperature, moSA< M >::random_move_generator, and eoRng::uniform().
|
||||
|
||||
.SH "Author"
|
||||
.PP
|
||||
Generated automatically by Doxygen for ParadisEO-MOMovingObjects from the source code.
|
||||
|
|
@ -1,162 +0,0 @@
|
|||
.TH "moSimpleMoveTabuList" 3 "15 Jan 2008" "Version 1.0" "ParadisEO-MOMovingObjects" \" -*- nroff -*-
|
||||
.ad l
|
||||
.nh
|
||||
.SH NAME
|
||||
moSimpleMoveTabuList \- Class describing a move tabu list with a limited memory.
|
||||
|
||||
.PP
|
||||
.SH SYNOPSIS
|
||||
.br
|
||||
.PP
|
||||
\fC#include <moSimpleMoveTabuList.h>\fP
|
||||
.PP
|
||||
Inherits \fBmoTabuList< M >< M >\fP.
|
||||
.PP
|
||||
.SS "Public Types"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "typedef M::EOType \fBEOT\fP"
|
||||
.br
|
||||
.RI "\fIAlias for the type. \fP"
|
||||
.ti -1c
|
||||
.RI "typedef std::list< M >::iterator \fBmoveIterator\fP"
|
||||
.br
|
||||
.RI "\fIAlias for an iterator of a move list. \fP"
|
||||
.in -1c
|
||||
.SS "Public Member Functions"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "\fBmoSimpleMoveTabuList\fP (unsigned int _memory_maximum_size)"
|
||||
.br
|
||||
.RI "\fIConstructor. \fP"
|
||||
.ti -1c
|
||||
.RI "bool \fBoperator()\fP (const M &_move, const \fBEOT\fP &_solution)"
|
||||
.br
|
||||
.RI "\fI\fBFunction\fP that indicates if, in a given state, the _move is tabu or not. \fP"
|
||||
.ti -1c
|
||||
.RI "void \fBadd\fP (const M &_move, const \fBEOT\fP &_solution)"
|
||||
.br
|
||||
.RI "\fIProcedure to add a move in the tabu list. \fP"
|
||||
.ti -1c
|
||||
.RI "void \fBupdate\fP ()"
|
||||
.br
|
||||
.RI "\fIProcedure that updates the tabu list content. \fP"
|
||||
.ti -1c
|
||||
.RI "void \fBinit\fP ()"
|
||||
.br
|
||||
.RI "\fIProcedure which initialises the tabu list. \fP"
|
||||
.in -1c
|
||||
.SS "Private Member Functions"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "void \fBremoveMove\fP (const M &_move)"
|
||||
.br
|
||||
.RI "\fIProcedure that removes a given move from the tabu list (if it is into, else do nothing). \fP"
|
||||
.in -1c
|
||||
.SS "Private Attributes"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "unsigned int \fBmemory_maximum_size\fP"
|
||||
.br
|
||||
.RI "\fIThe maximum size of the tabu list. \fP"
|
||||
.ti -1c
|
||||
.RI "unsigned int \fBmemory_size\fP"
|
||||
.br
|
||||
.RI "\fIThe current size of the tabu list. \fP"
|
||||
.ti -1c
|
||||
.RI "std::list< M > \fBtabuList\fP"
|
||||
.br
|
||||
.RI "\fIThe move tabu list. \fP"
|
||||
.in -1c
|
||||
.SH "Detailed Description"
|
||||
.PP
|
||||
|
||||
.SS "template<class M> class moSimpleMoveTabuList< M >"
|
||||
Class describing a move tabu list with a limited memory.
|
||||
.PP
|
||||
Definition at line 46 of file moSimpleMoveTabuList.h.
|
||||
.SH "Member Function Documentation"
|
||||
.PP
|
||||
.SS "template<class M> bool \fBmoSimpleMoveTabuList\fP< M >::operator() (const M & _move, const \fBEOT\fP & _solution)\fC [inline]\fP"
|
||||
.PP
|
||||
\fBFunction\fP that indicates if, in a given state, the _move is tabu or not.
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_move\fP A given \fBmoMove\fP.
|
||||
.br
|
||||
\fI_solution\fP A solution.
|
||||
.RE
|
||||
.PP
|
||||
\fBReturns:\fP
|
||||
.RS 4
|
||||
true or false.
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Definition at line 69 of file moSimpleMoveTabuList.h.
|
||||
.PP
|
||||
References moSimpleMoveTabuList< M >::tabuList.
|
||||
.SS "template<class M> void \fBmoSimpleMoveTabuList\fP< M >::add (const M & _move, const \fBEOT\fP & _solution)\fC [inline, virtual]\fP"
|
||||
.PP
|
||||
Procedure to add a move in the tabu list.
|
||||
.PP
|
||||
The two parameters have not to be modified so they are constant parameters.
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_move\fP a new tabu move.
|
||||
.br
|
||||
\fI_solution\fP the origianl solution associated to this move.
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Implements \fBmoTabuList< M >\fP.
|
||||
.PP
|
||||
Definition at line 86 of file moSimpleMoveTabuList.h.
|
||||
.PP
|
||||
References moSimpleMoveTabuList< M >::memory_maximum_size, moSimpleMoveTabuList< M >::memory_size, moSimpleMoveTabuList< M >::removeMove(), and moSimpleMoveTabuList< M >::tabuList.
|
||||
.SS "template<class M> void \fBmoSimpleMoveTabuList\fP< M >::update ()\fC [inline, virtual]\fP"
|
||||
.PP
|
||||
Procedure that updates the tabu list content.
|
||||
.PP
|
||||
Generally, a counter associated to each saved move is decreased by one.
|
||||
.PP
|
||||
Implements \fBmoTabuList< M >\fP.
|
||||
.PP
|
||||
Definition at line 110 of file moSimpleMoveTabuList.h.
|
||||
.SS "template<class M> void \fBmoSimpleMoveTabuList\fP< M >::init ()\fC [inline, virtual]\fP"
|
||||
.PP
|
||||
Procedure which initialises the tabu list.
|
||||
.PP
|
||||
Can be useful if the data structure needs to be allocated before being used.
|
||||
.PP
|
||||
Implements \fBmoTabuList< M >\fP.
|
||||
.PP
|
||||
Definition at line 115 of file moSimpleMoveTabuList.h.
|
||||
.SS "template<class M> void \fBmoSimpleMoveTabuList\fP< M >::removeMove (const M & _move)\fC [inline, private]\fP"
|
||||
.PP
|
||||
Procedure that removes a given move from the tabu list (if it is into, else do nothing).
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_move\fP A given \fBmoMove\fP.
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Definition at line 126 of file moSimpleMoveTabuList.h.
|
||||
.PP
|
||||
References moSimpleMoveTabuList< M >::tabuList.
|
||||
.PP
|
||||
Referenced by moSimpleMoveTabuList< M >::add().
|
||||
|
||||
.SH "Author"
|
||||
.PP
|
||||
Generated automatically by Doxygen for ParadisEO-MOMovingObjects from the source code.
|
||||
|
|
@ -1,176 +0,0 @@
|
|||
.TH "moSimpleSolutionTabuList" 3 "15 Jan 2008" "Version 1.0" "ParadisEO-MOMovingObjects" \" -*- nroff -*-
|
||||
.ad l
|
||||
.nh
|
||||
.SH NAME
|
||||
moSimpleSolutionTabuList \- Class describing a solution tabu list with limited length.
|
||||
|
||||
.PP
|
||||
.SH SYNOPSIS
|
||||
.br
|
||||
.PP
|
||||
\fC#include <moSimpleSolutionTabuList.h>\fP
|
||||
.PP
|
||||
Inherits \fBmoTabuList< M >< M >\fP.
|
||||
.PP
|
||||
.SS "Public Types"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "typedef M::EOType \fBEOT\fP"
|
||||
.br
|
||||
.RI "\fIAlias for the type. \fP"
|
||||
.ti -1c
|
||||
.RI "typedef std::list< \fBEOT\fP >::iterator \fBsolutionIterator\fP"
|
||||
.br
|
||||
.RI "\fIAlias for an iterator of a solution list. \fP"
|
||||
.in -1c
|
||||
.SS "Public Member Functions"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "\fBmoSimpleSolutionTabuList\fP (unsigned int _memory_maximum_size)"
|
||||
.br
|
||||
.RI "\fIConstructor. \fP"
|
||||
.ti -1c
|
||||
.RI "bool \fBoperator()\fP (const M &_move, const \fBEOT\fP &_solution)"
|
||||
.br
|
||||
.RI "\fI\fBFunction\fP that indicates if, in a given state, the _move is tabu or not. \fP"
|
||||
.ti -1c
|
||||
.RI "void \fBadd\fP (const M &_move, const \fBEOT\fP &_solution)"
|
||||
.br
|
||||
.RI "\fIProcedure to add a move in the tabu list. \fP"
|
||||
.ti -1c
|
||||
.RI "void \fBupdate\fP ()"
|
||||
.br
|
||||
.RI "\fIProcedure that updates the tabu list content. \fP"
|
||||
.ti -1c
|
||||
.RI "void \fBinit\fP ()"
|
||||
.br
|
||||
.RI "\fIProcedure which initialises the tabu list. \fP"
|
||||
.in -1c
|
||||
.SS "Private Member Functions"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "void \fBremoveSolution\fP (const \fBEOT\fP &_solution)"
|
||||
.br
|
||||
.RI "\fIProcedure that removes a given solution from the tabu list (if it is into, else does nothing). \fP"
|
||||
.in -1c
|
||||
.SS "Private Attributes"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "unsigned int \fBmemory_maximum_size\fP"
|
||||
.br
|
||||
.RI "\fIThe maximum size of the tabu list. \fP"
|
||||
.ti -1c
|
||||
.RI "unsigned int \fBmemory_size\fP"
|
||||
.br
|
||||
.RI "\fIThe current size of the tabu list. \fP"
|
||||
.ti -1c
|
||||
.RI "std::list< \fBEOT\fP > \fBtabuList\fP"
|
||||
.br
|
||||
.RI "\fIThe solution tabu list. \fP"
|
||||
.in -1c
|
||||
.SH "Detailed Description"
|
||||
.PP
|
||||
|
||||
.SS "template<class M> class moSimpleSolutionTabuList< M >"
|
||||
Class describing a solution tabu list with limited length.
|
||||
.PP
|
||||
Definition at line 46 of file moSimpleSolutionTabuList.h.
|
||||
.SH "Constructor & Destructor Documentation"
|
||||
.PP
|
||||
.SS "template<class M> \fBmoSimpleSolutionTabuList\fP< M >::\fBmoSimpleSolutionTabuList\fP (unsigned int _memory_maximum_size)\fC [inline]\fP"
|
||||
.PP
|
||||
Constructor.
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_memory_maximum_size\fP The maximum size of the solution tabu list.
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Definition at line 60 of file moSimpleSolutionTabuList.h.
|
||||
.SH "Member Function Documentation"
|
||||
.PP
|
||||
.SS "template<class M> bool \fBmoSimpleSolutionTabuList\fP< M >::operator() (const M & _move, const \fBEOT\fP & _solution)\fC [inline]\fP"
|
||||
.PP
|
||||
\fBFunction\fP that indicates if, in a given state, the _move is tabu or not.
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_move\fP A given \fBmoMove\fP.
|
||||
.br
|
||||
\fI_solution\fP A solution.
|
||||
.RE
|
||||
.PP
|
||||
\fBReturns:\fP
|
||||
.RS 4
|
||||
true or false.
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Definition at line 69 of file moSimpleSolutionTabuList.h.
|
||||
.PP
|
||||
References moSimpleSolutionTabuList< M >::tabuList.
|
||||
.SS "template<class M> void \fBmoSimpleSolutionTabuList\fP< M >::add (const M & _move, const \fBEOT\fP & _solution)\fC [inline, virtual]\fP"
|
||||
.PP
|
||||
Procedure to add a move in the tabu list.
|
||||
.PP
|
||||
The two parameters have not to be modified so they are constant parameters.
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_move\fP a new tabu move.
|
||||
.br
|
||||
\fI_solution\fP the origianl solution associated to this move.
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Implements \fBmoTabuList< M >\fP.
|
||||
.PP
|
||||
Definition at line 89 of file moSimpleSolutionTabuList.h.
|
||||
.PP
|
||||
References moSimpleSolutionTabuList< M >::memory_maximum_size, moSimpleSolutionTabuList< M >::memory_size, moSimpleSolutionTabuList< M >::removeSolution(), and moSimpleSolutionTabuList< M >::tabuList.
|
||||
.SS "template<class M> void \fBmoSimpleSolutionTabuList\fP< M >::update ()\fC [inline, virtual]\fP"
|
||||
.PP
|
||||
Procedure that updates the tabu list content.
|
||||
.PP
|
||||
Generally, a counter associated to each saved move is decreased by one.
|
||||
.PP
|
||||
Implements \fBmoTabuList< M >\fP.
|
||||
.PP
|
||||
Definition at line 115 of file moSimpleSolutionTabuList.h.
|
||||
.SS "template<class M> void \fBmoSimpleSolutionTabuList\fP< M >::init ()\fC [inline, virtual]\fP"
|
||||
.PP
|
||||
Procedure which initialises the tabu list.
|
||||
.PP
|
||||
Can be useful if the data structure needs to be allocated before being used.
|
||||
.PP
|
||||
Implements \fBmoTabuList< M >\fP.
|
||||
.PP
|
||||
Definition at line 120 of file moSimpleSolutionTabuList.h.
|
||||
.SS "template<class M> void \fBmoSimpleSolutionTabuList\fP< M >::removeSolution (const \fBEOT\fP & _solution)\fC [inline, private]\fP"
|
||||
.PP
|
||||
Procedure that removes a given solution from the tabu list (if it is into, else does nothing).
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_solution\fP A given solution.
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Definition at line 131 of file moSimpleSolutionTabuList.h.
|
||||
.PP
|
||||
References moSimpleSolutionTabuList< M >::tabuList.
|
||||
.PP
|
||||
Referenced by moSimpleSolutionTabuList< M >::add().
|
||||
|
||||
.SH "Author"
|
||||
.PP
|
||||
Generated automatically by Doxygen for ParadisEO-MOMovingObjects from the source code.
|
||||
|
|
@ -1,46 +0,0 @@
|
|||
.TH "moSolContinue" 3 "15 Jan 2008" "Version 1.0" "ParadisEO-MOMovingObjects" \" -*- nroff -*-
|
||||
.ad l
|
||||
.nh
|
||||
.SH NAME
|
||||
moSolContinue \- Class that describes a stop criterion for a solution-based heuristic.
|
||||
|
||||
.PP
|
||||
.SH SYNOPSIS
|
||||
.br
|
||||
.PP
|
||||
\fC#include <moSolContinue.h>\fP
|
||||
.PP
|
||||
Inherits \fBeoUF< const EOT &, bool >\fP.
|
||||
.PP
|
||||
Inherited by \fBmoFitSolContinue< EOT >\fP, \fBmoGenSolContinue< EOT >\fP, \fBmoNoFitImprSolContinue< EOT >\fP, and \fBmoSteadyFitSolContinue< EOT >\fP.
|
||||
.PP
|
||||
.SS "Public Member Functions"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "virtual void \fBinit\fP ()=0"
|
||||
.br
|
||||
.RI "\fIProcedure which initialises all that the stop criterion needs. \fP"
|
||||
.in -1c
|
||||
.SH "Detailed Description"
|
||||
.PP
|
||||
|
||||
.SS "template<class EOT> class moSolContinue< EOT >"
|
||||
Class that describes a stop criterion for a solution-based heuristic.
|
||||
|
||||
It allows to add an initialisation procedure to an object that is a unary function (\fBeoUF\fP).
|
||||
.PP
|
||||
Definition at line 48 of file moSolContinue.h.
|
||||
.SH "Member Function Documentation"
|
||||
.PP
|
||||
.SS "template<class EOT> virtual void \fBmoSolContinue\fP< EOT >::init ()\fC [pure virtual]\fP"
|
||||
.PP
|
||||
Procedure which initialises all that the stop criterion needs.
|
||||
.PP
|
||||
Generally, it allocates some data structures or initialises some counters.
|
||||
.PP
|
||||
Implemented in \fBmoFitSolContinue< EOT >\fP, \fBmoGenSolContinue< EOT >\fP, \fBmoNoFitImprSolContinue< EOT >\fP, and \fBmoSteadyFitSolContinue< EOT >\fP.
|
||||
|
||||
.SH "Author"
|
||||
.PP
|
||||
Generated automatically by Doxygen for ParadisEO-MOMovingObjects from the source code.
|
||||
|
|
@ -1,131 +0,0 @@
|
|||
.TH "moSteadyFitSolContinue" 3 "15 Jan 2008" "Version 1.0" "ParadisEO-MOMovingObjects" \" -*- nroff -*-
|
||||
.ad l
|
||||
.nh
|
||||
.SH NAME
|
||||
moSteadyFitSolContinue \- One possible stopping criterion for a solution-based heuristic.
|
||||
|
||||
.PP
|
||||
.SH SYNOPSIS
|
||||
.br
|
||||
.PP
|
||||
\fC#include <moSteadyFitSolContinue.h>\fP
|
||||
.PP
|
||||
Inherits \fBmoSolContinue< EOT >< EOT >\fP.
|
||||
.PP
|
||||
.SS "Public Types"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "typedef EOT::Fitness \fBFitness\fP"
|
||||
.br
|
||||
.RI "\fIAlias for the fitness. \fP"
|
||||
.in -1c
|
||||
.SS "Public Member Functions"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "\fBmoSteadyFitSolContinue\fP (unsigned int _maxNumberOfIterations, unsigned int _maxNumberOfIterationWithoutImprovement)"
|
||||
.br
|
||||
.RI "\fIBasic constructor. \fP"
|
||||
.ti -1c
|
||||
.RI "bool \fBoperator()\fP (const EOT &_solution)"
|
||||
.br
|
||||
.RI "\fI\fBFunction\fP that activates the stopping criterion. \fP"
|
||||
.ti -1c
|
||||
.RI "void \fBinit\fP ()"
|
||||
.br
|
||||
.RI "\fIProcedure which allows to initialise the stuff needed. \fP"
|
||||
.in -1c
|
||||
.SS "Private Attributes"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "unsigned int \fBmaxNumberOfIterations\fP"
|
||||
.br
|
||||
.RI "\fIMaximum number of iterations before considering the fitness. \fP"
|
||||
.ti -1c
|
||||
.RI "unsigned int \fBmaxNumberOfIterationsWithoutImprovement\fP"
|
||||
.br
|
||||
.RI "\fIMaximum number of iterations without improvement allowed. \fP"
|
||||
.ti -1c
|
||||
.RI "bool \fBmaxNumberOfIterationsReached\fP"
|
||||
.br
|
||||
.RI "\fIFlag that indicates that the maxNumberIteration have been reached. \fP"
|
||||
.ti -1c
|
||||
.RI "bool \fBfirstFitnessSaved\fP"
|
||||
.br
|
||||
.RI "\fIFlag that this is the first time that the fitness is used. \fP"
|
||||
.ti -1c
|
||||
.RI "\fBFitness\fP \fBfitness\fP"
|
||||
.br
|
||||
.RI "\fICurrent Fitness. \fP"
|
||||
.ti -1c
|
||||
.RI "unsigned int \fBcounter\fP"
|
||||
.br
|
||||
.RI "\fIThe iteration couter. \fP"
|
||||
.in -1c
|
||||
.SH "Detailed Description"
|
||||
.PP
|
||||
|
||||
.SS "template<class EOT> class moSteadyFitSolContinue< EOT >"
|
||||
One possible stopping criterion for a solution-based heuristic.
|
||||
|
||||
The stop criterion corresponds to a maximum number of iterations without improvement (after a minimum number of iterations).
|
||||
.PP
|
||||
Definition at line 46 of file moSteadyFitSolContinue.h.
|
||||
.SH "Constructor & Destructor Documentation"
|
||||
.PP
|
||||
.SS "template<class EOT> \fBmoSteadyFitSolContinue\fP< EOT >::\fBmoSteadyFitSolContinue\fP (unsigned int _maxNumberOfIterations, unsigned int _maxNumberOfIterationWithoutImprovement)\fC [inline]\fP"
|
||||
.PP
|
||||
Basic constructor.
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_maxNumberOfIterations\fP The number of iterations to reach before looking for the fitness.
|
||||
.br
|
||||
\fI_maxNumberOfIterationWithoutImprovement\fP The number of iterations without fitness improvement to reach for stop.
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Definition at line 58 of file moSteadyFitSolContinue.h.
|
||||
.SH "Member Function Documentation"
|
||||
.PP
|
||||
.SS "template<class EOT> bool \fBmoSteadyFitSolContinue\fP< EOT >::operator() (const EOT & _solution)\fC [inline, virtual]\fP"
|
||||
.PP
|
||||
\fBFunction\fP that activates the stopping criterion.
|
||||
.PP
|
||||
Indicates if the fitness has not been improved since a number of iterations (after a minimum of iterations).
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_solution\fP the current solution.
|
||||
.RE
|
||||
.PP
|
||||
\fBReturns:\fP
|
||||
.RS 4
|
||||
true or false.
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Implements \fBeoUF< const EOT &, bool >\fP.
|
||||
.PP
|
||||
Definition at line 70 of file moSteadyFitSolContinue.h.
|
||||
.PP
|
||||
References moSteadyFitSolContinue< EOT >::counter, moSteadyFitSolContinue< EOT >::firstFitnessSaved, moSteadyFitSolContinue< EOT >::fitness, moSteadyFitSolContinue< EOT >::maxNumberOfIterations, moSteadyFitSolContinue< EOT >::maxNumberOfIterationsReached, and moSteadyFitSolContinue< EOT >::maxNumberOfIterationsWithoutImprovement.
|
||||
.SS "template<class EOT> void \fBmoSteadyFitSolContinue\fP< EOT >::init ()\fC [inline, virtual]\fP"
|
||||
.PP
|
||||
Procedure which allows to initialise the stuff needed.
|
||||
.PP
|
||||
It can be also used to reinitialize the counter all the needed things.
|
||||
.PP
|
||||
Implements \fBmoSolContinue< EOT >\fP.
|
||||
.PP
|
||||
Definition at line 114 of file moSteadyFitSolContinue.h.
|
||||
.PP
|
||||
References moSteadyFitSolContinue< EOT >::counter, moSteadyFitSolContinue< EOT >::firstFitnessSaved, and moSteadyFitSolContinue< EOT >::maxNumberOfIterationsReached.
|
||||
|
||||
.SH "Author"
|
||||
.PP
|
||||
Generated automatically by Doxygen for ParadisEO-MOMovingObjects from the source code.
|
||||
|
|
@ -1,142 +0,0 @@
|
|||
.TH "moTS" 3 "15 Jan 2008" "Version 1.0" "ParadisEO-MOMovingObjects" \" -*- nroff -*-
|
||||
.ad l
|
||||
.nh
|
||||
.SH NAME
|
||||
moTS \- Tabu Search (TS).
|
||||
|
||||
.PP
|
||||
.SH SYNOPSIS
|
||||
.br
|
||||
.PP
|
||||
\fC#include <moTS.h>\fP
|
||||
.PP
|
||||
Inherits \fBmoAlgo< M::EOType >\fP.
|
||||
.PP
|
||||
.SS "Public Member Functions"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "\fBmoTS\fP (\fBmoMoveInit\fP< M > &_move_initializer, \fBmoNextMove\fP< M > &_next_move_generator, \fBmoMoveIncrEval\fP< M > &_incremental_evaluation, \fBmoTabuList\fP< M > &_tabu_list, \fBmoAspirCrit\fP< M > &_aspiration_criterion, \fBmoSolContinue\fP< \fBEOT\fP > &_continue, \fBeoEvalFunc\fP< \fBEOT\fP > &_full_evaluation)"
|
||||
.br
|
||||
.RI "\fIConstructor of a \fBmoTS\fP specifying all the boxes. \fP"
|
||||
.ti -1c
|
||||
.RI "\fBmoTS\fP (\fBmoMoveExpl\fP< M > &_move_explorer, \fBmoSolContinue\fP< \fBEOT\fP > &_continue, \fBeoEvalFunc\fP< \fBEOT\fP > &_full_evaluation)"
|
||||
.br
|
||||
.RI "\fIConstructor with less parameters. \fP"
|
||||
.ti -1c
|
||||
.RI "bool \fBoperator()\fP (\fBEOT\fP &_solution)"
|
||||
.br
|
||||
.RI "\fI\fBFunction\fP which launchs the Tabu Search. \fP"
|
||||
.in -1c
|
||||
.SS "Private Types"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "typedef M::EOType \fBEOT\fP"
|
||||
.br
|
||||
.RI "\fIAlias for the type. \fP"
|
||||
.ti -1c
|
||||
.RI "typedef EOT::Fitness \fBFitness\fP"
|
||||
.br
|
||||
.RI "\fIAlias for the fitness. \fP"
|
||||
.in -1c
|
||||
.SS "Private Attributes"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "\fBmoMoveExpl\fP< M > & \fBmove_explorer\fP"
|
||||
.br
|
||||
.RI "\fINeighborhood explorer. \fP"
|
||||
.ti -1c
|
||||
.RI "\fBmoSolContinue\fP< \fBEOT\fP > & \fBcontinu\fP"
|
||||
.br
|
||||
.RI "\fIStop criterion. \fP"
|
||||
.ti -1c
|
||||
.RI "\fBeoEvalFunc\fP< \fBEOT\fP > & \fBfull_evaluation\fP"
|
||||
.br
|
||||
.RI "\fIFull evaluation function. \fP"
|
||||
.in -1c
|
||||
.SH "Detailed Description"
|
||||
.PP
|
||||
|
||||
.SS "template<class M> class moTS< M >"
|
||||
Tabu Search (TS).
|
||||
|
||||
Generic algorithm that describes a tabu search.
|
||||
.PP
|
||||
Definition at line 50 of file moTS.h.
|
||||
.SH "Constructor & Destructor Documentation"
|
||||
.PP
|
||||
.SS "template<class M> \fBmoTS\fP< M >::\fBmoTS\fP (\fBmoMoveInit\fP< M > & _move_initializer, \fBmoNextMove\fP< M > & _next_move_generator, \fBmoMoveIncrEval\fP< M > & _incremental_evaluation, \fBmoTabuList\fP< M > & _tabu_list, \fBmoAspirCrit\fP< M > & _aspiration_criterion, \fBmoSolContinue\fP< \fBEOT\fP > & _continue, \fBeoEvalFunc\fP< \fBEOT\fP > & _full_evaluation)\fC [inline]\fP"
|
||||
.PP
|
||||
Constructor of a \fBmoTS\fP specifying all the boxes.
|
||||
.PP
|
||||
In this constructor, a \fBmoTSMoveLoopExpl\fP is instanciated.
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_move_initializer\fP The move initializer.
|
||||
.br
|
||||
\fI_next_move_generator\fP The neighbourhood explorer.
|
||||
.br
|
||||
\fI_incremental_evaluation\fP The (generally) efficient evaluation.
|
||||
.br
|
||||
\fI_tabu_list\fP The tabu list.
|
||||
.br
|
||||
\fI_aspiration_criterion\fP An aspiration criterion.
|
||||
.br
|
||||
\fI_continue\fP The stopping criterion.
|
||||
.br
|
||||
\fI_full_evaluation\fP A full evaluation function.
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Definition at line 72 of file moTS.h.
|
||||
.SS "template<class M> \fBmoTS\fP< M >::\fBmoTS\fP (\fBmoMoveExpl\fP< M > & _move_explorer, \fBmoSolContinue\fP< \fBEOT\fP > & _continue, \fBeoEvalFunc\fP< \fBEOT\fP > & _full_evaluation)\fC [inline]\fP"
|
||||
.PP
|
||||
Constructor with less parameters.
|
||||
.PP
|
||||
The explorer is given in the parameters.
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_move_explorer\fP The explorer (generally different that a \fBmoTSMoveLoopExpl\fP).
|
||||
.br
|
||||
\fI_continue\fP The stopping criterion.
|
||||
.br
|
||||
\fI_full_evaluation\fP A full evaluation function.
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Definition at line 89 of file moTS.h.
|
||||
.SH "Member Function Documentation"
|
||||
.PP
|
||||
.SS "template<class M> bool \fBmoTS\fP< M >::operator() (\fBEOT\fP & _solution)\fC [inline, virtual]\fP"
|
||||
.PP
|
||||
\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
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_solution\fP a solution to improve.
|
||||
.RE
|
||||
.PP
|
||||
\fBReturns:\fP
|
||||
.RS 4
|
||||
TRUE.
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Implements \fBeoUF< M::EOType &, bool >\fP.
|
||||
.PP
|
||||
Definition at line 102 of file moTS.h.
|
||||
.PP
|
||||
References moTS< M >::continu, moTS< M >::full_evaluation, and moTS< M >::move_explorer.
|
||||
|
||||
.SH "Author"
|
||||
.PP
|
||||
Generated automatically by Doxygen for ParadisEO-MOMovingObjects from the source code.
|
||||
|
|
@ -1,125 +0,0 @@
|
|||
.TH "moTSMoveLoopExpl" 3 "15 Jan 2008" "Version 1.0" "ParadisEO-MOMovingObjects" \" -*- nroff -*-
|
||||
.ad l
|
||||
.nh
|
||||
.SH NAME
|
||||
moTSMoveLoopExpl \- Explorer for a Tabu Search algorithm.
|
||||
|
||||
.PP
|
||||
.SH SYNOPSIS
|
||||
.br
|
||||
.PP
|
||||
\fC#include <moTSMoveLoopExpl.h>\fP
|
||||
.PP
|
||||
Inherits \fBmoMoveLoopExpl< M >< M >\fP.
|
||||
.PP
|
||||
.SS "Public Member Functions"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "\fBmoTSMoveLoopExpl\fP (\fBmoMoveInit\fP< M > &_move_initializer, \fBmoNextMove\fP< M > &_next_move_generator, \fBmoMoveIncrEval\fP< M > &_incremental_evaluation, \fBmoTabuList\fP< M > &_tabu_list, \fBmoAspirCrit\fP< M > &_aspiration_criterion)"
|
||||
.br
|
||||
.RI "\fIConstructor. \fP"
|
||||
.ti -1c
|
||||
.RI "void \fBoperator()\fP (const \fBEOT\fP &_old_solution, \fBEOT\fP &_new_solution)"
|
||||
.br
|
||||
.RI "\fIProcedure which lauches the exploration. \fP"
|
||||
.in -1c
|
||||
.SS "Private Types"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "typedef M::EOType \fBEOT\fP"
|
||||
.br
|
||||
.RI "\fIAlias for the type. \fP"
|
||||
.ti -1c
|
||||
.RI "typedef M::EOType::Fitness \fBFitness\fP"
|
||||
.br
|
||||
.RI "\fIAlias for the fitness. \fP"
|
||||
.in -1c
|
||||
.SS "Private Attributes"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "\fBmoMoveInit\fP< M > & \fBmove_initializer\fP"
|
||||
.br
|
||||
.RI "\fIMove initialisation. \fP"
|
||||
.ti -1c
|
||||
.RI "\fBmoNextMove\fP< M > & \fBnext_move_generator\fP"
|
||||
.br
|
||||
.RI "\fINeighborhood explorer. \fP"
|
||||
.ti -1c
|
||||
.RI "\fBmoMoveIncrEval\fP< M > & \fBincremental_evaluation\fP"
|
||||
.br
|
||||
.RI "\fIEfficient evaluation. \fP"
|
||||
.ti -1c
|
||||
.RI "\fBmoBestImprSelect\fP< M > \fBmove_selection\fP"
|
||||
.br
|
||||
.RI "\fIMove selector. \fP"
|
||||
.ti -1c
|
||||
.RI "\fBmoTabuList\fP< M > & \fBtabu_list\fP"
|
||||
.br
|
||||
.RI "\fITabu list. \fP"
|
||||
.ti -1c
|
||||
.RI "\fBmoAspirCrit\fP< M > & \fBaspiration_criterion\fP"
|
||||
.br
|
||||
.RI "\fIAspiration criterion. \fP"
|
||||
.in -1c
|
||||
.SH "Detailed Description"
|
||||
.PP
|
||||
|
||||
.SS "template<class M> class moTSMoveLoopExpl< M >"
|
||||
Explorer for a Tabu Search algorithm.
|
||||
|
||||
It is used by a \fBmoTS\fP.
|
||||
.PP
|
||||
Definition at line 53 of file moTSMoveLoopExpl.h.
|
||||
.SH "Constructor & Destructor Documentation"
|
||||
.PP
|
||||
.SS "template<class M> \fBmoTSMoveLoopExpl\fP< M >::\fBmoTSMoveLoopExpl\fP (\fBmoMoveInit\fP< M > & _move_initializer, \fBmoNextMove\fP< M > & _next_move_generator, \fBmoMoveIncrEval\fP< M > & _incremental_evaluation, \fBmoTabuList\fP< M > & _tabu_list, \fBmoAspirCrit\fP< M > & _aspiration_criterion)\fC [inline]\fP"
|
||||
.PP
|
||||
Constructor.
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_move_initializer\fP The move initializer.
|
||||
.br
|
||||
\fI_next_move_generator\fP The neighbourhood explorer.
|
||||
.br
|
||||
\fI_incremental_evaluation\fP A (generally) efficient evaluation.
|
||||
.br
|
||||
\fI_tabu_list\fP The tabu list.
|
||||
.br
|
||||
\fI_aspiration_criterion\fP An aspiration criterion.
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Definition at line 71 of file moTSMoveLoopExpl.h.
|
||||
.PP
|
||||
References moTSMoveLoopExpl< M >::aspiration_criterion, and moTSMoveLoopExpl< M >::tabu_list.
|
||||
.SH "Member Function Documentation"
|
||||
.PP
|
||||
.SS "template<class M> void \fBmoTSMoveLoopExpl\fP< M >::operator() (const \fBEOT\fP & _old_solution, \fBEOT\fP & _new_solution)\fC [inline, virtual]\fP"
|
||||
.PP
|
||||
Procedure which lauches the exploration.
|
||||
.PP
|
||||
The exploration continues while the chosen move is not in the tabu list or the aspiration criterion is true. If these 2 conditions are not true, the exploration stops if the move selector update function returns false.
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_old_solution\fP the initial solution
|
||||
.br
|
||||
\fI_new_solution\fP the new solution
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Implements \fBeoBF< const M::EOType &, M::EOType &, void >\fP.
|
||||
.PP
|
||||
Definition at line 90 of file moTSMoveLoopExpl.h.
|
||||
.PP
|
||||
References moTSMoveLoopExpl< M >::aspiration_criterion, moTSMoveLoopExpl< M >::incremental_evaluation, moTSMoveLoopExpl< M >::move_initializer, moTSMoveLoopExpl< M >::move_selection, moTSMoveLoopExpl< M >::next_move_generator, and moTSMoveLoopExpl< M >::tabu_list.
|
||||
|
||||
.SH "Author"
|
||||
.PP
|
||||
Generated automatically by Doxygen for ParadisEO-MOMovingObjects from the source code.
|
||||
|
|
@ -1,85 +0,0 @@
|
|||
.TH "moTabuList" 3 "15 Jan 2008" "Version 1.0" "ParadisEO-MOMovingObjects" \" -*- nroff -*-
|
||||
.ad l
|
||||
.nh
|
||||
.SH NAME
|
||||
moTabuList \- Class describing a tabu list that a \fBmoTS\fP uses.
|
||||
|
||||
.PP
|
||||
.SH SYNOPSIS
|
||||
.br
|
||||
.PP
|
||||
\fC#include <moTabuList.h>\fP
|
||||
.PP
|
||||
Inherits \fBeoBF< A1, A2, R >< const const M &, M::EOType &, bool >\fP.
|
||||
.PP
|
||||
Inherited by \fBmoSimpleMoveTabuList< M >\fP, and \fBmoSimpleSolutionTabuList< M >\fP.
|
||||
.PP
|
||||
.SS "Public Types"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "typedef M::EOType \fBEOT\fP"
|
||||
.br
|
||||
.RI "\fIAlias for the type. \fP"
|
||||
.in -1c
|
||||
.SS "Public Member Functions"
|
||||
|
||||
.in +1c
|
||||
.ti -1c
|
||||
.RI "virtual void \fBadd\fP (const M &_move, const \fBEOT\fP &_solution)=0"
|
||||
.br
|
||||
.RI "\fIProcedure to add a move in the tabu list. \fP"
|
||||
.ti -1c
|
||||
.RI "virtual void \fBupdate\fP ()=0"
|
||||
.br
|
||||
.RI "\fIProcedure that updates the tabu list content. \fP"
|
||||
.ti -1c
|
||||
.RI "virtual void \fBinit\fP ()=0"
|
||||
.br
|
||||
.RI "\fIProcedure which initialises the tabu list. \fP"
|
||||
.in -1c
|
||||
.SH "Detailed Description"
|
||||
.PP
|
||||
|
||||
.SS "template<class M> class moTabuList< M >"
|
||||
Class describing a tabu list that a \fBmoTS\fP uses.
|
||||
|
||||
It is only a description, does nothing... A new object that herits from this class has to be defined in order to be used in a \fBmoTS\fP.
|
||||
.PP
|
||||
Definition at line 46 of file moTabuList.h.
|
||||
.SH "Member Function Documentation"
|
||||
.PP
|
||||
.SS "template<class M> virtual void \fBmoTabuList\fP< M >::add (const M & _move, const \fBEOT\fP & _solution)\fC [pure virtual]\fP"
|
||||
.PP
|
||||
Procedure to add a move in the tabu list.
|
||||
.PP
|
||||
The two parameters have not to be modified so they are constant parameters.
|
||||
.PP
|
||||
\fBParameters:\fP
|
||||
.RS 4
|
||||
\fI_move\fP a new tabu move.
|
||||
.br
|
||||
\fI_solution\fP the origianl solution associated to this move.
|
||||
.RE
|
||||
.PP
|
||||
|
||||
.PP
|
||||
Implemented in \fBmoSimpleMoveTabuList< M >\fP, and \fBmoSimpleSolutionTabuList< M >\fP.
|
||||
.SS "template<class M> virtual void \fBmoTabuList\fP< M >::update ()\fC [pure virtual]\fP"
|
||||
.PP
|
||||
Procedure that updates the tabu list content.
|
||||
.PP
|
||||
Generally, a counter associated to each saved move is decreased by one.
|
||||
.PP
|
||||
Implemented in \fBmoSimpleMoveTabuList< M >\fP, and \fBmoSimpleSolutionTabuList< M >\fP.
|
||||
.SS "template<class M> virtual void \fBmoTabuList\fP< M >::init ()\fC [pure virtual]\fP"
|
||||
.PP
|
||||
Procedure which initialises the tabu list.
|
||||
.PP
|
||||
Can be useful if the data structure needs to be allocated before being used.
|
||||
.PP
|
||||
Implemented in \fBmoSimpleMoveTabuList< M >\fP, and \fBmoSimpleSolutionTabuList< M >\fP.
|
||||
|
||||
.SH "Author"
|
||||
.PP
|
||||
Generated automatically by Doxygen for ParadisEO-MOMovingObjects from the source code.
|
||||
Loading…
Add table
Add a link
Reference in a new issue