EGGP/evolutionary_algorithm.c at master · UoYCS-plasma/EGGP · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
#include "evolutionary_algorithm.h"
#include "utils.h"

Result** run_multi(EAArgs** args, int runs){
  Result** results = malloc(runs * sizeof(Result*));
  for(int i = 0; i < runs; i++){
    Result* r = run_EA(args[i]);
    results[i] = r;
    printf("%d, %lf                                                                                                                                                                  \n", r->generation, r->winning_score);
    free(args[i]);
  }
  free(args);
  return results;
}

Result* run_EA(EAArgs* args){
  Graph** population = args->initialisation(args->init_env_pointer);
  double* scores = args->evaluate(population, args->evaluation_env_pointer);
  int generation = 0;
  while(generation < args->generations && !args->termination(population, scores, args->termination_env_pointer)){
    population = args->select_repopulate(population, scores, args->select_repopulate_env_pointer);
    scores = args->evaluate(population, args->evaluation_env_pointer);
    if(args->update > 0 && generation % args->update == 0){
      int popsize = args->pop_size(population, args->pop_size_env_pointer);
      double bestScore = 999999999.9;
      if(args->maximise){
        bestScore = bestScore * -1.0;
      }
      int winner = -1;
      for(int i = 0; i < popsize; i++){
        if(args->maximise){
          if(scores[i] > bestScore){
            bestScore = scores[i];
            winner = i;
          }
        }
        else{
          if(scores[i] < bestScore){
            bestScore = scores[i];
            winner = i;
          }
        }
      }
      printf("Generation %d: winner %d has score %lf out of %d individuals", generation, winner, bestScore, popsize);
      printf(" {");
      for(int i = 0; i < popsize && i < 5; i++){
        if(scores[i] > 9999999.9){
          printf(" BIG (%d),", count_active_nodes(population[i], 0, 0));
        }
        else{
          printf(" %lf (%d),", scores[i], count_active_nodes(population[i], 0, 0));
        }
      }
      printf("}                                             \r");
    }
    generation = generation + 1;
  }
  Result* res = malloc(sizeof(Result));

  int popsize = args->pop_size(population, args->pop_size_env_pointer);
  double bestScore = 9999999999.9;
  if(args->maximise){
    bestScore = bestScore * -1.0;
  }
  int winner = -1;
  for(int i = 0; i < popsize; i++){
    if(args->maximise){
      if(scores[i] > bestScore){
        bestScore = scores[i];
        winner = i;
      }
    }
    else{
      if(scores[i] < bestScore){
        bestScore = scores[i];
        winner = i;
      }
    }
  }
  res->winning_graph = population[winner];
  res->winning_score = bestScore;
  res->generation = generation;
  res->terminated = generation == args->generations;
  if(args->update > 0){
    printf("Generation %d TERMINATED with score %lf\r", generation, res->winning_score);
  }
  free_graph_array(population, args->pop_size(population, args->pop_size_env_pointer));
  free(scores);
  return res;
}