12 #ifndef DIGNEA_BPP_BEST_FIT_H
13 #define DIGNEA_BPP_BEST_FIT_H
15 #include <dignea/core/Heuristic.h>
18 #include <nlohmann/json.hpp>
37 string getName()
const {
return "BestFit"; };
39 string getID()
const {
return "BestFit"; }
41 void setProblem(shared_ptr<BPP> prob);
43 void setProblem(
BPP *prob);
nlohmann::json json
Definition: MinKnap.h:85
Class to represent the Bin Packing Problem.
Definition: BPP.h:27
Best Fit Heuristic for the BPP. Places each item into the current bin.
Definition: BestFit.h:29
string getName() const
Returns the name of the algorithm, this is used in the to_json method. Must be implemented in the sub...
Definition: BestFit.h:37
string getID() const
Returns the identificator of the algorithm, this is used in the to_json method. Must be implemented i...
Definition: BestFit.h:39
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