/* This is a Multi-Objective GA program.***********************************************************************  This program is the implementation of the NSGA-2 proposed by      **                                                                    **  Prof. Kalyanmoy Deb and his students .                            **                                                                    **  copyright Kalyanmoy Deb**********************************************************************The user have to give the input manualy or through a data file.The user needs to enter objective functions in func-con.hThe code can also take care of the constraints. Enter the constraintsin the space provided in the func-con.h file.Constraints must be of the following type:g(x) >= 0.0Also normalize all constraints (see the example problem in func-con.h)If your program asks you to increase the values of some parameters in theprogram come to main program and accordingly changed the values which aredefined against #define ...The program generates few output files. These are described as1.output.out*           This file has the detailed record for all the variables,*           the fitness values, constraint values, overall constraint            violation (penalty)  and their ranks for all the members*           of old population in the left hand side of the |**|*           and of new population in the right hand side.2.all_fitness.out*         This file prints the record of all the fitness values for*         different individual of new popultion created at all*         generations.3.g_rank_record.out*        This file maintains the record of individuals in global pop-*        -ulation at different ranks for all the generations.4.ranks.out*         This file prints the number of individual at different ranks*          in old and new population and finds rank ratios5.final_fitness.out*                 This file has the fitness value of all feasible and                  non-dominated individuals at the final generation6.final_var.out*                 This file has the all the variables of the feasible                  and non-dominated individuals at the final generation.                  The i-th solutions here corresponds to the i-th solution                  in the final_fitness.out file. 7.plot.out        This file contains gnuplot-based file for plotting                  the non-dominated feasible solutions obtained by the code.**************************************************************************         This is recommended to delete or rename all the *.out files*         obtained from the previous runs as some files are opened in*         append mode so they give false resemblence of data if the*         user is not carefulCompilation procedure:  gcc nsga2.c -lmRun ./a.out with or without an input fileInput data files: Three files are included, but at one time one is neededdepending on the type of variables used:inp-r (template file input-real)  : All variables are real-codedinp-b (template file input-binary): All variables are binary-codedinp-rb(template file input-rl+bin): Some variables are real and some are binary  */#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 "dfit.h"         /*File Assigning Dummyfitness*/#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");