10 com.google.protobuf.ExtensionRegistryLite registry) {
14 com.google.protobuf.ExtensionRegistry registry) {
16 (com.google.protobuf.ExtensionRegistryLite) registry);
18 static final com.google.protobuf.Descriptors.Descriptor
19 internal_static_operations_research_RoutingSearchParameters_descriptor;
21 com.google.protobuf.GeneratedMessageV3.FieldAccessorTable
22 internal_static_operations_research_RoutingSearchParameters_fieldAccessorTable;
23 static final com.google.protobuf.Descriptors.Descriptor
24 internal_static_operations_research_RoutingSearchParameters_LocalSearchNeighborhoodOperators_descriptor;
26 com.google.protobuf.GeneratedMessageV3.FieldAccessorTable
27 internal_static_operations_research_RoutingSearchParameters_LocalSearchNeighborhoodOperators_fieldAccessorTable;
28 static final com.google.protobuf.Descriptors.Descriptor
29 internal_static_operations_research_RoutingSearchParameters_ImprovementSearchLimitParameters_descriptor;
31 com.google.protobuf.GeneratedMessageV3.FieldAccessorTable
32 internal_static_operations_research_RoutingSearchParameters_ImprovementSearchLimitParameters_fieldAccessorTable;
33 static final com.google.protobuf.Descriptors.Descriptor
34 internal_static_operations_research_RoutingModelParameters_descriptor;
36 com.google.protobuf.GeneratedMessageV3.FieldAccessorTable
37 internal_static_operations_research_RoutingModelParameters_fieldAccessorTable;
39 public static com.google.protobuf.Descriptors.FileDescriptor
43 private static com.google.protobuf.Descriptors.FileDescriptor
46 java.lang.String[] descriptorData = {
47 "\n2ortools/constraint_solver/routing_para" +
48 "meters.proto\022\023operations_research\032\036googl" +
49 "e/protobuf/duration.proto\032-ortools/const" +
50 "raint_solver/routing_enums.proto\032+ortool" +
51 "s/constraint_solver/routing_ils.proto\0321o" +
52 "rtools/constraint_solver/solver_paramete" +
53 "rs.proto\032 ortools/sat/sat_parameters.pro" +
54 "to\032#ortools/util/optional_boolean.proto\"" +
55 "\270.\n\027RoutingSearchParameters\022Q\n\027first_sol" +
56 "ution_strategy\030\001 \001(\01620.operations_resear" +
57 "ch.FirstSolutionStrategy.Value\022.\n&use_un" +
58 "filtered_first_solution_strategy\030\002 \001(\010\022\037" +
59 "\n\027savings_neighbors_ratio\030\016 \001(\001\022&\n\036savin" +
60 "gs_max_memory_usage_bytes\030\027 \001(\001\022 \n\030savin" +
61 "gs_add_reverse_arcs\030\017 \001(\010\022\037\n\027savings_arc" +
62 "_coefficient\030\022 \001(\001\022\037\n\027savings_parallel_r" +
63 "outes\030\023 \001(\010\022/\n\'cheapest_insertion_farthe" +
64 "st_seeds_ratio\030\020 \001(\001\0229\n1cheapest_inserti" +
65 "on_first_solution_neighbors_ratio\030\025 \001(\001\022" +
66 "7\n/cheapest_insertion_first_solution_min" +
67 "_neighbors\030, \001(\005\0226\n.cheapest_insertion_l" +
68 "s_operator_neighbors_ratio\030\037 \001(\001\0224\n,chea" +
69 "pest_insertion_ls_operator_min_neighbors" +
70 "\030- \001(\005\022P\nHcheapest_insertion_first_solut" +
71 "ion_use_neighbors_ratio_for_initializati" +
72 "on\030. \001(\010\0222\n*cheapest_insertion_add_unper" +
73 "formed_entries\030( \001(\010\022}\n1local_cheapest_i" +
74 "nsertion_pickup_delivery_strategy\0301 \001(\0162" +
75 "B.operations_research.RoutingSearchParam" +
76 "eters.PairInsertionStrategy\022\202\001\n6local_ch" +
77 "eapest_cost_insertion_pickup_delivery_st" +
78 "rategy\0307 \001(\0162B.operations_research.Routi" +
79 "ngSearchParameters.PairInsertionStrategy" +
80 "\022)\n!christofides_use_minimum_matching\030\036 " +
81 "\001(\010\022*\n\"first_solution_optimization_perio" +
82 "d\030; \001(\005\022m\n\026local_search_operators\030\003 \001(\0132" +
83 "M.operations_research.RoutingSearchParam" +
84 "eters.LocalSearchNeighborhoodOperators\022#" +
85 "\n\033ls_operator_neighbors_ratio\0305 \001(\001\022!\n\031l" +
86 "s_operator_min_neighbors\0306 \001(\005\0224\n,use_mu" +
87 "lti_armed_bandit_concatenate_operators\030)" +
88 " \001(\010\022?\n7multi_armed_bandit_compound_oper" +
89 "ator_memory_coefficient\030* \001(\001\022D\n<multi_a" +
90 "rmed_bandit_compound_operator_exploratio" +
91 "n_coefficient\030+ \001(\001\0225\n-relocate_expensiv" +
92 "e_chain_num_arcs_to_consider\030\024 \001(\005\022:\n2he" +
93 "uristic_expensive_chain_lns_num_arcs_to_" +
94 "consider\030 \001(\005\022+\n#heuristic_close_nodes_" +
95 "lns_num_nodes\030# \001(\005\022W\n\032local_search_meta" +
96 "heuristic\030\004 \001(\01623.operations_research.Lo" +
97 "calSearchMetaheuristic.Value\022.\n&guided_l" +
98 "ocal_search_lambda_coefficient\030\005 \001(\001\022@\n8" +
99 "guided_local_search_reset_penalties_on_n" +
100 "ew_best_solution\0303 \001(\010\022\036\n\026use_depth_firs" +
101 "t_search\030\006 \001(\010\0224\n\006use_cp\030\034 \001(\0162$.operati" +
102 "ons_research.OptionalBoolean\0228\n\nuse_cp_s" +
103 "at\030\033 \001(\0162$.operations_research.OptionalB" +
104 "oolean\022D\n\026use_generalized_cp_sat\030/ \001(\0162$" +
105 ".operations_research.OptionalBoolean\022>\n\016" +
106 "sat_parameters\0300 \001(\0132&.operations_resear" +
107 "ch.sat.SatParameters\022,\n$report_intermedi" +
108 "ate_cp_sat_solutions\0308 \001(\010\022)\n!fallback_t" +
109 "o_cp_sat_size_threshold\0304 \001(\005\022c\n\034continu" +
110 "ous_scheduling_solver\030! \001(\0162=.operations" +
111 "_research.RoutingSearchParameters.Schedu" +
112 "lingSolver\022f\n\037mixed_integer_scheduling_s" +
113 "olver\030\" \001(\0162=.operations_research.Routin" +
114 "gSearchParameters.SchedulingSolver\022C\n6di" +
115 "sable_scheduling_beware_this_may_degrade" +
116 "_performance\0302 \001(\010H\000\210\001\001\022\031\n\021optimization_" +
117 "step\030\007 \001(\001\022&\n\036number_of_solutions_to_col" +
118 "lect\030\021 \001(\005\022\026\n\016solution_limit\030\010 \001(\003\022-\n\nti" +
119 "me_limit\030\t \001(\0132\031.google.protobuf.Duratio" +
120 "n\0221\n\016lns_time_limit\030\n \001(\0132\031.google.proto" +
121 "buf.Duration\022%\n\035secondary_ls_time_limit_" +
122 "ratio\0309 \001(\001\022s\n\034improvement_limit_paramet" +
123 "ers\030% \001(\0132M.operations_research.RoutingS" +
124 "earchParameters.ImprovementSearchLimitPa" +
125 "rameters\022\034\n\024use_full_propagation\030\013 \001(\010\022\022" +
126 "\n\nlog_search\030\r \001(\010\022\037\n\027log_cost_scaling_f" +
127 "actor\030\026 \001(\001\022\027\n\017log_cost_offset\030\035 \001(\001\022\017\n\007" +
128 "log_tag\030$ \001(\t\022!\n\031use_iterated_local_sear" +
129 "ch\030: \001(\010\022\\\n iterated_local_search_parame" +
130 "ters\030< \001(\01322.operations_research.Iterate" +
131 "dLocalSearchParameters\032\244\023\n LocalSearchNe" +
132 "ighborhoodOperators\022:\n\014use_relocate\030\001 \001(" +
133 "\0162$.operations_research.OptionalBoolean\022" +
134 "?\n\021use_relocate_pair\030\002 \001(\0162$.operations_" +
135 "research.OptionalBoolean\022E\n\027use_light_re" +
136 "locate_pair\030\030 \001(\0162$.operations_research." +
137 "OptionalBoolean\022D\n\026use_relocate_neighbor" +
138 "s\030\003 \001(\0162$.operations_research.OptionalBo" +
139 "olean\022B\n\024use_relocate_subtrip\030\031 \001(\0162$.op" +
140 "erations_research.OptionalBoolean\022:\n\014use" +
141 "_exchange\030\004 \001(\0162$.operations_research.Op" +
142 "tionalBoolean\022?\n\021use_exchange_pair\030\026 \001(\016" +
143 "2$.operations_research.OptionalBoolean\022B" +
144 "\n\024use_exchange_subtrip\030\032 \001(\0162$.operation" +
145 "s_research.OptionalBoolean\0227\n\tuse_cross\030" +
146 "\005 \001(\0162$.operations_research.OptionalBool" +
147 "ean\022@\n\022use_cross_exchange\030\006 \001(\0162$.operat" +
148 "ions_research.OptionalBoolean\022J\n\034use_rel" +
149 "ocate_expensive_chain\030\027 \001(\0162$.operations" +
150 "_research.OptionalBoolean\0229\n\013use_two_opt" +
151 "\030\007 \001(\0162$.operations_research.OptionalBoo" +
152 "lean\0228\n\nuse_or_opt\030\010 \001(\0162$.operations_re" +
153 "search.OptionalBoolean\022?\n\021use_lin_kernig" +
154 "han\030\t \001(\0162$.operations_research.Optional" +
155 "Boolean\0229\n\013use_tsp_opt\030\n \001(\0162$.operation" +
156 "s_research.OptionalBoolean\022=\n\017use_make_a" +
157 "ctive\030\013 \001(\0162$.operations_research.Option" +
158 "alBoolean\022J\n\034use_relocate_and_make_activ" +
159 "e\030\025 \001(\0162$.operations_research.OptionalBo" +
160 "olean\022?\n\021use_make_inactive\030\014 \001(\0162$.opera" +
161 "tions_research.OptionalBoolean\022E\n\027use_ma" +
162 "ke_chain_inactive\030\r \001(\0162$.operations_res" +
163 "earch.OptionalBoolean\022=\n\017use_swap_active" +
164 "\030\016 \001(\0162$.operations_research.OptionalBoo" +
165 "lean\022F\n\030use_extended_swap_active\030\017 \001(\0162$" +
166 ".operations_research.OptionalBoolean\022K\n\035" +
167 "use_shortest_path_swap_active\030\" \001(\0162$.op" +
168 "erations_research.OptionalBoolean\022G\n\031use" +
169 "_node_pair_swap_active\030\024 \001(\0162$.operation" +
170 "s_research.OptionalBoolean\022:\n\014use_path_l" +
171 "ns\030\020 \001(\0162$.operations_research.OptionalB" +
172 "oolean\022?\n\021use_full_path_lns\030\021 \001(\0162$.oper" +
173 "ations_research.OptionalBoolean\0229\n\013use_t" +
174 "sp_lns\030\022 \001(\0162$.operations_research.Optio" +
175 "nalBoolean\022>\n\020use_inactive_lns\030\023 \001(\0162$.o" +
176 "perations_research.OptionalBoolean\022T\n&us" +
177 "e_global_cheapest_insertion_path_lns\030\033 \001" +
178 "(\0162$.operations_research.OptionalBoolean" +
179 "\022S\n%use_local_cheapest_insertion_path_ln" +
180 "s\030\034 \001(\0162$.operations_research.OptionalBo" +
181 "olean\022l\n>use_relocate_path_global_cheape" +
182 "st_insertion_insert_unperformed\030! \001(\0162$." +
183 "operations_research.OptionalBoolean\022_\n1u" +
184 "se_global_cheapest_insertion_expensive_c" +
185 "hain_lns\030\035 \001(\0162$.operations_research.Opt" +
186 "ionalBoolean\022^\n0use_local_cheapest_inser" +
187 "tion_expensive_chain_lns\030\036 \001(\0162$.operati" +
188 "ons_research.OptionalBoolean\022[\n-use_glob" +
189 "al_cheapest_insertion_close_nodes_lns\030\037 " +
190 "\001(\0162$.operations_research.OptionalBoolea" +
191 "n\022Z\n,use_local_cheapest_insertion_close_" +
192 "nodes_lns\030 \001(\0162$.operations_research.Op" +
193 "tionalBoolean\032u\n ImprovementSearchLimitP" +
194 "arameters\022$\n\034improvement_rate_coefficien" +
195 "t\030& \001(\001\022+\n#improvement_rate_solutions_di" +
196 "stance\030\' \001(\005\"\222\001\n\025PairInsertionStrategy\022\r" +
197 "\n\tAUTOMATIC\020\000\022\"\n\036BEST_PICKUP_THEN_BEST_D" +
198 "ELIVERY\020\001\022\035\n\031BEST_PICKUP_DELIVERY_PAIR\020\002" +
199 "\022\'\n#BEST_PICKUP_DELIVERY_PAIR_MULTITOUR\020" +
200 "\003\"T\n\020SchedulingSolver\022\024\n\020SCHEDULING_UNSE" +
201 "T\020\000\022\023\n\017SCHEDULING_GLOP\020\001\022\025\n\021SCHEDULING_C" +
202 "P_SAT\020\002B9\n7_disable_scheduling_beware_th" +
203 "is_may_degrade_performance\"\250\001\n\026RoutingMo" +
204 "delParameters\022J\n\021solver_parameters\030\001 \001(\013" +
205 "2/.operations_research.ConstraintSolverP" +
206 "arameters\022!\n\031reduce_vehicle_cost_model\030\002" +
207 " \001(\010\022\037\n\027max_callback_cache_size\030\003 \001(\005BI\n" +
208 "#com.google.ortools.constraintsolverP\001\252\002" +
209 "\037Google.OrTools.ConstraintSolverb\006proto3"
211 descriptor = com.google.protobuf.Descriptors.FileDescriptor
212 .internalBuildGeneratedFileFrom(descriptorData,
213 new com.google.protobuf.Descriptors.FileDescriptor[] {
214 com.google.protobuf.DurationProto.getDescriptor(),
215 com.google.ortools.constraintsolver.RoutingEnums.getDescriptor(),
216 operations_research.RoutingIls.getDescriptor(),
217 com.google.ortools.constraintsolver.SolverParameters.getDescriptor(),
218 com.google.ortools.sat.SatParametersOuterClass.getDescriptor(),
219 com.google.ortools.util.OptionalBooleanOuterClass.getDescriptor(),
221 internal_static_operations_research_RoutingSearchParameters_descriptor =
223 internal_static_operations_research_RoutingSearchParameters_fieldAccessorTable =
new
224 com.google.protobuf.GeneratedMessageV3.FieldAccessorTable(
225 internal_static_operations_research_RoutingSearchParameters_descriptor,
226 new java.lang.String[] {
"FirstSolutionStrategy",
"UseUnfilteredFirstSolutionStrategy",
"SavingsNeighborsRatio",
"SavingsMaxMemoryUsageBytes",
"SavingsAddReverseArcs",
"SavingsArcCoefficient",
"SavingsParallelRoutes",
"CheapestInsertionFarthestSeedsRatio",
"CheapestInsertionFirstSolutionNeighborsRatio",
"CheapestInsertionFirstSolutionMinNeighbors",
"CheapestInsertionLsOperatorNeighborsRatio",
"CheapestInsertionLsOperatorMinNeighbors",
"CheapestInsertionFirstSolutionUseNeighborsRatioForInitialization",
"CheapestInsertionAddUnperformedEntries",
"LocalCheapestInsertionPickupDeliveryStrategy",
"LocalCheapestCostInsertionPickupDeliveryStrategy",
"ChristofidesUseMinimumMatching",
"FirstSolutionOptimizationPeriod",
"LocalSearchOperators",
"LsOperatorNeighborsRatio",
"LsOperatorMinNeighbors",
"UseMultiArmedBanditConcatenateOperators",
"MultiArmedBanditCompoundOperatorMemoryCoefficient",
"MultiArmedBanditCompoundOperatorExplorationCoefficient",
"RelocateExpensiveChainNumArcsToConsider",
"HeuristicExpensiveChainLnsNumArcsToConsider",
"HeuristicCloseNodesLnsNumNodes",
"LocalSearchMetaheuristic",
"GuidedLocalSearchLambdaCoefficient",
"GuidedLocalSearchResetPenaltiesOnNewBestSolution",
"UseDepthFirstSearch",
"UseCp",
"UseCpSat",
"UseGeneralizedCpSat",
"SatParameters",
"ReportIntermediateCpSatSolutions",
"FallbackToCpSatSizeThreshold",
"ContinuousSchedulingSolver",
"MixedIntegerSchedulingSolver",
"DisableSchedulingBewareThisMayDegradePerformance",
"OptimizationStep",
"NumberOfSolutionsToCollect",
"SolutionLimit",
"TimeLimit",
"LnsTimeLimit",
"SecondaryLsTimeLimitRatio",
"ImprovementLimitParameters",
"UseFullPropagation",
"LogSearch",
"LogCostScalingFactor",
"LogCostOffset",
"LogTag",
"UseIteratedLocalSearch",
"IteratedLocalSearchParameters", });
227 internal_static_operations_research_RoutingSearchParameters_LocalSearchNeighborhoodOperators_descriptor =
228 internal_static_operations_research_RoutingSearchParameters_descriptor.getNestedTypes().get(0);
229 internal_static_operations_research_RoutingSearchParameters_LocalSearchNeighborhoodOperators_fieldAccessorTable =
new
230 com.google.protobuf.GeneratedMessageV3.FieldAccessorTable(
231 internal_static_operations_research_RoutingSearchParameters_LocalSearchNeighborhoodOperators_descriptor,
232 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",
"UseShortestPathSwapActive",
"UseNodePairSwapActive",
"UsePathLns",
"UseFullPathLns",
"UseTspLns",
"UseInactiveLns",
"UseGlobalCheapestInsertionPathLns",
"UseLocalCheapestInsertionPathLns",
"UseRelocatePathGlobalCheapestInsertionInsertUnperformed",
"UseGlobalCheapestInsertionExpensiveChainLns",
"UseLocalCheapestInsertionExpensiveChainLns",
"UseGlobalCheapestInsertionCloseNodesLns",
"UseLocalCheapestInsertionCloseNodesLns", });
233 internal_static_operations_research_RoutingSearchParameters_ImprovementSearchLimitParameters_descriptor =
234 internal_static_operations_research_RoutingSearchParameters_descriptor.getNestedTypes().get(1);
235 internal_static_operations_research_RoutingSearchParameters_ImprovementSearchLimitParameters_fieldAccessorTable =
new
236 com.google.protobuf.GeneratedMessageV3.FieldAccessorTable(
237 internal_static_operations_research_RoutingSearchParameters_ImprovementSearchLimitParameters_descriptor,
238 new java.lang.String[] {
"ImprovementRateCoefficient",
"ImprovementRateSolutionsDistance", });
239 internal_static_operations_research_RoutingModelParameters_descriptor =
241 internal_static_operations_research_RoutingModelParameters_fieldAccessorTable =
new
242 com.google.protobuf.GeneratedMessageV3.FieldAccessorTable(
243 internal_static_operations_research_RoutingModelParameters_descriptor,
244 new java.lang.String[] {
"SolverParameters",
"ReduceVehicleCostModel",
"MaxCallbackCacheSize", });
245 com.google.protobuf.DurationProto.getDescriptor();
246 com.google.ortools.constraintsolver.RoutingEnums.getDescriptor();
248 com.google.ortools.constraintsolver.SolverParameters.getDescriptor();
249 com.google.ortools.sat.SatParametersOuterClass.getDescriptor();
250 com.google.ortools.util.OptionalBooleanOuterClass.getDescriptor();
1.10.0