add new class for Bit flipping with different haming distances
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@2294 331e1502-861f-0410-8da2-ba01fb791d7f
This commit is contained in:
parent
54385a0a93
commit
d8d631d64b
1 changed files with 100 additions and 0 deletions
100
trunk/paradiseo-mo/src/neighborhood/moXBitFlippingNeighbor.h
Executable file
100
trunk/paradiseo-mo/src/neighborhood/moXBitFlippingNeighbor.h
Executable file
|
|
@ -0,0 +1,100 @@
|
|||
/*
|
||||
<moXBitFlippingNeighbor.h>
|
||||
Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010
|
||||
|
||||
Boufaras Karima, Thé Van Luong
|
||||
|
||||
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 _moXBitFlippingNeighbor_h
|
||||
#define _moXBitFlippingNeighbor_h
|
||||
|
||||
#include <neighborhood/moBackableNeighbor.h>
|
||||
#include <neighborhood/moXChangeNeighbor.h>
|
||||
|
||||
/**
|
||||
* X-BitFlipping Neighbor
|
||||
* Neighbor represent different hamming distances,it's fixed by xFlip attribute
|
||||
*/
|
||||
|
||||
template<class EOT, class Fitness = typename EOT::Fitness>
|
||||
class moXBitFlippingNeighbor:public moBackableNeighbor<EOT> ,
|
||||
public moXChangeNeighbor<EOT> {
|
||||
public:
|
||||
|
||||
using moXChangeNeighbor<EOT>::indices;
|
||||
using moXChangeNeighbor<EOT>::xChange;
|
||||
using moXChangeNeighbor<EOT>::key;
|
||||
|
||||
/**
|
||||
*Default Constructor
|
||||
*/
|
||||
|
||||
moXBitFlippingNeighbor() :
|
||||
moXChangeNeighbor<EOT> () {
|
||||
}
|
||||
|
||||
/**
|
||||
* Constructor
|
||||
* @param _xFlip the number of bit to flip
|
||||
*/
|
||||
|
||||
moXBitFlippingNeighbor(unsigned int _xFlip) :
|
||||
moXChangeNeighbor<EOT> (_xFlip) {
|
||||
}
|
||||
|
||||
/**
|
||||
* Apply the K-Flip in solution
|
||||
* @param _solution the solution to move
|
||||
*/
|
||||
|
||||
virtual void move(EOT& _solution) {
|
||||
for (unsigned int i = 0; i < xChange; i++)
|
||||
_solution[indices[i]] = !_solution[indices[i]];
|
||||
_solution.invalidate();
|
||||
|
||||
}
|
||||
|
||||
/**
|
||||
* apply the K-Flip to restore the solution (use by moFullEvalByModif)
|
||||
* @param _solution the solution to move back
|
||||
*/
|
||||
|
||||
virtual void moveBack(EOT& _solution) {
|
||||
move(_solution);
|
||||
}
|
||||
|
||||
/**
|
||||
* Return the class name.
|
||||
* @return the class name as a std::string
|
||||
*/
|
||||
|
||||
virtual std::string className() const {
|
||||
return "moXBitFlippingNeighbor";
|
||||
}
|
||||
|
||||
};
|
||||
|
||||
#endif
|
||||
|
||||
Loading…
Add table
Add a link
Reference in a new issue