Package | Description |
---|---|
com.google.ortools.constraintsolver |
Modifier and Type | Method and Description |
---|---|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.addAllLocalCheapestInsertionSortingProperties(java.lang.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 |
RoutingSearchParameters.Builder.addAllLocalCheapestInsertionSortingPropertiesValue(java.lang.Iterable<java.lang.Integer> values)
The properties used to sort insertion entries in the local cheapest
insertion heuristic, in *decreasing* order of priority.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.addAllLocalSearchMetaheuristics(java.lang.Iterable<? extends LocalSearchMetaheuristic.Value> values)
Local search metaheuristics alternatively used to guide the search.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.addAllLocalSearchMetaheuristicsValue(java.lang.Iterable<java.lang.Integer> values)
Local search metaheuristics alternatively used to guide the search.
|
RoutingSearchParameters.Builder |
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 |
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 |
RoutingSearchParameters.Builder.addLocalSearchMetaheuristics(LocalSearchMetaheuristic.Value value)
Local search metaheuristics alternatively used to guide the search.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.addLocalSearchMetaheuristicsValue(int value)
Local search metaheuristics alternatively used to guide the search.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.clear() |
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.clearCheapestInsertionAddUnperformedEntries()
Whether or not to consider entries making the nodes/pairs unperformed in
the GlobalCheapestInsertion heuristic.
|
RoutingSearchParameters.Builder |
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 |
RoutingSearchParameters.Builder.clearCheapestInsertionFirstSolutionMinNeighbors()
int32 cheapest_insertion_first_solution_min_neighbors = 44; |
RoutingSearchParameters.Builder |
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 |
RoutingSearchParameters.Builder.clearCheapestInsertionFirstSolutionUseNeighborsRatioForInitialization()
Whether or not to only consider closest neighbors when initializing the
assignment for the first solution.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.clearCheapestInsertionLsOperatorMinNeighbors()
int32 cheapest_insertion_ls_operator_min_neighbors = 45; |
RoutingSearchParameters.Builder |
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 |
RoutingSearchParameters.Builder.clearChristofidesUseMinimumMatching()
If true use minimum matching instead of minimal matching in the
Christofides algorithm.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.clearContinuousSchedulingSolver()
.operations_research.RoutingSearchParameters.SchedulingSolver continuous_scheduling_solver = 33; |
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.clearDisableSchedulingBewareThisMayDegradePerformance()
Setting this to true completely disables the LP and MIP scheduling in the
solver.
|
RoutingSearchParameters.Builder |
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 |
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 |
RoutingSearchParameters.Builder.clearFirstSolutionStrategy()
First solution strategies, used as starting point of local search.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.clearGuidedLocalSearchLambdaCoefficient()
These are advanced settings which should not be modified unless you know
what you are doing.
|
RoutingSearchParameters.Builder |
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 |
RoutingSearchParameters.Builder.clearGuidedLocalSearchResetPenaltiesOnNewBestSolution()
Whether to reset penalties when a new best solution is found.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.clearHeuristicCloseNodesLnsNumNodes()
Number of closest nodes to consider for each node during the destruction
phase of the FilteredHeuristicCloseNodesLNSOperator.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.clearHeuristicExpensiveChainLnsNumArcsToConsider()
Number of expensive arcs to consider cutting in the
FilteredHeuristicExpensiveChainLNSOperator operator.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.clearImprovementLimitParameters()
The improvement search limit is added to the solver if the following
parameters are set.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.clearIteratedLocalSearchParameters()
Iterated Local Search parameters.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.clearLnsTimeLimit()
Limit to the time spent in the completion search for each local search
neighbor.
|
RoutingSearchParameters.Builder |
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 |
RoutingSearchParameters.Builder.clearLocalCheapestInsertionPickupDeliveryStrategy()
Choice of insertion strategy for pickup/delivery pairs, used in local
cheapest insertion, both first solution heuristic and LNS.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.clearLocalCheapestInsertionSortingProperties()
The properties used to sort insertion entries in the local cheapest
insertion heuristic, in *decreasing* order of priority.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.clearLocalSearchMetaheuristic()
Local search metaheuristics used to guide the search.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.clearLocalSearchMetaheuristics()
Local search metaheuristics alternatively used to guide the search.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.clearLocalSearchOperators()
.operations_research.RoutingSearchParameters.LocalSearchNeighborhoodOperators local_search_operators = 3; |
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.clearLogCostOffset()
double log_cost_offset = 29; |
RoutingSearchParameters.Builder |
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)
double log_cost_scaling_factor = 22; |
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.clearLogSearch()
--- Miscellaneous ---
Some of these are advanced settings which should not be modified unless you
know what you are doing.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.clearLogTag()
In logs, this tag will be appended to each line corresponding to a new
solution.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.clearLsOperatorMinNeighbors()
int32 ls_operator_min_neighbors = 54; |
RoutingSearchParameters.Builder |
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 |
RoutingSearchParameters.Builder.clearMaxSwapActiveChainSize()
Maximum size of the chain to make inactive in SwapActiveChainOperator.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.clearMixedIntegerSchedulingSolver()
.operations_research.RoutingSearchParameters.SchedulingSolver mixed_integer_scheduling_solver = 34; |
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.clearMultiArmedBanditCompoundOperatorExplorationCoefficient()
Positive parameter defining the exploration coefficient of the multi-armed
bandit compound operator.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.clearMultiArmedBanditCompoundOperatorMemoryCoefficient()
Memory coefficient related to the multi-armed bandit compound operator.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.clearNumberOfSolutionsToCollect()
Number of solutions to collect during the search.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.clearNumMaxLocalOptimaBeforeMetaheuristicSwitch()
int32 num_max_local_optima_before_metaheuristic_switch = 64; |
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.clearOptimizationStep()
Minimum step by which the solution must be improved in local search. 0
means "unspecified".
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.clearRelocateExpensiveChainNumArcsToConsider()
Number of expensive arcs to consider cutting in the RelocateExpensiveChain
neighborhood operator (see
LocalSearchNeighborhoodOperators.use_relocate_expensive_chain()).
|
RoutingSearchParameters.Builder |
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 |
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 |
RoutingSearchParameters.Builder.clearSavingsAddReverseArcs()
Add savings related to reverse arcs when finding the nearest neighbors
of the nodes.
|
RoutingSearchParameters.Builder |
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 |
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 |
RoutingSearchParameters.Builder.clearSavingsNeighborsRatio()
Parameters specific to the Savings first solution heuristic.
|
RoutingSearchParameters.Builder |
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 |
RoutingSearchParameters.Builder.clearSolutionLimit()
-- Search limits --
Limit to the number of solutions generated during the search. 0 means
"unspecified".
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.clearTimeLimit()
Limit to the time spent in the search.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.clearUseCp()
If true, use the CP solver to find a solution.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.clearUseCpSat()
If true, use the CP-SAT solver to find a solution.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.clearUseDepthFirstSearch()
--- Search control ---
If true, the solver should use depth-first search rather than local search
to solve the problem.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.clearUseFullPropagation()
--- Propagation control ---
These are advanced settings which should not be modified unless you know
what you are doing.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.clearUseGeneralizedCpSat()
If true, use the CP-SAT solver to find a solution on generalized routing
model.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.clearUseGuidedLocalSearchPenaltiesInLocalSearchOperators()
Whether to consider arc penalties in cost functions used in local search
operators using arc costs.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.clearUseIteratedLocalSearch()
Whether the solver should use an Iterated Local Search approach to solve
the problem.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.clearUseMultiArmedBanditConcatenateOperators()
If true, the solver will use multi-armed bandit concatenate operators.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.clearUseUnfilteredFirstSolutionStrategy()
--- Advanced first solutions strategy settings ---
Don't touch these unless you know what you are doing.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.mergeFrom(com.google.protobuf.CodedInputStream input,
com.google.protobuf.ExtensionRegistryLite extensionRegistry) |
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.mergeFrom(com.google.protobuf.Message other) |
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.mergeFrom(RoutingSearchParameters other) |
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.mergeImprovementLimitParameters(RoutingSearchParameters.ImprovementSearchLimitParameters value)
The improvement search limit is added to the solver if the following
parameters are set.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.mergeIteratedLocalSearchParameters(IteratedLocalSearchParameters value)
Iterated Local Search parameters.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.mergeLnsTimeLimit(com.google.protobuf.Duration value)
Limit to the time spent in the completion search for each local search
neighbor.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.mergeLocalSearchOperators(RoutingSearchParameters.LocalSearchNeighborhoodOperators value)
.operations_research.RoutingSearchParameters.LocalSearchNeighborhoodOperators local_search_operators = 3; |
RoutingSearchParameters.Builder |
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 |
RoutingSearchParameters.Builder.mergeTimeLimit(com.google.protobuf.Duration value)
Limit to the time spent in the search.
|
static RoutingSearchParameters.Builder |
RoutingSearchParameters.newBuilder() |
static RoutingSearchParameters.Builder |
RoutingSearchParameters.newBuilder(RoutingSearchParameters prototype) |
RoutingSearchParameters.Builder |
RoutingSearchParameters.newBuilderForType() |
protected RoutingSearchParameters.Builder |
RoutingSearchParameters.newBuilderForType(com.google.protobuf.AbstractMessage.BuilderParent parent) |
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.setCheapestInsertionAddUnperformedEntries(boolean value)
Whether or not to consider entries making the nodes/pairs unperformed in
the GlobalCheapestInsertion heuristic.
|
RoutingSearchParameters.Builder |
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 |
RoutingSearchParameters.Builder.setCheapestInsertionFirstSolutionMinNeighbors(int value)
int32 cheapest_insertion_first_solution_min_neighbors = 44; |
RoutingSearchParameters.Builder |
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 |
RoutingSearchParameters.Builder.setCheapestInsertionFirstSolutionUseNeighborsRatioForInitialization(boolean value)
Whether or not to only consider closest neighbors when initializing the
assignment for the first solution.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.setCheapestInsertionLsOperatorMinNeighbors(int value)
int32 cheapest_insertion_ls_operator_min_neighbors = 45; |
RoutingSearchParameters.Builder |
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 |
RoutingSearchParameters.Builder.setChristofidesUseMinimumMatching(boolean value)
If true use minimum matching instead of minimal matching in the
Christofides algorithm.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.setContinuousSchedulingSolver(RoutingSearchParameters.SchedulingSolver value)
.operations_research.RoutingSearchParameters.SchedulingSolver continuous_scheduling_solver = 33; |
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.setContinuousSchedulingSolverValue(int value)
.operations_research.RoutingSearchParameters.SchedulingSolver continuous_scheduling_solver = 33; |
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.setDisableSchedulingBewareThisMayDegradePerformance(boolean value)
Setting this to true completely disables the LP and MIP scheduling in the
solver.
|
RoutingSearchParameters.Builder |
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 |
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 |
RoutingSearchParameters.Builder.setFirstSolutionStrategy(FirstSolutionStrategy.Value value)
First solution strategies, used as starting point of local search.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.setFirstSolutionStrategyValue(int value)
First solution strategies, used as starting point of local search.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.setGuidedLocalSearchLambdaCoefficient(double value)
These are advanced settings which should not be modified unless you know
what you are doing.
|
RoutingSearchParameters.Builder |
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 |
RoutingSearchParameters.Builder.setGuidedLocalSearchResetPenaltiesOnNewBestSolution(boolean value)
Whether to reset penalties when a new best solution is found.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.setHeuristicCloseNodesLnsNumNodes(int value)
Number of closest nodes to consider for each node during the destruction
phase of the FilteredHeuristicCloseNodesLNSOperator.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.setHeuristicExpensiveChainLnsNumArcsToConsider(int value)
Number of expensive arcs to consider cutting in the
FilteredHeuristicExpensiveChainLNSOperator operator.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.setImprovementLimitParameters(RoutingSearchParameters.ImprovementSearchLimitParameters.Builder builderForValue)
The improvement search limit is added to the solver if the following
parameters are set.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.setImprovementLimitParameters(RoutingSearchParameters.ImprovementSearchLimitParameters value)
The improvement search limit is added to the solver if the following
parameters are set.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.setIteratedLocalSearchParameters(IteratedLocalSearchParameters.Builder builderForValue)
Iterated Local Search parameters.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.setIteratedLocalSearchParameters(IteratedLocalSearchParameters value)
Iterated Local Search parameters.
|
RoutingSearchParameters.Builder |
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 |
RoutingSearchParameters.Builder.setLnsTimeLimit(com.google.protobuf.Duration value)
Limit to the time spent in the completion search for each local search
neighbor.
|
RoutingSearchParameters.Builder |
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 |
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 |
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 |
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 |
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 |
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 |
RoutingSearchParameters.Builder.setLocalSearchMetaheuristic(LocalSearchMetaheuristic.Value value)
Local search metaheuristics used to guide the search.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.setLocalSearchMetaheuristics(int index,
LocalSearchMetaheuristic.Value value)
Local search metaheuristics alternatively used to guide the search.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.setLocalSearchMetaheuristicsValue(int index,
int value)
Local search metaheuristics alternatively used to guide the search.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.setLocalSearchMetaheuristicValue(int value)
Local search metaheuristics used to guide the search.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.setLocalSearchOperators(RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder builderForValue)
.operations_research.RoutingSearchParameters.LocalSearchNeighborhoodOperators local_search_operators = 3; |
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.setLocalSearchOperators(RoutingSearchParameters.LocalSearchNeighborhoodOperators value)
.operations_research.RoutingSearchParameters.LocalSearchNeighborhoodOperators local_search_operators = 3; |
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.setLogCostOffset(double value)
double log_cost_offset = 29; |
RoutingSearchParameters.Builder |
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)
double log_cost_scaling_factor = 22; |
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.setLogSearch(boolean value)
--- Miscellaneous ---
Some of these are advanced settings which should not be modified unless you
know what you are doing.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.setLogTag(java.lang.String value)
In logs, this tag will be appended to each line corresponding to a new
solution.
|
RoutingSearchParameters.Builder |
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 |
RoutingSearchParameters.Builder.setLsOperatorMinNeighbors(int value)
int32 ls_operator_min_neighbors = 54; |
RoutingSearchParameters.Builder |
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 |
RoutingSearchParameters.Builder.setMaxSwapActiveChainSize(int value)
Maximum size of the chain to make inactive in SwapActiveChainOperator.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.setMixedIntegerSchedulingSolver(RoutingSearchParameters.SchedulingSolver value)
.operations_research.RoutingSearchParameters.SchedulingSolver mixed_integer_scheduling_solver = 34; |
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.setMixedIntegerSchedulingSolverValue(int value)
.operations_research.RoutingSearchParameters.SchedulingSolver mixed_integer_scheduling_solver = 34; |
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.setMultiArmedBanditCompoundOperatorExplorationCoefficient(double value)
Positive parameter defining the exploration coefficient of the multi-armed
bandit compound operator.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.setMultiArmedBanditCompoundOperatorMemoryCoefficient(double value)
Memory coefficient related to the multi-armed bandit compound operator.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.setNumberOfSolutionsToCollect(int value)
Number of solutions to collect during the search.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.setNumMaxLocalOptimaBeforeMetaheuristicSwitch(int value)
int32 num_max_local_optima_before_metaheuristic_switch = 64; |
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.setOptimizationStep(double value)
Minimum step by which the solution must be improved in local search. 0
means "unspecified".
|
RoutingSearchParameters.Builder |
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 |
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 |
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 |
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 |
RoutingSearchParameters.Builder.setSavingsAddReverseArcs(boolean value)
Add savings related to reverse arcs when finding the nearest neighbors
of the nodes.
|
RoutingSearchParameters.Builder |
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 |
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 |
RoutingSearchParameters.Builder.setSavingsNeighborsRatio(double value)
Parameters specific to the Savings first solution heuristic.
|
RoutingSearchParameters.Builder |
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 |
RoutingSearchParameters.Builder.setSolutionLimit(long value)
-- Search limits --
Limit to the number of solutions generated during the search. 0 means
"unspecified".
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.setTimeLimit(com.google.protobuf.Duration.Builder builderForValue)
Limit to the time spent in the search.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.setTimeLimit(com.google.protobuf.Duration value)
Limit to the time spent in the search.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.setUseCp(OptionalBoolean value)
If true, use the CP solver to find a solution.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.setUseCpSat(OptionalBoolean value)
If true, use the CP-SAT solver to find a solution.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.setUseCpSatValue(int value)
If true, use the CP-SAT solver to find a solution.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.setUseCpValue(int value)
If true, use the CP solver to find a solution.
|
RoutingSearchParameters.Builder |
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 |
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 |
RoutingSearchParameters.Builder.setUseGeneralizedCpSat(OptionalBoolean value)
If true, use the CP-SAT solver to find a solution on generalized routing
model.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.setUseGeneralizedCpSatValue(int value)
If true, use the CP-SAT solver to find a solution on generalized routing
model.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.setUseGuidedLocalSearchPenaltiesInLocalSearchOperators(boolean value)
Whether to consider arc penalties in cost functions used in local search
operators using arc costs.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.setUseIteratedLocalSearch(boolean value)
Whether the solver should use an Iterated Local Search approach to solve
the problem.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.setUseMultiArmedBanditConcatenateOperators(boolean value)
If true, the solver will use multi-armed bandit concatenate operators.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.setUseUnfilteredFirstSolutionStrategy(boolean value)
--- Advanced first solutions strategy settings ---
Don't touch these unless you know what you are doing.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.toBuilder() |
Copyright © 2025. All rights reserved.