![]() |
OR-Tools
9.6
|
Definition at line 1056 of file routing_search.h.
Public Attributes | |
| double | 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. More... | |
| double | 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. More... | |
| bool | add_reverse_arcs = false |
| If add_reverse_arcs is true, the neighborhood relationships are considered symmetrically. More... | |
| double | arc_coefficient = 1.0 |
| arc_coefficient is a strictly positive parameter indicating the coefficient of the arc being considered in the Saving formula. More... | |
| bool add_reverse_arcs = false |
If add_reverse_arcs is true, the neighborhood relationships are considered symmetrically.
Definition at line 1065 of file routing_search.h.
| double 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 1068 of file routing_search.h.
| double 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 1062 of file routing_search.h.
| double 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 1059 of file routing_search.h.