From ade53b7ec321a566743dca273c7ec1d843036672 Mon Sep 17 00:00:00 2001 From: verel Date: Wed, 30 Mar 2011 15:17:50 +0000 Subject: [PATCH] Add a neighborhood which flips several bits in random order git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@2204 331e1502-861f-0410-8da2-ba01fb791d7f --- .../src/problems/bitString/moBitsNeighbor.h | 10 ++ .../bitString/moBitsWithoutReplNeighborhood.h | 161 ++++++++++++++++++ 2 files changed, 171 insertions(+) create mode 100644 trunk/paradiseo-mo/src/problems/bitString/moBitsWithoutReplNeighborhood.h diff --git a/trunk/paradiseo-mo/src/problems/bitString/moBitsNeighbor.h b/trunk/paradiseo-mo/src/problems/bitString/moBitsNeighbor.h index 82c03e816..de04184b2 100644 --- a/trunk/paradiseo-mo/src/problems/bitString/moBitsNeighbor.h +++ b/trunk/paradiseo-mo/src/problems/bitString/moBitsNeighbor.h @@ -134,6 +134,16 @@ public: } } + /** + * Write object. Called printOn since it prints the object _on_ a stream. + * @param _os A std::ostream. + */ + virtual void printOn(std::ostream& _os) const { + _os << this->fitness() << " " << nBits ; + for(unsigned int i = 0; i < nBits; i++) + _os << " " << bits[i] ; + } + }; #endif diff --git a/trunk/paradiseo-mo/src/problems/bitString/moBitsWithoutReplNeighborhood.h b/trunk/paradiseo-mo/src/problems/bitString/moBitsWithoutReplNeighborhood.h new file mode 100644 index 000000000..63bf1c6c9 --- /dev/null +++ b/trunk/paradiseo-mo/src/problems/bitString/moBitsWithoutReplNeighborhood.h @@ -0,0 +1,161 @@ +/* + + 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 use, + 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". + + As a counterpart to the access to the source code and rights to copy, + modify and redistribute granted by the license, users are provided only + with a limited warranty and the software's author, the holder of the + economic rights, and the successive licensors have only limited liability. + + 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 _moBitsWithoutReplNeighborhood_h +#define _moBitsWithoutReplNeighborhood_h + +#include +#include +#include +#include + +/** + * A neighborhood for bit string solutions + * where several bits could be flipped + * under a given Hamming distance + * + * The neighborhood is explred in a random order + * and the number of neighbors is fixed by a number + */ +template< class Neighbor > +class moBitsWithoutReplNeighborhood : public moBitsNeighborhood +{ + using moBitsNeighborhood::neighborhoodSize; + using moBitsNeighborhood::setNeighbor; + using moBitsNeighborhood::key; + using moBitsNeighborhood::nBits; + +public: + + /** + * Define type of a solution corresponding to Neighbor + */ + typedef typename Neighbor::EOT EOT; + + /** + * Constructor + * @param _length bit string length + * @param _nBits maximum number of bits to flip (radius of the neighborhood) + */ + moBitsWithoutReplNeighborhood(unsigned _length, unsigned _nBits, unsigned _sampleSize): moBitsNeighborhood(_length, _nBits), sampleSize(_sampleSize) { + if (sampleSize > neighborhoodSize || sampleSize == 0) + sampleSize = neighborhoodSize; + + indexVector.resize(neighborhoodSize); + + for(unsigned int i = 0; i < neighborhoodSize; i++) + indexVector[i] = i; + } + + /** + * Test if it exist a neighbor + * @param _solution the solution to explore + * @return true if the neighborhood was not empty: the population size is at least 1 + */ + virtual bool hasNeighbor(EOT& _solution) { + return _solution.size() > 0; + } + + /** + * Initialization of the neighborhood: + * apply several bit flips on the solution + * @param _solution the solution to explore + * @param _neighbor the first neighbor + */ + virtual void init(EOT & _solution, Neighbor & _neighbor) { + maxIndex = neighborhoodSize ; + + unsigned i = rng.random(maxIndex); + key = indexVector[i]; + + unsigned tmp = indexVector[i]; + indexVector[i] = indexVector[maxIndex - 1]; + indexVector[maxIndex - 1] = tmp; + maxIndex--; + + _neighbor.bits.resize(nBits); + setNeighbor(key, _neighbor); + } + + /** + * Give the next neighbor + * apply several bit flips on the solution + * @param _solution the solution to explore (population of solutions) + * @param _neighbor the next neighbor which in order of distance + */ + virtual void next(EOT & _solution, Neighbor & _neighbor) { + unsigned i = rng.random(maxIndex); + key = indexVector[i]; + + unsigned tmp = indexVector[i]; + indexVector[i] = indexVector[maxIndex - 1]; + indexVector[maxIndex - 1] = tmp; + maxIndex--; + + setNeighbor(key, _neighbor); + } + + /** + * Test if all neighbors are explored or not,if false, there is no neighbor left to explore + * @param _solution the solution to explore + * @return true if there is again a neighbor to explore: population size larger or equals than 1 + */ + virtual bool cont(EOT & _solution) { + return neighborhoodSize - maxIndex < sampleSize ; + } + + /** + * Return the class Name + * @return the class name as a std::string + */ + virtual std::string className() const { + return "moBitsWithoutReplNeighborhood"; + } + + unsigned int index() { + return key; + } + +protected: + // number of remainded neighbors to sample + unsigned int maxIndex; + + // vector of possible index + std::vector indexVector; + + // maximum number of visited neighbor i.e. number of neighbor to sample in the neighborhood + unsigned int sampleSize; +}; + +#endif