change tutorials to tutorial

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

branches/paradiseo-moeo-1.0/tutorial/lesson1/FlowShopEval.h

@@ -0,0 +1,129 @@
+// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
+
+//-----------------------------------------------------------------------------
+// FlowShopEval.h
+// (c) OPAC Team (LIFL), Dolphin Project (INRIA), 2007
+/*
+    This library...
+
+    Contact: paradiseo-help@lists.gforge.inria.fr, http://paradiseo.gforge.inria.fr
+ */
+//-----------------------------------------------------------------------------
+
+#ifndef FLOWSHOPEVAL_H_
+#define FLOWSHOPEVAL_H_
+
+#include "FlowShop.h"
+#include <moeoEvalFunc.h>
+
+/**
+ * Functor
+ * Computation of the multi-objective evaluation of a FlowShop object
+ */
+class FlowShopEval : public moeoEvalFunc<FlowShop> {
+
+public:
+
+    /**
+     * constructor
+     * @param _M the number of machines 
+     * @param _N the number of jobs to schedule
+     * @param _p the processing times
+     * @param _d the due dates
+     */
+    FlowShopEval(const unsigned _M, const unsigned _N, const vector< vector<unsigned> > & _p, const vector<unsigned> & _d) :
+            M(_M), N (_N), p(_p), d(_d){
+
+        unsigned nObjs = 2;
+        std::vector<bool> bObjs(nObjs, true);
+        moeoObjectiveVectorTraits::setup(nObjs, bObjs);
+    }
+
+
+
+    /**
+     * computation of the multi-objective evaluation of an eoFlowShop object
+     * @param FlowShop & _eo  the FlowShop object to evaluate
+     */
+    void operator()(FlowShop & _eo) {
+        FlowShopObjectiveVector objVector;
+        objVector[0] = tardiness(_eo);
+        objVector[1] = makespan(_eo);
+        _eo.objectiveVector(objVector);
+    }
+
+
+
+
+
+private:
+
+    /** number of machines */
+    unsigned M;
+    /** number of jobs */
+    unsigned N;
+    /** p[i][j] = processing time of job j on machine i */
+    std::vector< std::vector<unsigned> > p;
+    /** d[j] = due-date of the job j */
+    std::vector<unsigned> d;
+
+
+
+    /**
+     * computation of the makespan
+     * @param FlowShop _eo  the FlowShop object to evaluate
+     */
+    double makespan(FlowShop _eo) {
+        // the scheduling to evaluate
+        vector<unsigned> scheduling = _eo.getScheduling();
+        // completion times computation for each job on each machine
+        // C[i][j] = completion of the jth job of the scheduling on the ith machine
+        std::vector< std::vector<unsigned> > C = completionTime(_eo);
+        // fitness == C[M-1][scheduling[N-1]];
+        return C[M-1][scheduling[N-1]];
+    }
+
+
+
+    /**
+     * computation of the tardiness
+     * @param _eo  the FlowShop object to evaluate
+     */
+    double tardiness(FlowShop _eo) {
+        // the scheduling to evaluate
+        vector<unsigned> scheduling = _eo.getScheduling();
+        // completion times computation for each job on each machine
+        // C[i][j] = completion of the jth job of the scheduling on the ith machine
+        std::vector< std::vector<unsigned> > C = completionTime(_eo);
+        // tardiness computation
+        unsigned long sum = 0;
+        for (unsigned j=0 ; j<N ; j++)
+            sum += (unsigned) std::max (0, (int) (C[M-1][scheduling[j]] - d[scheduling[j]]));
+        // fitness == sum
+        return sum;
+    }
+
+
+
+    /**
+     * computation of the completion times of a scheduling (for each job on each machine)
+     * C[i][j] = completion of the jth job of the scheduling on the ith machine
+     * @param const FlowShop _eo  the genotype to evaluate
+     */
+    std::vector< std::vector<unsigned> > completionTime(FlowShop _eo) {
+        vector<unsigned> scheduling = _eo.getScheduling();
+        std::vector< std::vector<unsigned> > C(M,N);
+        C[0][scheduling[0]] = p[0][scheduling[0]];
+        for (unsigned j=1; j<N; j++)
+            C[0][scheduling[j]] = C[0][scheduling[j-1]] + p[0][scheduling[j]];
+        for (unsigned i=1; i<M; i++)
+            C[i][scheduling[0]] = C[i-1][scheduling[0]] + p[i][scheduling[0]];
+        for (unsigned i=1; i<M; i++)
+            for (unsigned j=1; j<N; j++)
+                C[i][scheduling[j]] = std::max(C[i][scheduling[j-1]], C[i-1][scheduling[j]]) + p[i][scheduling[j]];
+        return C;
+    }
+
+};
+
+#endif /*FLOWSHOPEVAL_H_*/