Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
|
#include <routing_search.h>
Public Attributes | |
double | neighbors_ratio = 1.0 |
double | max_memory_usage_bytes = 6e9 |
bool | add_reverse_arcs = false |
double | arc_coefficient = 1.0 |
Definition at line 1247 of file routing_search.h.
bool operations_research::SavingsFilteredHeuristic::SavingsParameters::add_reverse_arcs = false |
If add_reverse_arcs is true, the neighborhood relationships are considered symmetrically.
Definition at line 1256 of file routing_search.h.
double operations_research::SavingsFilteredHeuristic::SavingsParameters::arc_coefficient = 1.0 |
arc_coefficient is a strictly positive parameter indicating the coefficient of the arc being considered in the Saving formula.
Definition at line 1259 of file routing_search.h.
double operations_research::SavingsFilteredHeuristic::SavingsParameters::max_memory_usage_bytes = 6e9 |
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 1253 of file routing_search.h.
double operations_research::SavingsFilteredHeuristic::SavingsParameters::neighbors_ratio = 1.0 |
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 1250 of file routing_search.h.