Google OR-Tools v9.9
a fast and portable software suite for combinatorial optimization
Loading...
Searching...
No Matches
com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder Interface Reference
Inheritance diagram for com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder:
com.google.ortools.constraintsolver.RoutingSearchParameters com.google.ortools.constraintsolver.RoutingSearchParameters.Builder

Public Member Functions

int getFirstSolutionStrategyValue ()
 
com.google.ortools.constraintsolver.FirstSolutionStrategy.Value getFirstSolutionStrategy ()
 
boolean getUseUnfilteredFirstSolutionStrategy ()
 
double getSavingsNeighborsRatio ()
 
double getSavingsMaxMemoryUsageBytes ()
 
boolean getSavingsAddReverseArcs ()
 
double getSavingsArcCoefficient ()
 
boolean getSavingsParallelRoutes ()
 
double getCheapestInsertionFarthestSeedsRatio ()
 
double getCheapestInsertionFirstSolutionNeighborsRatio ()
 
int getCheapestInsertionFirstSolutionMinNeighbors ()
 
double getCheapestInsertionLsOperatorNeighborsRatio ()
 
int getCheapestInsertionLsOperatorMinNeighbors ()
 
boolean getCheapestInsertionFirstSolutionUseNeighborsRatioForInitialization ()
 
boolean getCheapestInsertionAddUnperformedEntries ()
 
int getLocalCheapestInsertionPickupDeliveryStrategyValue ()
 
com.google.ortools.constraintsolver.RoutingSearchParameters.PairInsertionStrategy getLocalCheapestInsertionPickupDeliveryStrategy ()
 
int getLocalCheapestCostInsertionPickupDeliveryStrategyValue ()
 
com.google.ortools.constraintsolver.RoutingSearchParameters.PairInsertionStrategy getLocalCheapestCostInsertionPickupDeliveryStrategy ()
 
boolean getChristofidesUseMinimumMatching ()
 
int getFirstSolutionOptimizationPeriod ()
 
boolean hasLocalSearchOperators ()
 
com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators getLocalSearchOperators ()
 
com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder getLocalSearchOperatorsOrBuilder ()
 
double getLsOperatorNeighborsRatio ()
 
int getLsOperatorMinNeighbors ()
 
boolean getUseMultiArmedBanditConcatenateOperators ()
 
double getMultiArmedBanditCompoundOperatorMemoryCoefficient ()
 
double getMultiArmedBanditCompoundOperatorExplorationCoefficient ()
 
int getRelocateExpensiveChainNumArcsToConsider ()
 
int getHeuristicExpensiveChainLnsNumArcsToConsider ()
 
int getHeuristicCloseNodesLnsNumNodes ()
 
int getLocalSearchMetaheuristicValue ()
 
com.google.ortools.constraintsolver.LocalSearchMetaheuristic.Value getLocalSearchMetaheuristic ()
 
double getGuidedLocalSearchLambdaCoefficient ()
 
boolean getGuidedLocalSearchResetPenaltiesOnNewBestSolution ()
 
boolean getUseDepthFirstSearch ()
 
int getUseCpValue ()
 
com.google.ortools.util.OptionalBoolean getUseCp ()
 
int getUseCpSatValue ()
 
com.google.ortools.util.OptionalBoolean getUseCpSat ()
 
int getUseGeneralizedCpSatValue ()
 
com.google.ortools.util.OptionalBoolean getUseGeneralizedCpSat ()
 
boolean hasSatParameters ()
 
com.google.ortools.sat.SatParameters getSatParameters ()
 
com.google.ortools.sat.SatParametersOrBuilder getSatParametersOrBuilder ()
 
boolean getReportIntermediateCpSatSolutions ()
 
int getFallbackToCpSatSizeThreshold ()
 
int getContinuousSchedulingSolverValue ()
 
com.google.ortools.constraintsolver.RoutingSearchParameters.SchedulingSolver getContinuousSchedulingSolver ()
 
int getMixedIntegerSchedulingSolverValue ()
 
com.google.ortools.constraintsolver.RoutingSearchParameters.SchedulingSolver getMixedIntegerSchedulingSolver ()
 
boolean hasDisableSchedulingBewareThisMayDegradePerformance ()
 
boolean getDisableSchedulingBewareThisMayDegradePerformance ()
 
double getOptimizationStep ()
 
int getNumberOfSolutionsToCollect ()
 
long getSolutionLimit ()
 
boolean hasTimeLimit ()
 
com.google.protobuf.Duration getTimeLimit ()
 
com.google.protobuf.DurationOrBuilder getTimeLimitOrBuilder ()
 
boolean hasLnsTimeLimit ()
 
com.google.protobuf.Duration getLnsTimeLimit ()
 
com.google.protobuf.DurationOrBuilder getLnsTimeLimitOrBuilder ()
 
double getSecondaryLsTimeLimitRatio ()
 
boolean hasImprovementLimitParameters ()
 
com.google.ortools.constraintsolver.RoutingSearchParameters.ImprovementSearchLimitParameters getImprovementLimitParameters ()
 
com.google.ortools.constraintsolver.RoutingSearchParameters.ImprovementSearchLimitParametersOrBuilder getImprovementLimitParametersOrBuilder ()
 
boolean getUseFullPropagation ()
 
boolean getLogSearch ()
 
double getLogCostScalingFactor ()
 
double getLogCostOffset ()
 
java.lang.String getLogTag ()
 
com.google.protobuf.ByteString getLogTagBytes ()
 
boolean getUseIteratedLocalSearch ()
 
boolean hasIteratedLocalSearchParameters ()
 
operations_research.RoutingIls.IteratedLocalSearchParameters getIteratedLocalSearchParameters ()
 
operations_research.RoutingIls.IteratedLocalSearchParametersOrBuilder getIteratedLocalSearchParametersOrBuilder ()
 

Detailed Description

Definition at line 7 of file RoutingSearchParametersOrBuilder.java.

Member Function Documentation

◆ getCheapestInsertionAddUnperformedEntries()

boolean com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.getCheapestInsertionAddUnperformedEntries ( )
Whether or not to consider entries making the nodes/pairs unperformed in
the GlobalCheapestInsertion heuristic.

bool cheapest_insertion_add_unperformed_entries = 40;

Returns
The cheapestInsertionAddUnperformedEntries.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getCheapestInsertionFarthestSeedsRatio()

double com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.getCheapestInsertionFarthestSeedsRatio ( )
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.

double cheapest_insertion_farthest_seeds_ratio = 16;

Returns
The cheapestInsertionFarthestSeedsRatio.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getCheapestInsertionFirstSolutionMinNeighbors()

int com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.getCheapestInsertionFirstSolutionMinNeighbors ( )

int32 cheapest_insertion_first_solution_min_neighbors = 44;

Returns
The cheapestInsertionFirstSolutionMinNeighbors.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getCheapestInsertionFirstSolutionNeighborsRatio()

double com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.getCheapestInsertionFirstSolutionNeighborsRatio ( )
Ratio (in ]0, 1]) of closest non start/end nodes to consider as neighbors
for each node when creating new insertions in the parallel/sequential
cheapest insertion heuristic.
If not overridden, its default value is 1, meaning all neighbors will be
considered.
The neighborhood ratio is coupled with the corresponding min_neighbors
integer, indicating the minimum number of neighbors to consider for each
node:
num_closest_neighbors =
       max(min_neighbors, neighbors_ratio * NUM_NON_START_END_NODES)
This minimum number of neighbors must be greater or equal to 1, its
default value.

Neighbors ratio and minimum number of neighbors for the first solution
heuristic.

double cheapest_insertion_first_solution_neighbors_ratio = 21;

Returns
The cheapestInsertionFirstSolutionNeighborsRatio.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getCheapestInsertionFirstSolutionUseNeighborsRatioForInitialization()

boolean com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.getCheapestInsertionFirstSolutionUseNeighborsRatioForInitialization ( )
Whether or not to only consider closest neighbors when initializing the
assignment for the first solution.

bool cheapest_insertion_first_solution_use_neighbors_ratio_for_initialization = 46;

Returns
The cheapestInsertionFirstSolutionUseNeighborsRatioForInitialization.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getCheapestInsertionLsOperatorMinNeighbors()

int com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.getCheapestInsertionLsOperatorMinNeighbors ( )

int32 cheapest_insertion_ls_operator_min_neighbors = 45;

Returns
The cheapestInsertionLsOperatorMinNeighbors.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getCheapestInsertionLsOperatorNeighborsRatio()

double com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.getCheapestInsertionLsOperatorNeighborsRatio ( )
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).

double cheapest_insertion_ls_operator_neighbors_ratio = 31;

Returns
The cheapestInsertionLsOperatorNeighborsRatio.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getChristofidesUseMinimumMatching()

boolean com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.getChristofidesUseMinimumMatching ( )
If true use minimum matching instead of minimal matching in the
Christofides algorithm.

bool christofides_use_minimum_matching = 30;

Returns
The christofidesUseMinimumMatching.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getContinuousSchedulingSolver()

com.google.ortools.constraintsolver.RoutingSearchParameters.SchedulingSolver com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.getContinuousSchedulingSolver ( )

.operations_research.RoutingSearchParameters.SchedulingSolver continuous_scheduling_solver = 33;

Returns
The continuousSchedulingSolver.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getContinuousSchedulingSolverValue()

int com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.getContinuousSchedulingSolverValue ( )

.operations_research.RoutingSearchParameters.SchedulingSolver continuous_scheduling_solver = 33;

Returns
The enum numeric value on the wire for continuousSchedulingSolver.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getDisableSchedulingBewareThisMayDegradePerformance()

boolean com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.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;

Returns
The disableSchedulingBewareThisMayDegradePerformance.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getFallbackToCpSatSizeThreshold()

int com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.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;

Returns
The fallbackToCpSatSizeThreshold.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getFirstSolutionOptimizationPeriod()

int com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.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;

Returns
The firstSolutionOptimizationPeriod.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getFirstSolutionStrategy()

com.google.ortools.constraintsolver.FirstSolutionStrategy.Value com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.getFirstSolutionStrategy ( )
First solution strategies, used as starting point of local search.

.operations_research.FirstSolutionStrategy.Value first_solution_strategy = 1;

Returns
The firstSolutionStrategy.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getFirstSolutionStrategyValue()

int com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.getFirstSolutionStrategyValue ( )
First solution strategies, used as starting point of local search.

.operations_research.FirstSolutionStrategy.Value first_solution_strategy = 1;

Returns
The enum numeric value on the wire for firstSolutionStrategy.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getGuidedLocalSearchLambdaCoefficient()

double com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.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;

Returns
The guidedLocalSearchLambdaCoefficient.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getGuidedLocalSearchResetPenaltiesOnNewBestSolution()

boolean com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.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;

Returns
The guidedLocalSearchResetPenaltiesOnNewBestSolution.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getHeuristicCloseNodesLnsNumNodes()

int com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.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;

Returns
The heuristicCloseNodesLnsNumNodes.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getHeuristicExpensiveChainLnsNumArcsToConsider()

int com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.getHeuristicExpensiveChainLnsNumArcsToConsider ( )
Number of expensive arcs to consider cutting in the
FilteredHeuristicExpensiveChainLNSOperator operator.

int32 heuristic_expensive_chain_lns_num_arcs_to_consider = 32;

Returns
The heuristicExpensiveChainLnsNumArcsToConsider.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getImprovementLimitParameters()

com.google.ortools.constraintsolver.RoutingSearchParameters.ImprovementSearchLimitParameters com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.getImprovementLimitParameters ( )
The improvement search limit is added to the solver if the following
parameters are set.

.operations_research.RoutingSearchParameters.ImprovementSearchLimitParameters improvement_limit_parameters = 37;

Returns
The improvementLimitParameters.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getImprovementLimitParametersOrBuilder()

com.google.ortools.constraintsolver.RoutingSearchParameters.ImprovementSearchLimitParametersOrBuilder com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.getImprovementLimitParametersOrBuilder ( )
The improvement search limit is added to the solver if the following
parameters are set.

.operations_research.RoutingSearchParameters.ImprovementSearchLimitParameters improvement_limit_parameters = 37;

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getIteratedLocalSearchParameters()

operations_research.RoutingIls.IteratedLocalSearchParameters com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.getIteratedLocalSearchParameters ( )
Iterated Local Search parameters.

.operations_research.IteratedLocalSearchParameters iterated_local_search_parameters = 60;

Returns
The iteratedLocalSearchParameters.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getIteratedLocalSearchParametersOrBuilder()

operations_research.RoutingIls.IteratedLocalSearchParametersOrBuilder com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.getIteratedLocalSearchParametersOrBuilder ( )
Iterated Local Search parameters.

.operations_research.IteratedLocalSearchParameters iterated_local_search_parameters = 60;

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getLnsTimeLimit()

com.google.protobuf.Duration com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.getLnsTimeLimit ( )
Limit to the time spent in the completion search for each local search
neighbor.

.google.protobuf.Duration lns_time_limit = 10;

Returns
The lnsTimeLimit.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getLnsTimeLimitOrBuilder()

com.google.protobuf.DurationOrBuilder com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.getLnsTimeLimitOrBuilder ( )
Limit to the time spent in the completion search for each local search
neighbor.

.google.protobuf.Duration lns_time_limit = 10;

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getLocalCheapestCostInsertionPickupDeliveryStrategy()

com.google.ortools.constraintsolver.RoutingSearchParameters.PairInsertionStrategy com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.getLocalCheapestCostInsertionPickupDeliveryStrategy ( )
Choice of insertion strategy for pickup/delivery pairs, used in local
cheapest cost insertion, both first solution heuristic and LNS.

.operations_research.RoutingSearchParameters.PairInsertionStrategy local_cheapest_cost_insertion_pickup_delivery_strategy = 55;

Returns
The localCheapestCostInsertionPickupDeliveryStrategy.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getLocalCheapestCostInsertionPickupDeliveryStrategyValue()

int com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.getLocalCheapestCostInsertionPickupDeliveryStrategyValue ( )
Choice of insertion strategy for pickup/delivery pairs, used in local
cheapest cost insertion, both first solution heuristic and LNS.

.operations_research.RoutingSearchParameters.PairInsertionStrategy local_cheapest_cost_insertion_pickup_delivery_strategy = 55;

Returns
The enum numeric value on the wire for localCheapestCostInsertionPickupDeliveryStrategy.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getLocalCheapestInsertionPickupDeliveryStrategy()

com.google.ortools.constraintsolver.RoutingSearchParameters.PairInsertionStrategy com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.getLocalCheapestInsertionPickupDeliveryStrategy ( )
Choice of insertion strategy for pickup/delivery pairs, used in local
cheapest insertion, both first solution heuristic and LNS.

.operations_research.RoutingSearchParameters.PairInsertionStrategy local_cheapest_insertion_pickup_delivery_strategy = 49;

Returns
The localCheapestInsertionPickupDeliveryStrategy.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getLocalCheapestInsertionPickupDeliveryStrategyValue()

int com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.getLocalCheapestInsertionPickupDeliveryStrategyValue ( )
Choice of insertion strategy for pickup/delivery pairs, used in local
cheapest insertion, both first solution heuristic and LNS.

.operations_research.RoutingSearchParameters.PairInsertionStrategy local_cheapest_insertion_pickup_delivery_strategy = 49;

Returns
The enum numeric value on the wire for localCheapestInsertionPickupDeliveryStrategy.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getLocalSearchMetaheuristic()

com.google.ortools.constraintsolver.LocalSearchMetaheuristic.Value com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.getLocalSearchMetaheuristic ( )
Local search metaheuristics used to guide the search.

.operations_research.LocalSearchMetaheuristic.Value local_search_metaheuristic = 4;

Returns
The localSearchMetaheuristic.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getLocalSearchMetaheuristicValue()

int com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.getLocalSearchMetaheuristicValue ( )
Local search metaheuristics used to guide the search.

.operations_research.LocalSearchMetaheuristic.Value local_search_metaheuristic = 4;

Returns
The enum numeric value on the wire for localSearchMetaheuristic.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getLocalSearchOperators()

com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.getLocalSearchOperators ( )

.operations_research.RoutingSearchParameters.LocalSearchNeighborhoodOperators local_search_operators = 3;

Returns
The localSearchOperators.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getLocalSearchOperatorsOrBuilder()

com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.getLocalSearchOperatorsOrBuilder ( )

.operations_research.RoutingSearchParameters.LocalSearchNeighborhoodOperators local_search_operators = 3;

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getLogCostOffset()

double com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.getLogCostOffset ( )

◆ getLogCostScalingFactor()

double com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.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;

Returns
The logCostScalingFactor.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getLogSearch()

boolean com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.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;

Returns
The logSearch.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getLogTag()

java.lang.String com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.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;

Returns
The logTag.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getLogTagBytes()

com.google.protobuf.ByteString com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.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;

Returns
The bytes for logTag.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getLsOperatorMinNeighbors()

int com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.getLsOperatorMinNeighbors ( )

int32 ls_operator_min_neighbors = 54;

Returns
The lsOperatorMinNeighbors.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getLsOperatorNeighborsRatio()

double com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.getLsOperatorNeighborsRatio ( )
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).

double ls_operator_neighbors_ratio = 53;

Returns
The lsOperatorNeighborsRatio.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getMixedIntegerSchedulingSolver()

com.google.ortools.constraintsolver.RoutingSearchParameters.SchedulingSolver com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.getMixedIntegerSchedulingSolver ( )

.operations_research.RoutingSearchParameters.SchedulingSolver mixed_integer_scheduling_solver = 34;

Returns
The mixedIntegerSchedulingSolver.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getMixedIntegerSchedulingSolverValue()

int com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.getMixedIntegerSchedulingSolverValue ( )

.operations_research.RoutingSearchParameters.SchedulingSolver mixed_integer_scheduling_solver = 34;

Returns
The enum numeric value on the wire for mixedIntegerSchedulingSolver.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getMultiArmedBanditCompoundOperatorExplorationCoefficient()

double com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.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;

Returns
The multiArmedBanditCompoundOperatorExplorationCoefficient.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getMultiArmedBanditCompoundOperatorMemoryCoefficient()

double com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.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;

Returns
The multiArmedBanditCompoundOperatorMemoryCoefficient.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getNumberOfSolutionsToCollect()

int com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.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;

Returns
The numberOfSolutionsToCollect.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getOptimizationStep()

double com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.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;

Returns
The optimizationStep.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getRelocateExpensiveChainNumArcsToConsider()

int com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.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;

Returns
The relocateExpensiveChainNumArcsToConsider.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getReportIntermediateCpSatSolutions()

boolean com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.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;

Returns
The reportIntermediateCpSatSolutions.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getSatParameters()

com.google.ortools.sat.SatParameters com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.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;

Returns
The satParameters.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getSatParametersOrBuilder()

com.google.ortools.sat.SatParametersOrBuilder com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.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;

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getSavingsAddReverseArcs()

boolean com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.getSavingsAddReverseArcs ( )
Add savings related to reverse arcs when finding the nearest neighbors
of the nodes.

bool savings_add_reverse_arcs = 15;

Returns
The savingsAddReverseArcs.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getSavingsArcCoefficient()

double com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.getSavingsArcCoefficient ( )
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.

double savings_arc_coefficient = 18;

Returns
The savingsArcCoefficient.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getSavingsMaxMemoryUsageBytes()

double com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.getSavingsMaxMemoryUsageBytes ( )
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].
NOTE: If both savings_neighbors_ratio and savings_max_memory_usage_bytes
are specified, the number of neighbors considered for each node will be the
minimum of the two numbers determined by these parameters.

double savings_max_memory_usage_bytes = 23;

Returns
The savingsMaxMemoryUsageBytes.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getSavingsNeighborsRatio()

double com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.getSavingsNeighborsRatio ( )
Parameters specific to the Savings first solution heuristic.
Ratio (in ]0, 1]) of neighbors to consider for each node when constructing
the savings. If unspecified, its value is considered to be 1.0.

double savings_neighbors_ratio = 14;

Returns
The savingsNeighborsRatio.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getSavingsParallelRoutes()

boolean com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.getSavingsParallelRoutes ( )
When true, the routes are built in parallel, sequentially otherwise.

bool savings_parallel_routes = 19;

Returns
The savingsParallelRoutes.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getSecondaryLsTimeLimitRatio()

double com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.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;

Returns
The secondaryLsTimeLimitRatio.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getSolutionLimit()

long com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.getSolutionLimit ( )
-- Search limits --
Limit to the number of solutions generated during the search. 0 means
"unspecified".

int64 solution_limit = 8;

Returns
The solutionLimit.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getTimeLimit()

com.google.protobuf.Duration com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.getTimeLimit ( )
Limit to the time spent in the search.

.google.protobuf.Duration time_limit = 9;

Returns
The timeLimit.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getTimeLimitOrBuilder()

com.google.protobuf.DurationOrBuilder com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.getTimeLimitOrBuilder ( )
Limit to the time spent in the search.

.google.protobuf.Duration time_limit = 9;

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getUseCp()

com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.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;

Returns
The useCp.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getUseCpSat()

com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.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;

Returns
The useCpSat.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getUseCpSatValue()

int com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.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;

Returns
The enum numeric value on the wire for useCpSat.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getUseCpValue()

int com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.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;

Returns
The enum numeric value on the wire for useCp.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getUseDepthFirstSearch()

boolean com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.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;

Returns
The useDepthFirstSearch.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getUseFullPropagation()

boolean com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.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;

Returns
The useFullPropagation.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getUseGeneralizedCpSat()

com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.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;

Returns
The useGeneralizedCpSat.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getUseGeneralizedCpSatValue()

int com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.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;

Returns
The enum numeric value on the wire for useGeneralizedCpSat.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getUseIteratedLocalSearch()

boolean com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.getUseIteratedLocalSearch ( )
Whether the solver should use an Iterated Local Search approach to solve
the problem.

bool use_iterated_local_search = 58;

Returns
The useIteratedLocalSearch.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getUseMultiArmedBanditConcatenateOperators()

boolean com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.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;

Returns
The useMultiArmedBanditConcatenateOperators.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ getUseUnfilteredFirstSolutionStrategy()

boolean com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.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;

Returns
The useUnfilteredFirstSolutionStrategy.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ hasDisableSchedulingBewareThisMayDegradePerformance()

boolean com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.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;

Returns
Whether the disableSchedulingBewareThisMayDegradePerformance field is set.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ hasImprovementLimitParameters()

boolean com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.hasImprovementLimitParameters ( )
The improvement search limit is added to the solver if the following
parameters are set.

.operations_research.RoutingSearchParameters.ImprovementSearchLimitParameters improvement_limit_parameters = 37;

Returns
Whether the improvementLimitParameters field is set.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ hasIteratedLocalSearchParameters()

boolean com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.hasIteratedLocalSearchParameters ( )
Iterated Local Search parameters.

.operations_research.IteratedLocalSearchParameters iterated_local_search_parameters = 60;

Returns
Whether the iteratedLocalSearchParameters field is set.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ hasLnsTimeLimit()

boolean com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.hasLnsTimeLimit ( )
Limit to the time spent in the completion search for each local search
neighbor.

.google.protobuf.Duration lns_time_limit = 10;

Returns
Whether the lnsTimeLimit field is set.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ hasLocalSearchOperators()

boolean com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.hasLocalSearchOperators ( )

.operations_research.RoutingSearchParameters.LocalSearchNeighborhoodOperators local_search_operators = 3;

Returns
Whether the localSearchOperators field is set.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ hasSatParameters()

boolean com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.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;

Returns
Whether the satParameters field is set.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.

◆ hasTimeLimit()

boolean com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.hasTimeLimit ( )
Limit to the time spent in the search.

.google.protobuf.Duration time_limit = 9;

Returns
Whether the timeLimit field is set.

Implemented in com.google.ortools.constraintsolver.RoutingSearchParameters, and com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.


The documentation for this interface was generated from the following file: