Parameters used to configure global cheapest insertion heuristics.
More...
Parameters used to configure global cheapest insertion heuristics.
Definition at line 733 of file RoutingHeuristicParameters.pb.cs.
|
| static pb::MessageParser< GlobalCheapestInsertionParameters > | Parser [get] |
| static pbr::MessageDescriptor | Descriptor [get] |
| double | FarthestSeedsRatio [get, set] |
| | Ratio (between 0 and 1) of available vehicles in the model on which farthest nodes of the model are inserted as seeds.
|
| double | NeighborsRatio [get, set] |
| | Ratio (in ]0, 1]) of closest non start/end nodes to consider as neighbors for each node when creating new insertions in the parallel/sequential cheapest insertion heuristic. If not overridden, its default value is 1, meaning all neighbors will be considered. The neighborhood ratio is coupled with the corresponding min_neighbors integer, indicating the minimum number of neighbors to consider for each node: num_closest_neighbors = max(min_neighbors, neighbors_ratio * NUM_NON_START_END_NODES) This minimum number of neighbors must be greater or equal to 1, its default value.
|
| int | MinNeighbors [get, set] |
| bool | UseNeighborsRatioForInitialization [get, set] |
| | Whether or not to only consider closest neighbors when initializing the assignment. More precisely, if true, only closest neighbors (see neighbors_ratio and min_neighbors) are considered as insertion positions during initialization. Otherwise, all possible insertion positions are considered.
|
| bool | AddUnperformedEntries [get, set] |
| | Whether or not to consider entries making the nodes/pairs unperformed. More precisely, if true, entries are created for making the nodes/pairs unperformed, and when the cost of making a node unperformed is lower than all insertions, the node/pair will be made unperformed. If false, only entries making a node/pair performed are considered.
|
◆ GlobalCheapestInsertionParameters() [1/2]
| Google.OrTools.ConstraintSolver.GlobalCheapestInsertionParameters.GlobalCheapestInsertionParameters |
( |
| ) |
|
|
inline |
◆ GlobalCheapestInsertionParameters() [2/2]
| Google.OrTools.ConstraintSolver.GlobalCheapestInsertionParameters.GlobalCheapestInsertionParameters |
( |
GlobalCheapestInsertionParameters | other | ) |
|
|
inline |
◆ CalculateSize()
| int Google.OrTools.ConstraintSolver.GlobalCheapestInsertionParameters.CalculateSize |
( |
| ) |
|
|
inline |
◆ Clone()
◆ Equals() [1/2]
◆ Equals() [2/2]
| override bool Google.OrTools.ConstraintSolver.GlobalCheapestInsertionParameters.Equals |
( |
object | other | ) |
|
|
inline |
◆ GetHashCode()
| override int Google.OrTools.ConstraintSolver.GlobalCheapestInsertionParameters.GetHashCode |
( |
| ) |
|
|
inline |
◆ MergeFrom() [1/2]
◆ MergeFrom() [2/2]
| void Google.OrTools.ConstraintSolver.GlobalCheapestInsertionParameters.MergeFrom |
( |
pb.CodedInputStream | input | ) |
|
|
inline |
◆ ToString()
| override string Google.OrTools.ConstraintSolver.GlobalCheapestInsertionParameters.ToString |
( |
| ) |
|
|
inline |
◆ WriteTo()
| void Google.OrTools.ConstraintSolver.GlobalCheapestInsertionParameters.WriteTo |
( |
pb.CodedOutputStream | output | ) |
|
|
inline |
◆ AddUnperformedEntriesFieldNumber
| const int Google.OrTools.ConstraintSolver.GlobalCheapestInsertionParameters.AddUnperformedEntriesFieldNumber = 7 |
|
static |
◆ FarthestSeedsRatioFieldNumber
| const int Google.OrTools.ConstraintSolver.GlobalCheapestInsertionParameters.FarthestSeedsRatioFieldNumber = 1 |
|
static |
◆ MinNeighborsFieldNumber
| const int Google.OrTools.ConstraintSolver.GlobalCheapestInsertionParameters.MinNeighborsFieldNumber = 3 |
|
static |
◆ NeighborsRatioFieldNumber
| const int Google.OrTools.ConstraintSolver.GlobalCheapestInsertionParameters.NeighborsRatioFieldNumber = 2 |
|
static |
◆ UseNeighborsRatioForInitializationFieldNumber
| const int Google.OrTools.ConstraintSolver.GlobalCheapestInsertionParameters.UseNeighborsRatioForInitializationFieldNumber = 6 |
|
static |
◆ AddUnperformedEntries
| bool Google.OrTools.ConstraintSolver.GlobalCheapestInsertionParameters.AddUnperformedEntries |
|
getset |
Whether or not to consider entries making the nodes/pairs unperformed. More precisely, if true, entries are created for making the nodes/pairs unperformed, and when the cost of making a node unperformed is lower than all insertions, the node/pair will be made unperformed. If false, only entries making a node/pair performed are considered.
Definition at line 866 of file RoutingHeuristicParameters.pb.cs.
◆ Descriptor
| pbr.MessageDescriptor Google.OrTools.ConstraintSolver.GlobalCheapestInsertionParameters.Descriptor |
|
staticget |
◆ FarthestSeedsRatio
| double Google.OrTools.ConstraintSolver.GlobalCheapestInsertionParameters.FarthestSeedsRatio |
|
getset |
Ratio (between 0 and 1) of available vehicles in the model on which farthest nodes of the model are inserted as seeds.
Definition at line 790 of file RoutingHeuristicParameters.pb.cs.
◆ MinNeighbors
| int Google.OrTools.ConstraintSolver.GlobalCheapestInsertionParameters.MinNeighbors |
|
getset |
◆ NeighborsRatio
| double Google.OrTools.ConstraintSolver.GlobalCheapestInsertionParameters.NeighborsRatio |
|
getset |
Ratio (in ]0, 1]) of closest non start/end nodes to consider as neighbors for each node when creating new insertions in the parallel/sequential cheapest insertion heuristic. If not overridden, its default value is 1, meaning all neighbors will be considered. The neighborhood ratio is coupled with the corresponding min_neighbors integer, indicating the minimum number of neighbors to consider for each node: num_closest_neighbors = max(min_neighbors, neighbors_ratio * NUM_NON_START_END_NODES) This minimum number of neighbors must be greater or equal to 1, its default value.
Definition at line 816 of file RoutingHeuristicParameters.pb.cs.
◆ Parser
◆ UseNeighborsRatioForInitialization
| bool Google.OrTools.ConstraintSolver.GlobalCheapestInsertionParameters.UseNeighborsRatioForInitialization |
|
getset |
Whether or not to only consider closest neighbors when initializing the assignment. More precisely, if true, only closest neighbors (see neighbors_ratio and min_neighbors) are considered as insertion positions during initialization. Otherwise, all possible insertion positions are considered.
Definition at line 847 of file RoutingHeuristicParameters.pb.cs.
The documentation for this class was generated from the following file: