11 #ifndef DIGNEA_BPP_FIRST_FIT_H
12 #define DIGNEA_BPP_FIRST_FIT_H
14 #include <dignea/core/Heuristic.h>
17 #include <nlohmann/json.hpp>
36 string getName()
const {
return "FirstFit"; };
38 string getID()
const {
return "FirstFit"; }
40 void setProblem(shared_ptr<BPP> prob);
42 void setProblem(
BPP *prob);
nlohmann::json json
Definition: MinKnap.h:85
Class to represent the Bin Packing Problem.
Definition: BPP.h:27
First Fit Heuristic for the BPP. Places each item into the current bin.
Definition: FirstFit.h:28
string getID() const
Returns the identificator of the algorithm, this is used in the to_json method. Must be implemented i...
Definition: FirstFit.h:38
string getName() const
Returns the name of the algorithm, this is used in the to_json method. Must be implemented in the sub...
Definition: FirstFit.h:36
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