diff --git a/trunk/paradiseo-moeo/src/archive/moeo2DMinHypervolumeArchive.h b/trunk/paradiseo-moeo/src/archive/moeo2DMinHypervolumeArchive.h
new file mode 100644
index 000000000..7d592eb52
--- /dev/null
+++ b/trunk/paradiseo-moeo/src/archive/moeo2DMinHypervolumeArchive.h
@@ -0,0 +1,305 @@
+/*
+* <moeo2DMinHypervolumeArchive.h>
+* Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+* (C) OPAC Team, LIFL, 2002-2007
+*
+* 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  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 MOEO2DMINHYPERVOLUMEARCHIVE_H_
+#define MOEO2DMINHYPERVOLUMEARCHIVE_H_
+
+#include <set>
+#include <climits>
+
+
+
+template < class MOEOT >
+struct comp
+{
+	// returns a "before" b
+	// all objectives = min
+	bool operator() (const MOEOT & a, const MOEOT & b)
+	{
+		return  ((a.objectiveVector()[1] < b.objectiveVector()[1]) || ((a.objectiveVector()[1] == b.objectiveVector()[1]) && (a.objectiveVector()[0] < b.objectiveVector()[0])));
+	}
+};
+
+
+/** 2D (minimization) bounded archive by hypervolume , base on a set */
+template < class MOEOT >
+class moeo2DMinHypervolumeArchive : public std::set<MOEOT, comp < MOEOT > >
+{
+public:
+
+	typedef typename MOEOT::Fitness Fitness;
+	typedef typename MOEOT::ObjectiveVector ObjectiveVector;
+	typedef typename std::set < MOEOT, comp<MOEOT>  >::iterator Iterator;
+
+	using std::set < MOEOT, comp<MOEOT> > :: begin;
+	using std::set < MOEOT, comp<MOEOT> > :: end;
+	using std::set < MOEOT, comp<MOEOT> > :: insert;
+	using std::set < MOEOT, comp<MOEOT> > :: erase;
+	using std::set < MOEOT, comp<MOEOT> > :: size;
+	using std::set < MOEOT, comp<MOEOT> > :: upper_bound;
+
+
+	/**
+	 * Ctr.
+	 * @param _maxSize size of the archive (must be >1)
+	 * @param _maxValue fitness assigned to the first and the last solution in the archive (default LONG_MAX)
+	 */
+	moeo2DMinHypervolumeArchive(unsigned int _maxSize, double _maxValue=LONG_MAX) : std::set < MOEOT, comp<MOEOT> > (), maxSize(_maxSize), maxValue(_maxValue)
+	{
+		if(maxSize<2)
+			maxSize=2;
+	}
+
+
+	/**
+	 * update the archive with a solution
+	 * @param _moeo a solution
+	 * @return true if _moeo has been added to the archive
+	 */
+	bool operator()(const MOEOT & _moeo)
+	{
+		//store result
+		bool result;
+
+		//used to affect the fitness value
+		MOEOT* tmp;
+
+		//used to find sol with minimum fitness value
+		double minFit=maxValue;
+		Iterator itMinFit;
+
+		//If archive is empty -> add the sol and affect its fitness value
+		if (size()==0){
+			result = true;
+			insert(_moeo);
+			tmp = (MOEOT*)&(*begin());
+			tmp->fitness(maxValue);
+		}
+		else{
+			//else test if sol can be added to the archive
+			result = insert(_moeo.objectiveVector());
+			if (result){
+				//if yes, insert it and recompute fitness value of MOEOT and its neighbors
+				insert(hint,_moeo);
+				if(size()>2){
+					//general case
+					hint--;
+					computeFitness(hint);
+				}
+				else{
+					//archive size < 3, fitness=maxValue for each sol
+					Iterator it=begin();
+					while(it!=end()){
+						tmp = (MOEOT*)&(*it);
+						tmp->fitness(maxValue);
+						it++;
+					}
+				}
+				//remove MOEOT with the lowest fitness value if archive size > maxSize
+				if(size()>maxSize){
+					//find sol with minimum fitness
+					for(Iterator i=begin(); i!=end(); i++){
+						if(i->fitness() < minFit){
+							minFit=i->fitness();
+							itMinFit=i;
+						}
+					}
+					//remove it and recompute fitness of its neighbors
+					Iterator ittmp=itMinFit;
+					ittmp--;
+					erase(itMinFit);
+					compute(ittmp);
+					ittmp++;
+					compute(ittmp);
+				}
+			}
+		}
+		return result;
+	}
+
+
+	/**
+	 * update the archive with a population
+	 * @param _pop a pop
+	 * @return true if at least one solution of _pop has been added to the archive
+	 */
+	bool operator()(const eoPop < MOEOT > & _pop)
+	{
+		bool result = false;
+    	bool tmp = false;
+        for (unsigned int i=0; i<_pop.size(); i++)
+        {
+            tmp = (*this)(_pop[i]);
+            result = tmp || result;
+        }
+        return result;
+	}
+
+	/**
+	 * Test if insertion is possible and fix hint if yes
+	 * @param _objVec the objective vector of the sol to insert
+	 * @return true if objVec can be added to the archive wrt Pareto-dominance
+	 */
+	bool insert(const ObjectiveVector & _objVec)
+	{
+		bool result = false;
+		Iterator it;
+		double min;
+		// set the objVec to the empty solution
+		empty.objectiveVector(_objVec);
+		// compute the position where it would possibly be added
+		it = upper_bound(empty);
+		// compute the weigth from the previous solution
+		min = begin()->objectiveVector()[0];
+		if (it != begin())
+		{
+			it--;
+			min = (*it).objectiveVector()[0];
+			it++;
+		}
+		// if it has a better weitgh, or if it's an extreme sol, let's add it
+		if (it == begin() || _objVec[0]<min)
+		{
+			// remove dominated solutions
+			remove(it,_objVec);
+			// set hint to the current iterator (probably modified by "remove")
+			hint=it;
+			// set result to true
+			result = true;
+		}
+		return result;
+	}
+
+	/**
+	 * print objective vector and fitness value of the archive
+	 */
+	void print(){
+		Iterator it = begin();
+		while(it!=end()){
+			std::cout << (*it).objectiveVector()[0] << " " << (*it).objectiveVector()[1] << ", fit: " << (*it).fitness() << std::endl;
+			it++;
+		}
+	}
+
+protected:
+
+	/** an empty MOEOT used for checking insertion */
+	MOEOT empty;
+	/** hint for the insertion */
+	Iterator hint;
+
+	/** Size max of the archive*/
+	unsigned int maxSize;
+
+	/** fitness assigned to the first and the last solution in the archive */
+	double maxValue;
+
+	/**
+	 * remove solutions from the archive that are dominated by _objVec
+	 * @param _it an iterator beginning on the first potentialy sol to remove
+	 * @param _objVec the objective vector of the new solution
+	 */
+	void remove(Iterator & _it, const ObjectiveVector & _objVec)
+	{
+		Iterator itd;
+		while ((_it!=end()) && ((*_it).objectiveVector()[0] >= _objVec[0]))
+		{
+			itd = _it;
+			_it++;
+			erase(itd);
+		}
+	}
+
+	/**
+	 * compute fitness value of a solution and its two neighbors
+	 * @param _it refer to the solution
+	 */
+	void computeFitness(Iterator& _it){
+		Iterator tmp;
+		if(_it!=begin()){
+			tmp=_it;
+			tmp--;
+			compute(tmp);
+		}
+		_it++;
+		if(_it!=end()){
+			_it--;
+			tmp=_it;
+			tmp++;
+			compute(tmp);
+		}
+		else{
+			_it--;
+		}
+		compute(_it);
+	}
+
+	/**
+	 * compute fitness value of a solution
+	 * @param _it refer to the solution
+	 */
+	void compute(Iterator& _it){
+		double x0, x1, y0, y1, fit;
+		MOEOT* tmp;
+		if(_it==begin()){
+			tmp = (MOEOT*)&(*_it);
+			tmp->fitness(maxValue);
+		}
+		else if((++_it)==end()){
+			_it--;
+			tmp = (MOEOT*)&(*_it);
+			tmp->fitness(maxValue);
+		}
+		else{
+			_it--;
+			x0 = (*_it).objectiveVector()[0];
+			y0 = (*_it).objectiveVector()[1];
+			_it--;
+			x1 = (*_it).objectiveVector()[0];
+			_it++;
+			_it++;
+			y1 = (*_it).objectiveVector()[1];
+			_it--;
+			fit= (x1 - x0) * (y1 - y0);
+			tmp = (MOEOT*)&(*_it);
+			tmp->fitness(fit);
+		}
+	}
+};
+
+#endif /*MOEO2DMINHYPERVOLUMEARCHIVE_H_ */
diff --git a/trunk/paradiseo-moeo/src/moeo b/trunk/paradiseo-moeo/src/moeo
index 3e5db4142..29b069df1 100644
--- a/trunk/paradiseo-moeo/src/moeo
+++ b/trunk/paradiseo-moeo/src/moeo
@@ -57,6 +57,7 @@
 #include <algo/moeoSPEA2.h>
 #include <algo/moeoUnifiedDominanceBasedLS.h>
 
+#include <archive/moeo2DMinHypervolumeArchive.h>
 #include <archive/moeoArchive.h>
 #include <archive/moeoBoundedArchive.h>
 #include <archive/moeoEpsilonHyperboxArchive.h>
diff --git a/trunk/paradiseo-moeo/test/CMakeLists.txt b/trunk/paradiseo-moeo/test/CMakeLists.txt
index 185b00a05..92ac7926f 100644
--- a/trunk/paradiseo-moeo/test/CMakeLists.txt
+++ b/trunk/paradiseo-moeo/test/CMakeLists.txt
@@ -103,6 +103,7 @@ SET (TEST_LIST
 		t-moeoNumberUnvisitedSelect
 		t-moeoDMLSMonOp
 		t-moeoDMLSGenUpdater
+		t-moeo2DMinHypervolumeArchive
 )
 
 FOREACH (test ${TEST_LIST})
diff --git a/trunk/paradiseo-moeo/test/t-moeo2DMinHypervolumeArchive.cpp b/trunk/paradiseo-moeo/test/t-moeo2DMinHypervolumeArchive.cpp
new file mode 100644
index 000000000..ed216eca5
--- /dev/null
+++ b/trunk/paradiseo-moeo/test/t-moeo2DMinHypervolumeArchive.cpp
@@ -0,0 +1,190 @@
+/*
+* <t-moeo2DMinHypervolumeArchive.cpp>
+* Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007
+* (C) OPAC Team, LIFL, 2002-2007
+*
+* Arnaud Liefooghe
+*
+* 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
+*
+*/
+//-----------------------------------------------------------------------------
+// t-moeo2DMinHypervolumeArchive.cpp
+//-----------------------------------------------------------------------------
+
+#include <eo>
+#include <moeo>
+#include <cassert>
+
+//-----------------------------------------------------------------------------
+
+class ObjectiveVectorTraits : public moeoObjectiveVectorTraits
+{
+public:
+    static bool minimizing (int i)
+    {
+        return true;
+    }
+    static bool maximizing (int i)
+    {
+        return false;
+    }
+    static unsigned int nObjectives ()
+    {
+        return 2;
+    }
+};
+
+typedef moeoRealObjectiveVector < ObjectiveVectorTraits > ObjectiveVector;
+
+typedef moeoBitVector < ObjectiveVector > Solution;
+
+//-----------------------------------------------------------------------------
+
+int main()
+{
+    std::cout << "[moeo2DMinHyperVolumeArchive]\t=>\t";
+
+    // objective vectors
+    ObjectiveVector obj;
+    obj[0] = 7;
+    obj[1] = 15;
+
+
+    // population
+    eoPop < Solution > pop;
+    pop.resize(0);
+
+
+    //Solutions
+    Solution a;
+    a.objectiveVector(obj);
+
+    // archive
+    moeo2DMinHypervolumeArchive< Solution > arch(5,1000);
+
+    //test archive
+    pop.push_back(a);
+
+    obj[0]=10;
+    obj[1]=14;
+    a.objectiveVector(obj);
+    pop.push_back(a);
+
+
+    obj[0]=8;
+    obj[1]=14.5;
+    a.objectiveVector(obj);
+    pop.push_back(a);
+
+    obj[0]=6;
+    obj[1]=15;
+    a.objectiveVector(obj);
+    pop.push_back(a);
+
+    obj[0]=14;
+    obj[1]=13;
+    a.objectiveVector(obj);
+    pop.push_back(a);
+
+    obj[0]=12;
+    obj[1]=13.5;
+    a.objectiveVector(obj);
+    pop.push_back(a);
+
+    obj[0]=14.5;
+    obj[1]=12.5;
+    a.objectiveVector(obj);
+    pop.push_back(a);
+
+    obj[0]=14;
+    obj[1]=13;
+    a.objectiveVector(obj);
+    pop.push_back(a);
+
+    obj[0]=11.5;
+    obj[1]=11.5;
+    a.objectiveVector(obj);
+    pop.push_back(a);
+
+    obj[0]=5.5;
+    obj[1]=12.5;
+    a.objectiveVector(obj);
+    pop.push_back(a);
+
+    obj[0]=3.5;
+    obj[1]=13.5;
+    a.objectiveVector(obj);
+    pop.push_back(a);
+
+    obj[0]=15;
+    obj[1]=3.5;
+    a.objectiveVector(obj);
+    pop.push_back(a);
+
+    obj[0]=13.5;
+    obj[1]=8;
+    a.objectiveVector(obj);
+    pop.push_back(a);
+
+    obj[0]=1;
+    obj[1]=15;
+    a.objectiveVector(obj);
+    pop.push_back(a);
+
+    arch(pop);
+
+    moeo2DMinHypervolumeArchive< Solution >::iterator it;
+    it=arch.begin();
+    assert(it->objectiveVector()[0]==15);
+    assert(it->objectiveVector()[1]==3.5);
+    assert(it->fitness()==1000);
+    it++;
+    assert(it->objectiveVector()[0]==13.5);
+    assert(it->objectiveVector()[1]==8);
+    assert(it->fitness()==6.75);
+    it++;
+    assert(it->objectiveVector()[0]==5.5);
+    assert(it->objectiveVector()[1]==12.5);
+    assert(it->fitness()==8);
+    it++;
+    assert(it->objectiveVector()[0]==3.5);
+    assert(it->objectiveVector()[1]==13.5);
+    assert(it->fitness()==3);
+    it++;
+    assert(it->objectiveVector()[0]==1);
+    assert(it->objectiveVector()[1]==15);
+    assert(it->fitness()==1000);
+
+    std::cout << "OK" << std::endl;
+    return EXIT_SUCCESS;
+}
+
+
+
+//-----------------------------------------------------------------------------