minor modifications for GCC 4.3.0 compatibility
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@1239 331e1502-861f-0410-8da2-ba01fb791d7f
This commit is contained in:
parent
b6798df567
commit
33f3b82974
14 changed files with 40 additions and 5 deletions
|
|
@ -61,6 +61,10 @@ class moBestImprSelect:public moMoveSelect < M >
|
|||
Fitness fitness;
|
||||
fitness=(Fitness)_fitness;
|
||||
|
||||
//std::cout.precision(10);
|
||||
|
||||
//std::cout << "old fitness = " << _fitness << std::endl;
|
||||
|
||||
first_time = true;
|
||||
}
|
||||
|
||||
|
|
@ -84,6 +88,8 @@ class moBestImprSelect:public moMoveSelect < M >
|
|||
first_time = false;
|
||||
}
|
||||
|
||||
//std::cout << "best fitness = " << best_fitness << std::endl;
|
||||
|
||||
return true;
|
||||
}
|
||||
|
||||
|
|
@ -101,6 +107,9 @@ class moBestImprSelect:public moMoveSelect < M >
|
|||
|
||||
_move = best_move;
|
||||
_fitness = best_fitness;
|
||||
|
||||
|
||||
//std::cout << "Final fitness = " << best_fitness << std::endl;
|
||||
}
|
||||
|
||||
private:
|
||||
|
|
|
|||
|
|
@ -43,6 +43,7 @@
|
|||
#include <fstream>
|
||||
#include <iostream>
|
||||
#include <math.h>
|
||||
#include <stdlib.h>
|
||||
|
||||
|
||||
namespace Graph
|
||||
|
|
|
|||
|
|
@ -169,14 +169,20 @@ class moeoEasyEA: public moeoEA < MOEOT >
|
|||
unsigned int pSize = _pop.size();
|
||||
offspring.clear(); // new offspring
|
||||
// fitness and diversity assignment (if you want to or if it is the first generation)
|
||||
//std::cout << "eval ou first time" << std::endl;
|
||||
if (evalFitAndDivBeforeSelection || firstTime)
|
||||
{
|
||||
firstTime = false;
|
||||
//std::cout << "fitness eval" << std::endl;
|
||||
fitnessEval(_pop);
|
||||
//std::cout << "diversity eval" << std::endl;
|
||||
diversityEval(_pop);
|
||||
}
|
||||
//std::cout << "breed" << std::endl;
|
||||
breed(_pop, offspring);
|
||||
//std::cout << "pop eval" << std::endl;
|
||||
popEval(_pop, offspring); // eval of parents + offspring if necessary
|
||||
//std::cout << "replace" << std::endl;
|
||||
replace(_pop, offspring); // after replace, the new pop. is in _pop
|
||||
if (pSize > _pop.size())
|
||||
{
|
||||
|
|
|
|||
|
|
@ -38,6 +38,7 @@
|
|||
#ifndef MAKE_CHECKPOINT_MOEO_H_
|
||||
#define MAKE_CHECKPOINT_MOEO_H_
|
||||
|
||||
#include <limits.h>
|
||||
#include <stdlib.h>
|
||||
#include <sstream>
|
||||
#include <eoContinue.h>
|
||||
|
|
@ -52,6 +53,7 @@
|
|||
#include <utils/moeoArchiveObjectiveVectorSavingUpdater.h>
|
||||
#include <utils/moeoBinaryMetricSavingUpdater.h>
|
||||
|
||||
|
||||
bool testDirRes(std::string _dirName, bool _erase);
|
||||
|
||||
/**
|
||||
|
|
|
|||
|
|
@ -106,7 +106,8 @@ void FlowShopBenchmarkParser::init(const std::string _benchmarkFileName)
|
|||
// initial and current seeds (not used)
|
||||
getline(inputFile, buffer, '\n');
|
||||
// processing times and due-dates
|
||||
p = std::vector< std::vector<unsigned int> > (M,N);
|
||||
//p = std::vector< std::vector<unsigned int> > (M,N);
|
||||
p.resize(N);
|
||||
d = std::vector<unsigned int> (N);
|
||||
// for each job...
|
||||
for (unsigned int j=0 ; j<N ; j++)
|
||||
|
|
@ -119,6 +120,7 @@ void FlowShopBenchmarkParser::init(const std::string _benchmarkFileName)
|
|||
// processing times of the job j on each machine
|
||||
getline(inputFile, buffer, '\n');
|
||||
start = buffer.find_first_not_of(" ");
|
||||
p[j].resize(M);
|
||||
for (unsigned int i=0 ; i<M ; i++)
|
||||
{
|
||||
end = buffer.find_first_of(" ", start);
|
||||
|
|
|
|||
|
|
@ -38,6 +38,7 @@
|
|||
#ifndef FLOWSHOPBENCHMARKPARSER_H_
|
||||
#define FLOWSHOPBENCHMARKPARSER_H_
|
||||
|
||||
#include <stdlib.h>
|
||||
#include <fstream>
|
||||
#include <string>
|
||||
#include <vector>
|
||||
|
|
|
|||
|
|
@ -77,7 +77,14 @@ double FlowShopEval::tardiness(const FlowShop & _flowshop)
|
|||
|
||||
std::vector< std::vector<unsigned int> > FlowShopEval::completionTime(const FlowShop & _flowshop)
|
||||
{
|
||||
std::vector< std::vector<unsigned int> > C(M,N);
|
||||
//std::vector< std::vector<unsigned int> > C(M,N);
|
||||
std::vector< std::vector<unsigned int> > C;
|
||||
C.resize(M);
|
||||
for(unsigned int i=0;i<N;i++)
|
||||
{
|
||||
C[i].resize(N);
|
||||
}
|
||||
|
||||
C[0][_flowshop[0]] = p[0][_flowshop[0]];
|
||||
for (unsigned int j=1; j<N; j++)
|
||||
C[0][_flowshop[j]] = C[0][_flowshop[j-1]] + p[0][_flowshop[j]];
|
||||
|
|
|
|||
|
|
@ -38,7 +38,7 @@
|
|||
#define THREAD_H_
|
||||
|
||||
#include <vector>
|
||||
|
||||
#include <pthread.h>
|
||||
|
||||
/* A high-level thread */
|
||||
class Thread
|
||||
|
|
|
|||
|
|
@ -41,7 +41,7 @@
|
|||
#include "../../core/peo_debug.h"
|
||||
#include "node.h"
|
||||
|
||||
#define MPI_BUF_SIZE 1024*64
|
||||
#define MPI_BUF_SIZE 1024*512
|
||||
|
||||
static char mpi_buf [MPI_BUF_SIZE];
|
||||
|
||||
|
|
@ -89,7 +89,7 @@ void cleanBuffers ()
|
|||
void waitBuffers ()
|
||||
{
|
||||
|
||||
printDebugMessage ("waiting the termination of the asynchronous operations to complete");
|
||||
// printDebugMessage ("waiting the termination of the asynchronous operations to complete");
|
||||
|
||||
for (unsigned i = 0; i < act_req.size (); i ++)
|
||||
{
|
||||
|
|
|
|||
|
|
@ -37,6 +37,8 @@
|
|||
#ifndef __mess_rmc_h
|
||||
#define __mess_rmc_h
|
||||
|
||||
#include <string.h>
|
||||
|
||||
#include "../../core/messaging.h"
|
||||
|
||||
extern void initMessage ();
|
||||
|
|
|
|||
|
|
@ -39,6 +39,7 @@
|
|||
#include <map>
|
||||
#include <string>
|
||||
#include <cassert>
|
||||
#include <stdlib.h>
|
||||
|
||||
#include "mess.h"
|
||||
|
||||
|
|
|
|||
|
|
@ -40,6 +40,7 @@
|
|||
#include <string>
|
||||
#include <vector>
|
||||
#include <cassert>
|
||||
#include <stdlib.h>
|
||||
|
||||
#include "node.h"
|
||||
#include "../../core/runner.h"
|
||||
|
|
|
|||
|
|
@ -38,6 +38,7 @@
|
|||
#define __xml_parser_h
|
||||
|
||||
#include <string>
|
||||
#include <string.h>
|
||||
|
||||
extern void openXMLDocument (const char * __filename);
|
||||
|
||||
|
|
|
|||
|
|
@ -39,6 +39,8 @@
|
|||
|
||||
#include <cassert>
|
||||
#include <utils/eoParser.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
|
||||
#include "route.h"
|
||||
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue