Heuristic Optimization Methods
Task in Croatian : PDF
- CMake 3.6
- C++11
cmake .
make
BFS algorithm has been used to evaluate solution.
-
Compute an inital greedy solution:
./GREEDY # Writes to "results/res-<SOLUTION_ERROR>-<SOLUTION_MINUTES>min-popic";
-
Compute a GA-optimised solution (best from population):
./GA <pM_start> <pM> <pop_size> <pre_solution_path>
Params:
- pM_start - mutation percentage for an inital population
- pM - mutation percentage
- pop_size - population size
- pre_solution_path - path to file for an inital greedy solution