3 #ifndef DIGNEA_TSP_NearestNeighbour_HEURISTIC_H
4 #define DIGNEA_TSP_NearestNeighbour_HEURISTIC_H
6 #include <dignea/core/Heuristic.h>
9 #include <nlohmann/json.hpp>
12 namespace tsp_heuristics {
29 string getName()
const {
return "NearestNeighbour TSP"; };
31 string getID()
const {
return "NN TSP"; }
33 void setProblem(shared_ptr<TSP> prob);
35 void setProblem(
TSP *prob);
nlohmann::json json
Definition: MinKnap.h:85
Front class which stores the final results of an EA execution.
Definition: Front.h:26
Base heuristic class. This is the skeleton for future heuristic implementations. Extends AbstractEA f...
Definition: Heuristic.h:19
Traveling Salesman Problem implemented in dignea. Uses a IntFloat representation where the solutions ...
Definition: TSP.h:35
NearestNeighbour Heuristic for the Knapsack Problem. Tries to insert each item in the knapsack while ...
Definition: NearestNeighbour.h:21
string getName() const
Returns the name of the algorithm, this is used in the to_json method. Must be implemented in the sub...
Definition: NearestNeighbour.h:29
string getID() const
Returns the identificator of the algorithm, this is used in the to_json method. Must be implemented i...
Definition: NearestNeighbour.h:31