Java Reference

Java Reference

RoutingParameters.java
Go to the documentation of this file.
1 // Generated by the protocol buffer compiler. DO NOT EDIT!
2 // source: ortools/constraint_solver/routing_parameters.proto
3 
4 package com.google.ortools.constraintsolver;
5 
6 public final class RoutingParameters {
7  private RoutingParameters() {}
8  public static void registerAllExtensions(
9  com.google.protobuf.ExtensionRegistryLite registry) {
10  }
11 
12  public static void registerAllExtensions(
13  com.google.protobuf.ExtensionRegistry registry) {
14  registerAllExtensions(
15  (com.google.protobuf.ExtensionRegistryLite) registry);
16  }
17  static final com.google.protobuf.Descriptors.Descriptor
18  internal_static_operations_research_RoutingSearchParameters_descriptor;
19  static final
20  com.google.protobuf.GeneratedMessageV3.FieldAccessorTable
21  internal_static_operations_research_RoutingSearchParameters_fieldAccessorTable;
22  static final com.google.protobuf.Descriptors.Descriptor
23  internal_static_operations_research_RoutingSearchParameters_LocalSearchNeighborhoodOperators_descriptor;
24  static final
25  com.google.protobuf.GeneratedMessageV3.FieldAccessorTable
26  internal_static_operations_research_RoutingSearchParameters_LocalSearchNeighborhoodOperators_fieldAccessorTable;
27  static final com.google.protobuf.Descriptors.Descriptor
28  internal_static_operations_research_RoutingSearchParameters_ImprovementSearchLimitParameters_descriptor;
29  static final
30  com.google.protobuf.GeneratedMessageV3.FieldAccessorTable
31  internal_static_operations_research_RoutingSearchParameters_ImprovementSearchLimitParameters_fieldAccessorTable;
32  static final com.google.protobuf.Descriptors.Descriptor
33  internal_static_operations_research_RoutingModelParameters_descriptor;
34  static final
35  com.google.protobuf.GeneratedMessageV3.FieldAccessorTable
36  internal_static_operations_research_RoutingModelParameters_fieldAccessorTable;
37 
38  public static com.google.protobuf.Descriptors.FileDescriptor
39  getDescriptor() {
40  return descriptor;
41  }
42  private static com.google.protobuf.Descriptors.FileDescriptor
43  descriptor;
44  static {
45  java.lang.String[] descriptorData = {
46  "\n2ortools/constraint_solver/routing_para" +
47  "meters.proto\022\023operations_research\032\036googl" +
48  "e/protobuf/duration.proto\032-ortools/const" +
49  "raint_solver/routing_enums.proto\0321ortool" +
50  "s/constraint_solver/solver_parameters.pr" +
51  "oto\032#ortools/util/optional_boolean.proto" +
52  "\"\242$\n\027RoutingSearchParameters\022Q\n\027first_so" +
53  "lution_strategy\030\001 \001(\01620.operations_resea" +
54  "rch.FirstSolutionStrategy.Value\022.\n&use_u" +
55  "nfiltered_first_solution_strategy\030\002 \001(\010\022" +
56  "\037\n\027savings_neighbors_ratio\030\016 \001(\001\022&\n\036savi" +
57  "ngs_max_memory_usage_bytes\030\027 \001(\001\022 \n\030savi" +
58  "ngs_add_reverse_arcs\030\017 \001(\010\022\037\n\027savings_ar" +
59  "c_coefficient\030\022 \001(\001\022\037\n\027savings_parallel_" +
60  "routes\030\023 \001(\010\022/\n\'cheapest_insertion_farth" +
61  "est_seeds_ratio\030\020 \001(\001\0229\n1cheapest_insert" +
62  "ion_first_solution_neighbors_ratio\030\025 \001(\001" +
63  "\0227\n/cheapest_insertion_first_solution_mi" +
64  "n_neighbors\030, \001(\005\0226\n.cheapest_insertion_" +
65  "ls_operator_neighbors_ratio\030\037 \001(\001\0224\n,che" +
66  "apest_insertion_ls_operator_min_neighbor" +
67  "s\030- \001(\005\0222\n*cheapest_insertion_add_unperf" +
68  "ormed_entries\030( \001(\010\022)\n!christofides_use_" +
69  "minimum_matching\030\036 \001(\010\022m\n\026local_search_o" +
70  "perators\030\003 \001(\0132M.operations_research.Rou" +
71  "tingSearchParameters.LocalSearchNeighbor" +
72  "hoodOperators\0224\n,use_multi_armed_bandit_" +
73  "concatenate_operators\030) \001(\010\022?\n7multi_arm" +
74  "ed_bandit_compound_operator_memory_coeff" +
75  "icient\030* \001(\001\022D\n<multi_armed_bandit_compo" +
76  "und_operator_exploration_coefficient\030+ \001" +
77  "(\001\0225\n-relocate_expensive_chain_num_arcs_" +
78  "to_consider\030\024 \001(\005\022:\n2heuristic_expensive" +
79  "_chain_lns_num_arcs_to_consider\030 \001(\005\022+\n" +
80  "#heuristic_close_nodes_lns_num_nodes\030# \001" +
81  "(\005\022W\n\032local_search_metaheuristic\030\004 \001(\01623" +
82  ".operations_research.LocalSearchMetaheur" +
83  "istic.Value\022.\n&guided_local_search_lambd" +
84  "a_coefficient\030\005 \001(\001\022\036\n\026use_depth_first_s" +
85  "earch\030\006 \001(\010\0224\n\006use_cp\030\034 \001(\0162$.operations" +
86  "_research.OptionalBoolean\0228\n\nuse_cp_sat\030" +
87  "\033 \001(\0162$.operations_research.OptionalBool" +
88  "ean\022c\n\034continuous_scheduling_solver\030! \001(" +
89  "\0162=.operations_research.RoutingSearchPar" +
90  "ameters.SchedulingSolver\022f\n\037mixed_intege" +
91  "r_scheduling_solver\030\" \001(\0162=.operations_r" +
92  "esearch.RoutingSearchParameters.Scheduli" +
93  "ngSolver\022\031\n\021optimization_step\030\007 \001(\001\022&\n\036n" +
94  "umber_of_solutions_to_collect\030\021 \001(\005\022\026\n\016s" +
95  "olution_limit\030\010 \001(\003\022-\n\ntime_limit\030\t \001(\0132" +
96  "\031.google.protobuf.Duration\0221\n\016lns_time_l" +
97  "imit\030\n \001(\0132\031.google.protobuf.Duration\022s\n" +
98  "\034improvement_limit_parameters\030% \001(\0132M.op" +
99  "erations_research.RoutingSearchParameter" +
100  "s.ImprovementSearchLimitParameters\022\034\n\024us" +
101  "e_full_propagation\030\013 \001(\010\022\022\n\nlog_search\030\r" +
102  " \001(\010\022\037\n\027log_cost_scaling_factor\030\026 \001(\001\022\027\n" +
103  "\017log_cost_offset\030\035 \001(\001\022\017\n\007log_tag\030$ \001(\t\032" +
104  "\327\022\n LocalSearchNeighborhoodOperators\022:\n\014" +
105  "use_relocate\030\001 \001(\0162$.operations_research" +
106  ".OptionalBoolean\022?\n\021use_relocate_pair\030\002 " +
107  "\001(\0162$.operations_research.OptionalBoolea" +
108  "n\022E\n\027use_light_relocate_pair\030\030 \001(\0162$.ope" +
109  "rations_research.OptionalBoolean\022D\n\026use_" +
110  "relocate_neighbors\030\003 \001(\0162$.operations_re" +
111  "search.OptionalBoolean\022B\n\024use_relocate_s" +
112  "ubtrip\030\031 \001(\0162$.operations_research.Optio" +
113  "nalBoolean\022:\n\014use_exchange\030\004 \001(\0162$.opera" +
114  "tions_research.OptionalBoolean\022?\n\021use_ex" +
115  "change_pair\030\026 \001(\0162$.operations_research." +
116  "OptionalBoolean\022B\n\024use_exchange_subtrip\030" +
117  "\032 \001(\0162$.operations_research.OptionalBool" +
118  "ean\0227\n\tuse_cross\030\005 \001(\0162$.operations_rese" +
119  "arch.OptionalBoolean\022@\n\022use_cross_exchan" +
120  "ge\030\006 \001(\0162$.operations_research.OptionalB" +
121  "oolean\022J\n\034use_relocate_expensive_chain\030\027" +
122  " \001(\0162$.operations_research.OptionalBoole" +
123  "an\0229\n\013use_two_opt\030\007 \001(\0162$.operations_res" +
124  "earch.OptionalBoolean\0228\n\nuse_or_opt\030\010 \001(" +
125  "\0162$.operations_research.OptionalBoolean\022" +
126  "?\n\021use_lin_kernighan\030\t \001(\0162$.operations_" +
127  "research.OptionalBoolean\0229\n\013use_tsp_opt\030" +
128  "\n \001(\0162$.operations_research.OptionalBool" +
129  "ean\022=\n\017use_make_active\030\013 \001(\0162$.operation" +
130  "s_research.OptionalBoolean\022J\n\034use_reloca" +
131  "te_and_make_active\030\025 \001(\0162$.operations_re" +
132  "search.OptionalBoolean\022?\n\021use_make_inact" +
133  "ive\030\014 \001(\0162$.operations_research.Optional" +
134  "Boolean\022E\n\027use_make_chain_inactive\030\r \001(\016" +
135  "2$.operations_research.OptionalBoolean\022=" +
136  "\n\017use_swap_active\030\016 \001(\0162$.operations_res" +
137  "earch.OptionalBoolean\022F\n\030use_extended_sw" +
138  "ap_active\030\017 \001(\0162$.operations_research.Op" +
139  "tionalBoolean\022G\n\031use_node_pair_swap_acti" +
140  "ve\030\024 \001(\0162$.operations_research.OptionalB" +
141  "oolean\022:\n\014use_path_lns\030\020 \001(\0162$.operation" +
142  "s_research.OptionalBoolean\022?\n\021use_full_p" +
143  "ath_lns\030\021 \001(\0162$.operations_research.Opti" +
144  "onalBoolean\0229\n\013use_tsp_lns\030\022 \001(\0162$.opera" +
145  "tions_research.OptionalBoolean\022>\n\020use_in" +
146  "active_lns\030\023 \001(\0162$.operations_research.O" +
147  "ptionalBoolean\022T\n&use_global_cheapest_in" +
148  "sertion_path_lns\030\033 \001(\0162$.operations_rese" +
149  "arch.OptionalBoolean\022S\n%use_local_cheape" +
150  "st_insertion_path_lns\030\034 \001(\0162$.operations" +
151  "_research.OptionalBoolean\022l\n>use_relocat" +
152  "e_path_global_cheapest_insertion_insert_" +
153  "unperformed\030! \001(\0162$.operations_research." +
154  "OptionalBoolean\022_\n1use_global_cheapest_i" +
155  "nsertion_expensive_chain_lns\030\035 \001(\0162$.ope" +
156  "rations_research.OptionalBoolean\022^\n0use_" +
157  "local_cheapest_insertion_expensive_chain" +
158  "_lns\030\036 \001(\0162$.operations_research.Optiona" +
159  "lBoolean\022[\n-use_global_cheapest_insertio" +
160  "n_close_nodes_lns\030\037 \001(\0162$.operations_res" +
161  "earch.OptionalBoolean\022Z\n,use_local_cheap" +
162  "est_insertion_close_nodes_lns\030 \001(\0162$.op" +
163  "erations_research.OptionalBoolean\032u\n Imp" +
164  "rovementSearchLimitParameters\022$\n\034improve" +
165  "ment_rate_coefficient\030& \001(\001\022+\n#improveme" +
166  "nt_rate_solutions_distance\030\' \001(\005\"3\n\020Sche" +
167  "dulingSolver\022\t\n\005UNSET\020\000\022\010\n\004GLOP\020\001\022\n\n\006CP_" +
168  "SAT\020\002\"\250\001\n\026RoutingModelParameters\022J\n\021solv" +
169  "er_parameters\030\001 \001(\0132/.operations_researc" +
170  "h.ConstraintSolverParameters\022!\n\031reduce_v" +
171  "ehicle_cost_model\030\002 \001(\010\022\037\n\027max_callback_" +
172  "cache_size\030\003 \001(\005BI\n#com.google.ortools.c" +
173  "onstraintsolverP\001\252\002\037Google.OrTools.Const" +
174  "raintSolverb\006proto3"
175  };
176  descriptor = com.google.protobuf.Descriptors.FileDescriptor
177  .internalBuildGeneratedFileFrom(descriptorData,
178  new com.google.protobuf.Descriptors.FileDescriptor[] {
179  com.google.protobuf.DurationProto.getDescriptor(),
180  com.google.ortools.constraintsolver.RoutingEnums.getDescriptor(),
181  com.google.ortools.constraintsolver.SolverParameters.getDescriptor(),
182  com.google.ortools.util.OptionalBooleanOuterClass.getDescriptor(),
183  });
184  internal_static_operations_research_RoutingSearchParameters_descriptor =
185  getDescriptor().getMessageTypes().get(0);
186  internal_static_operations_research_RoutingSearchParameters_fieldAccessorTable = new
187  com.google.protobuf.GeneratedMessageV3.FieldAccessorTable(
188  internal_static_operations_research_RoutingSearchParameters_descriptor,
189  new java.lang.String[] { "FirstSolutionStrategy", "UseUnfilteredFirstSolutionStrategy", "SavingsNeighborsRatio", "SavingsMaxMemoryUsageBytes", "SavingsAddReverseArcs", "SavingsArcCoefficient", "SavingsParallelRoutes", "CheapestInsertionFarthestSeedsRatio", "CheapestInsertionFirstSolutionNeighborsRatio", "CheapestInsertionFirstSolutionMinNeighbors", "CheapestInsertionLsOperatorNeighborsRatio", "CheapestInsertionLsOperatorMinNeighbors", "CheapestInsertionAddUnperformedEntries", "ChristofidesUseMinimumMatching", "LocalSearchOperators", "UseMultiArmedBanditConcatenateOperators", "MultiArmedBanditCompoundOperatorMemoryCoefficient", "MultiArmedBanditCompoundOperatorExplorationCoefficient", "RelocateExpensiveChainNumArcsToConsider", "HeuristicExpensiveChainLnsNumArcsToConsider", "HeuristicCloseNodesLnsNumNodes", "LocalSearchMetaheuristic", "GuidedLocalSearchLambdaCoefficient", "UseDepthFirstSearch", "UseCp", "UseCpSat", "ContinuousSchedulingSolver", "MixedIntegerSchedulingSolver", "OptimizationStep", "NumberOfSolutionsToCollect", "SolutionLimit", "TimeLimit", "LnsTimeLimit", "ImprovementLimitParameters", "UseFullPropagation", "LogSearch", "LogCostScalingFactor", "LogCostOffset", "LogTag", });
190  internal_static_operations_research_RoutingSearchParameters_LocalSearchNeighborhoodOperators_descriptor =
191  internal_static_operations_research_RoutingSearchParameters_descriptor.getNestedTypes().get(0);
192  internal_static_operations_research_RoutingSearchParameters_LocalSearchNeighborhoodOperators_fieldAccessorTable = new
193  com.google.protobuf.GeneratedMessageV3.FieldAccessorTable(
194  internal_static_operations_research_RoutingSearchParameters_LocalSearchNeighborhoodOperators_descriptor,
195  new java.lang.String[] { "UseRelocate", "UseRelocatePair", "UseLightRelocatePair", "UseRelocateNeighbors", "UseRelocateSubtrip", "UseExchange", "UseExchangePair", "UseExchangeSubtrip", "UseCross", "UseCrossExchange", "UseRelocateExpensiveChain", "UseTwoOpt", "UseOrOpt", "UseLinKernighan", "UseTspOpt", "UseMakeActive", "UseRelocateAndMakeActive", "UseMakeInactive", "UseMakeChainInactive", "UseSwapActive", "UseExtendedSwapActive", "UseNodePairSwapActive", "UsePathLns", "UseFullPathLns", "UseTspLns", "UseInactiveLns", "UseGlobalCheapestInsertionPathLns", "UseLocalCheapestInsertionPathLns", "UseRelocatePathGlobalCheapestInsertionInsertUnperformed", "UseGlobalCheapestInsertionExpensiveChainLns", "UseLocalCheapestInsertionExpensiveChainLns", "UseGlobalCheapestInsertionCloseNodesLns", "UseLocalCheapestInsertionCloseNodesLns", });
196  internal_static_operations_research_RoutingSearchParameters_ImprovementSearchLimitParameters_descriptor =
197  internal_static_operations_research_RoutingSearchParameters_descriptor.getNestedTypes().get(1);
198  internal_static_operations_research_RoutingSearchParameters_ImprovementSearchLimitParameters_fieldAccessorTable = new
199  com.google.protobuf.GeneratedMessageV3.FieldAccessorTable(
200  internal_static_operations_research_RoutingSearchParameters_ImprovementSearchLimitParameters_descriptor,
201  new java.lang.String[] { "ImprovementRateCoefficient", "ImprovementRateSolutionsDistance", });
202  internal_static_operations_research_RoutingModelParameters_descriptor =
203  getDescriptor().getMessageTypes().get(1);
204  internal_static_operations_research_RoutingModelParameters_fieldAccessorTable = new
205  com.google.protobuf.GeneratedMessageV3.FieldAccessorTable(
206  internal_static_operations_research_RoutingModelParameters_descriptor,
207  new java.lang.String[] { "SolverParameters", "ReduceVehicleCostModel", "MaxCallbackCacheSize", });
208  com.google.protobuf.DurationProto.getDescriptor();
209  com.google.ortools.constraintsolver.RoutingEnums.getDescriptor();
210  com.google.ortools.constraintsolver.SolverParameters.getDescriptor();
211  com.google.ortools.util.OptionalBooleanOuterClass.getDescriptor();
212  }
213 
214  // @@protoc_insertion_point(outer_class_scope)
215 }
com.google.ortools.constraintsolver.RoutingParameters.registerAllExtensions
static void registerAllExtensions(com.google.protobuf.ExtensionRegistry registry)
Definition: RoutingParameters.java:12
com.google.ortools.constraintsolver.RoutingParameters.getDescriptor
static com.google.protobuf.Descriptors.FileDescriptor getDescriptor()
Definition: RoutingParameters.java:39
com.google.ortools.constraintsolver.RoutingParameters.registerAllExtensions
static void registerAllExtensions(com.google.protobuf.ExtensionRegistryLite registry)
Definition: RoutingParameters.java:8