dignea
1.0.0
Diverse Instance Generator with Novelty Search and Evolutionary Algorithms
|
#include <dignea/core/Problem.h>
#include <dignea/types/SolutionTypes.h>
#include <dignea/utilities/random/PseudoRandom.h>
#include <fstream>
#include <iostream>
#include <utility>
Go to the source code of this file.
Classes | |
class | TSP |
Traveling Salesman Problem implemented in dignea. Uses a IntFloat representation where the solutions are integers in a permutation-based approach and the fitness is a float with the cost of a travel. More... | |
Typedefs | |
using | coords = std::pair< float, float > |
Coordinates of each city in the TSP instance. | |