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
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
|
#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);
} |
