D:/Projekt/ECF_trunk/examples/GATSP/TSPEvalOp.cpp

#include <cmath>
#include <iostream>
#include <string>
#include <fstream>
#include <ecf/ECF.h>
#include "TSPEvalOp.h"


void TSPEvalOp::registerParameters(StateP state)
{
    state->getRegistry()->registerEntry("tsp.infile", (voidP) (new std::string), ECF::STRING);
}


bool TSPEvalOp::initialize(StateP state)
{
    if(!state->getRegistry()->isModified("tsp.infile")) {
        state->getLogger()->log(1, "Error: no input file defined for TSP! (parameter 'tsp.infile'");
        return false;
    }

    voidP sptr = state->getRegistry()->getEntry("tsp.infile"); // get parameter value
    std::string filePath = *((std::string*) sptr.get()); // convert from voidP to user defined type

    std::ifstream iFile(filePath.c_str());
    std::string line;
    if(!iFile.is_open()) {
        state->getLogger()->log(1, "Error: can't open input file " + filePath);
        return false;
    }

    do {
        getline(iFile,line);
    }while(line.find("DIMENSION",0) == std::string::npos);

    std::stringstream ss(line.substr(line.find(":") + 1));
    ss >> dimension;

    do {
        getline(iFile,line);
    }while(line.find("EDGE_WEIGHT_SECTION",0) == std::string::npos);

    weights.resize(dimension);
    for(int i = 0; i < dimension; i++) {
        weights[i].resize(dimension);
        for(int j = 0; j < dimension; j++) {
                iFile >> weights[i][j];
        }
    }
    return true;
}


FitnessP TSPEvalOp::evaluate(IndividualP individual)
{
    // minimize travel distance, so use FitnessMin
    FitnessP fitness (new FitnessMin);

    // get Permutation genotype from the individual
    Permutation::Permutation* perm = (Permutation::Permutation*) individual->getGenotype().get();
    // (you can also use boost smart pointers:)
    //PermutationP perm = boost::static_pointer_cast<Permutation::Permutation> (individual->getGenotype());

    int fitnessV = 0;
    // genotype Permutation keeps a vector of indexes named 'variables'
    for(uint i = 0; i < perm->variables.size() - 1; i++){
        // the length of each route is the sum of distances (weights) between each city in a route
        fitnessV += weights[perm->variables[i]][perm->variables[i + 1]];
    }
    fitnessV += weights[perm->variables[0]][perm->variables[dimension - 1]];
    

    fitness->setValue(fitnessV);
    return fitness;
}