Google OR-Tools v9.9
a fast and portable software suite for combinatorial optimization
|
Static Public Member Functions | |
static final com.google.protobuf.Descriptors.Descriptor | getDescriptor () |
Protected Member Functions | |
com.google.protobuf.GeneratedMessageV3.FieldAccessorTable | internalGetFieldAccessorTable () |
Parameters defining the search used to solve vehicle routing problems. If a parameter is unset (or, equivalently, set to its default value), then the routing library will pick its preferred value for that parameter automatically: this should be the case for most parameters. To see those "default" parameters, call GetDefaultRoutingSearchParameters(). Next ID: 61
Protobuf type operations_research.RoutingSearchParameters
Definition at line 9922 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.addRepeatedField | ( | com.google.protobuf.Descriptors.FieldDescriptor | field, |
java.lang.Object | value ) |
Definition at line 10295 of file RoutingSearchParameters.java.
com.google.ortools.constraintsolver.RoutingSearchParameters com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.build | ( | ) |
Definition at line 10058 of file RoutingSearchParameters.java.
com.google.ortools.constraintsolver.RoutingSearchParameters com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.buildPartial | ( | ) |
Definition at line 10067 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.clear | ( | ) |
Definition at line 9961 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.clearCheapestInsertionAddUnperformedEntries | ( | ) |
Whether or not to consider entries making the nodes/pairs unperformed in the GlobalCheapestInsertion heuristic.
bool cheapest_insertion_add_unperformed_entries = 40;
Definition at line 11524 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.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.
double cheapest_insertion_farthest_seeds_ratio = 16;
Definition at line 11227 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.clearCheapestInsertionFirstSolutionMinNeighbors | ( | ) |
int32 cheapest_insertion_first_solution_min_neighbors = 44;
Definition at line 11345 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.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. 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;
Definition at line 11313 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.clearCheapestInsertionFirstSolutionUseNeighborsRatioForInitialization | ( | ) |
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;
Definition at line 11477 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.clearCheapestInsertionLsOperatorMinNeighbors | ( | ) |
int32 cheapest_insertion_ls_operator_min_neighbors = 45;
Definition at line 11430 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.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).
double cheapest_insertion_ls_operator_neighbors_ratio = 31;
Definition at line 11398 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.clearChristofidesUseMinimumMatching | ( | ) |
If true use minimum matching instead of minimal matching in the Christofides algorithm.
bool christofides_use_minimum_matching = 30;
Definition at line 11727 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.clearContinuousSchedulingSolver | ( | ) |
.operations_research.RoutingSearchParameters.SchedulingSolver continuous_scheduling_solver = 33;
Definition at line 13099 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.clearDisableSchedulingBewareThisMayDegradePerformance | ( | ) |
Setting this to true completely disables the LP and MIP scheduling in the solver. This overrides the 2 SchedulingSolver options above.
optional bool disable_scheduling_beware_this_may_degrade_performance = 50;
Definition at line 13212 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.clearFallbackToCpSatSizeThreshold | ( | ) |
If model.Size() is less than the threshold and that no solution has been found, attempt a pass with CP-SAT.
int32 fallback_to_cp_sat_size_threshold = 52;
Definition at line 13046 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.clearField | ( | com.google.protobuf.Descriptors.FieldDescriptor | field | ) |
Definition at line 10279 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.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. 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;
Definition at line 11789 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.clearFirstSolutionStrategy | ( | ) |
First solution strategies, used as starting point of local search.
.operations_research.FirstSolutionStrategy.Value first_solution_strategy = 1;
Definition at line 10868 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.clearGuidedLocalSearchLambdaCoefficient | ( | ) |
These are advanced settings which should not be modified unless you know what you are doing. Lambda coefficient used to penalize arc costs when GUIDED_LOCAL_SEARCH is used. Must be positive.
double guided_local_search_lambda_coefficient = 5;
Definition at line 12427 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.clearGuidedLocalSearchResetPenaltiesOnNewBestSolution | ( | ) |
Whether to reset penalties when a new best solution is found. The effect is that a greedy descent is started before the next penalization phase.
bool guided_local_search_reset_penalties_on_new_best_solution = 51;
Definition at line 12474 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.clearHeuristicCloseNodesLnsNumNodes | ( | ) |
Number of closest nodes to consider for each node during the destruction phase of the FilteredHeuristicCloseNodesLNSOperator.
int32 heuristic_close_nodes_lns_num_nodes = 35;
Definition at line 12301 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.clearHeuristicExpensiveChainLnsNumArcsToConsider | ( | ) |
Number of expensive arcs to consider cutting in the FilteredHeuristicExpensiveChainLNSOperator operator.
int32 heuristic_expensive_chain_lns_num_arcs_to_consider = 32;
Definition at line 12254 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.clearImprovementLimitParameters | ( | ) |
The improvement search limit is added to the solver if the following parameters are set.
.operations_research.RoutingSearchParameters.ImprovementSearchLimitParameters improvement_limit_parameters = 37;
Definition at line 13853 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.clearIteratedLocalSearchParameters | ( | ) |
Iterated Local Search parameters.
.operations_research.IteratedLocalSearchParameters iterated_local_search_parameters = 60;
Definition at line 14387 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.clearLnsTimeLimit | ( | ) |
Limit to the time spent in the completion search for each local search neighbor.
.google.protobuf.Duration lns_time_limit = 10;
Definition at line 13628 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.clearLocalCheapestCostInsertionPickupDeliveryStrategy | ( | ) |
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;
Definition at line 11680 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.clearLocalCheapestInsertionPickupDeliveryStrategy | ( | ) |
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;
Definition at line 11602 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.clearLocalSearchMetaheuristic | ( | ) |
Local search metaheuristics used to guide the search.
.operations_research.LocalSearchMetaheuristic.Value local_search_metaheuristic = 4;
Definition at line 12374 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.clearLocalSearchOperators | ( | ) |
.operations_research.RoutingSearchParameters.LocalSearchNeighborhoodOperators local_search_operators = 3;
Definition at line 11871 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.clearLogCostOffset | ( | ) |
double log_cost_offset = 29;
Definition at line 14137 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.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;
Definition at line 14105 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.clearLogSearch | ( | ) |
--- Miscellaneous --- Some of these are advanced settings which should not be modified unless you know what you are doing. Activates search logging. For each solution found during the search, the following will be displayed: its objective value, the maximum objective value since the beginning of the search, the elapsed time since the beginning of the search, the number of branches explored in the search tree, the number of failures in the search tree, the depth of the search tree, the number of local search neighbors explored, the number of local search neighbors filtered by local search filters, the number of local search neighbors accepted, the total memory used and the percentage of the search done.
bool log_search = 13;
Definition at line 14058 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.clearLogTag | ( | ) |
In logs, this tag will be appended to each line corresponding to a new solution. Useful to sort out logs when several solves are run in parallel.
string log_tag = 36;
Definition at line 14215 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.clearLsOperatorMinNeighbors | ( | ) |
int32 ls_operator_min_neighbors = 54;
Definition at line 11992 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.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).
double ls_operator_neighbors_ratio = 53;
Definition at line 11960 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.clearMixedIntegerSchedulingSolver | ( | ) |
.operations_research.RoutingSearchParameters.SchedulingSolver mixed_integer_scheduling_solver = 34;
Definition at line 13152 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.clearMultiArmedBanditCompoundOperatorExplorationCoefficient | ( | ) |
Positive parameter defining the exploration coefficient of the multi-armed bandit compound operator. Sets how often we explore rarely used and unsuccessful in the past operators
double multi_armed_bandit_compound_operator_exploration_coefficient = 43;
Definition at line 12145 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.clearMultiArmedBanditCompoundOperatorMemoryCoefficient | ( | ) |
Memory coefficient related to the multi-armed bandit compound operator. Sets how much the objective improvement of previous accepted neighbors influence the current average improvement. This parameter should be between 0 and 1.
double multi_armed_bandit_compound_operator_memory_coefficient = 42;
Definition at line 12095 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.clearNumberOfSolutionsToCollect | ( | ) |
Number of solutions to collect during the search. Corresponds to the best solutions found during the search. 0 means "unspecified".
int32 number_of_solutions_to_collect = 17;
Definition at line 13309 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.clearOneof | ( | com.google.protobuf.Descriptors.OneofDescriptor | oneof | ) |
Definition at line 10284 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.clearOptimizationStep | ( | ) |
Minimum step by which the solution must be improved in local search. 0 means "unspecified". If this value is fractional, it will get rounded to the nearest integer.
double optimization_step = 7;
Definition at line 13262 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.clearRelocateExpensiveChainNumArcsToConsider | ( | ) |
Number of expensive arcs to consider cutting in the RelocateExpensiveChain neighborhood operator (see LocalSearchNeighborhoodOperators.use_relocate_expensive_chain()). This parameter must be greater than 2. NOTE(user): The number of neighbors generated by the operator for relocate_expensive_chain_num_arcs_to_consider = K is around K*(K-1)/2 * number_of_routes * number_of_nodes.
int32 relocate_expensive_chain_num_arcs_to_consider = 20;
Definition at line 12207 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.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.
bool report_intermediate_cp_sat_solutions = 56;
Definition at line 12999 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.clearSatParameters | ( | ) |
If use_cp_sat or use_generalized_cp_sat is true, contains the SAT algorithm parameters which will be used.
.operations_research.sat.SatParameters sat_parameters = 48;
Definition at line 12898 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.clearSavingsAddReverseArcs | ( | ) |
Add savings related to reverse arcs when finding the nearest neighbors of the nodes.
bool savings_add_reverse_arcs = 15;
Definition at line 11077 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.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.
double savings_arc_coefficient = 18;
Definition at line 11133 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.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]. 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;
Definition at line 11030 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.clearSavingsNeighborsRatio | ( | ) |
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;
Definition at line 10971 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.clearSavingsParallelRoutes | ( | ) |
When true, the routes are built in parallel, sequentially otherwise.
bool savings_parallel_routes = 19;
Definition at line 11177 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.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. 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;
Definition at line 13741 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.clearSolutionLimit | ( | ) |
-- Search limits -- Limit to the number of solutions generated during the search. 0 means "unspecified".
int64 solution_limit = 8;
Definition at line 13359 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.clearTimeLimit | ( | ) |
Limit to the time spent in the search.
.google.protobuf.Duration time_limit = 9;
Definition at line 13465 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.clearUseCp | ( | ) |
If true, use the CP solver to find a solution. Either local or depth-first search will be used depending on the value of use_depth_first_search. Will be run before the CP-SAT solver (cf. use_cp_sat).
.operations_research.OptionalBoolean use_cp = 28;
Definition at line 12610 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.clearUseCpSat | ( | ) |
If true, use the CP-SAT solver to find a solution. If use_cp is also true, the CP-SAT solver will be run after the CP solver if there is time remaining and will use the CP solution as a hint for the CP-SAT search. As of 5/2019, only TSP models can be solved.
.operations_research.OptionalBoolean use_cp_sat = 27;
Definition at line 12698 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.clearUseDepthFirstSearch | ( | ) |
--- Search control --- If true, the solver should use depth-first search rather than local search to solve the problem.
bool use_depth_first_search = 6;
Definition at line 12527 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.clearUseFullPropagation | ( | ) |
--- Propagation control --- These are advanced settings which should not be modified unless you know what you are doing. Use constraints with full propagation in routing model (instead of 'light' propagation only). Full propagation is only necessary when using depth-first search or for models which require strong propagation to finalize the value of secondary variables. Changing this setting to true will slow down the search in most cases and increase memory consumption in all cases.
bool use_full_propagation = 11;
Definition at line 13978 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.clearUseGeneralizedCpSat | ( | ) |
If true, use the CP-SAT solver to find a solution on generalized routing model. If use_cp is also true, the CP-SAT solver will be run after the CP solver if there is time remaining and will use the CP solution as a hint for the CP-SAT search.
.operations_research.OptionalBoolean use_generalized_cp_sat = 47;
Definition at line 12786 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.clearUseIteratedLocalSearch | ( | ) |
Whether the solver should use an Iterated Local Search approach to solve the problem.
bool use_iterated_local_search = 58;
Definition at line 14281 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.clearUseMultiArmedBanditConcatenateOperators | ( | ) |
If true, the solver will use multi-armed bandit concatenate operators. It dynamically chooses the next neighbor operator in order to get the best objective improvement.
bool use_multi_armed_bandit_concatenate_operators = 41;
Definition at line 12042 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.clearUseUnfilteredFirstSolutionStrategy | ( | ) |
--- Advanced first solutions strategy settings --- Don't touch these unless you know what you are doing. Use filtered version of first solution strategy if available.
bool use_unfiltered_first_solution_strategy = 2;
Definition at line 10921 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.clone | ( | ) |
Definition at line 10269 of file RoutingSearchParameters.java.
boolean com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.getCheapestInsertionAddUnperformedEntries | ( | ) |
Whether or not to consider entries making the nodes/pairs unperformed in the GlobalCheapestInsertion heuristic.
bool cheapest_insertion_add_unperformed_entries = 40;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 11495 of file RoutingSearchParameters.java.
double com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.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;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 11196 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.getCheapestInsertionFirstSolutionMinNeighbors | ( | ) |
int32 cheapest_insertion_first_solution_min_neighbors = 44;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 11326 of file RoutingSearchParameters.java.
double com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.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;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 11258 of file RoutingSearchParameters.java.
boolean com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.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;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 11448 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.getCheapestInsertionLsOperatorMinNeighbors | ( | ) |
int32 cheapest_insertion_ls_operator_min_neighbors = 45;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 11411 of file RoutingSearchParameters.java.
double com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.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;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 11365 of file RoutingSearchParameters.java.
boolean com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.getChristofidesUseMinimumMatching | ( | ) |
If true use minimum matching instead of minimal matching in the Christofides algorithm.
bool christofides_use_minimum_matching = 30;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 11698 of file RoutingSearchParameters.java.
com.google.ortools.constraintsolver.RoutingSearchParameters.SchedulingSolver com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.getContinuousSchedulingSolver | ( | ) |
.operations_research.RoutingSearchParameters.SchedulingSolver continuous_scheduling_solver = 33;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 13077 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.getContinuousSchedulingSolverValue | ( | ) |
.operations_research.RoutingSearchParameters.SchedulingSolver continuous_scheduling_solver = 33;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 13058 of file RoutingSearchParameters.java.
com.google.ortools.constraintsolver.RoutingSearchParameters com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.getDefaultInstanceForType | ( | ) |
Definition at line 10053 of file RoutingSearchParameters.java.
|
static |
Definition at line 9927 of file RoutingSearchParameters.java.
com.google.protobuf.Descriptors.Descriptor com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.getDescriptorForType | ( | ) |
Definition at line 10048 of file RoutingSearchParameters.java.
boolean com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.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;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 13183 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.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;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 13017 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.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;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 11750 of file RoutingSearchParameters.java.
com.google.ortools.constraintsolver.FirstSolutionStrategy.Value com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.getFirstSolutionStrategy | ( | ) |
First solution strategies, used as starting point of local search.
.operations_research.FirstSolutionStrategy.Value first_solution_strategy = 1;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 10838 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.getFirstSolutionStrategyValue | ( | ) |
First solution strategies, used as starting point of local search.
.operations_research.FirstSolutionStrategy.Value first_solution_strategy = 1;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 10811 of file RoutingSearchParameters.java.
double com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.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;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 12394 of file RoutingSearchParameters.java.
boolean com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.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;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 12445 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.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;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 12272 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.getHeuristicExpensiveChainLnsNumArcsToConsider | ( | ) |
Number of expensive arcs to consider cutting in the FilteredHeuristicExpensiveChainLNSOperator operator.
int32 heuristic_expensive_chain_lns_num_arcs_to_consider = 32;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 12225 of file RoutingSearchParameters.java.
com.google.ortools.constraintsolver.RoutingSearchParameters.ImprovementSearchLimitParameters com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.getImprovementLimitParameters | ( | ) |
The improvement search limit is added to the solver if the following parameters are set.
.operations_research.RoutingSearchParameters.ImprovementSearchLimitParameters improvement_limit_parameters = 37;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 13772 of file RoutingSearchParameters.java.
com.google.ortools.constraintsolver.RoutingSearchParameters.ImprovementSearchLimitParameters.Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.getImprovementLimitParametersBuilder | ( | ) |
The improvement search limit is added to the solver if the following parameters are set.
.operations_research.RoutingSearchParameters.ImprovementSearchLimitParameters improvement_limit_parameters = 37;
Definition at line 13871 of file RoutingSearchParameters.java.
com.google.ortools.constraintsolver.RoutingSearchParameters.ImprovementSearchLimitParametersOrBuilder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.getImprovementLimitParametersOrBuilder | ( | ) |
The improvement search limit is added to the solver if the following parameters are set.
.operations_research.RoutingSearchParameters.ImprovementSearchLimitParameters improvement_limit_parameters = 37;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 13884 of file RoutingSearchParameters.java.
operations_research.RoutingIls.IteratedLocalSearchParameters com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.getIteratedLocalSearchParameters | ( | ) |
Iterated Local Search parameters.
.operations_research.IteratedLocalSearchParameters iterated_local_search_parameters = 60;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 14310 of file RoutingSearchParameters.java.
operations_research.RoutingIls.IteratedLocalSearchParameters.Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.getIteratedLocalSearchParametersBuilder | ( | ) |
Iterated Local Search parameters.
.operations_research.IteratedLocalSearchParameters iterated_local_search_parameters = 60;
Definition at line 14404 of file RoutingSearchParameters.java.
operations_research.RoutingIls.IteratedLocalSearchParametersOrBuilder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.getIteratedLocalSearchParametersOrBuilder | ( | ) |
Iterated Local Search parameters.
.operations_research.IteratedLocalSearchParameters iterated_local_search_parameters = 60;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 14416 of file RoutingSearchParameters.java.
com.google.protobuf.Duration com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.getLnsTimeLimit | ( | ) |
Limit to the time spent in the completion search for each local search neighbor.
.google.protobuf.Duration lns_time_limit = 10;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 13547 of file RoutingSearchParameters.java.
com.google.protobuf.Duration.Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.getLnsTimeLimitBuilder | ( | ) |
Limit to the time spent in the completion search for each local search neighbor.
.google.protobuf.Duration lns_time_limit = 10;
Definition at line 13646 of file RoutingSearchParameters.java.
com.google.protobuf.DurationOrBuilder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.getLnsTimeLimitOrBuilder | ( | ) |
Limit to the time spent in the completion search for each local search neighbor.
.google.protobuf.Duration lns_time_limit = 10;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 13659 of file RoutingSearchParameters.java.
com.google.ortools.constraintsolver.RoutingSearchParameters.PairInsertionStrategy com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.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;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 11648 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.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;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 11619 of file RoutingSearchParameters.java.
com.google.ortools.constraintsolver.RoutingSearchParameters.PairInsertionStrategy com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.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;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 11570 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.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;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 11541 of file RoutingSearchParameters.java.
com.google.ortools.constraintsolver.LocalSearchMetaheuristic.Value com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.getLocalSearchMetaheuristic | ( | ) |
Local search metaheuristics used to guide the search.
.operations_research.LocalSearchMetaheuristic.Value local_search_metaheuristic = 4;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 12344 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.getLocalSearchMetaheuristicValue | ( | ) |
Local search metaheuristics used to guide the search.
.operations_research.LocalSearchMetaheuristic.Value local_search_metaheuristic = 4;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 12317 of file RoutingSearchParameters.java.
com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.getLocalSearchOperators | ( | ) |
.operations_research.RoutingSearchParameters.LocalSearchNeighborhoodOperators local_search_operators = 3;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 11810 of file RoutingSearchParameters.java.
com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.getLocalSearchOperatorsBuilder | ( | ) |
.operations_research.RoutingSearchParameters.LocalSearchNeighborhoodOperators local_search_operators = 3;
Definition at line 11884 of file RoutingSearchParameters.java.
com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.getLocalSearchOperatorsOrBuilder | ( | ) |
.operations_research.RoutingSearchParameters.LocalSearchNeighborhoodOperators local_search_operators = 3;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 11892 of file RoutingSearchParameters.java.
double com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.getLogCostOffset | ( | ) |
double log_cost_offset = 29;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 14118 of file RoutingSearchParameters.java.
double com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.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;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 14076 of file RoutingSearchParameters.java.
boolean com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.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;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 14007 of file RoutingSearchParameters.java.
java.lang.String com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.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;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 14154 of file RoutingSearchParameters.java.
com.google.protobuf.ByteString com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.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;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 14176 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.getLsOperatorMinNeighbors | ( | ) |
int32 ls_operator_min_neighbors = 54;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 11973 of file RoutingSearchParameters.java.
double com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.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;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 11929 of file RoutingSearchParameters.java.
com.google.ortools.constraintsolver.RoutingSearchParameters.SchedulingSolver com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.getMixedIntegerSchedulingSolver | ( | ) |
.operations_research.RoutingSearchParameters.SchedulingSolver mixed_integer_scheduling_solver = 34;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 13130 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.getMixedIntegerSchedulingSolverValue | ( | ) |
.operations_research.RoutingSearchParameters.SchedulingSolver mixed_integer_scheduling_solver = 34;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 13111 of file RoutingSearchParameters.java.
double com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.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;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 12114 of file RoutingSearchParameters.java.
double com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.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;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 12062 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.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;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 13280 of file RoutingSearchParameters.java.
double com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.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;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 13231 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.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;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 12168 of file RoutingSearchParameters.java.
boolean com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.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;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 12970 of file RoutingSearchParameters.java.
com.google.ortools.sat.SatParameters com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.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;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 12817 of file RoutingSearchParameters.java.
com.google.ortools.sat.SatParameters.Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.getSatParametersBuilder | ( | ) |
If use_cp_sat or use_generalized_cp_sat is true, contains the SAT algorithm parameters which will be used.
.operations_research.sat.SatParameters sat_parameters = 48;
Definition at line 12916 of file RoutingSearchParameters.java.
com.google.ortools.sat.SatParametersOrBuilder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.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;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 12929 of file RoutingSearchParameters.java.
boolean com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.getSavingsAddReverseArcs | ( | ) |
Add savings related to reverse arcs when finding the nearest neighbors of the nodes.
bool savings_add_reverse_arcs = 15;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 11048 of file RoutingSearchParameters.java.
double com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.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;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 11098 of file RoutingSearchParameters.java.
double com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.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;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 10993 of file RoutingSearchParameters.java.
double com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.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;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 10940 of file RoutingSearchParameters.java.
boolean com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.getSavingsParallelRoutes | ( | ) |
When true, the routes are built in parallel, sequentially otherwise.
bool savings_parallel_routes = 19;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 11150 of file RoutingSearchParameters.java.
double com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.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;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 13704 of file RoutingSearchParameters.java.
long com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.getSolutionLimit | ( | ) |
-- Search limits -- Limit to the number of solutions generated during the search. 0 means "unspecified".
int64 solution_limit = 8;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 13328 of file RoutingSearchParameters.java.
com.google.protobuf.Duration com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.getTimeLimit | ( | ) |
Limit to the time spent in the search.
.google.protobuf.Duration time_limit = 9;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 13388 of file RoutingSearchParameters.java.
com.google.protobuf.Duration.Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.getTimeLimitBuilder | ( | ) |
Limit to the time spent in the search.
.google.protobuf.Duration time_limit = 9;
Definition at line 13482 of file RoutingSearchParameters.java.
com.google.protobuf.DurationOrBuilder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.getTimeLimitOrBuilder | ( | ) |
Limit to the time spent in the search.
.google.protobuf.Duration time_limit = 9;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 13494 of file RoutingSearchParameters.java.
com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.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;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 12576 of file RoutingSearchParameters.java.
com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.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;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 12662 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.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;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 12629 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.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;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 12545 of file RoutingSearchParameters.java.
boolean com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.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;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 12494 of file RoutingSearchParameters.java.
boolean com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.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;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 13933 of file RoutingSearchParameters.java.
com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.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;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 12750 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.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;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 12717 of file RoutingSearchParameters.java.
boolean com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.getUseIteratedLocalSearch | ( | ) |
Whether the solver should use an Iterated Local Search approach to solve the problem.
bool use_iterated_local_search = 58;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 14252 of file RoutingSearchParameters.java.
boolean com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.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;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 12011 of file RoutingSearchParameters.java.
boolean com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.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;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 10888 of file RoutingSearchParameters.java.
boolean com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.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;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 13170 of file RoutingSearchParameters.java.
boolean com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.hasImprovementLimitParameters | ( | ) |
The improvement search limit is added to the solver if the following parameters are set.
.operations_research.RoutingSearchParameters.ImprovementSearchLimitParameters improvement_limit_parameters = 37;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 13760 of file RoutingSearchParameters.java.
boolean com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.hasIteratedLocalSearchParameters | ( | ) |
Iterated Local Search parameters.
.operations_research.IteratedLocalSearchParameters iterated_local_search_parameters = 60;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 14299 of file RoutingSearchParameters.java.
boolean com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.hasLnsTimeLimit | ( | ) |
Limit to the time spent in the completion search for each local search neighbor.
.google.protobuf.Duration lns_time_limit = 10;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 13535 of file RoutingSearchParameters.java.
boolean com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.hasLocalSearchOperators | ( | ) |
.operations_research.RoutingSearchParameters.LocalSearchNeighborhoodOperators local_search_operators = 3;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 11803 of file RoutingSearchParameters.java.
boolean com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.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;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 12805 of file RoutingSearchParameters.java.
boolean com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.hasTimeLimit | ( | ) |
Limit to the time spent in the search.
.google.protobuf.Duration time_limit = 9;
Implements com.google.ortools.constraintsolver.RoutingSearchParametersOrBuilder.
Definition at line 13377 of file RoutingSearchParameters.java.
|
protected |
Definition at line 9933 of file RoutingSearchParameters.java.
final boolean com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.isInitialized | ( | ) |
Definition at line 10482 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.mergeFrom | ( | com.google.ortools.constraintsolver.RoutingSearchParameters | other | ) |
Definition at line 10310 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.mergeFrom | ( | com.google.protobuf.CodedInputStream | input, |
com.google.protobuf.ExtensionRegistryLite | extensionRegistry ) throws java.io.IOException |
Definition at line 10487 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.mergeFrom | ( | com.google.protobuf.Message | other | ) |
Definition at line 10301 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.mergeImprovementLimitParameters | ( | com.google.ortools.constraintsolver.RoutingSearchParameters.ImprovementSearchLimitParameters | value | ) |
The improvement search limit is added to the solver if the following parameters are set.
.operations_research.RoutingSearchParameters.ImprovementSearchLimitParameters improvement_limit_parameters = 37;
Definition at line 13827 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.mergeIteratedLocalSearchParameters | ( | operations_research.RoutingIls.IteratedLocalSearchParameters | value | ) |
Iterated Local Search parameters.
.operations_research.IteratedLocalSearchParameters iterated_local_search_parameters = 60;
Definition at line 14362 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.mergeLnsTimeLimit | ( | com.google.protobuf.Duration | value | ) |
Limit to the time spent in the completion search for each local search neighbor.
.google.protobuf.Duration lns_time_limit = 10;
Definition at line 13602 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.mergeLocalSearchOperators | ( | com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators | value | ) |
.operations_research.RoutingSearchParameters.LocalSearchNeighborhoodOperators local_search_operators = 3;
Definition at line 11850 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.mergeSatParameters | ( | com.google.ortools.sat.SatParameters | value | ) |
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;
Definition at line 12872 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.mergeTimeLimit | ( | com.google.protobuf.Duration | value | ) |
Limit to the time spent in the search.
.google.protobuf.Duration time_limit = 9;
Definition at line 13440 of file RoutingSearchParameters.java.
final Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.mergeUnknownFields | ( | final com.google.protobuf.UnknownFieldSet | unknownFields | ) |
Definition at line 14451 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setCheapestInsertionAddUnperformedEntries | ( | boolean | value | ) |
Whether or not to consider entries making the nodes/pairs unperformed in the GlobalCheapestInsertion heuristic.
bool cheapest_insertion_add_unperformed_entries = 40;
value | The cheapestInsertionAddUnperformedEntries to set. |
Definition at line 11508 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.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.
double cheapest_insertion_farthest_seeds_ratio = 16;
value | The cheapestInsertionFarthestSeedsRatio to set. |
Definition at line 11210 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setCheapestInsertionFirstSolutionMinNeighbors | ( | int | value | ) |
int32 cheapest_insertion_first_solution_min_neighbors = 44;
value | The cheapestInsertionFirstSolutionMinNeighbors to set. |
Definition at line 11334 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.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. 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;
value | The cheapestInsertionFirstSolutionNeighborsRatio to set. |
Definition at line 11284 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setCheapestInsertionFirstSolutionUseNeighborsRatioForInitialization | ( | boolean | value | ) |
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;
value | The cheapestInsertionFirstSolutionUseNeighborsRatioForInitialization to set. |
Definition at line 11461 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setCheapestInsertionLsOperatorMinNeighbors | ( | int | value | ) |
int32 cheapest_insertion_ls_operator_min_neighbors = 45;
value | The cheapestInsertionLsOperatorMinNeighbors to set. |
Definition at line 11419 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.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).
double cheapest_insertion_ls_operator_neighbors_ratio = 31;
value | The cheapestInsertionLsOperatorNeighborsRatio to set. |
Definition at line 11380 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setChristofidesUseMinimumMatching | ( | boolean | value | ) |
If true use minimum matching instead of minimal matching in the Christofides algorithm.
bool christofides_use_minimum_matching = 30;
value | The christofidesUseMinimumMatching to set. |
Definition at line 11711 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setContinuousSchedulingSolver | ( | com.google.ortools.constraintsolver.RoutingSearchParameters.SchedulingSolver | value | ) |
.operations_research.RoutingSearchParameters.SchedulingSolver continuous_scheduling_solver = 33;
value | The continuousSchedulingSolver to set. |
Definition at line 13086 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setContinuousSchedulingSolverValue | ( | int | value | ) |
.operations_research.RoutingSearchParameters.SchedulingSolver continuous_scheduling_solver = 33;
value | The enum numeric value on the wire for continuousSchedulingSolver to set. |
Definition at line 13066 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setDisableSchedulingBewareThisMayDegradePerformance | ( | boolean | value | ) |
Setting this to true completely disables the LP and MIP scheduling in the solver. This overrides the 2 SchedulingSolver options above.
optional bool disable_scheduling_beware_this_may_degrade_performance = 50;
value | The disableSchedulingBewareThisMayDegradePerformance to set. |
Definition at line 13196 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.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.
int32 fallback_to_cp_sat_size_threshold = 52;
value | The fallbackToCpSatSizeThreshold to set. |
Definition at line 13030 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setField | ( | com.google.protobuf.Descriptors.FieldDescriptor | field, |
java.lang.Object | value ) |
Definition at line 10273 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.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. 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;
value | The firstSolutionOptimizationPeriod to set. |
Definition at line 11768 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setFirstSolutionStrategy | ( | com.google.ortools.constraintsolver.FirstSolutionStrategy.Value | value | ) |
First solution strategies, used as starting point of local search.
.operations_research.FirstSolutionStrategy.Value first_solution_strategy = 1;
value | The firstSolutionStrategy to set. |
Definition at line 10851 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setFirstSolutionStrategyValue | ( | int | value | ) |
First solution strategies, used as starting point of local search.
.operations_research.FirstSolutionStrategy.Value first_solution_strategy = 1;
value | The enum numeric value on the wire for firstSolutionStrategy to set. |
Definition at line 10823 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setGuidedLocalSearchLambdaCoefficient | ( | double | value | ) |
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;
value | The guidedLocalSearchLambdaCoefficient to set. |
Definition at line 12409 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setGuidedLocalSearchResetPenaltiesOnNewBestSolution | ( | boolean | value | ) |
Whether to reset penalties when a new best solution is found. The effect is that a greedy descent is started before the next penalization phase.
bool guided_local_search_reset_penalties_on_new_best_solution = 51;
value | The guidedLocalSearchResetPenaltiesOnNewBestSolution to set. |
Definition at line 12458 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setHeuristicCloseNodesLnsNumNodes | ( | int | value | ) |
Number of closest nodes to consider for each node during the destruction phase of the FilteredHeuristicCloseNodesLNSOperator.
int32 heuristic_close_nodes_lns_num_nodes = 35;
value | The heuristicCloseNodesLnsNumNodes to set. |
Definition at line 12285 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setHeuristicExpensiveChainLnsNumArcsToConsider | ( | int | value | ) |
Number of expensive arcs to consider cutting in the FilteredHeuristicExpensiveChainLNSOperator operator.
int32 heuristic_expensive_chain_lns_num_arcs_to_consider = 32;
value | The heuristicExpensiveChainLnsNumArcsToConsider to set. |
Definition at line 12238 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setImprovementLimitParameters | ( | com.google.ortools.constraintsolver.RoutingSearchParameters.ImprovementSearchLimitParameters | value | ) |
The improvement search limit is added to the solver if the following parameters are set.
.operations_research.RoutingSearchParameters.ImprovementSearchLimitParameters improvement_limit_parameters = 37;
Definition at line 13787 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setImprovementLimitParameters | ( | com.google.ortools.constraintsolver.RoutingSearchParameters.ImprovementSearchLimitParameters.Builder | builderForValue | ) |
The improvement search limit is added to the solver if the following parameters are set.
.operations_research.RoutingSearchParameters.ImprovementSearchLimitParameters improvement_limit_parameters = 37;
Definition at line 13808 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setIteratedLocalSearchParameters | ( | operations_research.RoutingIls.IteratedLocalSearchParameters | value | ) |
Iterated Local Search parameters.
.operations_research.IteratedLocalSearchParameters iterated_local_search_parameters = 60;
Definition at line 14324 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setIteratedLocalSearchParameters | ( | operations_research.RoutingIls.IteratedLocalSearchParameters.Builder | builderForValue | ) |
Iterated Local Search parameters.
.operations_research.IteratedLocalSearchParameters iterated_local_search_parameters = 60;
Definition at line 14344 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setLnsTimeLimit | ( | com.google.protobuf.Duration | value | ) |
Limit to the time spent in the completion search for each local search neighbor.
.google.protobuf.Duration lns_time_limit = 10;
Definition at line 13562 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setLnsTimeLimit | ( | com.google.protobuf.Duration.Builder | builderForValue | ) |
Limit to the time spent in the completion search for each local search neighbor.
.google.protobuf.Duration lns_time_limit = 10;
Definition at line 13583 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setLocalCheapestCostInsertionPickupDeliveryStrategy | ( | com.google.ortools.constraintsolver.RoutingSearchParameters.PairInsertionStrategy | value | ) |
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;
value | The localCheapestCostInsertionPickupDeliveryStrategy to set. |
Definition at line 11662 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.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.
.operations_research.RoutingSearchParameters.PairInsertionStrategy local_cheapest_cost_insertion_pickup_delivery_strategy = 55;
value | The enum numeric value on the wire for localCheapestCostInsertionPickupDeliveryStrategy to set. |
Definition at line 11632 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setLocalCheapestInsertionPickupDeliveryStrategy | ( | com.google.ortools.constraintsolver.RoutingSearchParameters.PairInsertionStrategy | value | ) |
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;
value | The localCheapestInsertionPickupDeliveryStrategy to set. |
Definition at line 11584 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setLocalCheapestInsertionPickupDeliveryStrategyValue | ( | int | value | ) |
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;
value | The enum numeric value on the wire for localCheapestInsertionPickupDeliveryStrategy to set. |
Definition at line 11554 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setLocalSearchMetaheuristic | ( | com.google.ortools.constraintsolver.LocalSearchMetaheuristic.Value | value | ) |
Local search metaheuristics used to guide the search.
.operations_research.LocalSearchMetaheuristic.Value local_search_metaheuristic = 4;
value | The localSearchMetaheuristic to set. |
Definition at line 12357 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setLocalSearchMetaheuristicValue | ( | int | value | ) |
Local search metaheuristics used to guide the search.
.operations_research.LocalSearchMetaheuristic.Value local_search_metaheuristic = 4;
value | The enum numeric value on the wire for localSearchMetaheuristic to set. |
Definition at line 12329 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setLocalSearchOperators | ( | com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators | value | ) |
.operations_research.RoutingSearchParameters.LocalSearchNeighborhoodOperators local_search_operators = 3;
Definition at line 11820 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setLocalSearchOperators | ( | com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder | builderForValue | ) |
.operations_research.RoutingSearchParameters.LocalSearchNeighborhoodOperators local_search_operators = 3;
Definition at line 11836 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setLogCostOffset | ( | double | value | ) |
double log_cost_offset = 29;
value | The logCostOffset to set. |
Definition at line 14126 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.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;
value | The logCostScalingFactor to set. |
Definition at line 14089 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setLogSearch | ( | boolean | value | ) |
--- 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;
value | The logSearch to set. |
Definition at line 14031 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setLogTag | ( | java.lang.String | value | ) |
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;
value | The logTag to set. |
Definition at line 14198 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setLogTagBytes | ( | com.google.protobuf.ByteString | value | ) |
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;
value | The bytes for logTag to set. |
Definition at line 14231 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setLsOperatorMinNeighbors | ( | int | value | ) |
int32 ls_operator_min_neighbors = 54;
value | The lsOperatorMinNeighbors to set. |
Definition at line 11981 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.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).
double ls_operator_neighbors_ratio = 53;
value | The lsOperatorNeighborsRatio to set. |
Definition at line 11943 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setMixedIntegerSchedulingSolver | ( | com.google.ortools.constraintsolver.RoutingSearchParameters.SchedulingSolver | value | ) |
.operations_research.RoutingSearchParameters.SchedulingSolver mixed_integer_scheduling_solver = 34;
value | The mixedIntegerSchedulingSolver to set. |
Definition at line 13139 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setMixedIntegerSchedulingSolverValue | ( | int | value | ) |
.operations_research.RoutingSearchParameters.SchedulingSolver mixed_integer_scheduling_solver = 34;
value | The enum numeric value on the wire for mixedIntegerSchedulingSolver to set. |
Definition at line 13119 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setMultiArmedBanditCompoundOperatorExplorationCoefficient | ( | double | value | ) |
Positive parameter defining the exploration coefficient of the multi-armed bandit compound operator. Sets how often we explore rarely used and unsuccessful in the past operators
double multi_armed_bandit_compound_operator_exploration_coefficient = 43;
value | The multiArmedBanditCompoundOperatorExplorationCoefficient to set. |
Definition at line 12128 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setMultiArmedBanditCompoundOperatorMemoryCoefficient | ( | double | value | ) |
Memory coefficient related to the multi-armed bandit compound operator. Sets how much the objective improvement of previous accepted neighbors influence the current average improvement. This parameter should be between 0 and 1.
double multi_armed_bandit_compound_operator_memory_coefficient = 42;
value | The multiArmedBanditCompoundOperatorMemoryCoefficient to set. |
Definition at line 12077 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setNumberOfSolutionsToCollect | ( | int | value | ) |
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;
value | The numberOfSolutionsToCollect to set. |
Definition at line 13293 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setOptimizationStep | ( | double | value | ) |
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;
value | The optimizationStep to set. |
Definition at line 13245 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setRelocateExpensiveChainNumArcsToConsider | ( | int | value | ) |
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;
value | The relocateExpensiveChainNumArcsToConsider to set. |
Definition at line 12186 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setRepeatedField | ( | com.google.protobuf.Descriptors.FieldDescriptor | field, |
int | index, | ||
java.lang.Object | value ) |
Definition at line 10289 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.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.
bool report_intermediate_cp_sat_solutions = 56;
value | The reportIntermediateCpSatSolutions to set. |
Definition at line 12983 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setSatParameters | ( | com.google.ortools.sat.SatParameters | value | ) |
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;
Definition at line 12832 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setSatParameters | ( | com.google.ortools.sat.SatParameters.Builder | builderForValue | ) |
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;
Definition at line 12853 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setSavingsAddReverseArcs | ( | boolean | value | ) |
Add savings related to reverse arcs when finding the nearest neighbors of the nodes.
bool savings_add_reverse_arcs = 15;
value | The savingsAddReverseArcs to set. |
Definition at line 11061 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.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.
double savings_arc_coefficient = 18;
value | The savingsArcCoefficient to set. |
Definition at line 11114 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.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]. 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;
value | The savingsMaxMemoryUsageBytes to set. |
Definition at line 11010 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setSavingsNeighborsRatio | ( | double | value | ) |
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;
value | The savingsNeighborsRatio to set. |
Definition at line 10954 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setSavingsParallelRoutes | ( | boolean | value | ) |
When true, the routes are built in parallel, sequentially otherwise.
bool savings_parallel_routes = 19;
value | The savingsParallelRoutes to set. |
Definition at line 11162 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.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. 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;
value | The secondaryLsTimeLimitRatio to set. |
Definition at line 13721 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setSolutionLimit | ( | long | value | ) |
-- Search limits -- Limit to the number of solutions generated during the search. 0 means "unspecified".
int64 solution_limit = 8;
value | The solutionLimit to set. |
Definition at line 13342 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setTimeLimit | ( | com.google.protobuf.Duration | value | ) |
Limit to the time spent in the search.
.google.protobuf.Duration time_limit = 9;
Definition at line 13402 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setTimeLimit | ( | com.google.protobuf.Duration.Builder | builderForValue | ) |
Limit to the time spent in the search.
.google.protobuf.Duration time_limit = 9;
Definition at line 13422 of file RoutingSearchParameters.java.
final Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setUnknownFields | ( | final com.google.protobuf.UnknownFieldSet | unknownFields | ) |
Definition at line 14445 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setUseCp | ( | com.google.ortools.util.OptionalBoolean | value | ) |
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;
value | The useCp to set. |
Definition at line 12591 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setUseCpSat | ( | com.google.ortools.util.OptionalBoolean | value | ) |
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;
value | The useCpSat to set. |
Definition at line 12678 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setUseCpSatValue | ( | int | value | ) |
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;
value | The enum numeric value on the wire for useCpSat to set. |
Definition at line 12644 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setUseCpValue | ( | int | value | ) |
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;
value | The enum numeric value on the wire for useCp to set. |
Definition at line 12559 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setUseDepthFirstSearch | ( | boolean | value | ) |
--- 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;
value | The useDepthFirstSearch to set. |
Definition at line 12509 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setUseFullPropagation | ( | boolean | value | ) |
--- 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;
value | The useFullPropagation to set. |
Definition at line 13954 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setUseGeneralizedCpSat | ( | com.google.ortools.util.OptionalBoolean | value | ) |
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;
value | The useGeneralizedCpSat to set. |
Definition at line 12766 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setUseGeneralizedCpSatValue | ( | int | value | ) |
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;
value | The enum numeric value on the wire for useGeneralizedCpSat to set. |
Definition at line 12732 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setUseIteratedLocalSearch | ( | boolean | value | ) |
Whether the solver should use an Iterated Local Search approach to solve the problem.
bool use_iterated_local_search = 58;
value | The useIteratedLocalSearch to set. |
Definition at line 14265 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setUseMultiArmedBanditConcatenateOperators | ( | boolean | value | ) |
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;
value | The useMultiArmedBanditConcatenateOperators to set. |
Definition at line 12025 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.Builder.setUseUnfilteredFirstSolutionStrategy | ( | boolean | value | ) |
--- 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;
value | The useUnfilteredFirstSolutionStrategy to set. |
Definition at line 10903 of file RoutingSearchParameters.java.