|
| synchronized void | delete () |
| |
| void | setNeighbors_ratio (double value) |
| | If neighbors_ratio < 1 then for each node only this ratio of its neighbors leading to the smallest arc costs are considered. More...
|
| |
| double | getNeighbors_ratio () |
| | If neighbors_ratio < 1 then for each node only this ratio of its neighbors leading to the smallest arc costs are considered. More...
|
| |
| void | setMax_memory_usage_bytes (double value) |
| | The number of neighbors considered for each node is also adapted so that the stored Savings don't use up more than max_memory_usage_bytes bytes. More...
|
| |
| double | getMax_memory_usage_bytes () |
| | The number of neighbors considered for each node is also adapted so that the stored Savings don't use up more than max_memory_usage_bytes bytes. More...
|
| |
| void | setAdd_reverse_arcs (boolean value) |
| | If add_reverse_arcs is true, the neighborhood relationships are considered symmetrically. More...
|
| |
| boolean | getAdd_reverse_arcs () |
| | If add_reverse_arcs is true, the neighborhood relationships are considered symmetrically. More...
|
| |
| void | setArc_coefficient (double value) |
| | arc_coefficient is a strictly positive parameter indicating the coefficient of the arc being considered in the Saving formula. More...
|
| |
| double | getArc_coefficient () |
| | arc_coefficient is a strictly positive parameter indicating the coefficient of the arc being considered in the Saving formula. More...
|
| |
| | SavingsParameters () |
| |
◆ SavingsParameters() [1/2]
◆ SavingsParameters() [2/2]
◆ delete()
| synchronized void delete |
( |
| ) |
|
|
inline |
◆ getAdd_reverse_arcs()
| boolean getAdd_reverse_arcs |
( |
| ) |
|
|
inline |
◆ getArc_coefficient()
| double getArc_coefficient |
( |
| ) |
|
|
inline |
arc_coefficient is a strictly positive parameter indicating the coefficient of the arc being considered in the Saving formula.
Definition at line 122 of file SavingsFilteredDecisionBuilder.java.
◆ getMax_memory_usage_bytes()
| double getMax_memory_usage_bytes |
( |
| ) |
|
|
inline |
The number of neighbors considered for each node is also adapted so that the stored Savings don't use up more than max_memory_usage_bytes bytes.
Definition at line 94 of file SavingsFilteredDecisionBuilder.java.
◆ getNeighbors_ratio()
| double getNeighbors_ratio |
( |
| ) |
|
|
inline |
If neighbors_ratio < 1 then for each node only this ratio of its neighbors leading to the smallest arc costs are considered.
Definition at line 80 of file SavingsFilteredDecisionBuilder.java.
◆ setAdd_reverse_arcs()
| void setAdd_reverse_arcs |
( |
boolean |
value | ) |
|
|
inline |
◆ setArc_coefficient()
| void setArc_coefficient |
( |
double |
value | ) |
|
|
inline |
arc_coefficient is a strictly positive parameter indicating the coefficient of the arc being considered in the Saving formula.
Definition at line 115 of file SavingsFilteredDecisionBuilder.java.
◆ setMax_memory_usage_bytes()
| void setMax_memory_usage_bytes |
( |
double |
value | ) |
|
|
inline |
The number of neighbors considered for each node is also adapted so that the stored Savings don't use up more than max_memory_usage_bytes bytes.
Definition at line 87 of file SavingsFilteredDecisionBuilder.java.
◆ setNeighbors_ratio()
| void setNeighbors_ratio |
( |
double |
value | ) |
|
|
inline |
If neighbors_ratio < 1 then for each node only this ratio of its neighbors leading to the smallest arc costs are considered.
Definition at line 73 of file SavingsFilteredDecisionBuilder.java.
The documentation for this class was generated from the following file: