projet_optim_m2/src/main.cpp

#include "search.h"
#include <cstdio>
#include <cstdlib>
#include <ctime> // time
#include <cassert>
#include <unistd.h> // getpid

int main(int argc, char **argv) {
  int seed = time(NULL)+getpid();
  fprintf(stderr, "seed: %d\n", seed);
  srand(seed);

  int npoints = 100, dim = 2, iterations = atoi(argv[1]);
  int p[] = {7,13, 29,3, 19};
  assert(sizeof(p)/sizeof(int) >= (unsigned int)dim);

  fprintf(stderr, "npoints = %d\ndim = %d\np = ", npoints, dim);
  for(int i = 0; i < dim; i++)
    fprintf(stderr, "%d%s", p[i], (i==dim-1) ? "\n" : ", ");
  fprintf(stderr, "iterations = %d\n\n", iterations);

  // random_search rs(dim, npoints, p);
  // rs.run(iterations);
  // sa_local_search s(dim, npoints, p, 0.992, 0.01/dim);
  // s.run(iterations);
  genetic_search s(dim, npoints, p, 10, 10, 0.5);
  s.run(iterations);

  return EXIT_SUCCESS;
}