problème algorithme génétique en C

Voir le sujet précédent Voir le sujet suivant Aller en bas

problème algorithme génétique en C

Message  potter le Lun 24 Nov 2008 - 13:31

Bonjour,
J'ai trouvé une difficulté à compiler et exécuter le programme suivant sous DEV-C++. Il s'agit de l'algorithme génétique écrit en C.Lorsque je fais éxécution, un message s'affiche : le fichier source n'est pas encore compilé malgré que il n'affiche aucune erreur lors dela compilation.
Prière de m'aider à le faire tourner.
Merci d'avance.
main.c
Code:

#include <stdio.h>
#include <stdlib.h>
#include <math.h>

#define square(x) ((x)*(x))
#define maxpop  500  /*Max population */
#define maxchrom 200  /*Max chromosome length*/
#define maxvar    20  /*Max no. of variables*/
#define maxfun    10  /*Max no. of functions */
#define maxcons  20  /*Max no. of Constraints*/

int gener,      /*No of generations*/
  nvar,nchrom,          /*No of variables*/
  ncons,        /*No of Constraints*/
  vlen[maxvar],  /*Array to store no of bits for each variable*/
  nmut,          /* No of Mutations */
  ncross,        /*No of crossovers*/
  ans;
float seed,      /*Random Seed*/
  pcross,        /*Cross-over Probability*/
  pmut_b, pmut_r,          /*Mutation Probability*/
  lim_b[maxvar][2], lim_r[maxvar][2];/*Limits of variable in array*/
float di,        /*Distribution Index for the Cross-over*/
  dim,          /*Distribution Index for the Mutation*/
  delta_fit,    /* variables required forfitness for fitness sharing */
  min_fit,
  front_ratio;
int optype,      /*Cross-over type*/
  nfunc,        /*No of functions*/
  sharespace;    /*Sharing space (either parameter or fitness)*/

double coef[maxvar]; /*Variable used for decoding*/

static int popsize,  /*Population Size*/
  chrom;            /*Chromosome size*/

typedef struct      /*individual properties*/
{
  int genes[maxchrom], /*bianry chromosome*/
    rank,              /*Rank of the individual*/
    flag;              /*Flag for ranking*/
  float xreal[maxvar], /*list of real variables*/
    xbin[maxvar];      /*list of decoded value of the chromosome */
  float fitness[maxfun],/*Fitness values */
    constr[maxcons],    /*Constraints values*/
    cub_len,            /*crowding distance of the individual*/
    error;              /* overall constraint violation for the individual*/
}individual;        /*Structure defining individual*/


typedef struct
{
  int maxrank;            /*Maximum rank present in the population*/
  float rankrat[maxpop];  /*Rank Ratio*/
  int rankno[maxpop];    /*Individual at different ranks*/
  individual ind[maxpop], /*Different Individuals*/
    *ind_ptr;
}population ;            /*Popuation Structure*/

#include "random.h"      /*Random Number Generator*/

#include "input.h"        /*File Takes Input from user*/

#include "realinit.h"    /*Random Initialization of the populaiton*/

#include "init.h"        /*Random Initialization of the population*/

#include "decode.h"      /*File decoding the binary dtrings*/

#include "ranking.h"      /*File Creating the Pareto Fronts*/

#include "rancon.h"      /*File Creating the Pareto Fronts when
             Constraints are specified*/

#include "func-con.h"    /*File Having the Function*/

#include "select.h"      /*File for Tournament Selection*/

#include "crossover.h"    /*Binary Cross-over*/

#include "uniformxr.h"    /*Uniform Cross-over*/

#include "realcross2.h"  /*Real Cross-over*/

#include "mut.h"          /*Binary Mutation*/

#include "realmut1.h"    /*Real Mutation*/

#include "keepaliven.h"  /*File For Elitism and Sharing Scheme*/

#include "report.h"      /*Printing the report*/

population oldpop,
  newpop,
  matepop,
  *old_pop_ptr,
  *new_pop_ptr,
  *mate_pop_ptr;
/*Defining the population Structures*/

main()
{

  /*Some Local variables to this Problem (Counters And some other pointers*/

  int i,j,l,f,maxrank1;
  float *ptr,tot;
  FILE
    *rep_ptr,
    *gen_ptr,
    *rep2_ptr,
    *end_ptr,
    *g_var,
    *lastit;
  /*File Pointers*/

  rep_ptr = fopen("output.out","w");
  gen_ptr =fopen("all_fitness.out","w");
  rep2_ptr = fopen("ranks.out","w");
  end_ptr = fopen("final_fitness.out","w");
  g_var = fopen("final_var.out","w");
  lastit = fopen("plot.out","w");
  /*Opening the files*/

  old_pop_ptr = &(oldpop);

  nmut = 0;
  ncross = 0;

  /*Get the input from the file input.h*/
  input(rep_ptr);

  fprintf(rep_ptr,"Results in a file\n");
  fprintf(end_ptr,"# Last generation population (Feasible and non-dominated)\n");
  fprintf(end_ptr,"# Fitness_vector (first %d)  Constraint_violation (next %d)  Overall_penalty\n",nfunc,ncons);
  fprintf(g_var,"#Feasible Variable_vectors for non-dominated solutions at last generation\n");
  fprintf(g_var,"# Real (first %d)  Binary (next %d)\n",nvar,nchrom);
  fprintf(lastit,"# Feasible and Non-dominated Objective Vector\n");

  /*Initialize the random no generator*/
  warmup_random(seed);

  /*Binary Initializaton*/
  if (nchrom > 0)
    init(old_pop_ptr); 
  if (nvar > 0)
    realinit(old_pop_ptr);
 
  old_pop_ptr = &(oldpop);

  // decode binary strings
  decode(old_pop_ptr);

  old_pop_ptr = &(oldpop);
  new_pop_ptr = &(newpop);
 
  for(j = 0;j < popsize;j++)
    {
      /*Initializing the Rank array having different individuals
   at a particular  rank to zero*/
      old_pop_ptr->rankno[j] = 0;
      new_pop_ptr->rankno[j] = 0;
    }
 
  old_pop_ptr = &(oldpop);
 
  func(old_pop_ptr);
  /*Function Calculaiton*/
 
  fprintf(rep_ptr,"----------------------------------------------------\n");
  fprintf(rep_ptr,"Statistics at Generation 0 ->\n");
  fprintf(rep_ptr,"--------------------------------------------------\n");
 
  /********************************************************************/
  /*----------------------GENERATION STARTS HERE----------------------*/
  for (i = 0;i < gener;i++)
    {
      printf("Generation = %d\n",i+1);
      old_pop_ptr = &(oldpop);
      mate_pop_ptr = &(matepop);
      fprintf(rep_ptr,"Population at generation no. -->%d\n",i+1);
      fprintf(gen_ptr,"#Generation No. -->%d\n",i+1);
      fprintf(gen_ptr,"#Variable_vector  Fitness_vector Constraint_violation Overall_penalty\n");
     
      /*--------SELECT----------------*/
      nselect(old_pop_ptr ,mate_pop_ptr );
     
      new_pop_ptr = &(newpop);
      mate_pop_ptr = &(matepop);
     
      /*CROSSOVER----------------------------*/     
      if (nchrom > 0)
   {
    
     if(optype == 1)
       {
         crossover(new_pop_ptr ,mate_pop_ptr );
         /*Binary Cross-over*/
       }
    
     if(optype == 2)
       {
         unicross(new_pop_ptr ,mate_pop_ptr );
         /*Binary Uniform Cross-over*/
       }
   }
      if (nvar > 0)
   realcross(new_pop_ptr ,mate_pop_ptr );
      /*Real Cross-over*/
     
     
      /*------MUTATION-------------------*/
      new_pop_ptr = &(newpop);
     
      if (nchrom > 0)
   mutate(new_pop_ptr );
      /*Binary Mutation */
     
      if (nvar > 0)
   real_mutate(new_pop_ptr );
      /*Real Mutation*/
     
      new_pop_ptr = &(newpop);
     
      /*-------DECODING----------*/
      if(nchrom > 0)
   decode(new_pop_ptr );
      /*Decoding for binary strings*/
     
      /*----------FUNCTION EVALUATION-----------*/
      new_pop_ptr = &(newpop);
      func(new_pop_ptr );
     
      /*-------------------SELECTION KEEPING FRONTS ALIVE--------------*/
      old_pop_ptr = &(oldpop);
      new_pop_ptr = &(newpop);
      mate_pop_ptr = &(matepop);
     
      /*Elitism And Sharing Implemented*/
      keepalive(old_pop_ptr ,new_pop_ptr ,mate_pop_ptr,i+1);     
     
      mate_pop_ptr = &(matepop);
      if(nchrom > 0)
   decode(mate_pop_ptr );
     
      mate_pop_ptr = &(matepop);
      /*------------------REPORT PRINTING--------------------------------*/ 
      report(i ,old_pop_ptr ,mate_pop_ptr ,rep_ptr ,gen_ptr, lastit );
     
      /*==================================================================*/
     
      /*----------------Rank Ratio Calculation------------------------*/
      new_pop_ptr = &(matepop);
      old_pop_ptr = &(oldpop);
     
      /*Finding the greater maxrank among the two populations*/
     
      if(old_pop_ptr->maxrank > new_pop_ptr->maxrank)
   maxrank1 = old_pop_ptr->maxrank;
      else
   maxrank1 = new_pop_ptr->maxrank;

      fprintf(rep2_ptr,"--------RANK AT GENERATION %d--------------\n",i+1);
      fprintf(rep2_ptr,"Rank old ranks  new ranks    rankratio\n");

      for(j = 0;j < maxrank1 ; j++)
   {
     /*Sum of the no of individuals at any rank in old population
       and the new populaion*/
    
     tot = (old_pop_ptr->rankno[j])+ (new_pop_ptr->rankno[j]);
    
     /*Finding the rank ratio for new population at this rank*/
    
     new_pop_ptr->rankrat[j] = (new_pop_ptr->rankno[j])/tot;
    
     /*Printing this rank ratio to a file called ranks.dat*/
    
     fprintf(rep2_ptr," %d\t  %d\t\t %d\t %f\n",j+1,old_pop_ptr->rankno[j],new_pop_ptr->rankno[j],new_pop_ptr->rankrat[j]);
    
   }
     
      fprintf(rep2_ptr,"-----------------Rank Ratio-------------------\n");
      /*==================================================================*/
     
      /*=======Copying the new population to old population======*/
     
      old_pop_ptr = &(oldpop);
      new_pop_ptr = &(matepop);

      for(j = 0;j < popsize;j++)
   {
     old_pop_ptr->ind_ptr = &(old_pop_ptr->ind[j]);
     new_pop_ptr->ind_ptr = &(new_pop_ptr->ind[j]);
     if(nchrom > 0)
       {
         /*For Binary GA copying of the chromosome*/
        
         for(l = 0;l < chrom;l++)
      old_pop_ptr->ind_ptr->genes[l]=new_pop_ptr->ind_ptr->genes[l];
        
         for(l = 0;l < nchrom;l++)
      old_pop_ptr->ind_ptr->xbin[l] = new_pop_ptr->ind_ptr->xbin[l];
       }
     if(nvar > 0)
       {
         /*For Real Coded GA copying of the chromosomes*/
         for(l = 0;l < nvar;l++)
      old_pop_ptr->ind_ptr->xreal[l] = new_pop_ptr->ind_ptr->xreal[l];
       }
    
     /*Copying the fitness vector */    
     for(l = 0 ; l < nfunc ;l++)
       old_pop_ptr->ind_ptr->fitness[l] = new_pop_ptr->ind_ptr->fitness[l];
    
     /*Copying the dummy fitness*/
     old_pop_ptr->ind_ptr->cub_len = new_pop_ptr->ind_ptr->cub_len;
    
     /*Copying the rank of the individuals*/
     old_pop_ptr->ind_ptr->rank = new_pop_ptr->ind_ptr->rank;
    
     /*Copying the error and constraints of the individual*/
    
     old_pop_ptr->ind_ptr->error = new_pop_ptr->ind_ptr->error;
     for(l = 0;l < ncons;l++)
       {
         old_pop_ptr->ind_ptr->constr[l] = new_pop_ptr->ind_ptr->constr[l];
       }
    
     /*Copying the flag of the individuals*/
     old_pop_ptr->ind_ptr->flag = new_pop_ptr->ind_ptr->flag;
   }  // end of j
     
      maxrank1 = new_pop_ptr->maxrank ;
    
      /*Copying the array having the record of the individual
   at different ranks */
      for(l = 0;l < popsize;l++)
   {
     old_pop_ptr->rankno[l] = new_pop_ptr->rankno[l];
   }
     
      /*Copying the maxrank */
      old_pop_ptr->maxrank = new_pop_ptr->maxrank;
     
      /*Printing the fitness record for last generation in a file last*/
      if(i == gener-1)
         {  // for the last generation
     old_pop_ptr = &(matepop);
     for(f = 0;f < popsize ; f++) // for printing
       {
         old_pop_ptr->ind_ptr = &(old_pop_ptr->ind[f]);
        
         if ((old_pop_ptr->ind_ptr->error <= 0.0) && (old_pop_ptr->ind_ptr->rank == 1))  // for all feasible solutions and non-dominated solutions
      {
        for(l = 0;l < nfunc;l++)
          fprintf(end_ptr,"%f\t",old_pop_ptr->ind_ptr->fitness[l]);
        for(l = 0;l < ncons;l++)
          {
            fprintf(end_ptr,"%f\t",old_pop_ptr->ind_ptr->constr[l]);
          }
        if (ncons > 0)
          fprintf(end_ptr,"%f\t",old_pop_ptr->ind_ptr->error);
        fprintf(end_ptr,"\n");
       
        if (nvar > 0)
          {
            for(l = 0;l < nvar ;l++)
         {
           fprintf(g_var,"%f\t",old_pop_ptr->ind_ptr->xreal[l]);
         }
            fprintf(g_var,"  ");
          }
       
        if(nchrom > 0)
          {
            for(l = 0;l < nchrom;l++)
         {
           fprintf(g_var,"%f\t",old_pop_ptr->ind_ptr->xbin[l]);
         }
          }
        fprintf(g_var,"\n");
      }  // feasibility check
       } // end of f (printing)
    
   } // for the last generation
    }  // end of i

  /*                  Generation Loop Ends                                */
  /************************************************************************/
 
  fprintf(rep_ptr,"NO. OF CROSSOVER = %d\n",ncross);
  fprintf(rep_ptr,"NO. OF MUTATION = %d\n",nmut);
  fprintf(rep_ptr,"------------------------------------------------------------\n");
  fprintf(rep_ptr,"---------------------------------Thanks---------------------\n");
  fprintf(rep_ptr,"-------------------------------------------------------------\n");
  printf("NOW YOU CAN LOOK IN THE FILE OUTPUT2.DAT\n");
 
  /*Closing the files*/
  fclose(rep_ptr);
  fclose(gen_ptr);
  fclose(rep2_ptr);
  fclose(end_ptr);
  fclose(g_var);
  fclose(lastit);
}

potter
Bavard
Bavard

Messages : 18
Date d'inscription : 24/11/2008

Voir le profil de l'utilisateur

Revenir en haut Aller en bas

Re: problème algorithme génétique en C

Message  -ed- le Jeu 27 Nov 2008 - 3:09

potter a écrit:Bonjour,
J'ai trouvé une difficulté à compiler et exécuter le programme suivant sous DEV-C++. Il s'agit de l'algorithme génétique écrit en C.Lorsque je fais éxécution, un message s'affiche : le fichier source n'est pas encore compilé malgré que il n'affiche aucune erreur lors dela compilation.
Prière de m'aider à le faire tourner.
Ce code est incomplet. Il manque au moins tous les headers :
Code:


-------------- Build: Debug in hello ---------------

Compiling: main.c
Linking console executable: bin\Debug\hello.exe
C:\dev\hello\main.c:61:61: random.h: No such file or directory
C:\dev\hello\main.c:63:64: input.h: No such file or directory
C:\dev\hello\main.c:65:77: realinit.h: No such file or directory
C:\dev\hello\main.c:67:77: init.h: No such file or directory
C:\dev\hello\main.c:69:70: decode.h: No such file or directory
C:\dev\hello\main.c:71:69: ranking.h: No such file or directory
C:\dev\hello\main.c:74:64: rancon.h: No such file or directory
C:\dev\hello\main.c:76:62: func-con.h: No such file or directory
C:\dev\hello\main.c:78:67: select.h: No such file or directory
C:\dev\hello\main.c:80:55: crossover.h: No such file or directory
C:\dev\hello\main.c:82:56: uniformxr.h: No such file or directory
C:\dev\hello\main.c:84:53: realcross2.h: No such file or directory
C:\dev\hello\main.c:86:53: mut.h: No such file or directory
C:\dev\hello\main.c:88:51: realmut1.h: No such file or directory
C:\dev\hello\main.c:90:73: keepaliven.h: No such file or directory
C:\dev\hello\main.c:92:57: report.h: No such file or directory
C:\dev\hello\main.c:98: warning: return type defaults to `int'
C:\dev\hello\main.c:98: warning: function declaration isn't a prototype
C:\dev\hello\main.c: In function `main':
C:\dev\hello\main.c:121: warning: implicit declaration of function `input'
C:\dev\hello\main.c:135: warning: implicit declaration of function `warmup_random'
C:\dev\hello\main.c:139: warning: implicit declaration of function `init'
C:\dev\hello\main.c:141: warning: implicit declaration of function `realinit'
C:\dev\hello\main.c:146: warning: implicit declaration of function `decode'
C:\dev\hello\main.c:161: warning: implicit declaration of function `func'
C:\dev\hello\main.c:182: warning: implicit declaration of function `nselect'
C:\dev\hello\main.c:193: warning: implicit declaration of function `crossover'
C:\dev\hello\main.c:199: warning: implicit declaration of function `unicross'
C:\dev\hello\main.c:204: warning: implicit declaration of function `realcross'
C:\dev\hello\main.c:211: warning: implicit declaration of function `mutate'
C:\dev\hello\main.c:215: warning: implicit declaration of function `real_mutate'
C:\dev\hello\main.c:235: warning: implicit declaration of function `keepalive'
C:\dev\hello\main.c:243: warning: implicit declaration of function `report'
C:\dev\hello\main.c:103: warning: unused variable `ptr'
C:\dev\hello\main.c:410: warning: control reaches end of non-void function
Process terminated with status 1 (0 minutes, 0 seconds)
16 errors, 18 warnings

-ed-
Admin
Admin

Messages : 289
Date d'inscription : 26/05/2008
Age : 60
Localisation : Paris 6eme arrondissement (75, France)

Voir le profil de l'utilisateur http://bien-programmer.fr

Revenir en haut Aller en bas

Voir le sujet précédent Voir le sujet suivant Revenir en haut

- Sujets similaires

 
Permission de ce forum:
Vous ne pouvez pas répondre aux sujets dans ce forum