4 package com.google.ortools.constraintsolver;
9 com.
google.protobuf.ExtensionRegistryLite registry) {
13 com.
google.protobuf.ExtensionRegistry registry) {
15 (
com.
google.protobuf.ExtensionRegistryLite) registry);
17 static final com.
google.protobuf.Descriptors.Descriptor
18 internal_static_operations_research_RoutingSearchParameters_descriptor;
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;
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;
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;
35 com.
google.protobuf.GeneratedMessageV3.FieldAccessorTable
36 internal_static_operations_research_RoutingModelParameters_fieldAccessorTable;
38 public static com.
google.protobuf.Descriptors.FileDescriptor
42 private static com.
google.protobuf.Descriptors.FileDescriptor
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/sat/sat_parameters.proto\032#o" +
52 "rtools/util/optional_boolean.proto\"\372%\n\027R" +
53 "outingSearchParameters\022Q\n\027first_solution" +
54 "_strategy\030\001 \001(\01620.operations_research.Fi" +
55 "rstSolutionStrategy.Value\022.\n&use_unfilte" +
56 "red_first_solution_strategy\030\002 \001(\010\022\037\n\027sav" +
57 "ings_neighbors_ratio\030\016 \001(\001\022&\n\036savings_ma" +
58 "x_memory_usage_bytes\030\027 \001(\001\022 \n\030savings_ad" +
59 "d_reverse_arcs\030\017 \001(\010\022\037\n\027savings_arc_coef" +
60 "ficient\030\022 \001(\001\022\037\n\027savings_parallel_routes" +
61 "\030\023 \001(\010\022/\n\'cheapest_insertion_farthest_se" +
62 "eds_ratio\030\020 \001(\001\0229\n1cheapest_insertion_fi" +
63 "rst_solution_neighbors_ratio\030\025 \001(\001\0227\n/ch" +
64 "eapest_insertion_first_solution_min_neig" +
65 "hbors\030, \001(\005\0226\n.cheapest_insertion_ls_ope" +
66 "rator_neighbors_ratio\030\037 \001(\001\0224\n,cheapest_" +
67 "insertion_ls_operator_min_neighbors\030- \001(" +
68 "\005\022P\nHcheapest_insertion_first_solution_u" +
69 "se_neighbors_ratio_for_initialization\030. " +
70 "\001(\010\0222\n*cheapest_insertion_add_unperforme" +
71 "d_entries\030( \001(\010\022)\n!christofides_use_mini" +
72 "mum_matching\030\036 \001(\010\022m\n\026local_search_opera" +
73 "tors\030\003 \001(\0132M.operations_research.Routing" +
74 "SearchParameters.LocalSearchNeighborhood" +
75 "Operators\0224\n,use_multi_armed_bandit_conc" +
76 "atenate_operators\030) \001(\010\022?\n7multi_armed_b" +
77 "andit_compound_operator_memory_coefficie" +
78 "nt\030* \001(\001\022D\n<multi_armed_bandit_compound_" +
79 "operator_exploration_coefficient\030+ \001(\001\0225" +
80 "\n-relocate_expensive_chain_num_arcs_to_c" +
81 "onsider\030\024 \001(\005\022:\n2heuristic_expensive_cha" +
82 "in_lns_num_arcs_to_consider\030 \001(\005\022+\n#heu" +
83 "ristic_close_nodes_lns_num_nodes\030# \001(\005\022W" +
84 "\n\032local_search_metaheuristic\030\004 \001(\01623.ope" +
85 "rations_research.LocalSearchMetaheuristi" +
86 "c.Value\022.\n&guided_local_search_lambda_co" +
87 "efficient\030\005 \001(\001\022\036\n\026use_depth_first_searc" +
88 "h\030\006 \001(\010\0224\n\006use_cp\030\034 \001(\0162$.operations_res" +
89 "earch.OptionalBoolean\0228\n\nuse_cp_sat\030\033 \001(" +
90 "\0162$.operations_research.OptionalBoolean\022" +
91 "D\n\026use_generalized_cp_sat\030/ \001(\0162$.operat" +
92 "ions_research.OptionalBoolean\022>\n\016sat_par" +
93 "ameters\0300 \001(\0132&.operations_research.sat." +
94 "SatParameters\022c\n\034continuous_scheduling_s" +
95 "olver\030! \001(\0162=.operations_research.Routin" +
96 "gSearchParameters.SchedulingSolver\022f\n\037mi" +
97 "xed_integer_scheduling_solver\030\" \001(\0162=.op" +
98 "erations_research.RoutingSearchParameter" +
99 "s.SchedulingSolver\022\031\n\021optimization_step\030" +
100 "\007 \001(\001\022&\n\036number_of_solutions_to_collect\030" +
101 "\021 \001(\005\022\026\n\016solution_limit\030\010 \001(\003\022-\n\ntime_li" +
102 "mit\030\t \001(\0132\031.google.protobuf.Duration\0221\n\016" +
103 "lns_time_limit\030\n \001(\0132\031.google.protobuf.D" +
104 "uration\022s\n\034improvement_limit_parameters\030" +
105 "% \001(\0132M.operations_research.RoutingSearc" +
106 "hParameters.ImprovementSearchLimitParame" +
107 "ters\022\034\n\024use_full_propagation\030\013 \001(\010\022\022\n\nlo" +
108 "g_search\030\r \001(\010\022\037\n\027log_cost_scaling_facto" +
109 "r\030\026 \001(\001\022\027\n\017log_cost_offset\030\035 \001(\001\022\017\n\007log_" +
110 "tag\030$ \001(\t\032\327\022\n LocalSearchNeighborhoodOpe" +
111 "rators\022:\n\014use_relocate\030\001 \001(\0162$.operation" +
112 "s_research.OptionalBoolean\022?\n\021use_reloca" +
113 "te_pair\030\002 \001(\0162$.operations_research.Opti" +
114 "onalBoolean\022E\n\027use_light_relocate_pair\030\030" +
115 " \001(\0162$.operations_research.OptionalBoole" +
116 "an\022D\n\026use_relocate_neighbors\030\003 \001(\0162$.ope" +
117 "rations_research.OptionalBoolean\022B\n\024use_" +
118 "relocate_subtrip\030\031 \001(\0162$.operations_rese" +
119 "arch.OptionalBoolean\022:\n\014use_exchange\030\004 \001" +
120 "(\0162$.operations_research.OptionalBoolean" +
121 "\022?\n\021use_exchange_pair\030\026 \001(\0162$.operations" +
122 "_research.OptionalBoolean\022B\n\024use_exchang" +
123 "e_subtrip\030\032 \001(\0162$.operations_research.Op" +
124 "tionalBoolean\0227\n\tuse_cross\030\005 \001(\0162$.opera" +
125 "tions_research.OptionalBoolean\022@\n\022use_cr" +
126 "oss_exchange\030\006 \001(\0162$.operations_research" +
127 ".OptionalBoolean\022J\n\034use_relocate_expensi" +
128 "ve_chain\030\027 \001(\0162$.operations_research.Opt" +
129 "ionalBoolean\0229\n\013use_two_opt\030\007 \001(\0162$.oper" +
130 "ations_research.OptionalBoolean\0228\n\nuse_o" +
131 "r_opt\030\010 \001(\0162$.operations_research.Option" +
132 "alBoolean\022?\n\021use_lin_kernighan\030\t \001(\0162$.o" +
133 "perations_research.OptionalBoolean\0229\n\013us" +
134 "e_tsp_opt\030\n \001(\0162$.operations_research.Op" +
135 "tionalBoolean\022=\n\017use_make_active\030\013 \001(\0162$" +
136 ".operations_research.OptionalBoolean\022J\n\034" +
137 "use_relocate_and_make_active\030\025 \001(\0162$.ope" +
138 "rations_research.OptionalBoolean\022?\n\021use_" +
139 "make_inactive\030\014 \001(\0162$.operations_researc" +
140 "h.OptionalBoolean\022E\n\027use_make_chain_inac" +
141 "tive\030\r \001(\0162$.operations_research.Optiona" +
142 "lBoolean\022=\n\017use_swap_active\030\016 \001(\0162$.oper" +
143 "ations_research.OptionalBoolean\022F\n\030use_e" +
144 "xtended_swap_active\030\017 \001(\0162$.operations_r" +
145 "esearch.OptionalBoolean\022G\n\031use_node_pair" +
146 "_swap_active\030\024 \001(\0162$.operations_research" +
147 ".OptionalBoolean\022:\n\014use_path_lns\030\020 \001(\0162$" +
148 ".operations_research.OptionalBoolean\022?\n\021" +
149 "use_full_path_lns\030\021 \001(\0162$.operations_res" +
150 "earch.OptionalBoolean\0229\n\013use_tsp_lns\030\022 \001" +
151 "(\0162$.operations_research.OptionalBoolean" +
152 "\022>\n\020use_inactive_lns\030\023 \001(\0162$.operations_" +
153 "research.OptionalBoolean\022T\n&use_global_c" +
154 "heapest_insertion_path_lns\030\033 \001(\0162$.opera" +
155 "tions_research.OptionalBoolean\022S\n%use_lo" +
156 "cal_cheapest_insertion_path_lns\030\034 \001(\0162$." +
157 "operations_research.OptionalBoolean\022l\n>u" +
158 "se_relocate_path_global_cheapest_inserti" +
159 "on_insert_unperformed\030! \001(\0162$.operations" +
160 "_research.OptionalBoolean\022_\n1use_global_" +
161 "cheapest_insertion_expensive_chain_lns\030\035" +
162 " \001(\0162$.operations_research.OptionalBoole" +
163 "an\022^\n0use_local_cheapest_insertion_expen" +
164 "sive_chain_lns\030\036 \001(\0162$.operations_resear" +
165 "ch.OptionalBoolean\022[\n-use_global_cheapes" +
166 "t_insertion_close_nodes_lns\030\037 \001(\0162$.oper" +
167 "ations_research.OptionalBoolean\022Z\n,use_l" +
168 "ocal_cheapest_insertion_close_nodes_lns\030" +
169 " \001(\0162$.operations_research.OptionalBool" +
170 "ean\032u\n ImprovementSearchLimitParameters\022" +
171 "$\n\034improvement_rate_coefficient\030& \001(\001\022+\n" +
172 "#improvement_rate_solutions_distance\030\' \001" +
173 "(\005\"3\n\020SchedulingSolver\022\t\n\005UNSET\020\000\022\010\n\004GLO" +
174 "P\020\001\022\n\n\006CP_SAT\020\002\"\250\001\n\026RoutingModelParamete" +
175 "rs\022J\n\021solver_parameters\030\001 \001(\0132/.operatio" +
176 "ns_research.ConstraintSolverParameters\022!" +
177 "\n\031reduce_vehicle_cost_model\030\002 \001(\010\022\037\n\027max" +
178 "_callback_cache_size\030\003 \001(\005BI\n#com.google" +
179 ".ortools.constraintsolverP\001\252\002\037Google.OrT" +
180 "ools.ConstraintSolverb\006proto3" 182 descriptor =
com.
google.protobuf.Descriptors.FileDescriptor
183 .internalBuildGeneratedFileFrom(descriptorData,
184 new com.
google.protobuf.Descriptors.FileDescriptor[] {
185 com.google.protobuf.DurationProto.getDescriptor(),
186 com.google.ortools.constraintsolver.RoutingEnums.getDescriptor(),
187 com.google.ortools.constraintsolver.SolverParameters.getDescriptor(),
188 com.google.ortools.sat.SatParametersOuterClass.getDescriptor(),
189 com.google.ortools.util.OptionalBooleanOuterClass.getDescriptor(),
191 internal_static_operations_research_RoutingSearchParameters_descriptor =
193 internal_static_operations_research_RoutingSearchParameters_fieldAccessorTable =
new 194 com.
google.protobuf.GeneratedMessageV3.FieldAccessorTable(
195 internal_static_operations_research_RoutingSearchParameters_descriptor,
196 new java.lang.String[] {
"FirstSolutionStrategy",
"UseUnfilteredFirstSolutionStrategy",
"SavingsNeighborsRatio",
"SavingsMaxMemoryUsageBytes",
"SavingsAddReverseArcs",
"SavingsArcCoefficient",
"SavingsParallelRoutes",
"CheapestInsertionFarthestSeedsRatio",
"CheapestInsertionFirstSolutionNeighborsRatio",
"CheapestInsertionFirstSolutionMinNeighbors",
"CheapestInsertionLsOperatorNeighborsRatio",
"CheapestInsertionLsOperatorMinNeighbors",
"CheapestInsertionFirstSolutionUseNeighborsRatioForInitialization",
"CheapestInsertionAddUnperformedEntries",
"ChristofidesUseMinimumMatching",
"LocalSearchOperators",
"UseMultiArmedBanditConcatenateOperators",
"MultiArmedBanditCompoundOperatorMemoryCoefficient",
"MultiArmedBanditCompoundOperatorExplorationCoefficient",
"RelocateExpensiveChainNumArcsToConsider",
"HeuristicExpensiveChainLnsNumArcsToConsider",
"HeuristicCloseNodesLnsNumNodes",
"LocalSearchMetaheuristic",
"GuidedLocalSearchLambdaCoefficient",
"UseDepthFirstSearch",
"UseCp",
"UseCpSat",
"UseGeneralizedCpSat",
"SatParameters",
"ContinuousSchedulingSolver",
"MixedIntegerSchedulingSolver",
"OptimizationStep",
"NumberOfSolutionsToCollect",
"SolutionLimit",
"TimeLimit",
"LnsTimeLimit",
"ImprovementLimitParameters",
"UseFullPropagation",
"LogSearch",
"LogCostScalingFactor",
"LogCostOffset",
"LogTag", });
197 internal_static_operations_research_RoutingSearchParameters_LocalSearchNeighborhoodOperators_descriptor =
198 internal_static_operations_research_RoutingSearchParameters_descriptor.getNestedTypes().get(0);
199 internal_static_operations_research_RoutingSearchParameters_LocalSearchNeighborhoodOperators_fieldAccessorTable =
new 200 com.
google.protobuf.GeneratedMessageV3.FieldAccessorTable(
201 internal_static_operations_research_RoutingSearchParameters_LocalSearchNeighborhoodOperators_descriptor,
202 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", });
203 internal_static_operations_research_RoutingSearchParameters_ImprovementSearchLimitParameters_descriptor =
204 internal_static_operations_research_RoutingSearchParameters_descriptor.getNestedTypes().get(1);
205 internal_static_operations_research_RoutingSearchParameters_ImprovementSearchLimitParameters_fieldAccessorTable =
new 206 com.
google.protobuf.GeneratedMessageV3.FieldAccessorTable(
207 internal_static_operations_research_RoutingSearchParameters_ImprovementSearchLimitParameters_descriptor,
208 new java.lang.String[] {
"ImprovementRateCoefficient",
"ImprovementRateSolutionsDistance", });
209 internal_static_operations_research_RoutingModelParameters_descriptor =
211 internal_static_operations_research_RoutingModelParameters_fieldAccessorTable =
new 212 com.
google.protobuf.GeneratedMessageV3.FieldAccessorTable(
213 internal_static_operations_research_RoutingModelParameters_descriptor,
214 new java.lang.String[] {
"SolverParameters",
"ReduceVehicleCostModel",
"MaxCallbackCacheSize", });
215 com.
google.protobuf.DurationProto.getDescriptor();