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/util/optional_boolean.proto" +
52 "\"\364$\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\022P\nHcheapest_insertion_first_solu" +
68 "tion_use_neighbors_ratio_for_initializat" +
69 "ion\030. \001(\010\0222\n*cheapest_insertion_add_unpe" +
70 "rformed_entries\030( \001(\010\022)\n!christofides_us" +
71 "e_minimum_matching\030\036 \001(\010\022m\n\026local_search" +
72 "_operators\030\003 \001(\0132M.operations_research.R" +
73 "outingSearchParameters.LocalSearchNeighb" +
74 "orhoodOperators\0224\n,use_multi_armed_bandi" +
75 "t_concatenate_operators\030) \001(\010\022?\n7multi_a" +
76 "rmed_bandit_compound_operator_memory_coe" +
77 "fficient\030* \001(\001\022D\n<multi_armed_bandit_com" +
78 "pound_operator_exploration_coefficient\030+" +
79 " \001(\001\0225\n-relocate_expensive_chain_num_arc" +
80 "s_to_consider\030\024 \001(\005\022:\n2heuristic_expensi" +
81 "ve_chain_lns_num_arcs_to_consider\030 \001(\005\022" +
82 "+\n#heuristic_close_nodes_lns_num_nodes\030#" +
83 " \001(\005\022W\n\032local_search_metaheuristic\030\004 \001(\016" +
84 "23.operations_research.LocalSearchMetahe" +
85 "uristic.Value\022.\n&guided_local_search_lam" +
86 "bda_coefficient\030\005 \001(\001\022\036\n\026use_depth_first" +
87 "_search\030\006 \001(\010\0224\n\006use_cp\030\034 \001(\0162$.operatio" +
88 "ns_research.OptionalBoolean\0228\n\nuse_cp_sa" +
89 "t\030\033 \001(\0162$.operations_research.OptionalBo" +
90 "olean\022c\n\034continuous_scheduling_solver\030! " +
91 "\001(\0162=.operations_research.RoutingSearchP" +
92 "arameters.SchedulingSolver\022f\n\037mixed_inte" +
93 "ger_scheduling_solver\030\" \001(\0162=.operations" +
94 "_research.RoutingSearchParameters.Schedu" +
95 "lingSolver\022\031\n\021optimization_step\030\007 \001(\001\022&\n" +
96 "\036number_of_solutions_to_collect\030\021 \001(\005\022\026\n" +
97 "\016solution_limit\030\010 \001(\003\022-\n\ntime_limit\030\t \001(" +
98 "\0132\031.google.protobuf.Duration\0221\n\016lns_time" +
99 "_limit\030\n \001(\0132\031.google.protobuf.Duration\022" +
100 "s\n\034improvement_limit_parameters\030% \001(\0132M." +
101 "operations_research.RoutingSearchParamet" +
102 "ers.ImprovementSearchLimitParameters\022\034\n\024" +
103 "use_full_propagation\030\013 \001(\010\022\022\n\nlog_search" +
104 "\030\r \001(\010\022\037\n\027log_cost_scaling_factor\030\026 \001(\001\022" +
105 "\027\n\017log_cost_offset\030\035 \001(\001\022\017\n\007log_tag\030$ \001(" +
106 "\t\032\327\022\n LocalSearchNeighborhoodOperators\022:" +
107 "\n\014use_relocate\030\001 \001(\0162$.operations_resear" +
108 "ch.OptionalBoolean\022?\n\021use_relocate_pair\030" +
109 "\002 \001(\0162$.operations_research.OptionalBool" +
110 "ean\022E\n\027use_light_relocate_pair\030\030 \001(\0162$.o" +
111 "perations_research.OptionalBoolean\022D\n\026us" +
112 "e_relocate_neighbors\030\003 \001(\0162$.operations_" +
113 "research.OptionalBoolean\022B\n\024use_relocate" +
114 "_subtrip\030\031 \001(\0162$.operations_research.Opt" +
115 "ionalBoolean\022:\n\014use_exchange\030\004 \001(\0162$.ope" +
116 "rations_research.OptionalBoolean\022?\n\021use_" +
117 "exchange_pair\030\026 \001(\0162$.operations_researc" +
118 "h.OptionalBoolean\022B\n\024use_exchange_subtri" +
119 "p\030\032 \001(\0162$.operations_research.OptionalBo" +
120 "olean\0227\n\tuse_cross\030\005 \001(\0162$.operations_re" +
121 "search.OptionalBoolean\022@\n\022use_cross_exch" +
122 "ange\030\006 \001(\0162$.operations_research.Optiona" +
123 "lBoolean\022J\n\034use_relocate_expensive_chain" +
124 "\030\027 \001(\0162$.operations_research.OptionalBoo" +
125 "lean\0229\n\013use_two_opt\030\007 \001(\0162$.operations_r" +
126 "esearch.OptionalBoolean\0228\n\nuse_or_opt\030\010 " +
127 "\001(\0162$.operations_research.OptionalBoolea" +
128 "n\022?\n\021use_lin_kernighan\030\t \001(\0162$.operation" +
129 "s_research.OptionalBoolean\0229\n\013use_tsp_op" +
130 "t\030\n \001(\0162$.operations_research.OptionalBo" +
131 "olean\022=\n\017use_make_active\030\013 \001(\0162$.operati" +
132 "ons_research.OptionalBoolean\022J\n\034use_relo" +
133 "cate_and_make_active\030\025 \001(\0162$.operations_" +
134 "research.OptionalBoolean\022?\n\021use_make_ina" +
135 "ctive\030\014 \001(\0162$.operations_research.Option" +
136 "alBoolean\022E\n\027use_make_chain_inactive\030\r \001" +
137 "(\0162$.operations_research.OptionalBoolean" +
138 "\022=\n\017use_swap_active\030\016 \001(\0162$.operations_r" +
139 "esearch.OptionalBoolean\022F\n\030use_extended_" +
140 "swap_active\030\017 \001(\0162$.operations_research." +
141 "OptionalBoolean\022G\n\031use_node_pair_swap_ac" +
142 "tive\030\024 \001(\0162$.operations_research.Optiona" +
143 "lBoolean\022:\n\014use_path_lns\030\020 \001(\0162$.operati" +
144 "ons_research.OptionalBoolean\022?\n\021use_full" +
145 "_path_lns\030\021 \001(\0162$.operations_research.Op" +
146 "tionalBoolean\0229\n\013use_tsp_lns\030\022 \001(\0162$.ope" +
147 "rations_research.OptionalBoolean\022>\n\020use_" +
148 "inactive_lns\030\023 \001(\0162$.operations_research" +
149 ".OptionalBoolean\022T\n&use_global_cheapest_" +
150 "insertion_path_lns\030\033 \001(\0162$.operations_re" +
151 "search.OptionalBoolean\022S\n%use_local_chea" +
152 "pest_insertion_path_lns\030\034 \001(\0162$.operatio" +
153 "ns_research.OptionalBoolean\022l\n>use_reloc" +
154 "ate_path_global_cheapest_insertion_inser" +
155 "t_unperformed\030! \001(\0162$.operations_researc" +
156 "h.OptionalBoolean\022_\n1use_global_cheapest" +
157 "_insertion_expensive_chain_lns\030\035 \001(\0162$.o" +
158 "perations_research.OptionalBoolean\022^\n0us" +
159 "e_local_cheapest_insertion_expensive_cha" +
160 "in_lns\030\036 \001(\0162$.operations_research.Optio" +
161 "nalBoolean\022[\n-use_global_cheapest_insert" +
162 "ion_close_nodes_lns\030\037 \001(\0162$.operations_r" +
163 "esearch.OptionalBoolean\022Z\n,use_local_che" +
164 "apest_insertion_close_nodes_lns\030 \001(\0162$." +
165 "operations_research.OptionalBoolean\032u\n I" +
166 "mprovementSearchLimitParameters\022$\n\034impro" +
167 "vement_rate_coefficient\030& \001(\001\022+\n#improve" +
168 "ment_rate_solutions_distance\030\' \001(\005\"3\n\020Sc" +
169 "hedulingSolver\022\t\n\005UNSET\020\000\022\010\n\004GLOP\020\001\022\n\n\006C" +
170 "P_SAT\020\002\"\250\001\n\026RoutingModelParameters\022J\n\021so" +
171 "lver_parameters\030\001 \001(\0132/.operations_resea" +
172 "rch.ConstraintSolverParameters\022!\n\031reduce" +
173 "_vehicle_cost_model\030\002 \001(\010\022\037\n\027max_callbac" +
174 "k_cache_size\030\003 \001(\005BI\n#com.google.ortools" +
175 ".constraintsolverP\001\252\002\037Google.OrTools.Con" +
176 "straintSolverb\006proto3"
178 descriptor = com.google.protobuf.Descriptors.FileDescriptor
179 .internalBuildGeneratedFileFrom(descriptorData,
180 new com.google.protobuf.Descriptors.FileDescriptor[] {
181 com.google.protobuf.DurationProto.getDescriptor(),
182 com.google.ortools.constraintsolver.RoutingEnums.getDescriptor(),
183 com.google.ortools.constraintsolver.SolverParameters.getDescriptor(),
184 com.google.ortools.util.OptionalBooleanOuterClass.getDescriptor(),
186 internal_static_operations_research_RoutingSearchParameters_descriptor =
188 internal_static_operations_research_RoutingSearchParameters_fieldAccessorTable =
new
189 com.google.protobuf.GeneratedMessageV3.FieldAccessorTable(
190 internal_static_operations_research_RoutingSearchParameters_descriptor,
191 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",
"ContinuousSchedulingSolver",
"MixedIntegerSchedulingSolver",
"OptimizationStep",
"NumberOfSolutionsToCollect",
"SolutionLimit",
"TimeLimit",
"LnsTimeLimit",
"ImprovementLimitParameters",
"UseFullPropagation",
"LogSearch",
"LogCostScalingFactor",
"LogCostOffset",
"LogTag", });
192 internal_static_operations_research_RoutingSearchParameters_LocalSearchNeighborhoodOperators_descriptor =
193 internal_static_operations_research_RoutingSearchParameters_descriptor.getNestedTypes().get(0);
194 internal_static_operations_research_RoutingSearchParameters_LocalSearchNeighborhoodOperators_fieldAccessorTable =
new
195 com.google.protobuf.GeneratedMessageV3.FieldAccessorTable(
196 internal_static_operations_research_RoutingSearchParameters_LocalSearchNeighborhoodOperators_descriptor,
197 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", });
198 internal_static_operations_research_RoutingSearchParameters_ImprovementSearchLimitParameters_descriptor =
199 internal_static_operations_research_RoutingSearchParameters_descriptor.getNestedTypes().get(1);
200 internal_static_operations_research_RoutingSearchParameters_ImprovementSearchLimitParameters_fieldAccessorTable =
new
201 com.google.protobuf.GeneratedMessageV3.FieldAccessorTable(
202 internal_static_operations_research_RoutingSearchParameters_ImprovementSearchLimitParameters_descriptor,
203 new java.lang.String[] {
"ImprovementRateCoefficient",
"ImprovementRateSolutionsDistance", });
204 internal_static_operations_research_RoutingModelParameters_descriptor =
206 internal_static_operations_research_RoutingModelParameters_fieldAccessorTable =
new
207 com.google.protobuf.GeneratedMessageV3.FieldAccessorTable(
208 internal_static_operations_research_RoutingModelParameters_descriptor,
209 new java.lang.String[] {
"SolverParameters",
"ReduceVehicleCostModel",
"MaxCallbackCacheSize", });
210 com.google.protobuf.DurationProto.getDescriptor();
211 com.google.ortools.constraintsolver.RoutingEnums.getDescriptor();
212 com.google.ortools.constraintsolver.SolverParameters.getDescriptor();
213 com.google.ortools.util.OptionalBooleanOuterClass.getDescriptor();