Class GlobalCheapestInsertionParameters.Builder
java.lang.Object
com.google.protobuf.AbstractMessageLite.Builder
com.google.protobuf.AbstractMessage.Builder<GlobalCheapestInsertionParameters.Builder>
com.google.protobuf.GeneratedMessage.Builder<GlobalCheapestInsertionParameters.Builder>
com.google.ortools.constraintsolver.GlobalCheapestInsertionParameters.Builder
- All Implemented Interfaces:
GlobalCheapestInsertionParametersOrBuilder, com.google.protobuf.Message.Builder, com.google.protobuf.MessageLite.Builder, com.google.protobuf.MessageLiteOrBuilder, com.google.protobuf.MessageOrBuilder, Cloneable
- Enclosing class:
GlobalCheapestInsertionParameters
public static final class GlobalCheapestInsertionParameters.Builder
extends com.google.protobuf.GeneratedMessage.Builder<GlobalCheapestInsertionParameters.Builder>
implements GlobalCheapestInsertionParametersOrBuilder
Parameters used to configure global cheapest insertion heuristics.Protobuf type
operations_research.GlobalCheapestInsertionParameters-
Method Summary
Modifier and TypeMethodDescriptionbuild()clear()Whether or not to consider entries making the nodes/pairs unperformed.Ratio (between 0 and 1) of available vehicles in the model on which farthest nodes of the model are inserted as seeds.int32 min_neighbors = 3;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.Whether or not to only consider closest neighbors when initializing the assignment.booleanWhether or not to consider entries making the nodes/pairs unperformed.static final com.google.protobuf.Descriptors.Descriptorcom.google.protobuf.Descriptors.DescriptordoubleRatio (between 0 and 1) of available vehicles in the model on which farthest nodes of the model are inserted as seeds.intint32 min_neighbors = 3;doubleRatio (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.booleanWhether or not to only consider closest neighbors when initializing the assignment.protected com.google.protobuf.GeneratedMessage.FieldAccessorTablefinal booleanmergeFrom(com.google.protobuf.CodedInputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry) mergeFrom(com.google.protobuf.Message other) setAddUnperformedEntries(boolean value) Whether or not to consider entries making the nodes/pairs unperformed.setFarthestSeedsRatio(double value) Ratio (between 0 and 1) of available vehicles in the model on which farthest nodes of the model are inserted as seeds.setMinNeighbors(int value) int32 min_neighbors = 3;setNeighborsRatio(double value) 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.setUseNeighborsRatioForInitialization(boolean value) Whether or not to only consider closest neighbors when initializing the assignment.Methods inherited from class com.google.protobuf.GeneratedMessage.Builder
addRepeatedField, clearField, clearOneof, clone, getAllFields, getField, getFieldBuilder, getOneofFieldDescriptor, getParentForChildren, getRepeatedField, getRepeatedFieldBuilder, getRepeatedFieldCount, getUnknownFields, getUnknownFieldSetBuilder, hasField, hasOneof, internalGetMapField, internalGetMapFieldReflection, internalGetMutableMapField, internalGetMutableMapFieldReflection, isClean, markClean, mergeUnknownFields, mergeUnknownLengthDelimitedField, mergeUnknownVarintField, newBuilderForField, onBuilt, onChanged, parseUnknownField, setField, setRepeatedField, setUnknownFields, setUnknownFieldSetBuilder, setUnknownFieldsProto3Methods inherited from class com.google.protobuf.AbstractMessage.Builder
findInitializationErrors, getInitializationErrorString, internalMergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, newUninitializedMessageException, toStringMethods inherited from class com.google.protobuf.AbstractMessageLite.Builder
addAll, addAll, mergeDelimitedFrom, mergeDelimitedFrom, mergeFrom, newUninitializedMessageExceptionMethods inherited from class Object
equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, waitMethods inherited from interface com.google.protobuf.Message.Builder
mergeDelimitedFrom, mergeDelimitedFromMethods inherited from interface com.google.protobuf.MessageLite.Builder
mergeFromMethods inherited from interface com.google.protobuf.MessageOrBuilder
findInitializationErrors, getAllFields, getField, getInitializationErrorString, getOneofFieldDescriptor, getRepeatedField, getRepeatedFieldCount, getUnknownFields, hasField, hasOneof
-
Method Details
-
getDescriptor
public static final com.google.protobuf.Descriptors.Descriptor getDescriptor() -
internalGetFieldAccessorTable
protected com.google.protobuf.GeneratedMessage.FieldAccessorTable internalGetFieldAccessorTable()- Specified by:
internalGetFieldAccessorTablein classcom.google.protobuf.GeneratedMessage.Builder<GlobalCheapestInsertionParameters.Builder>
-
clear
- Specified by:
clearin interfacecom.google.protobuf.Message.Builder- Specified by:
clearin interfacecom.google.protobuf.MessageLite.Builder- Overrides:
clearin classcom.google.protobuf.GeneratedMessage.Builder<GlobalCheapestInsertionParameters.Builder>
-
getDescriptorForType
public com.google.protobuf.Descriptors.Descriptor getDescriptorForType()- Specified by:
getDescriptorForTypein interfacecom.google.protobuf.Message.Builder- Specified by:
getDescriptorForTypein interfacecom.google.protobuf.MessageOrBuilder- Overrides:
getDescriptorForTypein classcom.google.protobuf.GeneratedMessage.Builder<GlobalCheapestInsertionParameters.Builder>
-
getDefaultInstanceForType
- Specified by:
getDefaultInstanceForTypein interfacecom.google.protobuf.MessageLiteOrBuilder- Specified by:
getDefaultInstanceForTypein interfacecom.google.protobuf.MessageOrBuilder
-
build
- Specified by:
buildin interfacecom.google.protobuf.Message.Builder- Specified by:
buildin interfacecom.google.protobuf.MessageLite.Builder
-
buildPartial
- Specified by:
buildPartialin interfacecom.google.protobuf.Message.Builder- Specified by:
buildPartialin interfacecom.google.protobuf.MessageLite.Builder
-
mergeFrom
- Specified by:
mergeFromin interfacecom.google.protobuf.Message.Builder- Overrides:
mergeFromin classcom.google.protobuf.AbstractMessage.Builder<GlobalCheapestInsertionParameters.Builder>
-
mergeFrom
-
isInitialized
public final boolean isInitialized()- Specified by:
isInitializedin interfacecom.google.protobuf.MessageLiteOrBuilder- Overrides:
isInitializedin classcom.google.protobuf.GeneratedMessage.Builder<GlobalCheapestInsertionParameters.Builder>
-
mergeFrom
public GlobalCheapestInsertionParameters.Builder mergeFrom(com.google.protobuf.CodedInputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws IOException - Specified by:
mergeFromin interfacecom.google.protobuf.Message.Builder- Specified by:
mergeFromin interfacecom.google.protobuf.MessageLite.Builder- Overrides:
mergeFromin classcom.google.protobuf.AbstractMessage.Builder<GlobalCheapestInsertionParameters.Builder>- Throws:
IOException
-
getFarthestSeedsRatio
public double getFarthestSeedsRatio()Ratio (between 0 and 1) of available vehicles in the model on which farthest nodes of the model are inserted as seeds.
double farthest_seeds_ratio = 1;- Specified by:
getFarthestSeedsRatioin interfaceGlobalCheapestInsertionParametersOrBuilder- Returns:
- The farthestSeedsRatio.
-
setFarthestSeedsRatio
Ratio (between 0 and 1) of available vehicles in the model on which farthest nodes of the model are inserted as seeds.
double farthest_seeds_ratio = 1;- Parameters:
value- The farthestSeedsRatio to set.- Returns:
- This builder for chaining.
-
clearFarthestSeedsRatio
Ratio (between 0 and 1) of available vehicles in the model on which farthest nodes of the model are inserted as seeds.
double farthest_seeds_ratio = 1;- Returns:
- This builder for chaining.
-
getNeighborsRatio
public double getNeighborsRatio()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.
double neighbors_ratio = 2;- Specified by:
getNeighborsRatioin interfaceGlobalCheapestInsertionParametersOrBuilder- Returns:
- The neighborsRatio.
-
setNeighborsRatio
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.
double neighbors_ratio = 2;- Parameters:
value- The neighborsRatio to set.- Returns:
- This builder for chaining.
-
clearNeighborsRatio
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.
double neighbors_ratio = 2;- Returns:
- This builder for chaining.
-
getMinNeighbors
public int getMinNeighbors()int32 min_neighbors = 3;- Specified by:
getMinNeighborsin interfaceGlobalCheapestInsertionParametersOrBuilder- Returns:
- The minNeighbors.
-
setMinNeighbors
int32 min_neighbors = 3;- Parameters:
value- The minNeighbors to set.- Returns:
- This builder for chaining.
-
clearMinNeighbors
int32 min_neighbors = 3;- Returns:
- This builder for chaining.
-
getUseNeighborsRatioForInitialization
public boolean getUseNeighborsRatioForInitialization()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 use_neighbors_ratio_for_initialization = 6;- Specified by:
getUseNeighborsRatioForInitializationin interfaceGlobalCheapestInsertionParametersOrBuilder- Returns:
- The useNeighborsRatioForInitialization.
-
setUseNeighborsRatioForInitialization
public GlobalCheapestInsertionParameters.Builder setUseNeighborsRatioForInitialization(boolean value) 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 use_neighbors_ratio_for_initialization = 6;- Parameters:
value- The useNeighborsRatioForInitialization to set.- Returns:
- This builder for chaining.
-
clearUseNeighborsRatioForInitialization
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 use_neighbors_ratio_for_initialization = 6;- Returns:
- This builder for chaining.
-
getAddUnperformedEntries
public boolean getAddUnperformedEntries()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.
bool add_unperformed_entries = 7;- Specified by:
getAddUnperformedEntriesin interfaceGlobalCheapestInsertionParametersOrBuilder- Returns:
- The addUnperformedEntries.
-
setAddUnperformedEntries
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.
bool add_unperformed_entries = 7;- Parameters:
value- The addUnperformedEntries to set.- Returns:
- This builder for chaining.
-
clearAddUnperformedEntries
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.
bool add_unperformed_entries = 7;- Returns:
- This builder for chaining.
-