9public final class RoutingParameters
extends com.google.protobuf.GeneratedFile {
10 private RoutingParameters() {}
12 com.google.protobuf.RuntimeVersion.validateProtobufGencodeVersion(
13 com.google.protobuf.RuntimeVersion.RuntimeDomain.PUBLIC,
21 com.google.protobuf.ExtensionRegistryLite registry) {
25 com.google.protobuf.ExtensionRegistry registry) {
27 (com.google.protobuf.ExtensionRegistryLite) registry);
29 static final com.google.protobuf.Descriptors.Descriptor
30 internal_static_operations_research_RoutingSearchParameters_descriptor;
32 com.google.protobuf.GeneratedMessage.FieldAccessorTable
33 internal_static_operations_research_RoutingSearchParameters_fieldAccessorTable;
34 static final com.google.protobuf.Descriptors.Descriptor
35 internal_static_operations_research_RoutingSearchParameters_LocalSearchNeighborhoodOperators_descriptor;
37 com.google.protobuf.GeneratedMessage.FieldAccessorTable
38 internal_static_operations_research_RoutingSearchParameters_LocalSearchNeighborhoodOperators_fieldAccessorTable;
39 static final com.google.protobuf.Descriptors.Descriptor
40 internal_static_operations_research_RoutingSearchParameters_ImprovementSearchLimitParameters_descriptor;
42 com.google.protobuf.GeneratedMessage.FieldAccessorTable
43 internal_static_operations_research_RoutingSearchParameters_ImprovementSearchLimitParameters_fieldAccessorTable;
44 static final com.google.protobuf.Descriptors.Descriptor
45 internal_static_operations_research_RoutingModelParameters_descriptor;
47 com.google.protobuf.GeneratedMessage.FieldAccessorTable
48 internal_static_operations_research_RoutingModelParameters_fieldAccessorTable;
50 public static com.google.protobuf.Descriptors.FileDescriptor
54 private static com.google.protobuf.Descriptors.FileDescriptor
57 java.lang.String[] descriptorData = {
58 "\n2ortools/constraint_solver/routing_para" +
59 "meters.proto\022\023operations_research\032\036googl" +
60 "e/protobuf/duration.proto\032-ortools/const" +
61 "raint_solver/routing_enums.proto\032<ortool" +
62 "s/constraint_solver/routing_heuristic_pa" +
63 "rameters.proto\032+ortools/constraint_solve" +
64 "r/routing_ils.proto\0321ortools/constraint_" +
65 "solver/solver_parameters.proto\032 ortools/" +
66 "sat/sat_parameters.proto\032#ortools/util/o" +
67 "ptional_boolean.proto\"\3301\n\027RoutingSearchP" +
68 "arameters\022Q\n\027first_solution_strategy\030\001 \001" +
69 "(\01620.operations_research.FirstSolutionSt" +
70 "rategy.Value\022.\n&use_unfiltered_first_sol" +
71 "ution_strategy\030\002 \001(\010\022B\n\022savings_paramete" +
72 "rs\030F \001(\0132&.operations_research.SavingsPa" +
73 "rameters\022s\n3global_cheapest_insertion_fi" +
74 "rst_solution_parameters\030G \001(\01326.operatio" +
75 "ns_research.GlobalCheapestInsertionParam" +
76 "eters\022p\n0global_cheapest_insertion_ls_op" +
77 "erator_parameters\030H \001(\01326.operations_res" +
78 "earch.GlobalCheapestInsertionParameters\022" +
79 "b\n#local_cheapest_insertion_parameters\030D" +
80 " \001(\01325.operations_research.LocalCheapest" +
81 "InsertionParameters\022g\n(local_cheapest_co" +
82 "st_insertion_parameters\030E \001(\01325.operatio" +
83 "ns_research.LocalCheapestInsertionParame" +
84 "ters\022)\n!christofides_use_minimum_matchin" +
85 "g\030\036 \001(\010\022*\n\"first_solution_optimization_p" +
86 "eriod\030; \001(\005\022m\n\026local_search_operators\030\003 " +
87 "\001(\0132M.operations_research.RoutingSearchP" +
88 "arameters.LocalSearchNeighborhoodOperato" +
89 "rs\022#\n\033ls_operator_neighbors_ratio\0305 \001(\001\022" +
90 "!\n\031ls_operator_min_neighbors\0306 \001(\005\0224\n,us" +
91 "e_multi_armed_bandit_concatenate_operato" +
92 "rs\030) \001(\010\022?\n7multi_armed_bandit_compound_" +
93 "operator_memory_coefficient\030* \001(\001\022D\n<mul" +
94 "ti_armed_bandit_compound_operator_explor" +
95 "ation_coefficient\030+ \001(\001\022\"\n\032max_swap_acti" +
96 "ve_chain_size\030B \001(\005\0225\n-relocate_expensiv" +
97 "e_chain_num_arcs_to_consider\030\024 \001(\005\022:\n2he" +
98 "uristic_expensive_chain_lns_num_arcs_to_" +
99 "consider\030 \001(\005\022+\n#heuristic_close_nodes_" +
100 "lns_num_nodes\030# \001(\005\022W\n\032local_search_meta" +
101 "heuristic\030\004 \001(\01623.operations_research.Lo" +
102 "calSearchMetaheuristic.Value\022X\n\033local_se" +
103 "arch_metaheuristics\030? \003(\01623.operations_r" +
104 "esearch.LocalSearchMetaheuristic.Value\0228" +
105 "\n0num_max_local_optima_before_metaheuris" +
106 "tic_switch\030@ \001(\005\022.\n&guided_local_search_" +
107 "lambda_coefficient\030\005 \001(\001\022@\n8guided_local" +
108 "_search_reset_penalties_on_new_best_solu" +
109 "tion\0303 \001(\010\0229\n1guided_local_search_penali" +
110 "ze_with_vehicle_classes\030= \001(\010\022C\n;use_gui" +
111 "ded_local_search_penalties_in_local_sear" +
112 "ch_operators\030> \001(\010\022\036\n\026use_depth_first_se" +
113 "arch\030\006 \001(\010\0224\n\006use_cp\030\034 \001(\0162$.operations_" +
114 "research.OptionalBoolean\0228\n\nuse_cp_sat\030\033" +
115 " \001(\0162$.operations_research.OptionalBoole" +
116 "an\022D\n\026use_generalized_cp_sat\030/ \001(\0162$.ope" +
117 "rations_research.OptionalBoolean\022>\n\016sat_" +
118 "parameters\0300 \001(\0132&.operations_research.s" +
119 "at.SatParameters\022,\n$report_intermediate_" +
120 "cp_sat_solutions\0308 \001(\010\022)\n!fallback_to_cp" +
121 "_sat_size_threshold\0304 \001(\005\022c\n\034continuous_" +
122 "scheduling_solver\030! \001(\0162=.operations_res" +
123 "earch.RoutingSearchParameters.Scheduling" +
124 "Solver\022f\n\037mixed_integer_scheduling_solve" +
125 "r\030\" \001(\0162=.operations_research.RoutingSea" +
126 "rchParameters.SchedulingSolver\022C\n6disabl" +
127 "e_scheduling_beware_this_may_degrade_per" +
128 "formance\0302 \001(\010H\000\210\001\001\022\031\n\021optimization_step" +
129 "\030\007 \001(\001\022&\n\036number_of_solutions_to_collect" +
130 "\030\021 \001(\005\022\026\n\016solution_limit\030\010 \001(\003\022-\n\ntime_l" +
131 "imit\030\t \001(\0132\031.google.protobuf.Duration\0221\n" +
132 "\016lns_time_limit\030\n \001(\0132\031.google.protobuf." +
133 "Duration\022%\n\035secondary_ls_time_limit_rati" +
134 "o\0309 \001(\001\022s\n\034improvement_limit_parameters\030" +
135 "% \001(\0132M.operations_research.RoutingSearc" +
136 "hParameters.ImprovementSearchLimitParame" +
137 "ters\022\034\n\024use_full_propagation\030\013 \001(\010\022\022\n\nlo" +
138 "g_search\030\r \001(\010\022\037\n\027log_cost_scaling_facto" +
139 "r\030\026 \001(\001\022\027\n\017log_cost_offset\030\035 \001(\001\022\017\n\007log_" +
140 "tag\030$ \001(\t\022!\n\031use_iterated_local_search\030:" +
141 " \001(\010\022\\\n iterated_local_search_parameters" +
142 "\030< \001(\01322.operations_research.IteratedLoc" +
143 "alSearchParameters\032\223\027\n LocalSearchNeighb" +
144 "orhoodOperators\022:\n\014use_relocate\030\001 \001(\0162$." +
145 "operations_research.OptionalBoolean\022?\n\021u" +
146 "se_relocate_pair\030\002 \001(\0162$.operations_rese" +
147 "arch.OptionalBoolean\022E\n\027use_light_reloca" +
148 "te_pair\030\030 \001(\0162$.operations_research.Opti" +
149 "onalBoolean\022D\n\026use_relocate_neighbors\030\003 " +
150 "\001(\0162$.operations_research.OptionalBoolea" +
151 "n\022B\n\024use_relocate_subtrip\030\031 \001(\0162$.operat" +
152 "ions_research.OptionalBoolean\022:\n\014use_exc" +
153 "hange\030\004 \001(\0162$.operations_research.Option" +
154 "alBoolean\022?\n\021use_exchange_pair\030\026 \001(\0162$.o" +
155 "perations_research.OptionalBoolean\022B\n\024us" +
156 "e_exchange_subtrip\030\032 \001(\0162$.operations_re" +
157 "search.OptionalBoolean\0227\n\tuse_cross\030\005 \001(" +
158 "\0162$.operations_research.OptionalBoolean\022" +
159 "@\n\022use_cross_exchange\030\006 \001(\0162$.operations" +
160 "_research.OptionalBoolean\022J\n\034use_relocat" +
161 "e_expensive_chain\030\027 \001(\0162$.operations_res" +
162 "earch.OptionalBoolean\0229\n\013use_two_opt\030\007 \001" +
163 "(\0162$.operations_research.OptionalBoolean" +
164 "\0228\n\nuse_or_opt\030\010 \001(\0162$.operations_resear" +
165 "ch.OptionalBoolean\022?\n\021use_lin_kernighan\030" +
166 "\t \001(\0162$.operations_research.OptionalBool" +
167 "ean\0229\n\013use_tsp_opt\030\n \001(\0162$.operations_re" +
168 "search.OptionalBoolean\022=\n\017use_make_activ" +
169 "e\030\013 \001(\0162$.operations_research.OptionalBo" +
170 "olean\022J\n\034use_relocate_and_make_active\030\025 " +
171 "\001(\0162$.operations_research.OptionalBoolea" +
172 "n\022J\n\034use_exchange_and_make_active\030% \001(\0162" +
173 "$.operations_research.OptionalBoolean\022Z\n" +
174 ",use_exchange_path_start_ends_and_make_a" +
175 "ctive\030& \001(\0162$.operations_research.Option" +
176 "alBoolean\022?\n\021use_make_inactive\030\014 \001(\0162$.o" +
177 "perations_research.OptionalBoolean\022E\n\027us" +
178 "e_make_chain_inactive\030\r \001(\0162$.operations" +
179 "_research.OptionalBoolean\022=\n\017use_swap_ac" +
180 "tive\030\016 \001(\0162$.operations_research.Optiona" +
181 "lBoolean\022C\n\025use_swap_active_chain\030# \001(\0162" +
182 "$.operations_research.OptionalBoolean\022F\n" +
183 "\030use_extended_swap_active\030\017 \001(\0162$.operat" +
184 "ions_research.OptionalBoolean\022K\n\035use_sho" +
185 "rtest_path_swap_active\030\" \001(\0162$.operation" +
186 "s_research.OptionalBoolean\022G\n\031use_shorte" +
187 "st_path_two_opt\030$ \001(\0162$.operations_resea" +
188 "rch.OptionalBoolean\022G\n\031use_node_pair_swa" +
189 "p_active\030\024 \001(\0162$.operations_research.Opt" +
190 "ionalBoolean\022:\n\014use_path_lns\030\020 \001(\0162$.ope" +
191 "rations_research.OptionalBoolean\022?\n\021use_" +
192 "full_path_lns\030\021 \001(\0162$.operations_researc" +
193 "h.OptionalBoolean\0229\n\013use_tsp_lns\030\022 \001(\0162$" +
194 ".operations_research.OptionalBoolean\022>\n\020" +
195 "use_inactive_lns\030\023 \001(\0162$.operations_rese" +
196 "arch.OptionalBoolean\022T\n&use_global_cheap" +
197 "est_insertion_path_lns\030\033 \001(\0162$.operation" +
198 "s_research.OptionalBoolean\022S\n%use_local_" +
199 "cheapest_insertion_path_lns\030\034 \001(\0162$.oper" +
200 "ations_research.OptionalBoolean\022l\n>use_r" +
201 "elocate_path_global_cheapest_insertion_i" +
202 "nsert_unperformed\030! \001(\0162$.operations_res" +
203 "earch.OptionalBoolean\022_\n1use_global_chea" +
204 "pest_insertion_expensive_chain_lns\030\035 \001(\016" +
205 "2$.operations_research.OptionalBoolean\022^" +
206 "\n0use_local_cheapest_insertion_expensive" +
207 "_chain_lns\030\036 \001(\0162$.operations_research.O" +
208 "ptionalBoolean\022[\n-use_global_cheapest_in" +
209 "sertion_close_nodes_lns\030\037 \001(\0162$.operatio" +
210 "ns_research.OptionalBoolean\022Z\n,use_local" +
211 "_cheapest_insertion_close_nodes_lns\030 \001(" +
212 "\0162$.operations_research.OptionalBoolean\022" +
213 "[\n-use_global_cheapest_insertion_visit_t" +
214 "ypes_lns\030\' \001(\0162$.operations_research.Opt" +
215 "ionalBoolean\022Z\n,use_local_cheapest_inser" +
216 "tion_visit_types_lns\030( \001(\0162$.operations_" +
217 "research.OptionalBoolean\032u\n ImprovementS" +
218 "earchLimitParameters\022$\n\034improvement_rate" +
219 "_coefficient\030& \001(\001\022+\n#improvement_rate_s" +
220 "olutions_distance\030\' \001(\005\"T\n\020SchedulingSol" +
221 "ver\022\024\n\020SCHEDULING_UNSET\020\000\022\023\n\017SCHEDULING_" +
222 "GLOP\020\001\022\025\n\021SCHEDULING_CP_SAT\020\002B9\n7_disabl" +
223 "e_scheduling_beware_this_may_degrade_per" +
224 "formanceJ\004\010\016\020\017J\004\010\017\020\020J\004\010\020\020\021J\004\010\022\020\023J\004\010\023\020\024J\004" +
225 "\010\025\020\026J\004\010\027\020\030J\004\010\037\020 J\004\010(\020)J\004\010,\020-J\004\010-\020.J\004\010.\020/" +
226 "J\004\0101\0202J\004\0107\0208J\004\010A\020BJ\004\010C\020D\"\250\001\n\026RoutingMode" +
227 "lParameters\022J\n\021solver_parameters\030\001 \001(\0132/" +
228 ".operations_research.ConstraintSolverPar" +
229 "ameters\022!\n\031reduce_vehicle_cost_model\030\002 \001" +
230 "(\010\022\037\n\027max_callback_cache_size\030\003 \001(\005BI\n#c" +
231 "om.google.ortools.constraintsolverP\001\252\002\037G" +
232 "oogle.OrTools.ConstraintSolverb\006proto3"
234 descriptor = com.google.protobuf.Descriptors.FileDescriptor
235 .internalBuildGeneratedFileFrom(descriptorData,
236 new com.google.protobuf.Descriptors.FileDescriptor[] {
237 com.google.protobuf.DurationProto.getDescriptor(),
238 com.google.ortools.constraintsolver.RoutingEnums.getDescriptor(),
239 com.google.ortools.constraintsolver.RoutingHeuristicParameters.getDescriptor(),
240 com.google.ortools.constraintsolver.RoutingIls.getDescriptor(),
241 com.google.ortools.constraintsolver.SolverParameters.getDescriptor(),
242 com.google.ortools.sat.SatParametersOuterClass.getDescriptor(),
243 com.google.ortools.util.OptionalBooleanOuterClass.getDescriptor(),
245 internal_static_operations_research_RoutingSearchParameters_descriptor =
247 internal_static_operations_research_RoutingSearchParameters_fieldAccessorTable =
new
248 com.google.protobuf.GeneratedMessage.FieldAccessorTable(
249 internal_static_operations_research_RoutingSearchParameters_descriptor,
250 new java.lang.String[] {
"FirstSolutionStrategy",
"UseUnfilteredFirstSolutionStrategy",
"SavingsParameters",
"GlobalCheapestInsertionFirstSolutionParameters",
"GlobalCheapestInsertionLsOperatorParameters",
"LocalCheapestInsertionParameters",
"LocalCheapestCostInsertionParameters",
"ChristofidesUseMinimumMatching",
"FirstSolutionOptimizationPeriod",
"LocalSearchOperators",
"LsOperatorNeighborsRatio",
"LsOperatorMinNeighbors",
"UseMultiArmedBanditConcatenateOperators",
"MultiArmedBanditCompoundOperatorMemoryCoefficient",
"MultiArmedBanditCompoundOperatorExplorationCoefficient",
"MaxSwapActiveChainSize",
"RelocateExpensiveChainNumArcsToConsider",
"HeuristicExpensiveChainLnsNumArcsToConsider",
"HeuristicCloseNodesLnsNumNodes",
"LocalSearchMetaheuristic",
"LocalSearchMetaheuristics",
"NumMaxLocalOptimaBeforeMetaheuristicSwitch",
"GuidedLocalSearchLambdaCoefficient",
"GuidedLocalSearchResetPenaltiesOnNewBestSolution",
"GuidedLocalSearchPenalizeWithVehicleClasses",
"UseGuidedLocalSearchPenaltiesInLocalSearchOperators",
"UseDepthFirstSearch",
"UseCp",
"UseCpSat",
"UseGeneralizedCpSat",
"SatParameters",
"ReportIntermediateCpSatSolutions",
"FallbackToCpSatSizeThreshold",
"ContinuousSchedulingSolver",
"MixedIntegerSchedulingSolver",
"DisableSchedulingBewareThisMayDegradePerformance",
"OptimizationStep",
"NumberOfSolutionsToCollect",
"SolutionLimit",
"TimeLimit",
"LnsTimeLimit",
"SecondaryLsTimeLimitRatio",
"ImprovementLimitParameters",
"UseFullPropagation",
"LogSearch",
"LogCostScalingFactor",
"LogCostOffset",
"LogTag",
"UseIteratedLocalSearch",
"IteratedLocalSearchParameters", });
251 internal_static_operations_research_RoutingSearchParameters_LocalSearchNeighborhoodOperators_descriptor =
252 internal_static_operations_research_RoutingSearchParameters_descriptor.getNestedType(0);
253 internal_static_operations_research_RoutingSearchParameters_LocalSearchNeighborhoodOperators_fieldAccessorTable =
new
254 com.google.protobuf.GeneratedMessage.FieldAccessorTable(
255 internal_static_operations_research_RoutingSearchParameters_LocalSearchNeighborhoodOperators_descriptor,
256 new java.lang.String[] {
"UseRelocate",
"UseRelocatePair",
"UseLightRelocatePair",
"UseRelocateNeighbors",
"UseRelocateSubtrip",
"UseExchange",
"UseExchangePair",
"UseExchangeSubtrip",
"UseCross",
"UseCrossExchange",
"UseRelocateExpensiveChain",
"UseTwoOpt",
"UseOrOpt",
"UseLinKernighan",
"UseTspOpt",
"UseMakeActive",
"UseRelocateAndMakeActive",
"UseExchangeAndMakeActive",
"UseExchangePathStartEndsAndMakeActive",
"UseMakeInactive",
"UseMakeChainInactive",
"UseSwapActive",
"UseSwapActiveChain",
"UseExtendedSwapActive",
"UseShortestPathSwapActive",
"UseShortestPathTwoOpt",
"UseNodePairSwapActive",
"UsePathLns",
"UseFullPathLns",
"UseTspLns",
"UseInactiveLns",
"UseGlobalCheapestInsertionPathLns",
"UseLocalCheapestInsertionPathLns",
"UseRelocatePathGlobalCheapestInsertionInsertUnperformed",
"UseGlobalCheapestInsertionExpensiveChainLns",
"UseLocalCheapestInsertionExpensiveChainLns",
"UseGlobalCheapestInsertionCloseNodesLns",
"UseLocalCheapestInsertionCloseNodesLns",
"UseGlobalCheapestInsertionVisitTypesLns",
"UseLocalCheapestInsertionVisitTypesLns", });
257 internal_static_operations_research_RoutingSearchParameters_ImprovementSearchLimitParameters_descriptor =
258 internal_static_operations_research_RoutingSearchParameters_descriptor.getNestedType(1);
259 internal_static_operations_research_RoutingSearchParameters_ImprovementSearchLimitParameters_fieldAccessorTable =
new
260 com.google.protobuf.GeneratedMessage.FieldAccessorTable(
261 internal_static_operations_research_RoutingSearchParameters_ImprovementSearchLimitParameters_descriptor,
262 new java.lang.String[] {
"ImprovementRateCoefficient",
"ImprovementRateSolutionsDistance", });
263 internal_static_operations_research_RoutingModelParameters_descriptor =
265 internal_static_operations_research_RoutingModelParameters_fieldAccessorTable =
new
266 com.google.protobuf.GeneratedMessage.FieldAccessorTable(
267 internal_static_operations_research_RoutingModelParameters_descriptor,
268 new java.lang.String[] {
"SolverParameters",
"ReduceVehicleCostModel",
"MaxCallbackCacheSize", });
269 descriptor.resolveAllFeaturesImmutable();
270 com.google.protobuf.DurationProto.getDescriptor();
271 com.google.ortools.constraintsolver.RoutingEnums.getDescriptor();
272 com.google.ortools.constraintsolver.RoutingHeuristicParameters.getDescriptor();
273 com.google.ortools.constraintsolver.RoutingIls.getDescriptor();
274 com.google.ortools.constraintsolver.SolverParameters.getDescriptor();
275 com.google.ortools.sat.SatParametersOuterClass.getDescriptor();
276 com.google.ortools.util.OptionalBooleanOuterClass.getDescriptor();