CPopulation.cpp 15.3 KB
Newer Older
kruger's avatar
kruger committed
1
2
3
4
5
6
7
8
/*
 * CPopulation.cpp
 *
 *  Created on: 22 juin 2009
 *      Author: maitre
 */

#include "include/CPopulation.h"
kruger's avatar
kruger committed
9
10
#include <iostream>
#include <fstream>
kruger's avatar
kruger committed
11
12
13
14
15
#include <string.h>
#include "include/CRandomGenerator.h"
#include "include/CIndividual.h"
#include "include/Parameters.h"

kruger's avatar
kruger committed
16
17
using namespace std;

kruger's avatar
kruger committed
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
CSelectionOperator* CPopulation::selectionOperator;
CSelectionOperator* CPopulation::replacementOperator;
CSelectionOperator* CPopulation::parentReductionOperator;
CSelectionOperator* CPopulation::offspringReductionOperator;


float CPopulation::selectionPressure;
float CPopulation::replacementPressure;
float CPopulation::parentReductionPressure;
float CPopulation::offspringReductionPressure;


extern float* pEZ_MUT_PROB;
extern float* pEZ_XOVER_PROB;
extern CIndividual** pPopulation;
maitre's avatar
maitre committed
33
extern CIndividual* bBest;
kruger's avatar
kruger committed
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56

CPopulation::CPopulation(){
}

CPopulation::CPopulation(size_t parentPopulationSize, size_t offspringPopulationSize,
		       float pCrossover, float pMutation, float pMutationPerGene,
		       CRandomGenerator* rg, Parameters* params){

  this->parents     = new CIndividual*[parentPopulationSize];
  this->offsprings  = new CIndividual*[offspringPopulationSize];

  this->parentPopulationSize     = parentPopulationSize;
  this->offspringPopulationSize  = offspringPopulationSize;

  this->actualParentPopulationSize    = 0;
  this->actualOffspringPopulationSize = 0;

  this->pCrossover       = pCrossover;
  this->pMutation        = pMutation;
  pEZ_MUT_PROB = &this->pMutation;
  pEZ_XOVER_PROB = &this->pCrossover;
  this->pMutationPerGene = pMutationPerGene;
  pPopulation = parents;
maitre's avatar
maitre committed
57
  bBest = Best;
kruger's avatar
kruger committed
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

  this->rg = rg;

  this->currentEvaluationNb = 0;
  this->params = params;
}

void CPopulation::syncInVector(){
  for( size_t i = 0 ; i<actualParentPopulationSize ; i++ ){
    parents[i] = pop_vect.at(i);
  }
}

void CPopulation::syncOutVector(){
  pop_vect.clear();
  for( size_t i = 0 ; i<actualParentPopulationSize ; i++ ){
    pop_vect.push_back(parents[i]);
  }
#ifndef WIN32
  DEBUG_PRT("Size of outVector",pop_vect.size());
#endif
}

CPopulation::~CPopulation(){
  for( size_t i=0 ; i<actualOffspringPopulationSize ; i++ ) delete(offsprings[i]);
  for( size_t i=0 ; i<actualParentPopulationSize ; i++ )    delete(parents[i]);

  delete[](this->parents);
  delete[](this->offsprings);
}

void CPopulation::initPopulation(CSelectionOperator* selectionOperator,
				CSelectionOperator* replacementOperator,
				CSelectionOperator* parentReductionOperator,
				CSelectionOperator* offspringReductionOperator,
				float selectionPressure, float replacementPressure,
				float parentReductionPressure, float offspringReductionPressure){
  CPopulation::selectionOperator   = selectionOperator;
  CPopulation::replacementOperator = replacementOperator;
  CPopulation::parentReductionOperator = parentReductionOperator;
  CPopulation::offspringReductionOperator = offspringReductionOperator;

  CPopulation::selectionPressure   = selectionPressure;
  CPopulation::replacementPressure = replacementPressure;
  CPopulation::parentReductionPressure = parentReductionPressure;
  CPopulation::offspringReductionPressure = offspringReductionPressure;

}




void CPopulation::evaluatePopulation(CIndividual** population, size_t populationSize){
  for( size_t i=0 ; i < populationSize ; i++ )
    population[i]->evaluate();
}

kruger's avatar
kruger committed
115
116
void CPopulation::optimisePopulation(CIndividual** population, size_t populationSize){
}
kruger's avatar
kruger committed
117
118
119
120
121

void CPopulation::evaluateParentPopulation(){
  evaluatePopulation(parents,parentPopulationSize);
}

kruger's avatar
kruger committed
122
123
124
void CPopulation::optimiseParentPopulation(){
  optimisePopulation(parents,parentPopulationSize);
}
kruger's avatar
kruger committed
125
126
127

void CPopulation::evaluateOffspringPopulation(){
  evaluatePopulation(offsprings,offspringPopulationSize);
kruger's avatar
kruger committed
128
129
130
131
}

void CPopulation::optimiseOffspringPopulation(){
  optimisePopulation(offsprings,offspringPopulationSize);
kruger's avatar
kruger committed
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
}


/**
   Reduit la population population de taille populationSize
   a une population reducedPopulation de taille obSize.
   reducedPopulation doit etre alloue a obSize.

   Ici on pourrait avoir le best fitness de la prochaine population de parents.


 */
void CPopulation::reducePopulation(CIndividual** population, size_t populationSize,
					  CIndividual** reducedPopulation, size_t obSize,
					  CSelectionOperator* replacementOperator){


  replacementOperator->initialize(population,replacementPressure,populationSize);

  for( size_t i=0 ; i<obSize ; i++ ){

    // select an CIndividual and add it to the reduced population
    size_t selectedIndex = replacementOperator->selectNext(populationSize - i);
    // std::cout << "Selected " << selectedIndex << "/" << populationSize
    // 	      << " replaced by : " << populationSize-(i+1)<< std::endl;
    reducedPopulation[i] = population[selectedIndex];
maitre's avatar
maitre committed
158
    //printf("TEST REMPLACEMENT %d %d %f %f\n", i, selectedIndex, reducedPopulation[i]->fitness, population[selectedIndex]->fitness);
kruger's avatar
kruger committed
159
160
161
162
163
164
165
166
167
168
169

    // erase it to the std population by swapping last CIndividual end current
    population[selectedIndex] = population[populationSize-(i+1)];
    //population[populationSize-(i+1)] = NULL;
  }

  //return reducedPopulation;
}


CIndividual** CPopulation::reduceParentPopulation(size_t obSize){
maitre's avatar
maitre committed
170
171
172
173
174
175
  CIndividual** nextGeneration;
  if(obSize==0){
  	nextGeneration = new CIndividual*[1];
  }
  else
  	nextGeneration = new CIndividual*[obSize];
kruger's avatar
kruger committed
176
177

  reducePopulation(parents,actualParentPopulationSize,nextGeneration,obSize,
178
		   CPopulation::parentReductionOperator);
kruger's avatar
kruger committed
179
180
181
182
183
184
185
186

  // free no longer needed CIndividuals
  for( size_t i=0 ; i<actualParentPopulationSize-obSize ; i++ )
    delete(parents[i]);
  delete[](parents);

  this->actualParentPopulationSize = obSize;

maitre's avatar
maitre committed
187
  parents = nextGeneration;
kruger's avatar
kruger committed
188
189
190
191
192
193
194
195
196
197
198
199

  return nextGeneration;
}



CIndividual** CPopulation::reduceOffspringPopulation(size_t obSize){
  // this array has offspringPopulationSize because it will be used as offspring population in
  // the next generation
  CIndividual** nextGeneration = new CIndividual*[offspringPopulationSize];

  reducePopulation(offsprings,actualOffspringPopulationSize,nextGeneration,obSize,
200
		   CPopulation::offspringReductionOperator);
kruger's avatar
kruger committed
201

maitre's avatar
maitre committed
202
  //printf("POPULATION SIZE %d\n",actualOffspringPopulationSize-obSize);
kruger's avatar
kruger committed
203
204
205
206
  // free no longer needed CIndividuals
  for( size_t i=0 ; i<actualOffspringPopulationSize-obSize ; i++ )
    delete(offsprings[i]);
  delete[](offsprings);
maitre's avatar
maitre committed
207
208
209
210
  //printf("DANS LA FONCTION DE REMPLACEMENT\n");
  /*for(int i=0; i<parentPopulationSize; i++)
	printf("Indiv %d %f | ",i, parents[i]->fitness);
  printf("\n");*/
kruger's avatar
kruger committed
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

  this->actualOffspringPopulationSize = obSize;
  offsprings = nextGeneration;
  return nextGeneration;
}


static int CIndividualCompare(const void* p1, const void* p2){
  CIndividual** p1_i = (CIndividual**)p1;
  CIndividual** p2_i = (CIndividual**)p2;

  return p1_i[0]->getFitness() > p2_i[0]->getFitness();
}

static int CIndividualRCompare(const void* p1, const void* p2){
  CIndividual** p1_i = (CIndividual**)p1;
  CIndividual** p2_i = (CIndividual**)p2;

  return p1_i[0]->getFitness() < p2_i[0]->getFitness();
}


void CPopulation::sortPopulation(CIndividual** population, size_t populationSize){
  qsort(population,populationSize,sizeof(CIndividual*),CIndividualCompare);
}

void CPopulation::sortRPopulation(CIndividual** population, size_t populationSize){
  qsort(population,populationSize,sizeof(CIndividual*),CIndividualRCompare);
}

kruger's avatar
kruger committed
241
242
243
244
245
246
247
248
249
250
251
252
253
/* Fonction qui va serializer la population */
void CPopulation::serializePopulation(){
  ofstream EASEA_File;
  std::string fichier = params->outputFilename;
  fichier.append(".pop");
  EASEA_File.open(fichier.c_str(), ios::app); 
  for(int i=0; (unsigned)i<parentPopulationSize; i++){
	EASEA_File << parents[i]->serialize() << endl;
	
  }
  EASEA_File.close();
}

kruger's avatar
kruger committed
254
255
256
257
258
259
260
261

/**
   Reduit les populations en faisant l'operation de remplacement.

   @TODO : on aurait voulu eviter la recopie des deux populations en une seule
   mais cela semble incompatible avec CSelectionOperator (notamment l'operation
   d'initialisation.
*/
maitre's avatar
maitre committed
262
void CPopulation::reduceTotalPopulation(CIndividual** elitPop){
kruger's avatar
kruger committed
263
264
265

  CIndividual** nextGeneration = new CIndividual*[parentPopulationSize];

maitre's avatar
maitre committed
266
267
  if(params->elitSize)
	memcpy(nextGeneration,elitPop, sizeof(CIndividual*)*params->elitSize);
kruger's avatar
kruger committed
268
269

  size_t actualGlobalSize = actualParentPopulationSize+actualOffspringPopulationSize;
maitre's avatar
maitre committed
270
  
kruger's avatar
kruger committed
271
272
  CIndividual** globalPopulation = new CIndividual*[actualGlobalSize]();

maitre's avatar
maitre committed
273
274
275
276
277
278
279
280
281
  if(actualParentPopulationSize==0){
  	memcpy(globalPopulation,offsprings,sizeof(CIndividual*)*actualOffspringPopulationSize);
  }
  else if(actualOffspringPopulationSize==0){
  	memcpy(globalPopulation,parents,sizeof(CIndividual*)*actualParentPopulationSize);
  }
  else{
  	memcpy(globalPopulation,parents,sizeof(CIndividual*)*actualParentPopulationSize);
        memcpy(globalPopulation+actualParentPopulationSize,offsprings,sizeof(CIndividual*)*actualOffspringPopulationSize);
kruger's avatar
kruger committed
282
283
284
  }


maitre's avatar
maitre committed
285
286
  replacementOperator->initialize(globalPopulation, replacementPressure,actualGlobalSize);

kruger's avatar
kruger committed
287
288
289
  CPopulation::reducePopulation(globalPopulation,actualGlobalSize,params->elitSize+nextGeneration,
			       parentPopulationSize-params->elitSize,replacementOperator);

maitre's avatar
maitre committed
290

kruger's avatar
kruger committed
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
  for( unsigned int i=0 ; i<((int)actualGlobalSize+params->elitSize)-(int)parentPopulationSize ; i++ )
    delete(globalPopulation[i]);

  delete[](parents);
  delete[](globalPopulation);

  actualParentPopulationSize = parentPopulationSize;
  actualOffspringPopulationSize = 0;
  parents = nextGeneration;

}


void CPopulation::produceOffspringPopulation(){

  size_t crossoverArrity = CIndividual::getCrossoverArrity();
  CIndividual* p1;
  CIndividual** ps = new CIndividual*[crossoverArrity]();
  CIndividual* child;

  selectionOperator->initialize(parents,selectionPressure,actualParentPopulationSize);

  for( size_t i=0 ; i<offspringPopulationSize ; i++ ){
    size_t index = selectionOperator->selectNext(parentPopulationSize);
    p1 = parents[index];

    if( rg->tossCoin(pCrossover) ){
      for( size_t j=0 ; j<crossoverArrity-1 ; j++ ){
	index = selectionOperator->selectNext(parentPopulationSize);
	ps[j] = parents[index];
      }
      child = p1->crossover(ps);
    }
    else child = parents[index]->clone();//new CIndividual(*parents[index]);

    if( rg->tossCoin(pMutation) ){
      child->mutate(pMutationPerGene);
    }

    offsprings[actualOffspringPopulationSize++] = child;
  }
  delete[](ps);
  }




/**
   Here we save elit CIndividuals to the replacement

   @ARG elitismSize the number of CIndividuals save by elitism
   @ARG population the population where the CIndividuals are save
   @ARG populationSize the size of the population
   @ARG outPopulation the output population, this must be allocated with size greather than elitism
   @ARG outPopulationSize the size of the output population

*/
maitre's avatar
maitre committed
348
void CPopulation::strongElitism(size_t elitismSize, CIndividual** population, size_t populationSize,
kruger's avatar
kruger committed
349
350
351
352
353
354
355
356
357
			 CIndividual** outPopulation, size_t outPopulationSize){

  float bestFitness = population[0]->getFitness();
  size_t bestCIndividual = 0;

#ifndef WIN32
  if( elitismSize >= 5 )DEBUG_PRT("Warning, elitism has O(n) complexity, elitismSize is maybe too big (%d)",elitismSize);
#endif

maitre's avatar
maitre committed
358
  //printf("MINIMIZING ? %d\n",params->minimizing);
kruger's avatar
kruger committed
359
  for(size_t i = 0 ; i<elitismSize ; i++ ){
maitre's avatar
maitre committed
360
361
    //bestFitness = replacementOperator->getExtremum();
    bestFitness = population[0]->getFitness();
kruger's avatar
kruger committed
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
    bestCIndividual = 0;
    for( size_t j=0 ; j<populationSize-i ; j++ ){

    	if( (params->minimizing && bestFitness > population[j]->getFitness() ) ||
    			( !params->minimizing && bestFitness < population[j]->getFitness() )){
    		bestFitness = population[j]->getFitness();
    		bestCIndividual = j;
    	}
    }
    outPopulation[i] = population[bestCIndividual];
    population[bestCIndividual] = population[populationSize-(i+1)];
    population[populationSize-(i+1)] = NULL;
  }
}

maitre's avatar
maitre committed
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
void CPopulation::weakElitism(size_t elitismSize, CIndividual** parentsPopulation, CIndividual** offspringPopulation, size_t* parentPopSize, size_t* offPopSize, CIndividual** outPopulation, size_t outPopulationSize){

  float bestParentFitness = parentsPopulation[0]->getFitness();
  float bestOffspringFitness = offspringPopulation[0]->getFitness();
  int bestParentIndiv = 0;
  int bestOffspringIndiv = 0;

  for(int i=1; (unsigned)i<(*parentPopSize); i++){
        if( (params->minimizing && bestParentFitness > parentsPopulation[i]->getFitness() ) ||
                        ( !params->minimizing && bestParentFitness < parentsPopulation[i]->getFitness() )){
                bestParentFitness = parentsPopulation[i]->getFitness();
                bestParentIndiv = i;
        }
  }
 
  for(int i=1; (unsigned)i<(*offPopSize); i++){
        if( (params->minimizing && bestOffspringFitness > offspringPopulation[i]->getFitness() ) ||
                        ( !params->minimizing && bestOffspringFitness < offspringPopulation[i]->getFitness() )){
                bestOffspringFitness = offspringPopulation[i]->getFitness();
                bestOffspringIndiv = i;
        }
  }
 
  for(int i = 0 ; (unsigned)i<elitismSize ; i++ ){
kruger's avatar
kruger committed
401
 	if(((!params->minimizing && bestParentFitness > bestOffspringFitness) || (params->minimizing && bestParentFitness<bestOffspringFitness) || (*offPopSize)==0) && (*parentPopSize)>0){
maitre's avatar
maitre committed
402
403
404
405
		outPopulation[i] = parentsPopulation[bestParentIndiv];
		parentsPopulation[bestParentIndiv] = parentsPopulation[(*parentPopSize)-1];
		parentsPopulation[(*parentPopSize)-1] = NULL;
		(*parentPopSize)-=1; 
kruger's avatar
kruger committed
406
407
408
409
410
411
412
413
414
415
416
		if((*parentPopSize)>0){
	  		bestParentFitness = parentsPopulation[0]->getFitness();
			bestParentIndiv=0;
			for(int j=1; (unsigned)j<(*parentPopSize); j++){
			        if( (params->minimizing && bestParentFitness > parentsPopulation[j]->getFitness() ) ||
	        	                ( !params->minimizing && bestParentFitness < parentsPopulation[j]->getFitness() )){
	        	        	bestParentFitness = parentsPopulation[j]->getFitness();
	        	        	bestParentIndiv = j;
	       			}
	  		}
		}
maitre's avatar
maitre committed
417
418
419
420
421
422
	}
	else{
		outPopulation[i] = offspringPopulation[bestOffspringIndiv];
		offspringPopulation[bestOffspringIndiv] = offspringPopulation[(*offPopSize)-1];
		offspringPopulation[(*offPopSize)-1] = NULL;
		(*offPopSize)-=1;
kruger's avatar
kruger committed
423
424
425
426
427
428
429
430
431
432
433
		if((*offPopSize)>0){
	  		bestOffspringFitness = offspringPopulation[0]->getFitness();
			bestOffspringIndiv = 0;	
			for(int j=1; (unsigned)j<(*offPopSize); j++){
			        if( (params->minimizing && bestOffspringFitness > offspringPopulation[j]->getFitness() ) ||
	        	                ( !params->minimizing && bestOffspringFitness < offspringPopulation[j]->getFitness() )){
	        	        	bestOffspringFitness = offspringPopulation[j]->getFitness();
	        	        	bestOffspringIndiv = j;
	       			}
	  		}
		}	
maitre's avatar
maitre committed
434
435
436
	}
  }
}
kruger's avatar
kruger committed
437
438


439
440
void CPopulation::addIndividualParentPopulation(CIndividual* indiv, size_t id){
	parents[id] = indiv;
kruger's avatar
kruger committed
441
}
442
443
444
void CPopulation::addIndividualParentPopulation(CIndividual* indiv){
	parents[actualParentPopulationSize++] = indiv;
}
kruger's avatar
kruger committed
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469

std::ostream& operator << (std::ostream& O, const CPopulation& B)
{

  size_t offspringPopulationSize = B.offspringPopulationSize;
  size_t realOffspringPopulationSize = B.actualOffspringPopulationSize;

  size_t parentPopulationSize = B.parentPopulationSize;
  size_t realParentPopulationSize = B.actualParentPopulationSize;


  O << "CPopulation : "<< std::endl;
  O << "\t Parents size : "<< realParentPopulationSize << "/" <<
    parentPopulationSize << std::endl;

  O << "\t Offspring size : "<< realOffspringPopulationSize << "/" <<
    offspringPopulationSize << std::endl;
  for( size_t i=0 ; i<realParentPopulationSize ; i++){
	B.parents[i]->printOn(O);
	 O << "\n";

  }
  return O;
}