myAlgorithm.h

#ifndef INC_METAHEURISTIC
#define INC_METAHEURISTIC
#include <iostream>
#include <cmath>
#include <vector>
#include "SetUpParams.h"
#include "Problem.h"
#include "Solution.h"
#include "Viewer.h"

using namespace std;


class MyAlgorithm
{
private:
    vector<Solution*> _solutions; // individuals in population
    const SetUpParams& _setup;
    unsigned int _upper_cost, _lower_cost; // lower and upper fitness of individuals in population

    vector<double> _results;
    Solution* _best_solution;
    const Problem& _pbm;

public:
    MyAlgorithm(const MyAlgorithm& A);
    MyAlgorithm(Problem& pbm, SetUpParams& setup);
    ~MyAlgorithm();

    friend ostream& operator<<(ostream& os, const MyAlgorithm& myAlgo);
    friend istream& operator>>(istream& is, MyAlgorithm& myAlgo);
    MyAlgorithm& operator=(const MyAlgorithm& myAlgo);
    const SetUpParams& setup() const;
    void initialize();

    void run(Viewer& fenetre);
    void evaluateFitness();
    void determineBestSolution();
    vector<double> MeanPerColumn() const;
    double Difference_Mean(int j, const vector<double>& Means, double r) const;
    void learnFromTeacher(int k, const vector<double>& Means, double r);
    void TeachingPhase(double r);
    void learnFromPeer(int P, int Q, double r);
    void LearningPhase(double r);
    void UpdateBestSolutionOverall(Solution* &OverallBestSolution);
    void changeSolutionWithinInterval(vector<double>& tabNewP, int j,double add);
    void changeSolutionWithinIntervalAfterFactor(vector<double>& tabNewP, int j, double factor);
    double valueAdaptedToPbmInterval(double original, double current);
    void speedControl(const vector<double> &oldS, vector<double> &newS) const;
    void solutionTranported(int pos);
    void TransportationPhase();
    void TutorPhase();
    const vector<double>& results() const;
    double meanResults() const;
    double sdResults() const;
    void outputSummary(ostream& outputFile);

    const vector<Solution*>& solutions() const;
    unsigned int upper_cost() const;
    unsigned int lower_cost() const;
    Solution& solution(const unsigned int index) const;
    double fitness(const unsigned int index) const;

    double best_cost() const;
    double worst_cost() const;
    Solution& best_solution() const;
    Solution& worst_solution() const;

    void evolution(int iter, Viewer& fenetre); /*makes an evolution step*/
};

#endif