add moPopSolNonDomInit.h to have initialization with non dominated solutions in the set
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@2097 331e1502-861f-0410-8da2-ba01fb791d7f
This commit is contained in:
parent
50da98a8c9
commit
baf6dd0ea7
1 changed files with 79 additions and 0 deletions
|
|
@ -0,0 +1,79 @@
|
||||||
|
/*
|
||||||
|
<moPopSolNonDomInit.h>
|
||||||
|
Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010
|
||||||
|
|
||||||
|
Sebastien Verel, Arnaud Liefooghe, Jeremie Humeau
|
||||||
|
|
||||||
|
This software is governed by the CeCILL license under French law and
|
||||||
|
abiding by the rules of distribution of free software. You can ue,
|
||||||
|
modify and/ or redistribute the software under the terms of the CeCILL
|
||||||
|
license as circulated by CEA, CNRS and INRIA at the following URL
|
||||||
|
"http://www.cecill.info".
|
||||||
|
|
||||||
|
In this respect, the user's attention is drawn to the risks associated
|
||||||
|
with loading, using, modifying and/or developing or reproducing the
|
||||||
|
software by the user in light of its specific status of free software,
|
||||||
|
that may mean that it is complicated to manipulate, and that also
|
||||||
|
therefore means that it is reserved for developers and experienced
|
||||||
|
professionals having in-depth computer knowledge. Users are therefore
|
||||||
|
encouraged to load and test the software's suitability as regards their
|
||||||
|
requirements in conditions enabling the security of their systems and/or
|
||||||
|
data to be ensured and, more generally, to use and operate it in the
|
||||||
|
same conditions as regards security.
|
||||||
|
The fact that you are presently reading this means that you have had
|
||||||
|
knowledge of the CeCILL license and that you accept its terms.
|
||||||
|
|
||||||
|
ParadisEO WebSite : http://paradiseo.gforge.inria.fr
|
||||||
|
Contact: paradiseo-help@lists.gforge.inria.fr
|
||||||
|
*/
|
||||||
|
|
||||||
|
#ifndef _moPopSolNonDomInit_h
|
||||||
|
#define _moPopSolNonDomInit_h
|
||||||
|
|
||||||
|
#include <problems/bitString/moPopSol.h>
|
||||||
|
#include <eoInit.h>
|
||||||
|
#include <archive/moeoUnboundedArchive.h>
|
||||||
|
|
||||||
|
template <class EOT>
|
||||||
|
class moPopSolNonDomInit: public eoInit<EOT> {
|
||||||
|
public:
|
||||||
|
typedef typename EOT::SUBEOT SUBEOT;
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Default constructor
|
||||||
|
*
|
||||||
|
* @param _rnd initializer of a solution
|
||||||
|
* @param _popSize population size of the solution-set
|
||||||
|
*/
|
||||||
|
moPopSolNonDomInit(eoInit<SUBEOT> & _rnd, eoEvalFunc<SUBEOT> & _eval, unsigned int _popSize) : rnd(_rnd), eval(_eval), popSize(_popSize){}
|
||||||
|
|
||||||
|
void operator()(EOT & _sol) {
|
||||||
|
SUBEOT tmp;
|
||||||
|
|
||||||
|
_sol.clear();
|
||||||
|
|
||||||
|
archive.clear();
|
||||||
|
|
||||||
|
while (archive.size() < popSize) {
|
||||||
|
rnd(tmp);
|
||||||
|
eval(tmp);
|
||||||
|
archive(tmp);
|
||||||
|
}
|
||||||
|
|
||||||
|
for(unsigned int i = 0; i < popSize; i++){
|
||||||
|
_sol.push_back(archive[i]);
|
||||||
|
}
|
||||||
|
|
||||||
|
_sol.invalidate();
|
||||||
|
}
|
||||||
|
|
||||||
|
private:
|
||||||
|
eoInit<SUBEOT>& rnd;
|
||||||
|
eoEvalFunc<SUBEOT> & eval;
|
||||||
|
unsigned int popSize;
|
||||||
|
|
||||||
|
moeoUnboundedArchive<SUBEOT> archive;
|
||||||
|
|
||||||
|
};
|
||||||
|
|
||||||
|
#endif
|
||||||
Loading…
Add table
Add a link
Reference in a new issue