Class RoutingSearchParameters
java.lang.Object
com.google.protobuf.AbstractMessageLite
com.google.protobuf.AbstractMessage
com.google.protobuf.GeneratedMessage
com.google.ortools.constraintsolver.RoutingSearchParameters
- All Implemented Interfaces:
RoutingSearchParametersOrBuilder, com.google.protobuf.Message, com.google.protobuf.MessageLite, com.google.protobuf.MessageLiteOrBuilder, com.google.protobuf.MessageOrBuilder, Serializable
@Generated
public final class RoutingSearchParameters
extends com.google.protobuf.GeneratedMessage
implements RoutingSearchParametersOrBuilder
Parameters defining the search used to solve vehicle routing problems. If a parameter is unset (or, equivalently, set to its default value), then the routing library will pick its preferred value for that parameter automatically: this should be the case for most parameters. To see those "default" parameters, call GetDefaultRoutingSearchParameters(). Next ID: 73Protobuf type
operations_research.RoutingSearchParameters- See Also:
-
Nested Class Summary
Nested ClassesModifier and TypeClassDescriptionstatic final classParameters defining the search used to solve vehicle routing problems.static final classParameters required for the improvement search limit.static interfacestatic final classLocal search neighborhood operators used to build a solutions neighborhood.static interfacestatic enumUnderlying solver to use in dimension scheduling, respectively for continuous and mixed models.Nested classes/interfaces inherited from class com.google.protobuf.GeneratedMessage
com.google.protobuf.GeneratedMessage.ExtendableBuilder<MessageT,BuilderT>, com.google.protobuf.GeneratedMessage.ExtendableMessage<MessageT>, com.google.protobuf.GeneratedMessage.ExtendableMessageOrBuilder<MessageT>, com.google.protobuf.GeneratedMessage.FieldAccessorTable, com.google.protobuf.GeneratedMessage.GeneratedExtension<ContainingT, T>, com.google.protobuf.GeneratedMessage.UnusedPrivateParameter Nested classes/interfaces inherited from class com.google.protobuf.AbstractMessage
com.google.protobuf.AbstractMessage.BuilderParentNested classes/interfaces inherited from class com.google.protobuf.AbstractMessageLite
com.google.protobuf.AbstractMessageLite.InternalOneOfEnum -
Field Summary
FieldsModifier and TypeFieldDescriptionstatic final intstatic final intstatic final intstatic final intstatic final intstatic final intstatic final intstatic final intstatic final intstatic final intstatic final intstatic final intstatic final intstatic final intstatic final intstatic final intstatic final intstatic final intstatic final intstatic final intstatic final intstatic final intstatic final intstatic final intstatic final intstatic final intstatic final intstatic final intstatic final intstatic final intstatic final intstatic final intstatic final intstatic final intstatic final intstatic final intstatic final intstatic final intstatic final intstatic final intstatic final intstatic final intstatic final intstatic final intstatic final intstatic final intstatic final intstatic final intstatic final intstatic final intFields inherited from class com.google.protobuf.GeneratedMessage
alwaysUseFieldBuilders, loggedPre22TypeNames, unknownFieldsFields inherited from class com.google.protobuf.AbstractMessage
memoizedSizeFields inherited from class com.google.protobuf.AbstractMessageLite
memoizedHashCode -
Method Summary
Modifier and TypeMethodDescriptionbooleanbooleanIf true use minimum matching instead of minimal matching in the Christofides algorithm..operations_research.RoutingSearchParameters.SchedulingSolver continuous_scheduling_solver = 33;int.operations_research.RoutingSearchParameters.SchedulingSolver continuous_scheduling_solver = 33;static RoutingSearchParametersstatic final com.google.protobuf.Descriptors.DescriptorbooleanSetting this to true completely disables the LP and MIP scheduling in the solver.intIf model.Size() is less than the threshold and that no solution has been found, attempt a pass with CP-SAT.intIf non zero, a period p indicates that every p node insertions or additions to a path, an optimization of the current partial solution will be performed.First solution strategies, used as starting point of local search.intFirst solution strategies, used as starting point of local search.Parameters for the global cheapest insertion heuristic when used as first solution heuristic.Parameters for the global cheapest insertion heuristic when used as first solution heuristic.Parameters for the global cheapest insertion heuristic when used in a local search operator (see local_search_operators.use_global_cheapest_insertion_path_lns and local_search_operators.use_global_cheapest_insertion_chain_lns below).Parameters for the global cheapest insertion heuristic when used in a local search operator (see local_search_operators.use_global_cheapest_insertion_path_lns and local_search_operators.use_global_cheapest_insertion_chain_lns below).doubleThese are advanced settings which should not be modified unless you know what you are doing.booleanWhen an arc leaving a vehicle start or arriving at a vehicle end is penalized, this field controls whether to penalize all other equivalent arcs with starts or ends in the same vehicle class.booleanWhether to reset penalties when a new best solution is found.intNumber of closest nodes to consider for each node during the destruction phase of the FilteredHeuristicCloseNodesLNSOperator.intNumber of expensive arcs to consider cutting in the FilteredHeuristicExpensiveChainLNSOperator operator.The improvement search limit is added to the solver if the following parameters are set.The improvement search limit is added to the solver if the following parameters are set.Iterated Local Search parameters.Iterated Local Search parameters.com.google.protobuf.DurationLimit to the time spent in the completion search for each local search neighbor.com.google.protobuf.DurationOrBuilderLimit to the time spent in the completion search for each local search neighbor.Parameters for the local cheapest cost insertion heuristic.Parameters for the local cheapest cost insertion heuristic.Parameters for the local cheapest insertion heuristic.Parameters for the local cheapest insertion heuristic.Local search metaheuristics used to guide the search.getLocalSearchMetaheuristics(int index) Local search metaheuristics alternatively used to guide the search.intLocal search metaheuristics alternatively used to guide the search.Local search metaheuristics alternatively used to guide the search.intgetLocalSearchMetaheuristicsValue(int index) Local search metaheuristics alternatively used to guide the search.Local search metaheuristics alternatively used to guide the search.intLocal search metaheuristics used to guide the search..operations_research.RoutingSearchParameters.LocalSearchNeighborhoodOperators local_search_operators = 3;.operations_research.RoutingSearchParameters.LocalSearchNeighborhoodOperators local_search_operators = 3;doubledouble log_cost_offset = 29;doubleIn logs, cost values will be scaled and offset by the given values in the following way: log_cost_scaling_factor * (cost + log_cost_offset)boolean--- Miscellaneous --- Some of these are advanced settings which should not be modified unless you know what you are doing.In logs, this tag will be appended to each line corresponding to a new solution.com.google.protobuf.ByteStringIn logs, this tag will be appended to each line corresponding to a new solution.intint32 ls_operator_min_neighbors = 54;doubleNeighbors ratio and minimum number of neighbors considered in local search operators (see GlobalCheapestInsertionParameters.neighbors_ratio and GlobalCheapestInsertionParameters.min_neighbors for more information).intMaximum size of the chain to make inactive in SwapActiveChainOperator..operations_research.RoutingSearchParameters.SchedulingSolver mixed_integer_scheduling_solver = 34;int.operations_research.RoutingSearchParameters.SchedulingSolver mixed_integer_scheduling_solver = 34;doublePositive parameter defining the exploration coefficient of the multi-armed bandit compound operator.doubleMemory coefficient related to the multi-armed bandit compound operator.intNumber of solutions to collect during the search.intint32 num_max_local_optima_before_metaheuristic_switch = 64;doubleMinimum step by which the solution must be improved in local search. 0 means "unspecified".com.google.protobuf.Parser<RoutingSearchParameters> intNumber of expensive arcs to consider cutting in the RelocateExpensiveChain neighborhood operator (see LocalSearchNeighborhoodOperators.use_relocate_expensive_chain()).booleanIf use_cp_sat or use_generalized_cp_sat is true, will report intermediate solutions found by CP-SAT to solution listeners.If use_cp_sat or use_generalized_cp_sat is true, contains the SAT algorithm parameters which will be used.If use_cp_sat or use_generalized_cp_sat is true, contains the SAT algorithm parameters which will be used.Parameters for the Savings heuristic.Parameters for the Savings heuristic.doubleRatio of the overall time limit spent in a secondary LS phase with only intra-route and insertion operators, meant to "cleanup" the current solution before stopping the search.intlong-- Search limits -- Limit to the number of solutions generated during the search. 0 means "unspecified".com.google.protobuf.DurationLimit to the time spent in the search.com.google.protobuf.DurationOrBuilderLimit to the time spent in the search.getUseCp()If true, use the CP solver to find a solution.If true, use the CP-SAT solver to find a solution.intIf true, use the CP-SAT solver to find a solution.intIf true, use the CP solver to find a solution.boolean--- Search control --- If true, the solver should use depth-first search rather than local search to solve the problem.boolean--- Propagation control --- These are advanced settings which should not be modified unless you know what you are doing.If true, use the CP-SAT solver to find a solution on generalized routing model.intIf true, use the CP-SAT solver to find a solution on generalized routing model.booleanWhether to consider arc penalties in cost functions used in local search operators using arc costs.booleanWhether the solver should use an Iterated Local Search approach to solve the problem.booleanIf true, the solver will use multi-armed bandit concatenate operators.boolean--- Advanced first solutions strategy settings --- Don't touch these unless you know what you are doing.booleanSetting this to true completely disables the LP and MIP scheduling in the solver.booleanParameters for the global cheapest insertion heuristic when used as first solution heuristic.booleanParameters for the global cheapest insertion heuristic when used in a local search operator (see local_search_operators.use_global_cheapest_insertion_path_lns and local_search_operators.use_global_cheapest_insertion_chain_lns below).inthashCode()booleanThe improvement search limit is added to the solver if the following parameters are set.booleanIterated Local Search parameters.booleanLimit to the time spent in the completion search for each local search neighbor.booleanParameters for the local cheapest cost insertion heuristic.booleanParameters for the local cheapest insertion heuristic.boolean.operations_research.RoutingSearchParameters.LocalSearchNeighborhoodOperators local_search_operators = 3;booleanIf use_cp_sat or use_generalized_cp_sat is true, contains the SAT algorithm parameters which will be used.booleanParameters for the Savings heuristic.booleanLimit to the time spent in the search.protected com.google.protobuf.GeneratedMessage.FieldAccessorTablefinal booleannewBuilder(RoutingSearchParameters prototype) protected RoutingSearchParameters.BuildernewBuilderForType(com.google.protobuf.AbstractMessage.BuilderParent parent) static RoutingSearchParametersparseDelimitedFrom(InputStream input) static RoutingSearchParametersparseDelimitedFrom(InputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry) static RoutingSearchParametersparseFrom(byte[] data) static RoutingSearchParametersparseFrom(byte[] data, com.google.protobuf.ExtensionRegistryLite extensionRegistry) static RoutingSearchParametersparseFrom(com.google.protobuf.ByteString data) static RoutingSearchParametersparseFrom(com.google.protobuf.ByteString data, com.google.protobuf.ExtensionRegistryLite extensionRegistry) static RoutingSearchParametersparseFrom(com.google.protobuf.CodedInputStream input) static RoutingSearchParametersparseFrom(com.google.protobuf.CodedInputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry) static RoutingSearchParametersparseFrom(InputStream input) static RoutingSearchParametersparseFrom(InputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry) static RoutingSearchParametersparseFrom(ByteBuffer data) static RoutingSearchParametersparseFrom(ByteBuffer data, com.google.protobuf.ExtensionRegistryLite extensionRegistry) static com.google.protobuf.Parser<RoutingSearchParameters> parser()voidwriteTo(com.google.protobuf.CodedOutputStream output) Methods inherited from class com.google.protobuf.GeneratedMessage
canUseUnsafe, computeStringSize, computeStringSizeNoTag, emptyBooleanList, emptyDoubleList, emptyFloatList, emptyIntList, emptyList, emptyLongList, getAllFields, getDescriptorForType, getField, getOneofFieldDescriptor, getRepeatedField, getRepeatedFieldCount, getUnknownFields, hasField, hasOneof, internalGetMapField, internalGetMapFieldReflection, isStringEmpty, makeExtensionsImmutable, makeMutableCopy, makeMutableCopy, mergeFromAndMakeImmutableInternal, newFileScopedGeneratedExtension, newInstance, newMessageScopedGeneratedExtension, parseDelimitedWithIOException, parseDelimitedWithIOException, parseUnknownField, parseUnknownFieldProto3, parseWithIOException, parseWithIOException, parseWithIOException, parseWithIOException, serializeBooleanMapTo, serializeIntegerMapTo, serializeLongMapTo, serializeStringMapTo, writeReplace, writeString, writeStringNoTagMethods inherited from class com.google.protobuf.AbstractMessage
findInitializationErrors, getInitializationErrorString, hashFields, toStringMethods inherited from class com.google.protobuf.AbstractMessageLite
addAll, checkByteStringIsUtf8, toByteArray, toByteString, writeDelimitedTo, writeToMethods inherited from interface com.google.protobuf.MessageLite
toByteArray, toByteString, writeDelimitedTo, writeToMethods inherited from interface com.google.protobuf.MessageOrBuilder
findInitializationErrors, getAllFields, getDescriptorForType, getField, getInitializationErrorString, getOneofFieldDescriptor, getRepeatedField, getRepeatedFieldCount, getUnknownFields, hasField, hasOneof
-
Field Details
-
FIRST_SOLUTION_STRATEGY_FIELD_NUMBER
public static final int FIRST_SOLUTION_STRATEGY_FIELD_NUMBER- See Also:
-
USE_UNFILTERED_FIRST_SOLUTION_STRATEGY_FIELD_NUMBER
public static final int USE_UNFILTERED_FIRST_SOLUTION_STRATEGY_FIELD_NUMBER- See Also:
-
SAVINGS_PARAMETERS_FIELD_NUMBER
public static final int SAVINGS_PARAMETERS_FIELD_NUMBER- See Also:
-
GLOBAL_CHEAPEST_INSERTION_FIRST_SOLUTION_PARAMETERS_FIELD_NUMBER
public static final int GLOBAL_CHEAPEST_INSERTION_FIRST_SOLUTION_PARAMETERS_FIELD_NUMBER- See Also:
-
GLOBAL_CHEAPEST_INSERTION_LS_OPERATOR_PARAMETERS_FIELD_NUMBER
public static final int GLOBAL_CHEAPEST_INSERTION_LS_OPERATOR_PARAMETERS_FIELD_NUMBER- See Also:
-
LOCAL_CHEAPEST_INSERTION_PARAMETERS_FIELD_NUMBER
public static final int LOCAL_CHEAPEST_INSERTION_PARAMETERS_FIELD_NUMBER- See Also:
-
LOCAL_CHEAPEST_COST_INSERTION_PARAMETERS_FIELD_NUMBER
public static final int LOCAL_CHEAPEST_COST_INSERTION_PARAMETERS_FIELD_NUMBER- See Also:
-
CHRISTOFIDES_USE_MINIMUM_MATCHING_FIELD_NUMBER
public static final int CHRISTOFIDES_USE_MINIMUM_MATCHING_FIELD_NUMBER- See Also:
-
FIRST_SOLUTION_OPTIMIZATION_PERIOD_FIELD_NUMBER
public static final int FIRST_SOLUTION_OPTIMIZATION_PERIOD_FIELD_NUMBER- See Also:
-
LOCAL_SEARCH_OPERATORS_FIELD_NUMBER
public static final int LOCAL_SEARCH_OPERATORS_FIELD_NUMBER- See Also:
-
LS_OPERATOR_NEIGHBORS_RATIO_FIELD_NUMBER
public static final int LS_OPERATOR_NEIGHBORS_RATIO_FIELD_NUMBER- See Also:
-
LS_OPERATOR_MIN_NEIGHBORS_FIELD_NUMBER
public static final int LS_OPERATOR_MIN_NEIGHBORS_FIELD_NUMBER- See Also:
-
USE_MULTI_ARMED_BANDIT_CONCATENATE_OPERATORS_FIELD_NUMBER
public static final int USE_MULTI_ARMED_BANDIT_CONCATENATE_OPERATORS_FIELD_NUMBER- See Also:
-
MULTI_ARMED_BANDIT_COMPOUND_OPERATOR_MEMORY_COEFFICIENT_FIELD_NUMBER
public static final int MULTI_ARMED_BANDIT_COMPOUND_OPERATOR_MEMORY_COEFFICIENT_FIELD_NUMBER- See Also:
-
MULTI_ARMED_BANDIT_COMPOUND_OPERATOR_EXPLORATION_COEFFICIENT_FIELD_NUMBER
public static final int MULTI_ARMED_BANDIT_COMPOUND_OPERATOR_EXPLORATION_COEFFICIENT_FIELD_NUMBER- See Also:
-
MAX_SWAP_ACTIVE_CHAIN_SIZE_FIELD_NUMBER
public static final int MAX_SWAP_ACTIVE_CHAIN_SIZE_FIELD_NUMBER- See Also:
-
RELOCATE_EXPENSIVE_CHAIN_NUM_ARCS_TO_CONSIDER_FIELD_NUMBER
public static final int RELOCATE_EXPENSIVE_CHAIN_NUM_ARCS_TO_CONSIDER_FIELD_NUMBER- See Also:
-
HEURISTIC_EXPENSIVE_CHAIN_LNS_NUM_ARCS_TO_CONSIDER_FIELD_NUMBER
public static final int HEURISTIC_EXPENSIVE_CHAIN_LNS_NUM_ARCS_TO_CONSIDER_FIELD_NUMBER- See Also:
-
HEURISTIC_CLOSE_NODES_LNS_NUM_NODES_FIELD_NUMBER
public static final int HEURISTIC_CLOSE_NODES_LNS_NUM_NODES_FIELD_NUMBER- See Also:
-
LOCAL_SEARCH_METAHEURISTIC_FIELD_NUMBER
public static final int LOCAL_SEARCH_METAHEURISTIC_FIELD_NUMBER- See Also:
-
LOCAL_SEARCH_METAHEURISTICS_FIELD_NUMBER
public static final int LOCAL_SEARCH_METAHEURISTICS_FIELD_NUMBER- See Also:
-
NUM_MAX_LOCAL_OPTIMA_BEFORE_METAHEURISTIC_SWITCH_FIELD_NUMBER
public static final int NUM_MAX_LOCAL_OPTIMA_BEFORE_METAHEURISTIC_SWITCH_FIELD_NUMBER- See Also:
-
GUIDED_LOCAL_SEARCH_LAMBDA_COEFFICIENT_FIELD_NUMBER
public static final int GUIDED_LOCAL_SEARCH_LAMBDA_COEFFICIENT_FIELD_NUMBER- See Also:
-
GUIDED_LOCAL_SEARCH_RESET_PENALTIES_ON_NEW_BEST_SOLUTION_FIELD_NUMBER
public static final int GUIDED_LOCAL_SEARCH_RESET_PENALTIES_ON_NEW_BEST_SOLUTION_FIELD_NUMBER- See Also:
-
GUIDED_LOCAL_SEARCH_PENALIZE_WITH_VEHICLE_CLASSES_FIELD_NUMBER
public static final int GUIDED_LOCAL_SEARCH_PENALIZE_WITH_VEHICLE_CLASSES_FIELD_NUMBER- See Also:
-
USE_GUIDED_LOCAL_SEARCH_PENALTIES_IN_LOCAL_SEARCH_OPERATORS_FIELD_NUMBER
public static final int USE_GUIDED_LOCAL_SEARCH_PENALTIES_IN_LOCAL_SEARCH_OPERATORS_FIELD_NUMBER- See Also:
-
USE_DEPTH_FIRST_SEARCH_FIELD_NUMBER
public static final int USE_DEPTH_FIRST_SEARCH_FIELD_NUMBER- See Also:
-
USE_CP_FIELD_NUMBER
public static final int USE_CP_FIELD_NUMBER- See Also:
-
USE_CP_SAT_FIELD_NUMBER
public static final int USE_CP_SAT_FIELD_NUMBER- See Also:
-
USE_GENERALIZED_CP_SAT_FIELD_NUMBER
public static final int USE_GENERALIZED_CP_SAT_FIELD_NUMBER- See Also:
-
SAT_PARAMETERS_FIELD_NUMBER
public static final int SAT_PARAMETERS_FIELD_NUMBER- See Also:
-
REPORT_INTERMEDIATE_CP_SAT_SOLUTIONS_FIELD_NUMBER
public static final int REPORT_INTERMEDIATE_CP_SAT_SOLUTIONS_FIELD_NUMBER- See Also:
-
FALLBACK_TO_CP_SAT_SIZE_THRESHOLD_FIELD_NUMBER
public static final int FALLBACK_TO_CP_SAT_SIZE_THRESHOLD_FIELD_NUMBER- See Also:
-
CONTINUOUS_SCHEDULING_SOLVER_FIELD_NUMBER
public static final int CONTINUOUS_SCHEDULING_SOLVER_FIELD_NUMBER- See Also:
-
MIXED_INTEGER_SCHEDULING_SOLVER_FIELD_NUMBER
public static final int MIXED_INTEGER_SCHEDULING_SOLVER_FIELD_NUMBER- See Also:
-
DISABLE_SCHEDULING_BEWARE_THIS_MAY_DEGRADE_PERFORMANCE_FIELD_NUMBER
public static final int DISABLE_SCHEDULING_BEWARE_THIS_MAY_DEGRADE_PERFORMANCE_FIELD_NUMBER- See Also:
-
OPTIMIZATION_STEP_FIELD_NUMBER
public static final int OPTIMIZATION_STEP_FIELD_NUMBER- See Also:
-
NUMBER_OF_SOLUTIONS_TO_COLLECT_FIELD_NUMBER
public static final int NUMBER_OF_SOLUTIONS_TO_COLLECT_FIELD_NUMBER- See Also:
-
SOLUTION_LIMIT_FIELD_NUMBER
public static final int SOLUTION_LIMIT_FIELD_NUMBER- See Also:
-
TIME_LIMIT_FIELD_NUMBER
public static final int TIME_LIMIT_FIELD_NUMBER- See Also:
-
LNS_TIME_LIMIT_FIELD_NUMBER
public static final int LNS_TIME_LIMIT_FIELD_NUMBER- See Also:
-
SECONDARY_LS_TIME_LIMIT_RATIO_FIELD_NUMBER
public static final int SECONDARY_LS_TIME_LIMIT_RATIO_FIELD_NUMBER- See Also:
-
IMPROVEMENT_LIMIT_PARAMETERS_FIELD_NUMBER
public static final int IMPROVEMENT_LIMIT_PARAMETERS_FIELD_NUMBER- See Also:
-
USE_FULL_PROPAGATION_FIELD_NUMBER
public static final int USE_FULL_PROPAGATION_FIELD_NUMBER- See Also:
-
LOG_SEARCH_FIELD_NUMBER
public static final int LOG_SEARCH_FIELD_NUMBER- See Also:
-
LOG_COST_SCALING_FACTOR_FIELD_NUMBER
public static final int LOG_COST_SCALING_FACTOR_FIELD_NUMBER- See Also:
-
LOG_COST_OFFSET_FIELD_NUMBER
public static final int LOG_COST_OFFSET_FIELD_NUMBER- See Also:
-
LOG_TAG_FIELD_NUMBER
public static final int LOG_TAG_FIELD_NUMBER- See Also:
-
USE_ITERATED_LOCAL_SEARCH_FIELD_NUMBER
public static final int USE_ITERATED_LOCAL_SEARCH_FIELD_NUMBER- See Also:
-
ITERATED_LOCAL_SEARCH_PARAMETERS_FIELD_NUMBER
public static final int ITERATED_LOCAL_SEARCH_PARAMETERS_FIELD_NUMBER- See Also:
-
-
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
-
getFirstSolutionStrategyValue
public int getFirstSolutionStrategyValue()First solution strategies, used as starting point of local search.
.operations_research.FirstSolutionStrategy.Value first_solution_strategy = 1;- Specified by:
getFirstSolutionStrategyValuein interfaceRoutingSearchParametersOrBuilder- Returns:
- The enum numeric value on the wire for firstSolutionStrategy.
-
getFirstSolutionStrategy
First solution strategies, used as starting point of local search.
.operations_research.FirstSolutionStrategy.Value first_solution_strategy = 1;- Specified by:
getFirstSolutionStrategyin interfaceRoutingSearchParametersOrBuilder- Returns:
- The firstSolutionStrategy.
-
getUseUnfilteredFirstSolutionStrategy
public boolean getUseUnfilteredFirstSolutionStrategy()--- Advanced first solutions strategy settings --- Don't touch these unless you know what you are doing. Use filtered version of first solution strategy if available.
bool use_unfiltered_first_solution_strategy = 2;- Specified by:
getUseUnfilteredFirstSolutionStrategyin interfaceRoutingSearchParametersOrBuilder- Returns:
- The useUnfilteredFirstSolutionStrategy.
-
hasSavingsParameters
public boolean hasSavingsParameters()Parameters for the Savings heuristic.
.operations_research.SavingsParameters savings_parameters = 70;- Specified by:
hasSavingsParametersin interfaceRoutingSearchParametersOrBuilder- Returns:
- Whether the savingsParameters field is set.
-
getSavingsParameters
Parameters for the Savings heuristic.
.operations_research.SavingsParameters savings_parameters = 70;- Specified by:
getSavingsParametersin interfaceRoutingSearchParametersOrBuilder- Returns:
- The savingsParameters.
-
getSavingsParametersOrBuilder
Parameters for the Savings heuristic.
.operations_research.SavingsParameters savings_parameters = 70;- Specified by:
getSavingsParametersOrBuilderin interfaceRoutingSearchParametersOrBuilder
-
hasGlobalCheapestInsertionFirstSolutionParameters
public boolean hasGlobalCheapestInsertionFirstSolutionParameters()Parameters for the global cheapest insertion heuristic when used as first solution heuristic.
.operations_research.GlobalCheapestInsertionParameters global_cheapest_insertion_first_solution_parameters = 71;- Specified by:
hasGlobalCheapestInsertionFirstSolutionParametersin interfaceRoutingSearchParametersOrBuilder- Returns:
- Whether the globalCheapestInsertionFirstSolutionParameters field is set.
-
getGlobalCheapestInsertionFirstSolutionParameters
Parameters for the global cheapest insertion heuristic when used as first solution heuristic.
.operations_research.GlobalCheapestInsertionParameters global_cheapest_insertion_first_solution_parameters = 71;- Specified by:
getGlobalCheapestInsertionFirstSolutionParametersin interfaceRoutingSearchParametersOrBuilder- Returns:
- The globalCheapestInsertionFirstSolutionParameters.
-
getGlobalCheapestInsertionFirstSolutionParametersOrBuilder
public GlobalCheapestInsertionParametersOrBuilder getGlobalCheapestInsertionFirstSolutionParametersOrBuilder()Parameters for the global cheapest insertion heuristic when used as first solution heuristic.
.operations_research.GlobalCheapestInsertionParameters global_cheapest_insertion_first_solution_parameters = 71;- Specified by:
getGlobalCheapestInsertionFirstSolutionParametersOrBuilderin interfaceRoutingSearchParametersOrBuilder
-
hasGlobalCheapestInsertionLsOperatorParameters
public boolean hasGlobalCheapestInsertionLsOperatorParameters()Parameters for the global cheapest insertion heuristic when used in a local search operator (see local_search_operators.use_global_cheapest_insertion_path_lns and local_search_operators.use_global_cheapest_insertion_chain_lns below).
.operations_research.GlobalCheapestInsertionParameters global_cheapest_insertion_ls_operator_parameters = 72;- Specified by:
hasGlobalCheapestInsertionLsOperatorParametersin interfaceRoutingSearchParametersOrBuilder- Returns:
- Whether the globalCheapestInsertionLsOperatorParameters field is set.
-
getGlobalCheapestInsertionLsOperatorParameters
Parameters for the global cheapest insertion heuristic when used in a local search operator (see local_search_operators.use_global_cheapest_insertion_path_lns and local_search_operators.use_global_cheapest_insertion_chain_lns below).
.operations_research.GlobalCheapestInsertionParameters global_cheapest_insertion_ls_operator_parameters = 72;- Specified by:
getGlobalCheapestInsertionLsOperatorParametersin interfaceRoutingSearchParametersOrBuilder- Returns:
- The globalCheapestInsertionLsOperatorParameters.
-
getGlobalCheapestInsertionLsOperatorParametersOrBuilder
public GlobalCheapestInsertionParametersOrBuilder getGlobalCheapestInsertionLsOperatorParametersOrBuilder()Parameters for the global cheapest insertion heuristic when used in a local search operator (see local_search_operators.use_global_cheapest_insertion_path_lns and local_search_operators.use_global_cheapest_insertion_chain_lns below).
.operations_research.GlobalCheapestInsertionParameters global_cheapest_insertion_ls_operator_parameters = 72;- Specified by:
getGlobalCheapestInsertionLsOperatorParametersOrBuilderin interfaceRoutingSearchParametersOrBuilder
-
hasLocalCheapestInsertionParameters
public boolean hasLocalCheapestInsertionParameters()Parameters for the local cheapest insertion heuristic.
.operations_research.LocalCheapestInsertionParameters local_cheapest_insertion_parameters = 68;- Specified by:
hasLocalCheapestInsertionParametersin interfaceRoutingSearchParametersOrBuilder- Returns:
- Whether the localCheapestInsertionParameters field is set.
-
getLocalCheapestInsertionParameters
Parameters for the local cheapest insertion heuristic.
.operations_research.LocalCheapestInsertionParameters local_cheapest_insertion_parameters = 68;- Specified by:
getLocalCheapestInsertionParametersin interfaceRoutingSearchParametersOrBuilder- Returns:
- The localCheapestInsertionParameters.
-
getLocalCheapestInsertionParametersOrBuilder
Parameters for the local cheapest insertion heuristic.
.operations_research.LocalCheapestInsertionParameters local_cheapest_insertion_parameters = 68;- Specified by:
getLocalCheapestInsertionParametersOrBuilderin interfaceRoutingSearchParametersOrBuilder
-
hasLocalCheapestCostInsertionParameters
public boolean hasLocalCheapestCostInsertionParameters()Parameters for the local cheapest cost insertion heuristic.
.operations_research.LocalCheapestInsertionParameters local_cheapest_cost_insertion_parameters = 69;- Specified by:
hasLocalCheapestCostInsertionParametersin interfaceRoutingSearchParametersOrBuilder- Returns:
- Whether the localCheapestCostInsertionParameters field is set.
-
getLocalCheapestCostInsertionParameters
Parameters for the local cheapest cost insertion heuristic.
.operations_research.LocalCheapestInsertionParameters local_cheapest_cost_insertion_parameters = 69;- Specified by:
getLocalCheapestCostInsertionParametersin interfaceRoutingSearchParametersOrBuilder- Returns:
- The localCheapestCostInsertionParameters.
-
getLocalCheapestCostInsertionParametersOrBuilder
Parameters for the local cheapest cost insertion heuristic.
.operations_research.LocalCheapestInsertionParameters local_cheapest_cost_insertion_parameters = 69;- Specified by:
getLocalCheapestCostInsertionParametersOrBuilderin interfaceRoutingSearchParametersOrBuilder
-
getChristofidesUseMinimumMatching
public boolean getChristofidesUseMinimumMatching()If true use minimum matching instead of minimal matching in the Christofides algorithm.
bool christofides_use_minimum_matching = 30;- Specified by:
getChristofidesUseMinimumMatchingin interfaceRoutingSearchParametersOrBuilder- Returns:
- The christofidesUseMinimumMatching.
-
getFirstSolutionOptimizationPeriod
public int getFirstSolutionOptimizationPeriod()If non zero, a period p indicates that every p node insertions or additions to a path, an optimization of the current partial solution will be performed. As of 12/2023: - this requires that a secondary routing model has been passed to the main one, - this is only supported by LOCAL_CHEAPEST_INSERTION and LOCAL_CHEAPEST_COST_INSERTION.
int32 first_solution_optimization_period = 59;- Specified by:
getFirstSolutionOptimizationPeriodin interfaceRoutingSearchParametersOrBuilder- Returns:
- The firstSolutionOptimizationPeriod.
-
hasLocalSearchOperators
public boolean hasLocalSearchOperators().operations_research.RoutingSearchParameters.LocalSearchNeighborhoodOperators local_search_operators = 3;- Specified by:
hasLocalSearchOperatorsin interfaceRoutingSearchParametersOrBuilder- Returns:
- Whether the localSearchOperators field is set.
-
getLocalSearchOperators
.operations_research.RoutingSearchParameters.LocalSearchNeighborhoodOperators local_search_operators = 3;- Specified by:
getLocalSearchOperatorsin interfaceRoutingSearchParametersOrBuilder- Returns:
- The localSearchOperators.
-
getLocalSearchOperatorsOrBuilder
public RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder getLocalSearchOperatorsOrBuilder().operations_research.RoutingSearchParameters.LocalSearchNeighborhoodOperators local_search_operators = 3;- Specified by:
getLocalSearchOperatorsOrBuilderin interfaceRoutingSearchParametersOrBuilder
-
getLsOperatorNeighborsRatio
public double getLsOperatorNeighborsRatio()Neighbors ratio and minimum number of neighbors considered in local search operators (see GlobalCheapestInsertionParameters.neighbors_ratio and GlobalCheapestInsertionParameters.min_neighbors for more information).
double ls_operator_neighbors_ratio = 53;- Specified by:
getLsOperatorNeighborsRatioin interfaceRoutingSearchParametersOrBuilder- Returns:
- The lsOperatorNeighborsRatio.
-
getLsOperatorMinNeighbors
public int getLsOperatorMinNeighbors()int32 ls_operator_min_neighbors = 54;- Specified by:
getLsOperatorMinNeighborsin interfaceRoutingSearchParametersOrBuilder- Returns:
- The lsOperatorMinNeighbors.
-
getUseMultiArmedBanditConcatenateOperators
public boolean getUseMultiArmedBanditConcatenateOperators()If true, the solver will use multi-armed bandit concatenate operators. It dynamically chooses the next neighbor operator in order to get the best objective improvement.
bool use_multi_armed_bandit_concatenate_operators = 41;- Specified by:
getUseMultiArmedBanditConcatenateOperatorsin interfaceRoutingSearchParametersOrBuilder- Returns:
- The useMultiArmedBanditConcatenateOperators.
-
getMultiArmedBanditCompoundOperatorMemoryCoefficient
public double getMultiArmedBanditCompoundOperatorMemoryCoefficient()Memory coefficient related to the multi-armed bandit compound operator. Sets how much the objective improvement of previous accepted neighbors influence the current average improvement. This parameter should be between 0 and 1.
double multi_armed_bandit_compound_operator_memory_coefficient = 42;- Specified by:
getMultiArmedBanditCompoundOperatorMemoryCoefficientin interfaceRoutingSearchParametersOrBuilder- Returns:
- The multiArmedBanditCompoundOperatorMemoryCoefficient.
-
getMultiArmedBanditCompoundOperatorExplorationCoefficient
public double getMultiArmedBanditCompoundOperatorExplorationCoefficient()Positive parameter defining the exploration coefficient of the multi-armed bandit compound operator. Sets how often we explore rarely used and unsuccessful in the past operators
double multi_armed_bandit_compound_operator_exploration_coefficient = 43;- Specified by:
getMultiArmedBanditCompoundOperatorExplorationCoefficientin interfaceRoutingSearchParametersOrBuilder- Returns:
- The multiArmedBanditCompoundOperatorExplorationCoefficient.
-
getMaxSwapActiveChainSize
public int getMaxSwapActiveChainSize()Maximum size of the chain to make inactive in SwapActiveChainOperator.
int32 max_swap_active_chain_size = 66;- Specified by:
getMaxSwapActiveChainSizein interfaceRoutingSearchParametersOrBuilder- Returns:
- The maxSwapActiveChainSize.
-
getRelocateExpensiveChainNumArcsToConsider
public int getRelocateExpensiveChainNumArcsToConsider()Number of expensive arcs to consider cutting in the RelocateExpensiveChain neighborhood operator (see LocalSearchNeighborhoodOperators.use_relocate_expensive_chain()). This parameter must be greater than 2. NOTE(user): The number of neighbors generated by the operator for relocate_expensive_chain_num_arcs_to_consider = K is around K*(K-1)/2 * number_of_routes * number_of_nodes.
int32 relocate_expensive_chain_num_arcs_to_consider = 20;- Specified by:
getRelocateExpensiveChainNumArcsToConsiderin interfaceRoutingSearchParametersOrBuilder- Returns:
- The relocateExpensiveChainNumArcsToConsider.
-
getHeuristicExpensiveChainLnsNumArcsToConsider
public int getHeuristicExpensiveChainLnsNumArcsToConsider()Number of expensive arcs to consider cutting in the FilteredHeuristicExpensiveChainLNSOperator operator.
int32 heuristic_expensive_chain_lns_num_arcs_to_consider = 32;- Specified by:
getHeuristicExpensiveChainLnsNumArcsToConsiderin interfaceRoutingSearchParametersOrBuilder- Returns:
- The heuristicExpensiveChainLnsNumArcsToConsider.
-
getHeuristicCloseNodesLnsNumNodes
public int getHeuristicCloseNodesLnsNumNodes()Number of closest nodes to consider for each node during the destruction phase of the FilteredHeuristicCloseNodesLNSOperator.
int32 heuristic_close_nodes_lns_num_nodes = 35;- Specified by:
getHeuristicCloseNodesLnsNumNodesin interfaceRoutingSearchParametersOrBuilder- Returns:
- The heuristicCloseNodesLnsNumNodes.
-
getLocalSearchMetaheuristicValue
public int getLocalSearchMetaheuristicValue()Local search metaheuristics used to guide the search.
.operations_research.LocalSearchMetaheuristic.Value local_search_metaheuristic = 4;- Specified by:
getLocalSearchMetaheuristicValuein interfaceRoutingSearchParametersOrBuilder- Returns:
- The enum numeric value on the wire for localSearchMetaheuristic.
-
getLocalSearchMetaheuristic
Local search metaheuristics used to guide the search.
.operations_research.LocalSearchMetaheuristic.Value local_search_metaheuristic = 4;- Specified by:
getLocalSearchMetaheuristicin interfaceRoutingSearchParametersOrBuilder- Returns:
- The localSearchMetaheuristic.
-
getLocalSearchMetaheuristicsList
Local search metaheuristics alternatively used to guide the search. Every num_max_local_optima_before_metaheuristic_switch local minima found by a metaheurisitic, the solver will switch to the next metaheuristic. Cannot be defined if local_search_metaheuristic is different from UNSET or AUTOMATIC.
repeated .operations_research.LocalSearchMetaheuristic.Value local_search_metaheuristics = 63;- Specified by:
getLocalSearchMetaheuristicsListin interfaceRoutingSearchParametersOrBuilder- Returns:
- A list containing the localSearchMetaheuristics.
-
getLocalSearchMetaheuristicsCount
public int getLocalSearchMetaheuristicsCount()Local search metaheuristics alternatively used to guide the search. Every num_max_local_optima_before_metaheuristic_switch local minima found by a metaheurisitic, the solver will switch to the next metaheuristic. Cannot be defined if local_search_metaheuristic is different from UNSET or AUTOMATIC.
repeated .operations_research.LocalSearchMetaheuristic.Value local_search_metaheuristics = 63;- Specified by:
getLocalSearchMetaheuristicsCountin interfaceRoutingSearchParametersOrBuilder- Returns:
- The count of localSearchMetaheuristics.
-
getLocalSearchMetaheuristics
Local search metaheuristics alternatively used to guide the search. Every num_max_local_optima_before_metaheuristic_switch local minima found by a metaheurisitic, the solver will switch to the next metaheuristic. Cannot be defined if local_search_metaheuristic is different from UNSET or AUTOMATIC.
repeated .operations_research.LocalSearchMetaheuristic.Value local_search_metaheuristics = 63;- Specified by:
getLocalSearchMetaheuristicsin interfaceRoutingSearchParametersOrBuilder- Parameters:
index- The index of the element to return.- Returns:
- The localSearchMetaheuristics at the given index.
-
getLocalSearchMetaheuristicsValueList
Local search metaheuristics alternatively used to guide the search. Every num_max_local_optima_before_metaheuristic_switch local minima found by a metaheurisitic, the solver will switch to the next metaheuristic. Cannot be defined if local_search_metaheuristic is different from UNSET or AUTOMATIC.
repeated .operations_research.LocalSearchMetaheuristic.Value local_search_metaheuristics = 63;- Specified by:
getLocalSearchMetaheuristicsValueListin interfaceRoutingSearchParametersOrBuilder- Returns:
- A list containing the enum numeric values on the wire for localSearchMetaheuristics.
-
getLocalSearchMetaheuristicsValue
public int getLocalSearchMetaheuristicsValue(int index) Local search metaheuristics alternatively used to guide the search. Every num_max_local_optima_before_metaheuristic_switch local minima found by a metaheurisitic, the solver will switch to the next metaheuristic. Cannot be defined if local_search_metaheuristic is different from UNSET or AUTOMATIC.
repeated .operations_research.LocalSearchMetaheuristic.Value local_search_metaheuristics = 63;- Specified by:
getLocalSearchMetaheuristicsValuein interfaceRoutingSearchParametersOrBuilder- Parameters:
index- The index of the value to return.- Returns:
- The enum numeric value on the wire of localSearchMetaheuristics at the given index.
-
getNumMaxLocalOptimaBeforeMetaheuristicSwitch
public int getNumMaxLocalOptimaBeforeMetaheuristicSwitch()int32 num_max_local_optima_before_metaheuristic_switch = 64;- Specified by:
getNumMaxLocalOptimaBeforeMetaheuristicSwitchin interfaceRoutingSearchParametersOrBuilder- Returns:
- The numMaxLocalOptimaBeforeMetaheuristicSwitch.
-
getGuidedLocalSearchLambdaCoefficient
public double getGuidedLocalSearchLambdaCoefficient()These are advanced settings which should not be modified unless you know what you are doing. Lambda coefficient used to penalize arc costs when GUIDED_LOCAL_SEARCH is used. Must be positive.
double guided_local_search_lambda_coefficient = 5;- Specified by:
getGuidedLocalSearchLambdaCoefficientin interfaceRoutingSearchParametersOrBuilder- Returns:
- The guidedLocalSearchLambdaCoefficient.
-
getGuidedLocalSearchResetPenaltiesOnNewBestSolution
public boolean getGuidedLocalSearchResetPenaltiesOnNewBestSolution()Whether to reset penalties when a new best solution is found. The effect is that a greedy descent is started before the next penalization phase.
bool guided_local_search_reset_penalties_on_new_best_solution = 51;- Specified by:
getGuidedLocalSearchResetPenaltiesOnNewBestSolutionin interfaceRoutingSearchParametersOrBuilder- Returns:
- The guidedLocalSearchResetPenaltiesOnNewBestSolution.
-
getGuidedLocalSearchPenalizeWithVehicleClasses
public boolean getGuidedLocalSearchPenalizeWithVehicleClasses()When an arc leaving a vehicle start or arriving at a vehicle end is penalized, this field controls whether to penalize all other equivalent arcs with starts or ends in the same vehicle class.
bool guided_local_search_penalize_with_vehicle_classes = 61;- Specified by:
getGuidedLocalSearchPenalizeWithVehicleClassesin interfaceRoutingSearchParametersOrBuilder- Returns:
- The guidedLocalSearchPenalizeWithVehicleClasses.
-
getUseGuidedLocalSearchPenaltiesInLocalSearchOperators
public boolean getUseGuidedLocalSearchPenaltiesInLocalSearchOperators()Whether to consider arc penalties in cost functions used in local search operators using arc costs.
bool use_guided_local_search_penalties_in_local_search_operators = 62;- Specified by:
getUseGuidedLocalSearchPenaltiesInLocalSearchOperatorsin interfaceRoutingSearchParametersOrBuilder- Returns:
- The useGuidedLocalSearchPenaltiesInLocalSearchOperators.
-
getUseDepthFirstSearch
public boolean getUseDepthFirstSearch()--- Search control --- If true, the solver should use depth-first search rather than local search to solve the problem.
bool use_depth_first_search = 6;- Specified by:
getUseDepthFirstSearchin interfaceRoutingSearchParametersOrBuilder- Returns:
- The useDepthFirstSearch.
-
getUseCpValue
public int getUseCpValue()If true, use the CP solver to find a solution. Either local or depth-first search will be used depending on the value of use_depth_first_search. Will be run before the CP-SAT solver (cf. use_cp_sat).
.operations_research.OptionalBoolean use_cp = 28;- Specified by:
getUseCpValuein interfaceRoutingSearchParametersOrBuilder- Returns:
- The enum numeric value on the wire for useCp.
-
getUseCp
If true, use the CP solver to find a solution. Either local or depth-first search will be used depending on the value of use_depth_first_search. Will be run before the CP-SAT solver (cf. use_cp_sat).
.operations_research.OptionalBoolean use_cp = 28;- Specified by:
getUseCpin interfaceRoutingSearchParametersOrBuilder- Returns:
- The useCp.
-
getUseCpSatValue
public int getUseCpSatValue()If true, use the CP-SAT solver to find a solution. If use_cp is also true, the CP-SAT solver will be run after the CP solver if there is time remaining and will use the CP solution as a hint for the CP-SAT search. As of 5/2019, only TSP models can be solved.
.operations_research.OptionalBoolean use_cp_sat = 27;- Specified by:
getUseCpSatValuein interfaceRoutingSearchParametersOrBuilder- Returns:
- The enum numeric value on the wire for useCpSat.
-
getUseCpSat
If true, use the CP-SAT solver to find a solution. If use_cp is also true, the CP-SAT solver will be run after the CP solver if there is time remaining and will use the CP solution as a hint for the CP-SAT search. As of 5/2019, only TSP models can be solved.
.operations_research.OptionalBoolean use_cp_sat = 27;- Specified by:
getUseCpSatin interfaceRoutingSearchParametersOrBuilder- Returns:
- The useCpSat.
-
getUseGeneralizedCpSatValue
public int getUseGeneralizedCpSatValue()If true, use the CP-SAT solver to find a solution on generalized routing model. If use_cp is also true, the CP-SAT solver will be run after the CP solver if there is time remaining and will use the CP solution as a hint for the CP-SAT search.
.operations_research.OptionalBoolean use_generalized_cp_sat = 47;- Specified by:
getUseGeneralizedCpSatValuein interfaceRoutingSearchParametersOrBuilder- Returns:
- The enum numeric value on the wire for useGeneralizedCpSat.
-
getUseGeneralizedCpSat
If true, use the CP-SAT solver to find a solution on generalized routing model. If use_cp is also true, the CP-SAT solver will be run after the CP solver if there is time remaining and will use the CP solution as a hint for the CP-SAT search.
.operations_research.OptionalBoolean use_generalized_cp_sat = 47;- Specified by:
getUseGeneralizedCpSatin interfaceRoutingSearchParametersOrBuilder- Returns:
- The useGeneralizedCpSat.
-
hasSatParameters
public boolean hasSatParameters()If use_cp_sat or use_generalized_cp_sat is true, contains the SAT algorithm parameters which will be used.
.operations_research.sat.SatParameters sat_parameters = 48;- Specified by:
hasSatParametersin interfaceRoutingSearchParametersOrBuilder- Returns:
- Whether the satParameters field is set.
-
getSatParameters
If use_cp_sat or use_generalized_cp_sat is true, contains the SAT algorithm parameters which will be used.
.operations_research.sat.SatParameters sat_parameters = 48;- Specified by:
getSatParametersin interfaceRoutingSearchParametersOrBuilder- Returns:
- The satParameters.
-
getSatParametersOrBuilder
If use_cp_sat or use_generalized_cp_sat is true, contains the SAT algorithm parameters which will be used.
.operations_research.sat.SatParameters sat_parameters = 48;- Specified by:
getSatParametersOrBuilderin interfaceRoutingSearchParametersOrBuilder
-
getReportIntermediateCpSatSolutions
public boolean getReportIntermediateCpSatSolutions()If use_cp_sat or use_generalized_cp_sat is true, will report intermediate solutions found by CP-SAT to solution listeners.
bool report_intermediate_cp_sat_solutions = 56;- Specified by:
getReportIntermediateCpSatSolutionsin interfaceRoutingSearchParametersOrBuilder- Returns:
- The reportIntermediateCpSatSolutions.
-
getFallbackToCpSatSizeThreshold
public int getFallbackToCpSatSizeThreshold()If model.Size() is less than the threshold and that no solution has been found, attempt a pass with CP-SAT.
int32 fallback_to_cp_sat_size_threshold = 52;- Specified by:
getFallbackToCpSatSizeThresholdin interfaceRoutingSearchParametersOrBuilder- Returns:
- The fallbackToCpSatSizeThreshold.
-
getContinuousSchedulingSolverValue
public int getContinuousSchedulingSolverValue().operations_research.RoutingSearchParameters.SchedulingSolver continuous_scheduling_solver = 33;- Specified by:
getContinuousSchedulingSolverValuein interfaceRoutingSearchParametersOrBuilder- Returns:
- The enum numeric value on the wire for continuousSchedulingSolver.
-
getContinuousSchedulingSolver
.operations_research.RoutingSearchParameters.SchedulingSolver continuous_scheduling_solver = 33;- Specified by:
getContinuousSchedulingSolverin interfaceRoutingSearchParametersOrBuilder- Returns:
- The continuousSchedulingSolver.
-
getMixedIntegerSchedulingSolverValue
public int getMixedIntegerSchedulingSolverValue().operations_research.RoutingSearchParameters.SchedulingSolver mixed_integer_scheduling_solver = 34;- Specified by:
getMixedIntegerSchedulingSolverValuein interfaceRoutingSearchParametersOrBuilder- Returns:
- The enum numeric value on the wire for mixedIntegerSchedulingSolver.
-
getMixedIntegerSchedulingSolver
.operations_research.RoutingSearchParameters.SchedulingSolver mixed_integer_scheduling_solver = 34;- Specified by:
getMixedIntegerSchedulingSolverin interfaceRoutingSearchParametersOrBuilder- Returns:
- The mixedIntegerSchedulingSolver.
-
hasDisableSchedulingBewareThisMayDegradePerformance
public boolean hasDisableSchedulingBewareThisMayDegradePerformance()Setting this to true completely disables the LP and MIP scheduling in the solver. This overrides the 2 SchedulingSolver options above.
optional bool disable_scheduling_beware_this_may_degrade_performance = 50;- Specified by:
hasDisableSchedulingBewareThisMayDegradePerformancein interfaceRoutingSearchParametersOrBuilder- Returns:
- Whether the disableSchedulingBewareThisMayDegradePerformance field is set.
-
getDisableSchedulingBewareThisMayDegradePerformance
public boolean getDisableSchedulingBewareThisMayDegradePerformance()Setting this to true completely disables the LP and MIP scheduling in the solver. This overrides the 2 SchedulingSolver options above.
optional bool disable_scheduling_beware_this_may_degrade_performance = 50;- Specified by:
getDisableSchedulingBewareThisMayDegradePerformancein interfaceRoutingSearchParametersOrBuilder- Returns:
- The disableSchedulingBewareThisMayDegradePerformance.
-
getOptimizationStep
public double getOptimizationStep()Minimum step by which the solution must be improved in local search. 0 means "unspecified". If this value is fractional, it will get rounded to the nearest integer.
double optimization_step = 7;- Specified by:
getOptimizationStepin interfaceRoutingSearchParametersOrBuilder- Returns:
- The optimizationStep.
-
getNumberOfSolutionsToCollect
public int getNumberOfSolutionsToCollect()Number of solutions to collect during the search. Corresponds to the best solutions found during the search. 0 means "unspecified".
int32 number_of_solutions_to_collect = 17;- Specified by:
getNumberOfSolutionsToCollectin interfaceRoutingSearchParametersOrBuilder- Returns:
- The numberOfSolutionsToCollect.
-
getSolutionLimit
public long getSolutionLimit()-- Search limits -- Limit to the number of solutions generated during the search. 0 means "unspecified".
int64 solution_limit = 8;- Specified by:
getSolutionLimitin interfaceRoutingSearchParametersOrBuilder- Returns:
- The solutionLimit.
-
hasTimeLimit
public boolean hasTimeLimit()Limit to the time spent in the search.
.google.protobuf.Duration time_limit = 9;- Specified by:
hasTimeLimitin interfaceRoutingSearchParametersOrBuilder- Returns:
- Whether the timeLimit field is set.
-
getTimeLimit
public com.google.protobuf.Duration getTimeLimit()Limit to the time spent in the search.
.google.protobuf.Duration time_limit = 9;- Specified by:
getTimeLimitin interfaceRoutingSearchParametersOrBuilder- Returns:
- The timeLimit.
-
getTimeLimitOrBuilder
public com.google.protobuf.DurationOrBuilder getTimeLimitOrBuilder()Limit to the time spent in the search.
.google.protobuf.Duration time_limit = 9;- Specified by:
getTimeLimitOrBuilderin interfaceRoutingSearchParametersOrBuilder
-
hasLnsTimeLimit
public boolean hasLnsTimeLimit()Limit to the time spent in the completion search for each local search neighbor.
.google.protobuf.Duration lns_time_limit = 10;- Specified by:
hasLnsTimeLimitin interfaceRoutingSearchParametersOrBuilder- Returns:
- Whether the lnsTimeLimit field is set.
-
getLnsTimeLimit
public com.google.protobuf.Duration getLnsTimeLimit()Limit to the time spent in the completion search for each local search neighbor.
.google.protobuf.Duration lns_time_limit = 10;- Specified by:
getLnsTimeLimitin interfaceRoutingSearchParametersOrBuilder- Returns:
- The lnsTimeLimit.
-
getLnsTimeLimitOrBuilder
public com.google.protobuf.DurationOrBuilder getLnsTimeLimitOrBuilder()Limit to the time spent in the completion search for each local search neighbor.
.google.protobuf.Duration lns_time_limit = 10;- Specified by:
getLnsTimeLimitOrBuilderin interfaceRoutingSearchParametersOrBuilder
-
getSecondaryLsTimeLimitRatio
public double getSecondaryLsTimeLimitRatio()Ratio of the overall time limit spent in a secondary LS phase with only intra-route and insertion operators, meant to "cleanup" the current solution before stopping the search. TODO(user): Since these operators are very fast, add a parameter to cap the max time allocated for this second phase (e.g. Duration max_secondary_ls_time_limit).
double secondary_ls_time_limit_ratio = 57;- Specified by:
getSecondaryLsTimeLimitRatioin interfaceRoutingSearchParametersOrBuilder- Returns:
- The secondaryLsTimeLimitRatio.
-
hasImprovementLimitParameters
public boolean hasImprovementLimitParameters()The improvement search limit is added to the solver if the following parameters are set.
.operations_research.RoutingSearchParameters.ImprovementSearchLimitParameters improvement_limit_parameters = 37;- Specified by:
hasImprovementLimitParametersin interfaceRoutingSearchParametersOrBuilder- Returns:
- Whether the improvementLimitParameters field is set.
-
getImprovementLimitParameters
The improvement search limit is added to the solver if the following parameters are set.
.operations_research.RoutingSearchParameters.ImprovementSearchLimitParameters improvement_limit_parameters = 37;- Specified by:
getImprovementLimitParametersin interfaceRoutingSearchParametersOrBuilder- Returns:
- The improvementLimitParameters.
-
getImprovementLimitParametersOrBuilder
public RoutingSearchParameters.ImprovementSearchLimitParametersOrBuilder getImprovementLimitParametersOrBuilder()The improvement search limit is added to the solver if the following parameters are set.
.operations_research.RoutingSearchParameters.ImprovementSearchLimitParameters improvement_limit_parameters = 37;- Specified by:
getImprovementLimitParametersOrBuilderin interfaceRoutingSearchParametersOrBuilder
-
getUseFullPropagation
public boolean getUseFullPropagation()--- Propagation control --- These are advanced settings which should not be modified unless you know what you are doing. Use constraints with full propagation in routing model (instead of 'light' propagation only). Full propagation is only necessary when using depth-first search or for models which require strong propagation to finalize the value of secondary variables. Changing this setting to true will slow down the search in most cases and increase memory consumption in all cases.
bool use_full_propagation = 11;- Specified by:
getUseFullPropagationin interfaceRoutingSearchParametersOrBuilder- Returns:
- The useFullPropagation.
-
getLogSearch
public boolean getLogSearch()--- Miscellaneous --- Some of these are advanced settings which should not be modified unless you know what you are doing. Activates search logging. For each solution found during the search, the following will be displayed: its objective value, the maximum objective value since the beginning of the search, the elapsed time since the beginning of the search, the number of branches explored in the search tree, the number of failures in the search tree, the depth of the search tree, the number of local search neighbors explored, the number of local search neighbors filtered by local search filters, the number of local search neighbors accepted, the total memory used and the percentage of the search done.
bool log_search = 13;- Specified by:
getLogSearchin interfaceRoutingSearchParametersOrBuilder- Returns:
- The logSearch.
-
getLogCostScalingFactor
public double getLogCostScalingFactor()In logs, cost values will be scaled and offset by the given values in the following way: log_cost_scaling_factor * (cost + log_cost_offset)
double log_cost_scaling_factor = 22;- Specified by:
getLogCostScalingFactorin interfaceRoutingSearchParametersOrBuilder- Returns:
- The logCostScalingFactor.
-
getLogCostOffset
public double getLogCostOffset()double log_cost_offset = 29;- Specified by:
getLogCostOffsetin interfaceRoutingSearchParametersOrBuilder- Returns:
- The logCostOffset.
-
getLogTag
In logs, this tag will be appended to each line corresponding to a new solution. Useful to sort out logs when several solves are run in parallel.
string log_tag = 36;- Specified by:
getLogTagin interfaceRoutingSearchParametersOrBuilder- Returns:
- The logTag.
-
getLogTagBytes
public com.google.protobuf.ByteString getLogTagBytes()In logs, this tag will be appended to each line corresponding to a new solution. Useful to sort out logs when several solves are run in parallel.
string log_tag = 36;- Specified by:
getLogTagBytesin interfaceRoutingSearchParametersOrBuilder- Returns:
- The bytes for logTag.
-
getUseIteratedLocalSearch
public boolean getUseIteratedLocalSearch()Whether the solver should use an Iterated Local Search approach to solve the problem.
bool use_iterated_local_search = 58;- Specified by:
getUseIteratedLocalSearchin interfaceRoutingSearchParametersOrBuilder- Returns:
- The useIteratedLocalSearch.
-
hasIteratedLocalSearchParameters
public boolean hasIteratedLocalSearchParameters()Iterated Local Search parameters.
.operations_research.IteratedLocalSearchParameters iterated_local_search_parameters = 60;- Specified by:
hasIteratedLocalSearchParametersin interfaceRoutingSearchParametersOrBuilder- Returns:
- Whether the iteratedLocalSearchParameters field is set.
-
getIteratedLocalSearchParameters
Iterated Local Search parameters.
.operations_research.IteratedLocalSearchParameters iterated_local_search_parameters = 60;- Specified by:
getIteratedLocalSearchParametersin interfaceRoutingSearchParametersOrBuilder- Returns:
- The iteratedLocalSearchParameters.
-
getIteratedLocalSearchParametersOrBuilder
Iterated Local Search parameters.
.operations_research.IteratedLocalSearchParameters iterated_local_search_parameters = 60;- Specified by:
getIteratedLocalSearchParametersOrBuilderin interfaceRoutingSearchParametersOrBuilder
-
isInitialized
public final boolean isInitialized()- Specified by:
isInitializedin interfacecom.google.protobuf.MessageLiteOrBuilder- Overrides:
isInitializedin classcom.google.protobuf.GeneratedMessage
-
writeTo
- Specified by:
writeToin interfacecom.google.protobuf.MessageLite- Overrides:
writeToin classcom.google.protobuf.GeneratedMessage- Throws:
IOException
-
getSerializedSize
public int getSerializedSize()- Specified by:
getSerializedSizein interfacecom.google.protobuf.MessageLite- Overrides:
getSerializedSizein classcom.google.protobuf.GeneratedMessage
-
equals
- Specified by:
equalsin interfacecom.google.protobuf.Message- Overrides:
equalsin classcom.google.protobuf.AbstractMessage
-
hashCode
public int hashCode()- Specified by:
hashCodein interfacecom.google.protobuf.Message- Overrides:
hashCodein classcom.google.protobuf.AbstractMessage
-
parseFrom
public static RoutingSearchParameters parseFrom(ByteBuffer data) throws com.google.protobuf.InvalidProtocolBufferException - Throws:
com.google.protobuf.InvalidProtocolBufferException
-
parseFrom
public static RoutingSearchParameters parseFrom(ByteBuffer data, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws com.google.protobuf.InvalidProtocolBufferException - Throws:
com.google.protobuf.InvalidProtocolBufferException
-
parseFrom
public static RoutingSearchParameters parseFrom(com.google.protobuf.ByteString data) throws com.google.protobuf.InvalidProtocolBufferException - Throws:
com.google.protobuf.InvalidProtocolBufferException
-
parseFrom
public static RoutingSearchParameters parseFrom(com.google.protobuf.ByteString data, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws com.google.protobuf.InvalidProtocolBufferException - Throws:
com.google.protobuf.InvalidProtocolBufferException
-
parseFrom
public static RoutingSearchParameters parseFrom(byte[] data) throws com.google.protobuf.InvalidProtocolBufferException - Throws:
com.google.protobuf.InvalidProtocolBufferException
-
parseFrom
public static RoutingSearchParameters parseFrom(byte[] data, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws com.google.protobuf.InvalidProtocolBufferException - Throws:
com.google.protobuf.InvalidProtocolBufferException
-
parseFrom
- Throws:
IOException
-
parseFrom
public static RoutingSearchParameters parseFrom(InputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws IOException - Throws:
IOException
-
parseDelimitedFrom
- Throws:
IOException
-
parseDelimitedFrom
public static RoutingSearchParameters parseDelimitedFrom(InputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws IOException - Throws:
IOException
-
parseFrom
public static RoutingSearchParameters parseFrom(com.google.protobuf.CodedInputStream input) throws IOException - Throws:
IOException
-
parseFrom
public static RoutingSearchParameters parseFrom(com.google.protobuf.CodedInputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws IOException - Throws:
IOException
-
newBuilderForType
- Specified by:
newBuilderForTypein interfacecom.google.protobuf.Message- Specified by:
newBuilderForTypein interfacecom.google.protobuf.MessageLite
-
newBuilder
-
newBuilder
-
toBuilder
- Specified by:
toBuilderin interfacecom.google.protobuf.Message- Specified by:
toBuilderin interfacecom.google.protobuf.MessageLite
-
newBuilderForType
protected RoutingSearchParameters.Builder newBuilderForType(com.google.protobuf.AbstractMessage.BuilderParent parent) - Overrides:
newBuilderForTypein classcom.google.protobuf.AbstractMessage
-
getDefaultInstance
-
parser
-
getParserForType
- Specified by:
getParserForTypein interfacecom.google.protobuf.Message- Specified by:
getParserForTypein interfacecom.google.protobuf.MessageLite- Overrides:
getParserForTypein classcom.google.protobuf.GeneratedMessage
-
getDefaultInstanceForType
- Specified by:
getDefaultInstanceForTypein interfacecom.google.protobuf.MessageLiteOrBuilder- Specified by:
getDefaultInstanceForTypein interfacecom.google.protobuf.MessageOrBuilder
-