Implemented the ibea algorithme

src/ibea/ibea.cpp

+#include "../coco/coco.h"
 #include "population.h"
+#include "fitness.h"
+#include "tournament.h"
+#include "combination.h"
+#include "mutation.h"
 #include "ibea.h"
 
-IBEA::IBEA(){
 
-}
 
-IBEA::~IBEA(){
+void ibea(void* evaluate,
+          const size_t dimension,
+          const size_t number_of_objectives,
+          const double *lower_bounds,
+          const double *upper_bounds,
+          const size_t max_budget,
+          coco_random_state_t *random_generator)
+{
+  /* Parameters */
+  int n_individus = 20; /* number of individus per generations */
+  int n_generations = (int) max_budget/n_individus; /* number of generations */
+  int mu = 10; /* number of tournament */
+  int eta = 100; /* polynomiale mutation degree */
+
+  Population pop = Population(n_individus, dimension);
+  Population new_pop = Population(n_individus, dimension);
+
+  random_init(&pop, random_generator);
+
+  /* Iterations */
+  int m = 0;
+  while (m < n_generations){
+    /* 2 Fitness assignment */
+    fitnesses(&pop);
+
+    new_pop_.empty();
+    while (new_pop.getCurrentSize() < n_individus){
+      /* 3 Environemental select */
+      fitnesses_update(pop_);
 
+      /* 4 */
+
+      /* 5 Fill mating pool */
+      binary_tournament(pop, &new_pop, mu, random_generator);
     }
 
-void IBEA::run(){
+    /* 6 Combination and Mutation */
+    pop_.empty();
+    combinate(new_pop, &pop, random_generator);
+    mutate(&pop, lower_bounds, upper_bounds, eta, random_generator);
+    m++;
+  }
+}
 
+void random_init(&Population pop, coco_random_state_t *random_generator){
+  for (int i=0; i < pop.getSize(); i++){
+    for (int j=0; j < pop.getDim(); j++) {
+      range = upper_bounds[j] - lower_bounds[j];
+      pop.setIndiv(i,j) = lower_bounds[j] + coco_random_uniform(random_generator) * range;
+    }
+  }
 }

src/ibea/ibea.h

 #ifndef IBEA_H
 #define IBEA_H
 
-class IBEA{
-private:
-  Population pop;
-  void (*evaluate)();
-  void (*fitness)(Population);
-  void (*tournament)();
-  void (*mutation)(Population);
-  void (*combination)(Population);
-
-public:
-  IBEA();
-  ~IBEA();
-  void run();
-
-};
+void ibea(void* evaluate,
+          const size_t dimension,
+          const size_t number_of_objectives,
+          const double *lower_bounds,
+          const double *upper_bounds,
+          const size_t max_budget,
+          coco_random_state_t *random_generator);
+
+void random_init(&Population pop, coco_random_state_t *random_generator);
 
 #endif