Machine-Task-Scheduler/main.cpp at master · feliperafael/Machine-Task-Scheduler · GitHub

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
#include <iostream>
#include <stdlib.h>     /* srand, rand */
#include <time.h>       /* time */
#include "SearchEngine.h"
#include "Configures.h"

#include "SimpleParser.h"
#include "Database.h"
#include <omp.h>

#include "MachineTaskSchedulingDatabase.h"
#include "MachineTaskSchedulingIndividual.h"
#include "MachineTaskSchedulingIndividualBuilder.h"
#include "MachineTaskSchedulingParser.h"
#include "MachineTaskSchedulingCrossover.h"
#include "MachineTaskSchedulingMutation.h"

using namespace std;

int main(int argc, char * argv[]) {
//    double wall_timer = omp_get_wtime();

    int seed = atoi(argv[3]);
    if(atoi(argv[3]) == 0)
        seed = time(NULL);
    //seed = 42;

    srand(seed);

    conf = new Configures(); //Configuration class with several GA parameters
    conf->seed = seed;
    conf->elitism = 0.2; // elitism percentage
    conf->generations = 100000; // num_max of generations
    conf->popSize = 100; // size of population
    conf->crossover = 0.5;  //crossing percentage
    conf->mutate = 0.5; // mutate percentage
    conf->MAX_THREADS = omp_get_max_threads(); // num_max_threads omp
    conf->max_generationsWithoutImprovement = 50;
    conf->MAX_TIME = atoi(argv[2]);

    //Create a problem database and load the input file.
    Database * database = new MachineTaskSchedulingDatabase();
    database->loadBase(argv[1]); // argv[1] is the path to the input file

//    //Create an evaluator of the problem
    Parser * parser = new MachineTaskSchedulingParser();
    MachineTaskSchedulingParser * machinetaskscheduling = dynamic_cast<MachineTaskSchedulingParser*>(parser);
    machinetaskscheduling->setDatabase(database);

    //Define the individual generator that returns an individual type of problem specific
    MachineTaskSchedulingIndividualBuilder * machineTaskSchedulingIndividualBuilder = new MachineTaskSchedulingIndividualBuilder(database);


    // Set searchEngine parameters
    SearchEngine * searcher = new SearchEngine();
    searcher->setParser(parser);
    //searcher->setMutation();
    //searcher->setCrossover();

    Individual * a[2];
    //Individual * a = machineTaskSchedulingIndividualBuilder->generateIndividuo();
    a[0] = machineTaskSchedulingIndividualBuilder->generateIndividuo();
    a[1] = machineTaskSchedulingIndividualBuilder->generateIndividuo();
    MachineTaskSchedulingCrossover * cross = new MachineTaskSchedulingCrossover();
    cross->cross(a,2);
    //MachineTaskSchedulingMutation * mut = new MachineTaskSchedulingMutation();
    //mut->mutate(a);
    cout << endl << endl;
    //a[0]->print();
    //a->print();


    cout << endl << endl;
//    MachineTaskSchedulingIndividual * s = dynamic_cast<MachineTaskSchedulingIndividual*>(a[0]);
     MachineTaskSchedulingIndividual * s1 = dynamic_cast<MachineTaskSchedulingIndividual*>(a[0]);
     MachineTaskSchedulingIndividual * s2 = dynamic_cast<MachineTaskSchedulingIndividual*>(a[1]);

    //s->calculateTimes(database);

    s1->print();
    cout << endl;
    s2->print();


//    //Instantiated a local search
//    TravelingThiefLocalSearch* ls = new TravelingThiefLocalSearch();
//    ls->setParser(travelingthiefparser);
//    ls->setDatabase(dynamic_cast<TravelingThiefDatabase*>(database));
//
//    // Set searchEngine parameters
//    SearchEngine * searcher = new SearchEngine();
//    searcher->setParser(travelingthiefparser);
//    searcher->setIndividualBuilder(travelingThiefIndividualBuilder);
//    searcher->setMutation(new TravelingThiefMutation());
//    searcher->setLocalSearch(ls);
//    TravelingThiefDatabase *db = dynamic_cast<TravelingThiefDatabase*>(database);
////    for(int i = 0; i < db->cities.size();i++){
////        for(Item * item : db->cities[i]->items){
////            cout << "item->index = " << item->index << " item->city = " <<  item->city << endl;
////        }
////    }
//
//    //Evolves solutions
//    searcher->Evolve();

//    cout << (omp_get_wtime() - wall_timer) << " s" << endl;

    return 0;
}