pwt#
Structs#
Point#
Item#
-
struct Item#
Meta data container for items in the grpah.
TTPData#
-
struct TTPData#
TODO: Find out what data is redundant and how we can better map to other graph data TODO: Don’t use stringstream; slow Raw TTP-Graph data container.
Public Members
-
std::string name#
The name.
-
std::string data_type#
The data type.
-
int dimension#
The dimension.
-
int n_items#
The number of items.
-
int capacity#
The capacity.
-
double min_speed#
The min speed.
-
double max_speed#
The max speed.
-
double rent_ratio#
Rent ration.
-
std::string edge_weight_type#
The type weight.
-
double penalty = 0#
numeric constant penalty
-
double velocity_gap = 0#
Veclocity gap.
-
std::vector<double> distances = {}#
Vector of distances.
-
std::string name#
TTPGraph#
PWTConstraint#
-
struct PWTConstraint : public ioh::problem::Constraint<int>#
Graph contraint for pwt.
Public Functions
Construct a new PWTConstraint object.
- Parameters:
graph – a shared_ptr to some TTPGraph
-
inline virtual bool compute_violation(const std::vector<int> &x) override#
Compute constraint violation.
- Parameters:
x – the candidate solution
- Returns:
true when there is constraint violation
- Returns:
false when there is no constraint violaton
-
inline virtual double penalty() const override#
Penalty function, scales violation.
-
inline virtual std::string repr() const override#
String representation.