Ajout de fitness function royal road

git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@1766 331e1502-861f-0410-8da2-ba01fb791d7f

trunk/problems/eval/royalRoadEval.h

@@ -0,0 +1,79 @@
+/*
+<royalRoadEval.h>
+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  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 _RoyalRoadEval_h
+#define _RoyalRoadEval_h
+
+#include <eoEvalFunc.h>
+
+/**
+ * Full evaluation Function for Royal Road problem
+ */
+template< class EOT >
+class RoyalRoadEval : public eoEvalFunc<EOT>
+{
+public:
+  /**
+   * Dfault constructor
+   * @param _k size of a block
+   */
+  RoyalRoad(unsigned int _k) : k(_k) {}
+
+  /**
+   * Count the number of complete blocks in the bit string
+   * @param _sol the solution to evaluate
+   */
+  void operator() (EOT& _solution) {
+    unsigned int sum = 0;
+    unsigned int i, j;
+    unsigned int offset;
+
+    // number of blocks
+    unsigned int n = _solution.size() / k;
+
+    for (i = 0; i < n; i++) {
+      offset = i * n;
+
+      j = 0;
+      while (_solution[offset + j] && j < k) j++;
+      
+      if (j == k)
+	sum++;
+    }
+
+    _solution.fitness(sum);
+  }
+
+private:
+  // size of a block
+  unsigned int k;    
+    
+};
+
+#endif