git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@1981 331e1502-861f-0410-8da2-ba01fb791d7f
This commit is contained in:
boufaras
parent
585454f7b5
commit
5d9433896e
1 changed files with 112 additions and 104 deletions
|
|
@ -1,36 +1,36 @@
|
||||||
/*
|
/*
|
||||||
<moOrderNeighborhood.h>
|
<moOrderNeighborhood.h>
|
||||||
Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010
|
Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010
|
||||||
|
|
||||||
Sébastien Verel, Arnaud Liefooghe, Jérémie Humeau
|
Sébastien Verel, Arnaud Liefooghe, Jérémie Humeau
|
||||||
|
|
||||||
This software is governed by the CeCILL license under French law and
|
This software is governed by the CeCILL license under French law and
|
||||||
abiding by the rules of distribution of free software. You can use,
|
abiding by the rules of distribution of free software. You can use,
|
||||||
modify and/ or redistribute the software under the terms of the CeCILL
|
modify and/ or redistribute the software under the terms of the CeCILL
|
||||||
license as circulated by CEA, CNRS and INRIA at the following URL
|
license as circulated by CEA, CNRS and INRIA at the following URL
|
||||||
"http://www.cecill.info".
|
"http://www.cecill.info".
|
||||||
|
|
||||||
As a counterpart to the access to the source code and rights to copy,
|
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
|
modify and redistribute granted by the license, users are provided only
|
||||||
with a limited warranty and the software's author, the holder of the
|
with a limited warranty and the software's author, the holder of the
|
||||||
economic rights, and the successive licensors have only limited liability.
|
economic rights, and the successive licensors have only limited liability.
|
||||||
|
|
||||||
In this respect, the user's attention is drawn to the risks associated
|
In this respect, the user's attention is drawn to the risks associated
|
||||||
with loading, using, modifying and/or developing or reproducing the
|
with loading, using, modifying and/or developing or reproducing the
|
||||||
software by the user in light of its specific status of free software,
|
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
|
that may mean that it is complicated to manipulate, and that also
|
||||||
therefore means that it is reserved for developers and experienced
|
therefore means that it is reserved for developers and experienced
|
||||||
professionals having in-depth computer knowledge. Users are therefore
|
professionals having in-depth computer knowledge. Users are therefore
|
||||||
encouraged to load and test the software's suitability as regards their
|
encouraged to load and test the software's suitability as regards their
|
||||||
requirements in conditions enabling the security of their systems and/or
|
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
|
data to be ensured and, more generally, to use and operate it in the
|
||||||
same conditions as regards security.
|
same conditions as regards security.
|
||||||
The fact that you are presently reading this means that you have had
|
The fact that you are presently reading this means that you have had
|
||||||
knowledge of the CeCILL license and that you accept its terms.
|
knowledge of the CeCILL license and that you accept its terms.
|
||||||
|
|
||||||
ParadisEO WebSite : http://paradiseo.gforge.inria.fr
|
ParadisEO WebSite : http://paradiseo.gforge.inria.fr
|
||||||
Contact: paradiseo-help@lists.gforge.inria.fr
|
Contact: paradiseo-help@lists.gforge.inria.fr
|
||||||
*/
|
*/
|
||||||
|
|
||||||
#ifndef _moOrderNeighborhood_h
|
#ifndef _moOrderNeighborhood_h
|
||||||
#define _moOrderNeighborhood_h
|
#define _moOrderNeighborhood_h
|
||||||
|
|
@ -40,82 +40,90 @@
|
||||||
/**
|
/**
|
||||||
* An ordered Neighborhood
|
* An ordered Neighborhood
|
||||||
*/
|
*/
|
||||||
template< class Neighbor >
|
template<class Neighbor>
|
||||||
class moOrderNeighborhood : public moIndexNeighborhood<Neighbor>
|
class moOrderNeighborhood: public moIndexNeighborhood<Neighbor> {
|
||||||
{
|
|
||||||
public:
|
public:
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Define type of a solution corresponding to Neighbor
|
* Define type of a solution corresponding to Neighbor
|
||||||
*/
|
*/
|
||||||
typedef typename Neighbor::EOT EOT;
|
typedef typename Neighbor::EOT EOT;
|
||||||
|
|
||||||
using moIndexNeighborhood<Neighbor>::neighborhoodSize;
|
using moIndexNeighborhood<Neighbor>::neighborhoodSize;
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Constructor
|
* Constructor
|
||||||
* @param _neighborhoodSize the size of the neighborhood
|
* @param _neighborhoodSize the size of the neighborhood
|
||||||
*/
|
*/
|
||||||
moOrderNeighborhood(unsigned int _neighborhoodSize): moIndexNeighborhood<Neighbor>(_neighborhoodSize), currentIndex(0) {}
|
moOrderNeighborhood(unsigned int _neighborhoodSize) :
|
||||||
|
moIndexNeighborhood<Neighbor> (_neighborhoodSize), currentIndex(0) {
|
||||||
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Test if a neighbor exists
|
* Test if a neighbor exists
|
||||||
* @param _solution the solution to explore
|
* @param _solution the solution to explore
|
||||||
* @return true if the neighborhood was not empty
|
* @return true if the neighborhood was not empty
|
||||||
*/
|
*/
|
||||||
virtual bool hasNeighbor(EOT& _solution) {
|
virtual bool hasNeighbor(EOT& _solution) {
|
||||||
return neighborhoodSize > 0;
|
return neighborhoodSize > 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Initialization of the neighborhood
|
* Initialization of the neighborhood
|
||||||
* @param _solution the solution to explore
|
* @param _solution the solution to explore
|
||||||
* @param _neighbor the first neighbor
|
* @param _neighbor the first neighbor
|
||||||
*/
|
*/
|
||||||
virtual void init(EOT & _solution, Neighbor & _neighbor) {
|
virtual void init(EOT & _solution, Neighbor & _neighbor) {
|
||||||
currentIndex = 0 ;
|
currentIndex = 0;
|
||||||
_neighbor.index(currentIndex) ;
|
_neighbor.index(currentIndex);
|
||||||
}
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Give the next neighbor
|
* Give the next neighbor
|
||||||
* @param _solution the solution to explore
|
* @param _solution the solution to explore
|
||||||
* @param _neighbor the next neighbor
|
* @param _neighbor the next neighbor
|
||||||
*/
|
*/
|
||||||
virtual void next(EOT & _solution, Neighbor & _neighbor) {
|
virtual void next(EOT & _solution, Neighbor & _neighbor) {
|
||||||
currentIndex++ ;
|
currentIndex++;
|
||||||
_neighbor.index(currentIndex);
|
_neighbor.index(currentIndex);
|
||||||
}
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* test if all neighbors are explore or not,if false, there is no neighbor left to explore
|
* test if all neighbors are explore or not,if false, there is no neighbor left to explore
|
||||||
* currentIndex is the index which have been used before, it is not the next neighbor which can be possibly evaluated
|
* currentIndex is the index which have been used before, it is not the next neighbor which can be possibly evaluated
|
||||||
*
|
*
|
||||||
* @param _solution the solution to explore
|
* @param _solution the solution to explore
|
||||||
* @return true if there is again a neighbor to explore
|
* @return true if there is again a neighbor to explore
|
||||||
*/
|
*/
|
||||||
virtual bool cont(EOT & _solution) {
|
virtual bool cont(EOT & _solution) {
|
||||||
return (currentIndex < neighborhoodSize - 1) ;
|
return (currentIndex < neighborhoodSize - 1);
|
||||||
}
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Getter
|
* Getter
|
||||||
* @return the position in the Neighborhood
|
* @return the position in the Neighborhood
|
||||||
*/
|
*/
|
||||||
unsigned int position() {
|
unsigned int position() {
|
||||||
return currentIndex;
|
return currentIndex;
|
||||||
}
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Return the class Name
|
* Setter the position in the Neighborhood
|
||||||
* @return the class name as a std::string
|
*/
|
||||||
*/
|
unsigned int setPosition(unsigned int _currentIndex) {
|
||||||
virtual std::string className() const {
|
currentIndex=_currentIndex;
|
||||||
return "moOrderNeighborhood";
|
}
|
||||||
}
|
|
||||||
|
/**
|
||||||
|
* Return the class Name
|
||||||
|
* @return the class name as a std::string
|
||||||
|
*/
|
||||||
|
virtual std::string className() const {
|
||||||
|
return "moOrderNeighborhood";
|
||||||
|
}
|
||||||
|
|
||||||
protected:
|
protected:
|
||||||
unsigned int currentIndex;
|
unsigned int currentIndex;
|
||||||
|
|
||||||
};
|
};
|
||||||
|
|
||||||
|
|
|
||||||
Loading…
Add table
Add a link
Reference in a new issue