Class RoutingSearchParameters.Builder
java.lang.Object
com.google.protobuf.AbstractMessageLite.Builder
com.google.protobuf.AbstractMessage.Builder<RoutingSearchParameters.Builder>
com.google.protobuf.GeneratedMessage.Builder<RoutingSearchParameters.Builder>
com.google.ortools.constraintsolver.RoutingSearchParameters.Builder
- All Implemented Interfaces:
RoutingSearchParametersOrBuilder, com.google.protobuf.Message.Builder, com.google.protobuf.MessageLite.Builder, com.google.protobuf.MessageLiteOrBuilder, com.google.protobuf.MessageOrBuilder, Cloneable
- Enclosing class:
RoutingSearchParameters
public static final class RoutingSearchParameters.Builder
extends com.google.protobuf.GeneratedMessage.Builder<RoutingSearchParameters.Builder>
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-
Method Summary
Modifier and TypeMethodDescriptionaddAllLocalSearchMetaheuristics(Iterable<? extends LocalSearchMetaheuristic.Value> values) Local search metaheuristics alternatively used to guide the search.Local search metaheuristics alternatively used to guide the search.Local search metaheuristics alternatively used to guide the search.addLocalSearchMetaheuristicsValue(int value) Local search metaheuristics alternatively used to guide the search.build()clear()If true use minimum matching instead of minimal matching in the Christofides algorithm..operations_research.RoutingSearchParameters.SchedulingSolver continuous_scheduling_solver = 33;Setting this to true completely disables the LP and MIP scheduling in the solver.If model.Size() is less than the threshold and that no solution has been found, attempt a pass with CP-SAT.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.First 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 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).These are advanced settings which should not be modified unless you know what you are doing.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.Whether to reset penalties when a new best solution is found.Number of closest nodes to consider for each node during the destruction phase of the FilteredHeuristicCloseNodesLNSOperator.Number 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.Iterated Local Search parameters.Limit 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 insertion heuristic.Local search metaheuristics used to guide the search.Local search metaheuristics alternatively used to guide the search..operations_research.RoutingSearchParameters.LocalSearchNeighborhoodOperators local_search_operators = 3;double log_cost_offset = 29;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)--- 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.int32 ls_operator_min_neighbors = 54;Neighbors ratio and minimum number of neighbors considered in local search operators (see GlobalCheapestInsertionParameters.neighbors_ratio and GlobalCheapestInsertionParameters.min_neighbors for more information).Maximum size of the chain to make inactive in SwapActiveChainOperator..operations_research.RoutingSearchParameters.SchedulingSolver mixed_integer_scheduling_solver = 34;Positive parameter defining the exploration coefficient of the multi-armed bandit compound operator.Memory coefficient related to the multi-armed bandit compound operator.Number of solutions to collect during the search.int32 num_max_local_optima_before_metaheuristic_switch = 64;Minimum step by which the solution must be improved in local search. 0 means "unspecified".Number of expensive arcs to consider cutting in the RelocateExpensiveChain neighborhood operator (see LocalSearchNeighborhoodOperators.use_relocate_expensive_chain()).If 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.Parameters for the Savings heuristic.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.-- Search limits -- Limit to the number of solutions generated during the search. 0 means "unspecified".Limit to the time spent in the search.If true, use the CP solver to find a solution.If true, use the CP-SAT solver to find a solution.--- Search control --- If true, the solver should use depth-first search rather than local search to solve the problem.--- 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.Whether to consider arc penalties in cost functions used in local search operators using arc costs.Whether the solver should use an Iterated Local Search approach to solve the problem.If true, the solver will use multi-armed bandit concatenate operators.--- Advanced first solutions strategy settings --- Don't touch these unless you know what you are doing.booleanIf 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 final com.google.protobuf.Descriptors.Descriptorcom.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 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).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.The improvement search limit is added to the solver if the following parameters are set.Iterated Local Search parameters.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.Duration.BuilderLimit 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 cost insertion heuristic.Parameters for the local cheapest 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;.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".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.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.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.long-- 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.Duration.BuilderLimit 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).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 booleanmergeFrom(RoutingSearchParameters other) mergeFrom(com.google.protobuf.CodedInputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry) mergeFrom(com.google.protobuf.Message other) 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).The improvement search limit is added to the solver if the following parameters are set.Iterated Local Search parameters.mergeLnsTimeLimit(com.google.protobuf.Duration value) Limit 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 insertion heuristic..operations_research.RoutingSearchParameters.LocalSearchNeighborhoodOperators local_search_operators = 3;mergeSatParameters(SatParameters value) 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.mergeTimeLimit(com.google.protobuf.Duration value) Limit to the time spent in the search.setChristofidesUseMinimumMatching(boolean value) If true use minimum matching instead of minimal matching in the Christofides algorithm..operations_research.RoutingSearchParameters.SchedulingSolver continuous_scheduling_solver = 33;setContinuousSchedulingSolverValue(int value) .operations_research.RoutingSearchParameters.SchedulingSolver continuous_scheduling_solver = 33;setDisableSchedulingBewareThisMayDegradePerformance(boolean value) Setting this to true completely disables the LP and MIP scheduling in the solver.setFallbackToCpSatSizeThreshold(int value) If model.Size() is less than the threshold and that no solution has been found, attempt a pass with CP-SAT.setFirstSolutionOptimizationPeriod(int value) 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.First solution strategies, used as starting point of local search.setFirstSolutionStrategyValue(int value) First solution strategies, used as starting point of local search.Parameters for the global cheapest insertion heuristic when used as first solution heuristic.setGlobalCheapestInsertionFirstSolutionParameters(GlobalCheapestInsertionParameters.Builder builderForValue) 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).setGlobalCheapestInsertionLsOperatorParameters(GlobalCheapestInsertionParameters.Builder builderForValue) 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).setGuidedLocalSearchLambdaCoefficient(double value) These are advanced settings which should not be modified unless you know what you are doing.setGuidedLocalSearchPenalizeWithVehicleClasses(boolean value) 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.setGuidedLocalSearchResetPenaltiesOnNewBestSolution(boolean value) Whether to reset penalties when a new best solution is found.setHeuristicCloseNodesLnsNumNodes(int value) Number of closest nodes to consider for each node during the destruction phase of the FilteredHeuristicCloseNodesLNSOperator.Number 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.setImprovementLimitParameters(RoutingSearchParameters.ImprovementSearchLimitParameters.Builder builderForValue) The improvement search limit is added to the solver if the following parameters are set.Iterated Local Search parameters.setIteratedLocalSearchParameters(IteratedLocalSearchParameters.Builder builderForValue) Iterated Local Search parameters.setLnsTimeLimit(com.google.protobuf.Duration value) Limit to the time spent in the completion search for each local search neighbor.setLnsTimeLimit(com.google.protobuf.Duration.Builder builderForValue) Limit 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.setLocalSearchMetaheuristics(int index, LocalSearchMetaheuristic.Value value) Local search metaheuristics alternatively used to guide the search.setLocalSearchMetaheuristicsValue(int index, int value) Local search metaheuristics alternatively used to guide the search.setLocalSearchMetaheuristicValue(int value) Local search metaheuristics used to guide the search..operations_research.RoutingSearchParameters.LocalSearchNeighborhoodOperators local_search_operators = 3;setLocalSearchOperators(RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder builderForValue) .operations_research.RoutingSearchParameters.LocalSearchNeighborhoodOperators local_search_operators = 3;setLogCostOffset(double value) double log_cost_offset = 29;setLogCostScalingFactor(double value) 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)setLogSearch(boolean value) --- 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.setLogTagBytes(com.google.protobuf.ByteString value) In logs, this tag will be appended to each line corresponding to a new solution.setLsOperatorMinNeighbors(int value) int32 ls_operator_min_neighbors = 54;setLsOperatorNeighborsRatio(double value) Neighbors ratio and minimum number of neighbors considered in local search operators (see GlobalCheapestInsertionParameters.neighbors_ratio and GlobalCheapestInsertionParameters.min_neighbors for more information).setMaxSwapActiveChainSize(int value) Maximum size of the chain to make inactive in SwapActiveChainOperator..operations_research.RoutingSearchParameters.SchedulingSolver mixed_integer_scheduling_solver = 34;setMixedIntegerSchedulingSolverValue(int value) .operations_research.RoutingSearchParameters.SchedulingSolver mixed_integer_scheduling_solver = 34;Positive parameter defining the exploration coefficient of the multi-armed bandit compound operator.setMultiArmedBanditCompoundOperatorMemoryCoefficient(double value) Memory coefficient related to the multi-armed bandit compound operator.setNumberOfSolutionsToCollect(int value) Number of solutions to collect during the search.int32 num_max_local_optima_before_metaheuristic_switch = 64;setOptimizationStep(double value) Minimum step by which the solution must be improved in local search. 0 means "unspecified".setRelocateExpensiveChainNumArcsToConsider(int value) Number of expensive arcs to consider cutting in the RelocateExpensiveChain neighborhood operator (see LocalSearchNeighborhoodOperators.use_relocate_expensive_chain()).setReportIntermediateCpSatSolutions(boolean value) If use_cp_sat or use_generalized_cp_sat is true, will report intermediate solutions found by CP-SAT to solution listeners.setSatParameters(SatParameters value) If use_cp_sat or use_generalized_cp_sat is true, contains the SAT algorithm parameters which will be used.setSatParameters(SatParameters.Builder builderForValue) 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.setSavingsParameters(SavingsParameters.Builder builderForValue) Parameters for the Savings heuristic.setSecondaryLsTimeLimitRatio(double value) 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.setSolutionLimit(long value) -- Search limits -- Limit to the number of solutions generated during the search. 0 means "unspecified".setTimeLimit(com.google.protobuf.Duration value) Limit to the time spent in the search.setTimeLimit(com.google.protobuf.Duration.Builder builderForValue) Limit to the time spent in the search.setUseCp(OptionalBoolean value) If true, use the CP solver to find a solution.setUseCpSat(OptionalBoolean value) If true, use the CP-SAT solver to find a solution.setUseCpSatValue(int value) If true, use the CP-SAT solver to find a solution.setUseCpValue(int value) If true, use the CP solver to find a solution.setUseDepthFirstSearch(boolean value) --- Search control --- If true, the solver should use depth-first search rather than local search to solve the problem.setUseFullPropagation(boolean value) --- 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.setUseGeneralizedCpSatValue(int value) If true, use the CP-SAT solver to find a solution on generalized routing model.setUseGuidedLocalSearchPenaltiesInLocalSearchOperators(boolean value) Whether to consider arc penalties in cost functions used in local search operators using arc costs.setUseIteratedLocalSearch(boolean value) Whether the solver should use an Iterated Local Search approach to solve the problem.setUseMultiArmedBanditConcatenateOperators(boolean value) If true, the solver will use multi-armed bandit concatenate operators.setUseUnfilteredFirstSolutionStrategy(boolean value) --- Advanced first solutions strategy settings --- Don't touch these unless you know what you are doing.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<RoutingSearchParameters.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<RoutingSearchParameters.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<RoutingSearchParameters.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<RoutingSearchParameters.Builder>
-
mergeFrom
-
isInitialized
public final boolean isInitialized()- Specified by:
isInitializedin interfacecom.google.protobuf.MessageLiteOrBuilder- Overrides:
isInitializedin classcom.google.protobuf.GeneratedMessage.Builder<RoutingSearchParameters.Builder>
-
mergeFrom
public RoutingSearchParameters.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<RoutingSearchParameters.Builder>- Throws:
IOException
-
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.
-
setFirstSolutionStrategyValue
First solution strategies, used as starting point of local search.
.operations_research.FirstSolutionStrategy.Value first_solution_strategy = 1;- Parameters:
value- The enum numeric value on the wire for firstSolutionStrategy to set.- Returns:
- This builder for chaining.
-
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.
-
setFirstSolutionStrategy
First solution strategies, used as starting point of local search.
.operations_research.FirstSolutionStrategy.Value first_solution_strategy = 1;- Parameters:
value- The firstSolutionStrategy to set.- Returns:
- This builder for chaining.
-
clearFirstSolutionStrategy
First solution strategies, used as starting point of local search.
.operations_research.FirstSolutionStrategy.Value first_solution_strategy = 1;- Returns:
- This builder for chaining.
-
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.
-
setUseUnfilteredFirstSolutionStrategy
--- 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;- Parameters:
value- The useUnfilteredFirstSolutionStrategy to set.- Returns:
- This builder for chaining.
-
clearUseUnfilteredFirstSolutionStrategy
--- 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;- Returns:
- This builder for chaining.
-
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.
-
setSavingsParameters
Parameters for the Savings heuristic.
.operations_research.SavingsParameters savings_parameters = 70; -
setSavingsParameters
public RoutingSearchParameters.Builder setSavingsParameters(SavingsParameters.Builder builderForValue) Parameters for the Savings heuristic.
.operations_research.SavingsParameters savings_parameters = 70; -
mergeSavingsParameters
Parameters for the Savings heuristic.
.operations_research.SavingsParameters savings_parameters = 70; -
clearSavingsParameters
Parameters for the Savings heuristic.
.operations_research.SavingsParameters savings_parameters = 70; -
getSavingsParametersBuilder
Parameters for the Savings heuristic.
.operations_research.SavingsParameters savings_parameters = 70; -
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.
-
setGlobalCheapestInsertionFirstSolutionParameters
public RoutingSearchParameters.Builder setGlobalCheapestInsertionFirstSolutionParameters(GlobalCheapestInsertionParameters value) Parameters for the global cheapest insertion heuristic when used as first solution heuristic.
.operations_research.GlobalCheapestInsertionParameters global_cheapest_insertion_first_solution_parameters = 71; -
setGlobalCheapestInsertionFirstSolutionParameters
public RoutingSearchParameters.Builder setGlobalCheapestInsertionFirstSolutionParameters(GlobalCheapestInsertionParameters.Builder builderForValue) Parameters for the global cheapest insertion heuristic when used as first solution heuristic.
.operations_research.GlobalCheapestInsertionParameters global_cheapest_insertion_first_solution_parameters = 71; -
mergeGlobalCheapestInsertionFirstSolutionParameters
public RoutingSearchParameters.Builder mergeGlobalCheapestInsertionFirstSolutionParameters(GlobalCheapestInsertionParameters value) Parameters for the global cheapest insertion heuristic when used as first solution heuristic.
.operations_research.GlobalCheapestInsertionParameters global_cheapest_insertion_first_solution_parameters = 71; -
clearGlobalCheapestInsertionFirstSolutionParameters
Parameters for the global cheapest insertion heuristic when used as first solution heuristic.
.operations_research.GlobalCheapestInsertionParameters global_cheapest_insertion_first_solution_parameters = 71; -
getGlobalCheapestInsertionFirstSolutionParametersBuilder
public GlobalCheapestInsertionParameters.Builder getGlobalCheapestInsertionFirstSolutionParametersBuilder()Parameters for the global cheapest insertion heuristic when used as first solution heuristic.
.operations_research.GlobalCheapestInsertionParameters global_cheapest_insertion_first_solution_parameters = 71; -
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.
-
setGlobalCheapestInsertionLsOperatorParameters
public RoutingSearchParameters.Builder setGlobalCheapestInsertionLsOperatorParameters(GlobalCheapestInsertionParameters value) 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; -
setGlobalCheapestInsertionLsOperatorParameters
public RoutingSearchParameters.Builder setGlobalCheapestInsertionLsOperatorParameters(GlobalCheapestInsertionParameters.Builder builderForValue) 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; -
mergeGlobalCheapestInsertionLsOperatorParameters
public RoutingSearchParameters.Builder mergeGlobalCheapestInsertionLsOperatorParameters(GlobalCheapestInsertionParameters value) 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; -
clearGlobalCheapestInsertionLsOperatorParameters
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; -
getGlobalCheapestInsertionLsOperatorParametersBuilder
public GlobalCheapestInsertionParameters.Builder getGlobalCheapestInsertionLsOperatorParametersBuilder()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; -
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.
-
setLocalCheapestInsertionParameters
public RoutingSearchParameters.Builder setLocalCheapestInsertionParameters(LocalCheapestInsertionParameters value) Parameters for the local cheapest insertion heuristic.
.operations_research.LocalCheapestInsertionParameters local_cheapest_insertion_parameters = 68; -
setLocalCheapestInsertionParameters
public RoutingSearchParameters.Builder setLocalCheapestInsertionParameters(LocalCheapestInsertionParameters.Builder builderForValue) Parameters for the local cheapest insertion heuristic.
.operations_research.LocalCheapestInsertionParameters local_cheapest_insertion_parameters = 68; -
mergeLocalCheapestInsertionParameters
public RoutingSearchParameters.Builder mergeLocalCheapestInsertionParameters(LocalCheapestInsertionParameters value) Parameters for the local cheapest insertion heuristic.
.operations_research.LocalCheapestInsertionParameters local_cheapest_insertion_parameters = 68; -
clearLocalCheapestInsertionParameters
Parameters for the local cheapest insertion heuristic.
.operations_research.LocalCheapestInsertionParameters local_cheapest_insertion_parameters = 68; -
getLocalCheapestInsertionParametersBuilder
Parameters for the local cheapest insertion heuristic.
.operations_research.LocalCheapestInsertionParameters local_cheapest_insertion_parameters = 68; -
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.
-
setLocalCheapestCostInsertionParameters
public RoutingSearchParameters.Builder setLocalCheapestCostInsertionParameters(LocalCheapestInsertionParameters value) Parameters for the local cheapest cost insertion heuristic.
.operations_research.LocalCheapestInsertionParameters local_cheapest_cost_insertion_parameters = 69; -
setLocalCheapestCostInsertionParameters
public RoutingSearchParameters.Builder setLocalCheapestCostInsertionParameters(LocalCheapestInsertionParameters.Builder builderForValue) Parameters for the local cheapest cost insertion heuristic.
.operations_research.LocalCheapestInsertionParameters local_cheapest_cost_insertion_parameters = 69; -
mergeLocalCheapestCostInsertionParameters
public RoutingSearchParameters.Builder mergeLocalCheapestCostInsertionParameters(LocalCheapestInsertionParameters value) Parameters for the local cheapest cost insertion heuristic.
.operations_research.LocalCheapestInsertionParameters local_cheapest_cost_insertion_parameters = 69; -
clearLocalCheapestCostInsertionParameters
Parameters for the local cheapest cost insertion heuristic.
.operations_research.LocalCheapestInsertionParameters local_cheapest_cost_insertion_parameters = 69; -
getLocalCheapestCostInsertionParametersBuilder
Parameters for the local cheapest cost insertion heuristic.
.operations_research.LocalCheapestInsertionParameters local_cheapest_cost_insertion_parameters = 69; -
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.
-
setChristofidesUseMinimumMatching
If true use minimum matching instead of minimal matching in the Christofides algorithm.
bool christofides_use_minimum_matching = 30;- Parameters:
value- The christofidesUseMinimumMatching to set.- Returns:
- This builder for chaining.
-
clearChristofidesUseMinimumMatching
If true use minimum matching instead of minimal matching in the Christofides algorithm.
bool christofides_use_minimum_matching = 30;- Returns:
- This builder for chaining.
-
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.
-
setFirstSolutionOptimizationPeriod
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;- Parameters:
value- The firstSolutionOptimizationPeriod to set.- Returns:
- This builder for chaining.
-
clearFirstSolutionOptimizationPeriod
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;- Returns:
- This builder for chaining.
-
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.
-
setLocalSearchOperators
public RoutingSearchParameters.Builder setLocalSearchOperators(RoutingSearchParameters.LocalSearchNeighborhoodOperators value) .operations_research.RoutingSearchParameters.LocalSearchNeighborhoodOperators local_search_operators = 3; -
setLocalSearchOperators
public RoutingSearchParameters.Builder setLocalSearchOperators(RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder builderForValue) .operations_research.RoutingSearchParameters.LocalSearchNeighborhoodOperators local_search_operators = 3; -
mergeLocalSearchOperators
public RoutingSearchParameters.Builder mergeLocalSearchOperators(RoutingSearchParameters.LocalSearchNeighborhoodOperators value) .operations_research.RoutingSearchParameters.LocalSearchNeighborhoodOperators local_search_operators = 3; -
clearLocalSearchOperators
.operations_research.RoutingSearchParameters.LocalSearchNeighborhoodOperators local_search_operators = 3; -
getLocalSearchOperatorsBuilder
public RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder getLocalSearchOperatorsBuilder().operations_research.RoutingSearchParameters.LocalSearchNeighborhoodOperators local_search_operators = 3; -
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.
-
setLsOperatorNeighborsRatio
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;- Parameters:
value- The lsOperatorNeighborsRatio to set.- Returns:
- This builder for chaining.
-
clearLsOperatorNeighborsRatio
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;- Returns:
- This builder for chaining.
-
getLsOperatorMinNeighbors
public int getLsOperatorMinNeighbors()int32 ls_operator_min_neighbors = 54;- Specified by:
getLsOperatorMinNeighborsin interfaceRoutingSearchParametersOrBuilder- Returns:
- The lsOperatorMinNeighbors.
-
setLsOperatorMinNeighbors
int32 ls_operator_min_neighbors = 54;- Parameters:
value- The lsOperatorMinNeighbors to set.- Returns:
- This builder for chaining.
-
clearLsOperatorMinNeighbors
int32 ls_operator_min_neighbors = 54;- Returns:
- This builder for chaining.
-
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.
-
setUseMultiArmedBanditConcatenateOperators
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;- Parameters:
value- The useMultiArmedBanditConcatenateOperators to set.- Returns:
- This builder for chaining.
-
clearUseMultiArmedBanditConcatenateOperators
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;- Returns:
- This builder for chaining.
-
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.
-
setMultiArmedBanditCompoundOperatorMemoryCoefficient
public RoutingSearchParameters.Builder setMultiArmedBanditCompoundOperatorMemoryCoefficient(double value) 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;- Parameters:
value- The multiArmedBanditCompoundOperatorMemoryCoefficient to set.- Returns:
- This builder for chaining.
-
clearMultiArmedBanditCompoundOperatorMemoryCoefficient
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;- Returns:
- This builder for chaining.
-
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.
-
setMultiArmedBanditCompoundOperatorExplorationCoefficient
public RoutingSearchParameters.Builder setMultiArmedBanditCompoundOperatorExplorationCoefficient(double value) 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;- Parameters:
value- The multiArmedBanditCompoundOperatorExplorationCoefficient to set.- Returns:
- This builder for chaining.
-
clearMultiArmedBanditCompoundOperatorExplorationCoefficient
public RoutingSearchParameters.Builder clearMultiArmedBanditCompoundOperatorExplorationCoefficient()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;- Returns:
- This builder for chaining.
-
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.
-
setMaxSwapActiveChainSize
Maximum size of the chain to make inactive in SwapActiveChainOperator.
int32 max_swap_active_chain_size = 66;- Parameters:
value- The maxSwapActiveChainSize to set.- Returns:
- This builder for chaining.
-
clearMaxSwapActiveChainSize
Maximum size of the chain to make inactive in SwapActiveChainOperator.
int32 max_swap_active_chain_size = 66;- Returns:
- This builder for chaining.
-
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.
-
setRelocateExpensiveChainNumArcsToConsider
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;- Parameters:
value- The relocateExpensiveChainNumArcsToConsider to set.- Returns:
- This builder for chaining.
-
clearRelocateExpensiveChainNumArcsToConsider
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;- Returns:
- This builder for chaining.
-
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.
-
setHeuristicExpensiveChainLnsNumArcsToConsider
Number of expensive arcs to consider cutting in the FilteredHeuristicExpensiveChainLNSOperator operator.
int32 heuristic_expensive_chain_lns_num_arcs_to_consider = 32;- Parameters:
value- The heuristicExpensiveChainLnsNumArcsToConsider to set.- Returns:
- This builder for chaining.
-
clearHeuristicExpensiveChainLnsNumArcsToConsider
Number of expensive arcs to consider cutting in the FilteredHeuristicExpensiveChainLNSOperator operator.
int32 heuristic_expensive_chain_lns_num_arcs_to_consider = 32;- Returns:
- This builder for chaining.
-
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.
-
setHeuristicCloseNodesLnsNumNodes
Number of closest nodes to consider for each node during the destruction phase of the FilteredHeuristicCloseNodesLNSOperator.
int32 heuristic_close_nodes_lns_num_nodes = 35;- Parameters:
value- The heuristicCloseNodesLnsNumNodes to set.- Returns:
- This builder for chaining.
-
clearHeuristicCloseNodesLnsNumNodes
Number of closest nodes to consider for each node during the destruction phase of the FilteredHeuristicCloseNodesLNSOperator.
int32 heuristic_close_nodes_lns_num_nodes = 35;- Returns:
- This builder for chaining.
-
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.
-
setLocalSearchMetaheuristicValue
Local search metaheuristics used to guide the search.
.operations_research.LocalSearchMetaheuristic.Value local_search_metaheuristic = 4;- Parameters:
value- The enum numeric value on the wire for localSearchMetaheuristic to set.- Returns:
- This builder for chaining.
-
getLocalSearchMetaheuristic
Local search metaheuristics used to guide the search.
.operations_research.LocalSearchMetaheuristic.Value local_search_metaheuristic = 4;- Specified by:
getLocalSearchMetaheuristicin interfaceRoutingSearchParametersOrBuilder- Returns:
- The localSearchMetaheuristic.
-
setLocalSearchMetaheuristic
public RoutingSearchParameters.Builder setLocalSearchMetaheuristic(LocalSearchMetaheuristic.Value value) Local search metaheuristics used to guide the search.
.operations_research.LocalSearchMetaheuristic.Value local_search_metaheuristic = 4;- Parameters:
value- The localSearchMetaheuristic to set.- Returns:
- This builder for chaining.
-
clearLocalSearchMetaheuristic
Local search metaheuristics used to guide the search.
.operations_research.LocalSearchMetaheuristic.Value local_search_metaheuristic = 4;- Returns:
- This builder for chaining.
-
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.
-
setLocalSearchMetaheuristics
public RoutingSearchParameters.Builder setLocalSearchMetaheuristics(int index, LocalSearchMetaheuristic.Value value) 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;- Parameters:
index- The index to set the value at.value- The localSearchMetaheuristics to set.- Returns:
- This builder for chaining.
-
addLocalSearchMetaheuristics
public RoutingSearchParameters.Builder addLocalSearchMetaheuristics(LocalSearchMetaheuristic.Value value) 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;- Parameters:
value- The localSearchMetaheuristics to add.- Returns:
- This builder for chaining.
-
addAllLocalSearchMetaheuristics
public RoutingSearchParameters.Builder addAllLocalSearchMetaheuristics(Iterable<? extends LocalSearchMetaheuristic.Value> values) 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;- Parameters:
values- The localSearchMetaheuristics to add.- Returns:
- This builder for chaining.
-
clearLocalSearchMetaheuristics
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;- Returns:
- This builder for chaining.
-
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.
-
setLocalSearchMetaheuristicsValue
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;- Parameters:
index- The index to set the value at.value- The enum numeric value on the wire for localSearchMetaheuristics to set.- Returns:
- This builder for chaining.
-
addLocalSearchMetaheuristicsValue
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;- Parameters:
value- The enum numeric value on the wire for localSearchMetaheuristics to add.- Returns:
- This builder for chaining.
-
addAllLocalSearchMetaheuristicsValue
public RoutingSearchParameters.Builder addAllLocalSearchMetaheuristicsValue(Iterable<Integer> values) 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;- Parameters:
values- The enum numeric values on the wire for localSearchMetaheuristics to add.- Returns:
- This builder for chaining.
-
getNumMaxLocalOptimaBeforeMetaheuristicSwitch
public int getNumMaxLocalOptimaBeforeMetaheuristicSwitch()int32 num_max_local_optima_before_metaheuristic_switch = 64;- Specified by:
getNumMaxLocalOptimaBeforeMetaheuristicSwitchin interfaceRoutingSearchParametersOrBuilder- Returns:
- The numMaxLocalOptimaBeforeMetaheuristicSwitch.
-
setNumMaxLocalOptimaBeforeMetaheuristicSwitch
int32 num_max_local_optima_before_metaheuristic_switch = 64;- Parameters:
value- The numMaxLocalOptimaBeforeMetaheuristicSwitch to set.- Returns:
- This builder for chaining.
-
clearNumMaxLocalOptimaBeforeMetaheuristicSwitch
int32 num_max_local_optima_before_metaheuristic_switch = 64;- Returns:
- This builder for chaining.
-
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.
-
setGuidedLocalSearchLambdaCoefficient
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;- Parameters:
value- The guidedLocalSearchLambdaCoefficient to set.- Returns:
- This builder for chaining.
-
clearGuidedLocalSearchLambdaCoefficient
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;- Returns:
- This builder for chaining.
-
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.
-
setGuidedLocalSearchResetPenaltiesOnNewBestSolution
public RoutingSearchParameters.Builder setGuidedLocalSearchResetPenaltiesOnNewBestSolution(boolean value) 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;- Parameters:
value- The guidedLocalSearchResetPenaltiesOnNewBestSolution to set.- Returns:
- This builder for chaining.
-
clearGuidedLocalSearchResetPenaltiesOnNewBestSolution
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;- Returns:
- This builder for chaining.
-
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.
-
setGuidedLocalSearchPenalizeWithVehicleClasses
public RoutingSearchParameters.Builder setGuidedLocalSearchPenalizeWithVehicleClasses(boolean value) 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;- Parameters:
value- The guidedLocalSearchPenalizeWithVehicleClasses to set.- Returns:
- This builder for chaining.
-
clearGuidedLocalSearchPenalizeWithVehicleClasses
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;- Returns:
- This builder for chaining.
-
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.
-
setUseGuidedLocalSearchPenaltiesInLocalSearchOperators
public RoutingSearchParameters.Builder setUseGuidedLocalSearchPenaltiesInLocalSearchOperators(boolean value) 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;- Parameters:
value- The useGuidedLocalSearchPenaltiesInLocalSearchOperators to set.- Returns:
- This builder for chaining.
-
clearUseGuidedLocalSearchPenaltiesInLocalSearchOperators
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;- Returns:
- This builder for chaining.
-
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.
-
setUseDepthFirstSearch
--- 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;- Parameters:
value- The useDepthFirstSearch to set.- Returns:
- This builder for chaining.
-
clearUseDepthFirstSearch
--- 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;- Returns:
- This builder for chaining.
-
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.
-
setUseCpValue
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;- Parameters:
value- The enum numeric value on the wire for useCp to set.- Returns:
- This builder for chaining.
-
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.
-
setUseCp
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;- Parameters:
value- The useCp to set.- Returns:
- This builder for chaining.
-
clearUseCp
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;- Returns:
- This builder for chaining.
-
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.
-
setUseCpSatValue
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;- Parameters:
value- The enum numeric value on the wire for useCpSat to set.- Returns:
- This builder for chaining.
-
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.
-
setUseCpSat
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;- Parameters:
value- The useCpSat to set.- Returns:
- This builder for chaining.
-
clearUseCpSat
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;- Returns:
- This builder for chaining.
-
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.
-
setUseGeneralizedCpSatValue
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;- Parameters:
value- The enum numeric value on the wire for useGeneralizedCpSat to set.- Returns:
- This builder for chaining.
-
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.
-
setUseGeneralizedCpSat
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;- Parameters:
value- The useGeneralizedCpSat to set.- Returns:
- This builder for chaining.
-
clearUseGeneralizedCpSat
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;- Returns:
- This builder for chaining.
-
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.
-
setSatParameters
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; -
setSatParameters
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; -
mergeSatParameters
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; -
clearSatParameters
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; -
getSatParametersBuilder
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; -
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.
-
setReportIntermediateCpSatSolutions
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;- Parameters:
value- The reportIntermediateCpSatSolutions to set.- Returns:
- This builder for chaining.
-
clearReportIntermediateCpSatSolutions
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;- Returns:
- This builder for chaining.
-
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.
-
setFallbackToCpSatSizeThreshold
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;- Parameters:
value- The fallbackToCpSatSizeThreshold to set.- Returns:
- This builder for chaining.
-
clearFallbackToCpSatSizeThreshold
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;- Returns:
- This builder for chaining.
-
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.
-
setContinuousSchedulingSolverValue
.operations_research.RoutingSearchParameters.SchedulingSolver continuous_scheduling_solver = 33;- Parameters:
value- The enum numeric value on the wire for continuousSchedulingSolver to set.- Returns:
- This builder for chaining.
-
getContinuousSchedulingSolver
.operations_research.RoutingSearchParameters.SchedulingSolver continuous_scheduling_solver = 33;- Specified by:
getContinuousSchedulingSolverin interfaceRoutingSearchParametersOrBuilder- Returns:
- The continuousSchedulingSolver.
-
setContinuousSchedulingSolver
public RoutingSearchParameters.Builder setContinuousSchedulingSolver(RoutingSearchParameters.SchedulingSolver value) .operations_research.RoutingSearchParameters.SchedulingSolver continuous_scheduling_solver = 33;- Parameters:
value- The continuousSchedulingSolver to set.- Returns:
- This builder for chaining.
-
clearContinuousSchedulingSolver
.operations_research.RoutingSearchParameters.SchedulingSolver continuous_scheduling_solver = 33;- Returns:
- This builder for chaining.
-
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.
-
setMixedIntegerSchedulingSolverValue
.operations_research.RoutingSearchParameters.SchedulingSolver mixed_integer_scheduling_solver = 34;- Parameters:
value- The enum numeric value on the wire for mixedIntegerSchedulingSolver to set.- Returns:
- This builder for chaining.
-
getMixedIntegerSchedulingSolver
.operations_research.RoutingSearchParameters.SchedulingSolver mixed_integer_scheduling_solver = 34;- Specified by:
getMixedIntegerSchedulingSolverin interfaceRoutingSearchParametersOrBuilder- Returns:
- The mixedIntegerSchedulingSolver.
-
setMixedIntegerSchedulingSolver
public RoutingSearchParameters.Builder setMixedIntegerSchedulingSolver(RoutingSearchParameters.SchedulingSolver value) .operations_research.RoutingSearchParameters.SchedulingSolver mixed_integer_scheduling_solver = 34;- Parameters:
value- The mixedIntegerSchedulingSolver to set.- Returns:
- This builder for chaining.
-
clearMixedIntegerSchedulingSolver
.operations_research.RoutingSearchParameters.SchedulingSolver mixed_integer_scheduling_solver = 34;- Returns:
- This builder for chaining.
-
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.
-
setDisableSchedulingBewareThisMayDegradePerformance
public RoutingSearchParameters.Builder setDisableSchedulingBewareThisMayDegradePerformance(boolean value) 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;- Parameters:
value- The disableSchedulingBewareThisMayDegradePerformance to set.- Returns:
- This builder for chaining.
-
clearDisableSchedulingBewareThisMayDegradePerformance
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;- Returns:
- This builder for chaining.
-
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.
-
setOptimizationStep
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;- Parameters:
value- The optimizationStep to set.- Returns:
- This builder for chaining.
-
clearOptimizationStep
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;- Returns:
- This builder for chaining.
-
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.
-
setNumberOfSolutionsToCollect
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;- Parameters:
value- The numberOfSolutionsToCollect to set.- Returns:
- This builder for chaining.
-
clearNumberOfSolutionsToCollect
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;- Returns:
- This builder for chaining.
-
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.
-
setSolutionLimit
-- Search limits -- Limit to the number of solutions generated during the search. 0 means "unspecified".
int64 solution_limit = 8;- Parameters:
value- The solutionLimit to set.- Returns:
- This builder for chaining.
-
clearSolutionLimit
-- Search limits -- Limit to the number of solutions generated during the search. 0 means "unspecified".
int64 solution_limit = 8;- Returns:
- This builder for chaining.
-
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.
-
setTimeLimit
Limit to the time spent in the search.
.google.protobuf.Duration time_limit = 9; -
setTimeLimit
public RoutingSearchParameters.Builder setTimeLimit(com.google.protobuf.Duration.Builder builderForValue) Limit to the time spent in the search.
.google.protobuf.Duration time_limit = 9; -
mergeTimeLimit
Limit to the time spent in the search.
.google.protobuf.Duration time_limit = 9; -
clearTimeLimit
Limit to the time spent in the search.
.google.protobuf.Duration time_limit = 9; -
getTimeLimitBuilder
public com.google.protobuf.Duration.Builder getTimeLimitBuilder()Limit to the time spent in the search.
.google.protobuf.Duration time_limit = 9; -
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.
-
setLnsTimeLimit
Limit to the time spent in the completion search for each local search neighbor.
.google.protobuf.Duration lns_time_limit = 10; -
setLnsTimeLimit
public RoutingSearchParameters.Builder setLnsTimeLimit(com.google.protobuf.Duration.Builder builderForValue) Limit to the time spent in the completion search for each local search neighbor.
.google.protobuf.Duration lns_time_limit = 10; -
mergeLnsTimeLimit
Limit to the time spent in the completion search for each local search neighbor.
.google.protobuf.Duration lns_time_limit = 10; -
clearLnsTimeLimit
Limit to the time spent in the completion search for each local search neighbor.
.google.protobuf.Duration lns_time_limit = 10; -
getLnsTimeLimitBuilder
public com.google.protobuf.Duration.Builder getLnsTimeLimitBuilder()Limit to the time spent in the completion search for each local search neighbor.
.google.protobuf.Duration lns_time_limit = 10; -
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.
-
setSecondaryLsTimeLimitRatio
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;- Parameters:
value- The secondaryLsTimeLimitRatio to set.- Returns:
- This builder for chaining.
-
clearSecondaryLsTimeLimitRatio
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;- Returns:
- This builder for chaining.
-
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.
-
setImprovementLimitParameters
public RoutingSearchParameters.Builder setImprovementLimitParameters(RoutingSearchParameters.ImprovementSearchLimitParameters value) The improvement search limit is added to the solver if the following parameters are set.
.operations_research.RoutingSearchParameters.ImprovementSearchLimitParameters improvement_limit_parameters = 37; -
setImprovementLimitParameters
public RoutingSearchParameters.Builder setImprovementLimitParameters(RoutingSearchParameters.ImprovementSearchLimitParameters.Builder builderForValue) The improvement search limit is added to the solver if the following parameters are set.
.operations_research.RoutingSearchParameters.ImprovementSearchLimitParameters improvement_limit_parameters = 37; -
mergeImprovementLimitParameters
public RoutingSearchParameters.Builder mergeImprovementLimitParameters(RoutingSearchParameters.ImprovementSearchLimitParameters value) The improvement search limit is added to the solver if the following parameters are set.
.operations_research.RoutingSearchParameters.ImprovementSearchLimitParameters improvement_limit_parameters = 37; -
clearImprovementLimitParameters
The improvement search limit is added to the solver if the following parameters are set.
.operations_research.RoutingSearchParameters.ImprovementSearchLimitParameters improvement_limit_parameters = 37; -
getImprovementLimitParametersBuilder
public RoutingSearchParameters.ImprovementSearchLimitParameters.Builder getImprovementLimitParametersBuilder()The improvement search limit is added to the solver if the following parameters are set.
.operations_research.RoutingSearchParameters.ImprovementSearchLimitParameters improvement_limit_parameters = 37; -
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.
-
setUseFullPropagation
--- 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;- Parameters:
value- The useFullPropagation to set.- Returns:
- This builder for chaining.
-
clearUseFullPropagation
--- 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;- Returns:
- This builder for chaining.
-
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.
-
setLogSearch
--- 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;- Parameters:
value- The logSearch to set.- Returns:
- This builder for chaining.
-
clearLogSearch
--- 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;- Returns:
- This builder for chaining.
-
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.
-
setLogCostScalingFactor
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;- Parameters:
value- The logCostScalingFactor to set.- Returns:
- This builder for chaining.
-
clearLogCostScalingFactor
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;- Returns:
- This builder for chaining.
-
getLogCostOffset
public double getLogCostOffset()double log_cost_offset = 29;- Specified by:
getLogCostOffsetin interfaceRoutingSearchParametersOrBuilder- Returns:
- The logCostOffset.
-
setLogCostOffset
double log_cost_offset = 29;- Parameters:
value- The logCostOffset to set.- Returns:
- This builder for chaining.
-
clearLogCostOffset
double log_cost_offset = 29;- Returns:
- This builder for chaining.
-
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.
-
setLogTag
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;- Parameters:
value- The logTag to set.- Returns:
- This builder for chaining.
-
clearLogTag
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;- Returns:
- This builder for chaining.
-
setLogTagBytes
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;- Parameters:
value- The bytes for logTag to set.- Returns:
- This builder for chaining.
-
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.
-
setUseIteratedLocalSearch
Whether the solver should use an Iterated Local Search approach to solve the problem.
bool use_iterated_local_search = 58;- Parameters:
value- The useIteratedLocalSearch to set.- Returns:
- This builder for chaining.
-
clearUseIteratedLocalSearch
Whether the solver should use an Iterated Local Search approach to solve the problem.
bool use_iterated_local_search = 58;- Returns:
- This builder for chaining.
-
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.
-
setIteratedLocalSearchParameters
public RoutingSearchParameters.Builder setIteratedLocalSearchParameters(IteratedLocalSearchParameters value) Iterated Local Search parameters.
.operations_research.IteratedLocalSearchParameters iterated_local_search_parameters = 60; -
setIteratedLocalSearchParameters
public RoutingSearchParameters.Builder setIteratedLocalSearchParameters(IteratedLocalSearchParameters.Builder builderForValue) Iterated Local Search parameters.
.operations_research.IteratedLocalSearchParameters iterated_local_search_parameters = 60; -
mergeIteratedLocalSearchParameters
public RoutingSearchParameters.Builder mergeIteratedLocalSearchParameters(IteratedLocalSearchParameters value) Iterated Local Search parameters.
.operations_research.IteratedLocalSearchParameters iterated_local_search_parameters = 60; -
clearIteratedLocalSearchParameters
Iterated Local Search parameters.
.operations_research.IteratedLocalSearchParameters iterated_local_search_parameters = 60; -
getIteratedLocalSearchParametersBuilder
Iterated Local Search parameters.
.operations_research.IteratedLocalSearchParameters iterated_local_search_parameters = 60; -
getIteratedLocalSearchParametersOrBuilder
Iterated Local Search parameters.
.operations_research.IteratedLocalSearchParameters iterated_local_search_parameters = 60;- Specified by:
getIteratedLocalSearchParametersOrBuilderin interfaceRoutingSearchParametersOrBuilder
-