Uses of Class
com.google.ortools.constraintsolver.RoutingSearchParameters.Builder
Packages that use RoutingSearchParameters.Builder
-
Uses of RoutingSearchParameters.Builder in com.google.ortools.constraintsolver
Subclasses with type arguments of type RoutingSearchParameters.Builder in com.google.ortools.constraintsolverModifier and TypeClassDescriptionstatic final classParameters defining the search used to solve vehicle routing problems.Methods in com.google.ortools.constraintsolver that return RoutingSearchParameters.BuilderModifier and TypeMethodDescriptionRoutingSearchParameters.Builder.addAllLocalCheapestInsertionSortingProperties(Iterable<? extends RoutingSearchParameters.InsertionSortingProperty> values) The properties used to sort insertion entries in the local cheapest insertion heuristic, in *decreasing* order of priority.RoutingSearchParameters.Builder.addAllLocalCheapestInsertionSortingPropertiesValue(Iterable<Integer> values) The properties used to sort insertion entries in the local cheapest insertion heuristic, in *decreasing* order of priority.RoutingSearchParameters.Builder.addAllLocalSearchMetaheuristics(Iterable<? extends LocalSearchMetaheuristic.Value> values) Local search metaheuristics alternatively used to guide the search.RoutingSearchParameters.Builder.addAllLocalSearchMetaheuristicsValue(Iterable<Integer> values) Local search metaheuristics alternatively used to guide the search.RoutingSearchParameters.Builder.addLocalCheapestInsertionSortingProperties(RoutingSearchParameters.InsertionSortingProperty value) The properties used to sort insertion entries in the local cheapest insertion heuristic, in *decreasing* order of priority.RoutingSearchParameters.Builder.addLocalCheapestInsertionSortingPropertiesValue(int value) The properties used to sort insertion entries in the local cheapest insertion heuristic, in *decreasing* order of priority.RoutingSearchParameters.Builder.addLocalSearchMetaheuristics(LocalSearchMetaheuristic.Value value) Local search metaheuristics alternatively used to guide the search.RoutingSearchParameters.Builder.addLocalSearchMetaheuristicsValue(int value) Local search metaheuristics alternatively used to guide the search.RoutingSearchParameters.Builder.clear()RoutingSearchParameters.Builder.clearCheapestInsertionAddUnperformedEntries()Whether or not to consider entries making the nodes/pairs unperformed in the GlobalCheapestInsertion heuristic.RoutingSearchParameters.Builder.clearCheapestInsertionFarthestSeedsRatio()Ratio (between 0 and 1) of available vehicles in the model on which farthest nodes of the model are inserted as seeds in the GlobalCheapestInsertion first solution heuristic.RoutingSearchParameters.Builder.clearCheapestInsertionFirstSolutionMinNeighbors()int32 cheapest_insertion_first_solution_min_neighbors = 44;RoutingSearchParameters.Builder.clearCheapestInsertionFirstSolutionNeighborsRatio()Ratio (in ]0, 1]) of closest non start/end nodes to consider as neighbors for each node when creating new insertions in the parallel/sequential cheapest insertion heuristic.RoutingSearchParameters.Builder.clearCheapestInsertionFirstSolutionUseNeighborsRatioForInitialization()Whether or not to only consider closest neighbors when initializing the assignment for the first solution.RoutingSearchParameters.Builder.clearCheapestInsertionLsOperatorMinNeighbors()int32 cheapest_insertion_ls_operator_min_neighbors = 45;RoutingSearchParameters.Builder.clearCheapestInsertionLsOperatorNeighborsRatio()Neighbors ratio and minimum number of neighbors for the 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).RoutingSearchParameters.Builder.clearChristofidesUseMinimumMatching()If true use minimum matching instead of minimal matching in the Christofides algorithm.RoutingSearchParameters.Builder.clearContinuousSchedulingSolver().operations_research.RoutingSearchParameters.SchedulingSolver continuous_scheduling_solver = 33;RoutingSearchParameters.Builder.clearDisableSchedulingBewareThisMayDegradePerformance()Setting this to true completely disables the LP and MIP scheduling in the solver.RoutingSearchParameters.Builder.clearFallbackToCpSatSizeThreshold()If model.Size() is less than the threshold and that no solution has been found, attempt a pass with CP-SAT.RoutingSearchParameters.Builder.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.RoutingSearchParameters.Builder.clearFirstSolutionStrategy()First solution strategies, used as starting point of local search.RoutingSearchParameters.Builder.clearGuidedLocalSearchLambdaCoefficient()These are advanced settings which should not be modified unless you know what you are doing.RoutingSearchParameters.Builder.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.RoutingSearchParameters.Builder.clearGuidedLocalSearchResetPenaltiesOnNewBestSolution()Whether to reset penalties when a new best solution is found.RoutingSearchParameters.Builder.clearHeuristicCloseNodesLnsNumNodes()Number of closest nodes to consider for each node during the destruction phase of the FilteredHeuristicCloseNodesLNSOperator.RoutingSearchParameters.Builder.clearHeuristicExpensiveChainLnsNumArcsToConsider()Number of expensive arcs to consider cutting in the FilteredHeuristicExpensiveChainLNSOperator operator.RoutingSearchParameters.Builder.clearImprovementLimitParameters()The improvement search limit is added to the solver if the following parameters are set.RoutingSearchParameters.Builder.clearIteratedLocalSearchParameters()Iterated Local Search parameters.RoutingSearchParameters.Builder.clearLnsTimeLimit()Limit to the time spent in the completion search for each local search neighbor.RoutingSearchParameters.Builder.clearLocalCheapestCostInsertionPickupDeliveryStrategy()Choice of insertion strategy for pickup/delivery pairs, used in local cheapest cost insertion, both first solution heuristic and LNS.RoutingSearchParameters.Builder.clearLocalCheapestInsertionPickupDeliveryStrategy()Choice of insertion strategy for pickup/delivery pairs, used in local cheapest insertion, both first solution heuristic and LNS.RoutingSearchParameters.Builder.clearLocalCheapestInsertionSortingProperties()The properties used to sort insertion entries in the local cheapest insertion heuristic, in *decreasing* order of priority.RoutingSearchParameters.Builder.clearLocalSearchMetaheuristic()Local search metaheuristics used to guide the search.RoutingSearchParameters.Builder.clearLocalSearchMetaheuristics()Local search metaheuristics alternatively used to guide the search.RoutingSearchParameters.Builder.clearLocalSearchOperators().operations_research.RoutingSearchParameters.LocalSearchNeighborhoodOperators local_search_operators = 3;RoutingSearchParameters.Builder.clearLogCostOffset()double log_cost_offset = 29;RoutingSearchParameters.Builder.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)RoutingSearchParameters.Builder.clearLogSearch()--- Miscellaneous --- Some of these are advanced settings which should not be modified unless you know what you are doing.RoutingSearchParameters.Builder.clearLogTag()In logs, this tag will be appended to each line corresponding to a new solution.RoutingSearchParameters.Builder.clearLsOperatorMinNeighbors()int32 ls_operator_min_neighbors = 54;RoutingSearchParameters.Builder.clearLsOperatorNeighborsRatio()Neighbors ratio and minimum number of neighbors considered in local search operators (see cheapest_insertion_first_solution_neighbors_ratio and cheapest_insertion_first_solution_min_neighbors for more information).RoutingSearchParameters.Builder.clearMaxSwapActiveChainSize()Maximum size of the chain to make inactive in SwapActiveChainOperator.RoutingSearchParameters.Builder.clearMixedIntegerSchedulingSolver().operations_research.RoutingSearchParameters.SchedulingSolver mixed_integer_scheduling_solver = 34;RoutingSearchParameters.Builder.clearMultiArmedBanditCompoundOperatorExplorationCoefficient()Positive parameter defining the exploration coefficient of the multi-armed bandit compound operator.RoutingSearchParameters.Builder.clearMultiArmedBanditCompoundOperatorMemoryCoefficient()Memory coefficient related to the multi-armed bandit compound operator.RoutingSearchParameters.Builder.clearNumberOfSolutionsToCollect()Number of solutions to collect during the search.RoutingSearchParameters.Builder.clearNumMaxLocalOptimaBeforeMetaheuristicSwitch()int32 num_max_local_optima_before_metaheuristic_switch = 64;RoutingSearchParameters.Builder.clearOptimizationStep()Minimum step by which the solution must be improved in local search. 0 means "unspecified".RoutingSearchParameters.Builder.clearRelocateExpensiveChainNumArcsToConsider()Number of expensive arcs to consider cutting in the RelocateExpensiveChain neighborhood operator (see LocalSearchNeighborhoodOperators.use_relocate_expensive_chain()).RoutingSearchParameters.Builder.clearReportIntermediateCpSatSolutions()If use_cp_sat or use_generalized_cp_sat is true, will report intermediate solutions found by CP-SAT to solution listeners.RoutingSearchParameters.Builder.clearSatParameters()If use_cp_sat or use_generalized_cp_sat is true, contains the SAT algorithm parameters which will be used.RoutingSearchParameters.Builder.clearSavingsAddReverseArcs()Add savings related to reverse arcs when finding the nearest neighbors of the nodes.RoutingSearchParameters.Builder.clearSavingsArcCoefficient()Coefficient of the cost of the arc for which the saving value is being computed: Saving(a-->b) = Cost(a-->end) + Cost(start-->b) - savings_arc_coefficient * Cost(a-->b) This parameter must be greater than 0, and its default value is 1.RoutingSearchParameters.Builder.clearSavingsMaxMemoryUsageBytes()The number of neighbors considered for each node in the Savings heuristic is chosen so that the space used to store the savings doesn't exceed savings_max_memory_usage_bytes, which must be in ]0, 1e10].RoutingSearchParameters.Builder.clearSavingsNeighborsRatio()Parameters specific to the Savings first solution heuristic.RoutingSearchParameters.Builder.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.RoutingSearchParameters.Builder.clearSolutionLimit()-- Search limits -- Limit to the number of solutions generated during the search. 0 means "unspecified".RoutingSearchParameters.Builder.clearTimeLimit()Limit to the time spent in the search.RoutingSearchParameters.Builder.clearUseCp()If true, use the CP solver to find a solution.RoutingSearchParameters.Builder.clearUseCpSat()If true, use the CP-SAT solver to find a solution.RoutingSearchParameters.Builder.clearUseDepthFirstSearch()--- Search control --- If true, the solver should use depth-first search rather than local search to solve the problem.RoutingSearchParameters.Builder.clearUseFullPropagation()--- Propagation control --- These are advanced settings which should not be modified unless you know what you are doing.RoutingSearchParameters.Builder.clearUseGeneralizedCpSat()If true, use the CP-SAT solver to find a solution on generalized routing model.RoutingSearchParameters.Builder.clearUseGuidedLocalSearchPenaltiesInLocalSearchOperators()Whether to consider arc penalties in cost functions used in local search operators using arc costs.RoutingSearchParameters.Builder.clearUseIteratedLocalSearch()Whether the solver should use an Iterated Local Search approach to solve the problem.RoutingSearchParameters.Builder.clearUseMultiArmedBanditConcatenateOperators()If true, the solver will use multi-armed bandit concatenate operators.RoutingSearchParameters.Builder.clearUseUnfilteredFirstSolutionStrategy()--- Advanced first solutions strategy settings --- Don't touch these unless you know what you are doing.RoutingSearchParameters.Builder.mergeFrom(RoutingSearchParameters other) RoutingSearchParameters.Builder.mergeFrom(com.google.protobuf.CodedInputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry) RoutingSearchParameters.Builder.mergeFrom(com.google.protobuf.Message other) RoutingSearchParameters.Builder.mergeImprovementLimitParameters(RoutingSearchParameters.ImprovementSearchLimitParameters value) The improvement search limit is added to the solver if the following parameters are set.RoutingSearchParameters.Builder.mergeIteratedLocalSearchParameters(IteratedLocalSearchParameters value) Iterated Local Search parameters.RoutingSearchParameters.Builder.mergeLnsTimeLimit(com.google.protobuf.Duration value) Limit to the time spent in the completion search for each local search neighbor.RoutingSearchParameters.Builder.mergeLocalSearchOperators(RoutingSearchParameters.LocalSearchNeighborhoodOperators value) .operations_research.RoutingSearchParameters.LocalSearchNeighborhoodOperators local_search_operators = 3;RoutingSearchParameters.Builder.mergeSatParameters(SatParameters value) If use_cp_sat or use_generalized_cp_sat is true, contains the SAT algorithm parameters which will be used.RoutingSearchParameters.Builder.mergeTimeLimit(com.google.protobuf.Duration value) Limit to the time spent in the search.RoutingSearchParameters.newBuilder()RoutingSearchParameters.newBuilder(RoutingSearchParameters prototype) RoutingSearchParameters.newBuilderForType()protected RoutingSearchParameters.BuilderRoutingSearchParameters.newBuilderForType(com.google.protobuf.AbstractMessage.BuilderParent parent) RoutingSearchParameters.Builder.setCheapestInsertionAddUnperformedEntries(boolean value) Whether or not to consider entries making the nodes/pairs unperformed in the GlobalCheapestInsertion heuristic.RoutingSearchParameters.Builder.setCheapestInsertionFarthestSeedsRatio(double value) Ratio (between 0 and 1) of available vehicles in the model on which farthest nodes of the model are inserted as seeds in the GlobalCheapestInsertion first solution heuristic.RoutingSearchParameters.Builder.setCheapestInsertionFirstSolutionMinNeighbors(int value) int32 cheapest_insertion_first_solution_min_neighbors = 44;RoutingSearchParameters.Builder.setCheapestInsertionFirstSolutionNeighborsRatio(double value) Ratio (in ]0, 1]) of closest non start/end nodes to consider as neighbors for each node when creating new insertions in the parallel/sequential cheapest insertion heuristic.RoutingSearchParameters.Builder.setCheapestInsertionFirstSolutionUseNeighborsRatioForInitialization(boolean value) Whether or not to only consider closest neighbors when initializing the assignment for the first solution.RoutingSearchParameters.Builder.setCheapestInsertionLsOperatorMinNeighbors(int value) int32 cheapest_insertion_ls_operator_min_neighbors = 45;RoutingSearchParameters.Builder.setCheapestInsertionLsOperatorNeighborsRatio(double value) Neighbors ratio and minimum number of neighbors for the 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).RoutingSearchParameters.Builder.setChristofidesUseMinimumMatching(boolean value) If true use minimum matching instead of minimal matching in the Christofides algorithm.RoutingSearchParameters.Builder.setContinuousSchedulingSolver(RoutingSearchParameters.SchedulingSolver value) .operations_research.RoutingSearchParameters.SchedulingSolver continuous_scheduling_solver = 33;RoutingSearchParameters.Builder.setContinuousSchedulingSolverValue(int value) .operations_research.RoutingSearchParameters.SchedulingSolver continuous_scheduling_solver = 33;RoutingSearchParameters.Builder.setDisableSchedulingBewareThisMayDegradePerformance(boolean value) Setting this to true completely disables the LP and MIP scheduling in the solver.RoutingSearchParameters.Builder.setFallbackToCpSatSizeThreshold(int value) If model.Size() is less than the threshold and that no solution has been found, attempt a pass with CP-SAT.RoutingSearchParameters.Builder.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.RoutingSearchParameters.Builder.setFirstSolutionStrategy(FirstSolutionStrategy.Value value) First solution strategies, used as starting point of local search.RoutingSearchParameters.Builder.setFirstSolutionStrategyValue(int value) First solution strategies, used as starting point of local search.RoutingSearchParameters.Builder.setGuidedLocalSearchLambdaCoefficient(double value) These are advanced settings which should not be modified unless you know what you are doing.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.RoutingSearchParameters.Builder.setGuidedLocalSearchResetPenaltiesOnNewBestSolution(boolean value) Whether to reset penalties when a new best solution is found.RoutingSearchParameters.Builder.setHeuristicCloseNodesLnsNumNodes(int value) Number of closest nodes to consider for each node during the destruction phase of the FilteredHeuristicCloseNodesLNSOperator.RoutingSearchParameters.Builder.setHeuristicExpensiveChainLnsNumArcsToConsider(int value) Number of expensive arcs to consider cutting in the FilteredHeuristicExpensiveChainLNSOperator operator.RoutingSearchParameters.Builder.setImprovementLimitParameters(RoutingSearchParameters.ImprovementSearchLimitParameters value) The improvement search limit is added to the solver if the following parameters are set.RoutingSearchParameters.Builder.setImprovementLimitParameters(RoutingSearchParameters.ImprovementSearchLimitParameters.Builder builderForValue) The improvement search limit is added to the solver if the following parameters are set.RoutingSearchParameters.Builder.setIteratedLocalSearchParameters(IteratedLocalSearchParameters value) Iterated Local Search parameters.RoutingSearchParameters.Builder.setIteratedLocalSearchParameters(IteratedLocalSearchParameters.Builder builderForValue) Iterated Local Search parameters.RoutingSearchParameters.Builder.setLnsTimeLimit(com.google.protobuf.Duration value) Limit to the time spent in the completion search for each local search neighbor.RoutingSearchParameters.Builder.setLnsTimeLimit(com.google.protobuf.Duration.Builder builderForValue) Limit to the time spent in the completion search for each local search neighbor.RoutingSearchParameters.Builder.setLocalCheapestCostInsertionPickupDeliveryStrategy(RoutingSearchParameters.PairInsertionStrategy value) Choice of insertion strategy for pickup/delivery pairs, used in local cheapest cost insertion, both first solution heuristic and LNS.RoutingSearchParameters.Builder.setLocalCheapestCostInsertionPickupDeliveryStrategyValue(int value) Choice of insertion strategy for pickup/delivery pairs, used in local cheapest cost insertion, both first solution heuristic and LNS.RoutingSearchParameters.Builder.setLocalCheapestInsertionPickupDeliveryStrategy(RoutingSearchParameters.PairInsertionStrategy value) Choice of insertion strategy for pickup/delivery pairs, used in local cheapest insertion, both first solution heuristic and LNS.RoutingSearchParameters.Builder.setLocalCheapestInsertionPickupDeliveryStrategyValue(int value) Choice of insertion strategy for pickup/delivery pairs, used in local cheapest insertion, both first solution heuristic and LNS.RoutingSearchParameters.Builder.setLocalCheapestInsertionSortingProperties(int index, RoutingSearchParameters.InsertionSortingProperty value) The properties used to sort insertion entries in the local cheapest insertion heuristic, in *decreasing* order of priority.RoutingSearchParameters.Builder.setLocalCheapestInsertionSortingPropertiesValue(int index, int value) The properties used to sort insertion entries in the local cheapest insertion heuristic, in *decreasing* order of priority.RoutingSearchParameters.Builder.setLocalSearchMetaheuristic(LocalSearchMetaheuristic.Value value) Local search metaheuristics used to guide the search.RoutingSearchParameters.Builder.setLocalSearchMetaheuristics(int index, LocalSearchMetaheuristic.Value value) Local search metaheuristics alternatively used to guide the search.RoutingSearchParameters.Builder.setLocalSearchMetaheuristicsValue(int index, int value) Local search metaheuristics alternatively used to guide the search.RoutingSearchParameters.Builder.setLocalSearchMetaheuristicValue(int value) Local search metaheuristics used to guide the search.RoutingSearchParameters.Builder.setLocalSearchOperators(RoutingSearchParameters.LocalSearchNeighborhoodOperators value) .operations_research.RoutingSearchParameters.LocalSearchNeighborhoodOperators local_search_operators = 3;RoutingSearchParameters.Builder.setLocalSearchOperators(RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder builderForValue) .operations_research.RoutingSearchParameters.LocalSearchNeighborhoodOperators local_search_operators = 3;RoutingSearchParameters.Builder.setLogCostOffset(double value) double log_cost_offset = 29;RoutingSearchParameters.Builder.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)RoutingSearchParameters.Builder.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.RoutingSearchParameters.Builder.setLogTagBytes(com.google.protobuf.ByteString value) In logs, this tag will be appended to each line corresponding to a new solution.RoutingSearchParameters.Builder.setLsOperatorMinNeighbors(int value) int32 ls_operator_min_neighbors = 54;RoutingSearchParameters.Builder.setLsOperatorNeighborsRatio(double value) Neighbors ratio and minimum number of neighbors considered in local search operators (see cheapest_insertion_first_solution_neighbors_ratio and cheapest_insertion_first_solution_min_neighbors for more information).RoutingSearchParameters.Builder.setMaxSwapActiveChainSize(int value) Maximum size of the chain to make inactive in SwapActiveChainOperator.RoutingSearchParameters.Builder.setMixedIntegerSchedulingSolver(RoutingSearchParameters.SchedulingSolver value) .operations_research.RoutingSearchParameters.SchedulingSolver mixed_integer_scheduling_solver = 34;RoutingSearchParameters.Builder.setMixedIntegerSchedulingSolverValue(int value) .operations_research.RoutingSearchParameters.SchedulingSolver mixed_integer_scheduling_solver = 34;RoutingSearchParameters.Builder.setMultiArmedBanditCompoundOperatorExplorationCoefficient(double value) Positive parameter defining the exploration coefficient of the multi-armed bandit compound operator.RoutingSearchParameters.Builder.setMultiArmedBanditCompoundOperatorMemoryCoefficient(double value) Memory coefficient related to the multi-armed bandit compound operator.RoutingSearchParameters.Builder.setNumberOfSolutionsToCollect(int value) Number of solutions to collect during the search.RoutingSearchParameters.Builder.setNumMaxLocalOptimaBeforeMetaheuristicSwitch(int value) int32 num_max_local_optima_before_metaheuristic_switch = 64;RoutingSearchParameters.Builder.setOptimizationStep(double value) Minimum step by which the solution must be improved in local search. 0 means "unspecified".RoutingSearchParameters.Builder.setRelocateExpensiveChainNumArcsToConsider(int value) Number of expensive arcs to consider cutting in the RelocateExpensiveChain neighborhood operator (see LocalSearchNeighborhoodOperators.use_relocate_expensive_chain()).RoutingSearchParameters.Builder.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.RoutingSearchParameters.Builder.setSatParameters(SatParameters value) If use_cp_sat or use_generalized_cp_sat is true, contains the SAT algorithm parameters which will be used.RoutingSearchParameters.Builder.setSatParameters(SatParameters.Builder builderForValue) If use_cp_sat or use_generalized_cp_sat is true, contains the SAT algorithm parameters which will be used.RoutingSearchParameters.Builder.setSavingsAddReverseArcs(boolean value) Add savings related to reverse arcs when finding the nearest neighbors of the nodes.RoutingSearchParameters.Builder.setSavingsArcCoefficient(double value) Coefficient of the cost of the arc for which the saving value is being computed: Saving(a-->b) = Cost(a-->end) + Cost(start-->b) - savings_arc_coefficient * Cost(a-->b) This parameter must be greater than 0, and its default value is 1.RoutingSearchParameters.Builder.setSavingsMaxMemoryUsageBytes(double value) The number of neighbors considered for each node in the Savings heuristic is chosen so that the space used to store the savings doesn't exceed savings_max_memory_usage_bytes, which must be in ]0, 1e10].RoutingSearchParameters.Builder.setSavingsNeighborsRatio(double value) Parameters specific to the Savings first solution heuristic.RoutingSearchParameters.Builder.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.RoutingSearchParameters.Builder.setSolutionLimit(long value) -- Search limits -- Limit to the number of solutions generated during the search. 0 means "unspecified".RoutingSearchParameters.Builder.setTimeLimit(com.google.protobuf.Duration value) Limit to the time spent in the search.RoutingSearchParameters.Builder.setTimeLimit(com.google.protobuf.Duration.Builder builderForValue) Limit to the time spent in the search.RoutingSearchParameters.Builder.setUseCp(OptionalBoolean value) If true, use the CP solver to find a solution.RoutingSearchParameters.Builder.setUseCpSat(OptionalBoolean value) If true, use the CP-SAT solver to find a solution.RoutingSearchParameters.Builder.setUseCpSatValue(int value) If true, use the CP-SAT solver to find a solution.RoutingSearchParameters.Builder.setUseCpValue(int value) If true, use the CP solver to find a solution.RoutingSearchParameters.Builder.setUseDepthFirstSearch(boolean value) --- Search control --- If true, the solver should use depth-first search rather than local search to solve the problem.RoutingSearchParameters.Builder.setUseFullPropagation(boolean value) --- Propagation control --- These are advanced settings which should not be modified unless you know what you are doing.RoutingSearchParameters.Builder.setUseGeneralizedCpSat(OptionalBoolean value) If true, use the CP-SAT solver to find a solution on generalized routing model.RoutingSearchParameters.Builder.setUseGeneralizedCpSatValue(int value) If true, use the CP-SAT solver to find a solution on generalized routing model.RoutingSearchParameters.Builder.setUseGuidedLocalSearchPenaltiesInLocalSearchOperators(boolean value) Whether to consider arc penalties in cost functions used in local search operators using arc costs.RoutingSearchParameters.Builder.setUseIteratedLocalSearch(boolean value) Whether the solver should use an Iterated Local Search approach to solve the problem.RoutingSearchParameters.Builder.setUseMultiArmedBanditConcatenateOperators(boolean value) If true, the solver will use multi-armed bandit concatenate operators.RoutingSearchParameters.Builder.setUseUnfilteredFirstSolutionStrategy(boolean value) --- Advanced first solutions strategy settings --- Don't touch these unless you know what you are doing.RoutingSearchParameters.toBuilder()