遗传算法源码.docx

************************************************************** /* This is a simple genetic algorithm implementation where the */ /* evaluation function takes positive values only and the */ /* fitness of an individual is the same as the value of the */ /* objective function */ /***************************************************************/ #include stdio.h #include stdlib.h #include math.h /* Change any of these parameters to match your needs */ #define POPSIZE 50#define MAXGENS 1000#define NVARS 3#define PXOVER 0.8#define PMUTATION #define POPSIZE 50 #define MAXGENS 1000 #define NVARS 3 #define PXOVER 0.8 #define PMUTATION 0.15 #define TRUE 1 #define FALSE 0 int generation; int cur_best; FILE *galog; /* population size */ /* max. number of generations */ /* no. of problem variables */ /* probability of crossover */ /* probability of mutation */ /* current generation no. */ /* best individual */ /* an output file */ struct genotype /* genotype (GT), a member of the population */ double gene[NV ARS];/* a string of variables */double fitness;/* GTs fitness */double upper[NV ARS];/* GTs variables upper bound */ double gene[NV ARS]; /* a string of variables */ double fitness; /* GTs fitness */ double upper[NV ARS]; /* GTs variables upper bound */ double lower[NV ARS]; /* GTs variables lower bound */ double rfitness; /* relative fitness */ double cfitness; /* cumulative fitness */ }; struct genotype population[POPSIZE+1]; /* population */ struct genotype newpopulation[POPSIZE+1]; /* new population; */ /* replaces the */ /* old generation */ /* Declaration of procedures used by this genetic algorithm */ void initialize(void); double randval(double, double); void evaluate(void); void keep_the_best(void); void elitist(void); void select(void); void crossover(void); void Xover(int,int); void swap(double *,double *); void mutate(void); void report(void); ************************************************************* /* Initialization function: Initializes the values of gene