From a29c8dfb2bee5c3001806ad21333d835a0fc0dc1 Mon Sep 17 00:00:00 2001 From: liefooga Date: Wed, 30 Mar 2011 07:12:42 +0000 Subject: [PATCH] a two-opt exchange neighborhood and neighbor added, largely inspired by the swap that is already available git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@2203 331e1502-861f-0410-8da2-ba01fb791d7f --- .../problems/permutation/moTwoOptExNeighbor.h | 104 ++++++++++++++++++ .../permutation/moTwoOptExNeighborhood.h | 103 +++++++++++++++++ 2 files changed, 207 insertions(+) create mode 100755 trunk/paradiseo-mo/src/problems/permutation/moTwoOptExNeighbor.h create mode 100755 trunk/paradiseo-mo/src/problems/permutation/moTwoOptExNeighborhood.h diff --git a/trunk/paradiseo-mo/src/problems/permutation/moTwoOptExNeighbor.h b/trunk/paradiseo-mo/src/problems/permutation/moTwoOptExNeighbor.h new file mode 100755 index 000000000..ed7198574 --- /dev/null +++ b/trunk/paradiseo-mo/src/problems/permutation/moTwoOptExNeighbor.h @@ -0,0 +1,104 @@ +/* + + Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010 + + Sébastien Verel, Arnaud Liefooghe, Jérémie 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 _moTwoOptExNeighbor_h +#define _moTwoOptExNeighbor_h + +#include + +/** + * Two-opt exchange neighbor + */ +template +class moTwoOptExNeighbor: public moBackableNeighbor { +public: + + /** + * Apply the move + * @param _solution the solution to move + */ + virtual void move(EOT& _solution) { + unsigned int stop = (indices.second - indices.first + 1) / 2; + for (unsigned int i=0; i & _neighbor) { + unsigned f, s; + _neighbor.getIndices(f, s); + return ((indices.first == f) && (indices.second == s) || (indices.first == s) && (indices.second == f)); + } + + /** + * Print the neighbor + */ + void print() { + std::cout << "[" << indices.first << ", " << indices.second << "] -> " << (*this).fitness() << std::endl; + } + +private: + std::pair indices; + +}; + +#endif diff --git a/trunk/paradiseo-mo/src/problems/permutation/moTwoOptExNeighborhood.h b/trunk/paradiseo-mo/src/problems/permutation/moTwoOptExNeighborhood.h new file mode 100755 index 000000000..9723946bb --- /dev/null +++ b/trunk/paradiseo-mo/src/problems/permutation/moTwoOptExNeighborhood.h @@ -0,0 +1,103 @@ +/* + + Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010 + + Sébastien Verel, Arnaud Liefooghe, Jérémie 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 _moTwoOptExNeighborhood_h +#define _moTwoOptExNeighborhood_h + +#include +#include + +#include + +/** + * Two-opt exchange neighborhood + */ + +template +class moTwoOptExNeighborhood : public moNeighborhood< moTwoOptExNeighbor > +{ +public: + typedef moTwoOptExNeighbor Neighbor; + + /** + * @return true if there is at least an available neighbor + */ + virtual bool hasNeighbor(EOT& _solution) { + return (_solution.size() > 1); + }; + + /** + * Initialization of the neighborhood + * @param _solution the solution to explore + * @param _current the first neighbor + */ + virtual void init(EOT& _solution, Neighbor& _current) { + indices.first=0; + indices.second=1; + _current.setIndices(0,1); + } + + /** + * Give the next neighbor + * @param _solution the solution to explore + * @param _current the next neighbor + */ + virtual void next(EOT& _solution, Neighbor& _current) { + if (indices.second==_solution.size()-1) { + indices.first++; + indices.second=indices.first+1; + } + else + indices.second++; + _current.setIndices(indices.first, indices.second); + } + + /** + * Test if there is again a neighbor + * @param _solution the solution to explore + * @return true if there is again a neighbor not explored + */ + virtual bool cont(EOT& _solution) { + return !((indices.first == (_solution.size()-2)) && (indices.second == (_solution.size()-1))); + } + + /** + * Return the class Name + * @return the class name as a std::string + */ + virtual std::string className() const { + return "moTwoOptExNeighborhood"; + } + +private: + std::pair indices; + +}; + +#endif