nojhan/paradiseo
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

Migration from SVN

Browse source
This commit is contained in:
quemy 2012-08-30 11:30:11 +02:00
commit 8cd56f37db
29069 changed files with 0 additions and 4096888 deletions
Download patch file Download diff file Expand all files Collapse all files

99
mo/src/problems/permutation/moIndexedSwapNeighbor.h Normal file
View file

@ -0,0 +1,99 @@
/*
<moIndexedSwapNeighbor.h>
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 _moIndexedSwapNeighbor_h
#define _moIndexedSwapNeighbor_h
#include <neighborhood/moBackableNeighbor.h>
#include <neighborhood/moIndexNeighbor.h>
/**
* Indexed Swap Neighbor: the position of the swap are computed according to the index
*/
template <class EOT, class Fitness=typename EOT::Fitness>
class moIndexedSwapNeighbor: public moBackableNeighbor<EOT, Fitness>, public moIndexNeighbor<EOT>
{
public:
using moBackableNeighbor<EOT>::fitness;
using moIndexNeighbor<EOT>::key;
/**
* Apply the swap
* @param _solution the solution to move
*/
virtual void move(EOT& _solution) {
unsigned int tmp;
unsigned i, j;
this->getIndices(_solution.size(), i, j);
tmp = _solution[i];
_solution[i] = _solution[j];
_solution[j] = tmp;
_solution.invalidate();
}
/**
* Return the class Name
* @return the class name as a std::string
*/
virtual std::string className() const {
return "moIndexedSwapNeighbor";
}
/**
* apply the swap to restore the solution (use by moFullEvalByModif)
* @param _solution the solution to move back
*/
virtual void moveBack(EOT& _solution) {
move(_solution);
}
/**
* Get the two indexes of the swap
* @param N size of the permutation
* @param _first first index
* @param _second second index
*/
void getIndices(unsigned N, unsigned int & _first, unsigned int & _second) {
unsigned int n = (unsigned int) ( (1 + sqrt(1 + 8 * key)) / 2);
_first = key - (n - 1) * n / 2;
_second = N - 1 - (n - 1 - _first);
}
};
#endif

115
mo/src/problems/permutation/moShiftNeighbor.h Normal file
View file

@ -0,0 +1,115 @@
/*
<moShiftNeighbor.h>
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 _moShiftNeighbor_h
#define _moShiftNeighbor_h
#include <neighborhood/moIndexNeighbor.h>
/**
* Indexed Shift Neighbor
*/
template <class EOT, class Fitness=typename EOT::Fitness>
class moShiftNeighbor: public moIndexNeighbor<EOT, Fitness>
{
public:
using moIndexNeighbor<EOT, Fitness>::key;
/**
* Apply move on a solution regarding a key
* @param _sol the solution to move
*/
virtual void move(EOT & _sol) {
unsigned int tmp ;
size=_sol.size();
translate(key+1);
// keep the first component to change
tmp = _sol[first];
// shift
if (first < second) {
for (unsigned int i=first; i<second-1; i++)
_sol[i] = _sol[i+1];
// shift the first component
_sol[second-1] = tmp;
}
else { /* first > second*/
for (unsigned int i=first; i>second; i--)
_sol[i] = _sol[i-1];
// shift the first component
_sol[second] = tmp;
}
_sol.invalidate();
}
/**
* fix two indexes regarding a key
* @param _key the key allowing to compute the two indexes for the shift
*/
void translate(unsigned int _key) {
int step;
int val = _key;
int tmpSize = size * (size-1) / 2;
// moves from left to right
if (val <= tmpSize) {
step = size - 1;
first = 0;
while ((val - step) > 0) {
val = val - step;
step--;
first++;
}
second = first + val + 1;
}
// moves from right to left (equivalent moves are avoided)
else { /* val > tmpSize */
val = val - tmpSize;
step = size - 2;
second = 0;
while ((val - step) > 0) {
val = val - step;
step--;
second++;
}
first = second + val + 1;
}
}
void print() {
std::cout << key << ": [" << first << ", " << second << "] -> " << (*this).fitness() << std::endl;
}
private:
unsigned int first;
unsigned int second;
unsigned int size;
};
#endif

105
mo/src/problems/permutation/moSwapNeighbor.h Normal file
View file

@ -0,0 +1,105 @@
/*
<moSwapNeighbor.h>
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 _moSwapNeighbor_h
#define _moSwapNeighbor_h
#include <neighborhood/moBackableNeighbor.h>
/**
* Swap Neighbor
*/
template<class EOT, class Fitness = typename EOT::Fitness>
class moSwapNeighbor: public moBackableNeighbor<EOT, Fitness> {
public:
/**
* Apply the swap
* @param _solution the solution to move
*/
virtual void move(EOT& _solution) {
EOT tmp(1);
tmp[0] = _solution[indices.first];
_solution[indices.first] = _solution[indices.second];
_solution[indices.second] = tmp[0];
_solution.invalidate();
}
/**
* apply the swap to restore the solution (use by moFullEvalByModif)
* @param _solution the solution to move back
*/
virtual void moveBack(EOT& _solution) {
move(_solution);
}
/**
* Setter to fix the two indexes to swap
* @param _first first index
* @param _second second index
*/
void setIndices(unsigned int _first, unsigned int _second) {
indices.first = _first;
indices.second = _second;
}
/**
* Get the two indexes to swap
* @param _first first index
* @param _second second index
*/
void getIndices(unsigned int & _first, unsigned int & _second) {
_first = indices.first;
_second = indices.second;
}
/**
* @param _neighbor a neighbor
* @return if _neighbor and this one are equals
*/
virtual bool equals(moSwapNeighbor<EOT,Fitness>& _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<unsigned int, unsigned int> indices;
};
#endif

100
mo/src/problems/permutation/moSwapNeighborhood.h Normal file
View file

@ -0,0 +1,100 @@
/*
<moSwapNeighborhood.h>
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 _moSwapNeighborhood_h
#define _moSwapNeighborhood_h
#include <problems/permutation/moSwapNeighbor.h>
#include <neighborhood/moNeighborhood.h>
/**
* Swap Neighborhood
*/
template <class EOT, class Fitness=typename EOT::Fitness>
class moSwapNeighborhood : public moNeighborhood<moSwapNeighbor<EOT, Fitness> >
{
public:
typedef moSwapNeighbor<EOT, Fitness> 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 "moSwapNeighborhood";
}
private:
std::pair<unsigned int, unsigned int> indices;
};
#endif

104
mo/src/problems/permutation/moTwoOptExNeighbor.h Executable file
View file

@ -0,0 +1,104 @@
/*
<moTwoOptExNeighbor.h>
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 <neighborhood/moBackableNeighbor.h>
/**
* Two-opt exchange neighbor
*/
template<class EOT, class Fitness = typename EOT::Fitness>
class moTwoOptExNeighbor: public moBackableNeighbor<EOT, Fitness> {
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<stop; i++) {
std::swap(_solution[indices.first + i], _solution[indices.second - i]);
}
_solution.invalidate();
}
/**
* apply the move to restore the solution (use by moFullEvalByModif)
* @param _solution the solution to move back
*/
virtual void moveBack(EOT& _solution) {
move(_solution);
}
/**
* Setter to fix the two indexes to move
* @param _first first index
* @param _second second index
*/
void setIndices(unsigned int _first, unsigned int _second) {
indices.first = _first;
indices.second = _second;
}
/**
* Get the two indexes to move
* @param _first first index
* @param _second second index
*/
void getIndices(unsigned int & _first, unsigned int & _second) {
_first = indices.first;
_second = indices.second;
}
/**
* @param _neighbor a neighbor
* @return if _neighbor and this one are equals
*/
virtual bool equals(moTwoOptExNeighbor<EOT,Fitness> & _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<unsigned int, unsigned int> indices;
};
#endif

103
mo/src/problems/permutation/moTwoOptExNeighborhood.h Executable file
View file

@ -0,0 +1,103 @@
/*
<moTwoOptExNeighborhood.h>
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 <problems/permutation/moTwoOptExNeighbor.h>
#include <neighborhood/moNeighborhood.h>
#include <neighborhood/moIndexNeighborhood.h>
/**
* Two-opt exchange neighborhood
*/
template <class EOT, class Fitness=typename EOT::Fitness>
class moTwoOptExNeighborhood : public moNeighborhood< moTwoOptExNeighbor<EOT,Fitness> >
{
public:
typedef moTwoOptExNeighbor<EOT, Fitness> 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<unsigned int, unsigned int> indices;
};
#endif