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_RoutingModelParameters_descriptor;
30 com.
google.protobuf.GeneratedMessageV3.FieldAccessorTable
31 internal_static_operations_research_RoutingModelParameters_fieldAccessorTable;
33 public static com.
google.protobuf.Descriptors.FileDescriptor
37 private static com.
google.protobuf.Descriptors.FileDescriptor
40 java.lang.String[] descriptorData = {
41 "\n2ortools/constraint_solver/routing_para" +
42 "meters.proto\022\023operations_research\032\036googl" +
43 "e/protobuf/duration.proto\032-ortools/const" +
44 "raint_solver/routing_enums.proto\0321ortool" +
45 "s/constraint_solver/solver_parameters.pr" +
46 "oto\032#ortools/util/optional_boolean.proto" +
47 "\"\350\036\n\027RoutingSearchParameters\022Q\n\027first_so" +
48 "lution_strategy\030\001 \001(\01620.operations_resea" +
49 "rch.FirstSolutionStrategy.Value\022.\n&use_u" +
50 "nfiltered_first_solution_strategy\030\002 \001(\010\022" +
51 "\037\n\027savings_neighbors_ratio\030\016 \001(\001\022&\n\036savi" +
52 "ngs_max_memory_usage_bytes\030\027 \001(\001\022 \n\030savi" +
53 "ngs_add_reverse_arcs\030\017 \001(\010\022\037\n\027savings_ar" +
54 "c_coefficient\030\022 \001(\001\022\037\n\027savings_parallel_" +
55 "routes\030\023 \001(\010\022/\n\'cheapest_insertion_farth" +
56 "est_seeds_ratio\030\020 \001(\001\0229\n1cheapest_insert" +
57 "ion_first_solution_neighbors_ratio\030\025 \001(\001" +
58 "\0226\n.cheapest_insertion_ls_operator_neigh" +
59 "bors_ratio\030\037 \001(\001\022)\n!christofides_use_min" +
60 "imum_matching\030\036 \001(\010\022m\n\026local_search_oper" +
61 "ators\030\003 \001(\0132M.operations_research.Routin" +
62 "gSearchParameters.LocalSearchNeighborhoo" +
63 "dOperators\0225\n-relocate_expensive_chain_n" +
64 "um_arcs_to_consider\030\024 \001(\005\022:\n2heuristic_e" +
65 "xpensive_chain_lns_num_arcs_to_consider\030" +
66 " \001(\005\022+\n#heuristic_close_nodes_lns_num_n" +
67 "odes\030# \001(\005\022W\n\032local_search_metaheuristic" +
68 "\030\004 \001(\01623.operations_research.LocalSearch" +
69 "Metaheuristic.Value\022.\n&guided_local_sear" +
70 "ch_lambda_coefficient\030\005 \001(\001\022\036\n\026use_depth" +
71 "_first_search\030\006 \001(\010\0224\n\006use_cp\030\034 \001(\0162$.op" +
72 "erations_research.OptionalBoolean\0228\n\nuse" +
73 "_cp_sat\030\033 \001(\0162$.operations_research.Opti" +
74 "onalBoolean\022c\n\034continuous_scheduling_sol" +
75 "ver\030! \001(\0162=.operations_research.RoutingS" +
76 "earchParameters.SchedulingSolver\022f\n\037mixe" +
77 "d_integer_scheduling_solver\030\" \001(\0162=.oper" +
78 "ations_research.RoutingSearchParameters." +
79 "SchedulingSolver\022\031\n\021optimization_step\030\007 " +
80 "\001(\001\022&\n\036number_of_solutions_to_collect\030\021 " +
81 "\001(\005\022\026\n\016solution_limit\030\010 \001(\003\022-\n\ntime_limi" +
82 "t\030\t \001(\0132\031.google.protobuf.Duration\0221\n\016ln" +
83 "s_time_limit\030\n \001(\0132\031.google.protobuf.Dur" +
84 "ation\022\034\n\024use_full_propagation\030\013 \001(\010\022\022\n\nl" +
85 "og_search\030\r \001(\010\022\037\n\027log_cost_scaling_fact" +
86 "or\030\026 \001(\001\022\027\n\017log_cost_offset\030\035 \001(\001\022\017\n\007log" +
87 "_tag\030$ \001(\t\032\351\021\n LocalSearchNeighborhoodOp" +
88 "erators\022:\n\014use_relocate\030\001 \001(\0162$.operatio" +
89 "ns_research.OptionalBoolean\022?\n\021use_reloc" +
90 "ate_pair\030\002 \001(\0162$.operations_research.Opt" +
91 "ionalBoolean\022E\n\027use_light_relocate_pair\030" +
92 "\030 \001(\0162$.operations_research.OptionalBool" +
93 "ean\022D\n\026use_relocate_neighbors\030\003 \001(\0162$.op" +
94 "erations_research.OptionalBoolean\022B\n\024use" +
95 "_relocate_subtrip\030\031 \001(\0162$.operations_res" +
96 "earch.OptionalBoolean\022:\n\014use_exchange\030\004 " +
97 "\001(\0162$.operations_research.OptionalBoolea" +
98 "n\022?\n\021use_exchange_pair\030\026 \001(\0162$.operation" +
99 "s_research.OptionalBoolean\022B\n\024use_exchan" +
100 "ge_subtrip\030\032 \001(\0162$.operations_research.O" +
101 "ptionalBoolean\0227\n\tuse_cross\030\005 \001(\0162$.oper" +
102 "ations_research.OptionalBoolean\022@\n\022use_c" +
103 "ross_exchange\030\006 \001(\0162$.operations_researc" +
104 "h.OptionalBoolean\022J\n\034use_relocate_expens" +
105 "ive_chain\030\027 \001(\0162$.operations_research.Op" +
106 "tionalBoolean\0229\n\013use_two_opt\030\007 \001(\0162$.ope" +
107 "rations_research.OptionalBoolean\0228\n\nuse_" +
108 "or_opt\030\010 \001(\0162$.operations_research.Optio" +
109 "nalBoolean\022?\n\021use_lin_kernighan\030\t \001(\0162$." +
110 "operations_research.OptionalBoolean\0229\n\013u" +
111 "se_tsp_opt\030\n \001(\0162$.operations_research.O" +
112 "ptionalBoolean\022=\n\017use_make_active\030\013 \001(\0162" +
113 "$.operations_research.OptionalBoolean\022J\n" +
114 "\034use_relocate_and_make_active\030\025 \001(\0162$.op" +
115 "erations_research.OptionalBoolean\022?\n\021use" +
116 "_make_inactive\030\014 \001(\0162$.operations_resear" +
117 "ch.OptionalBoolean\022E\n\027use_make_chain_ina" +
118 "ctive\030\r \001(\0162$.operations_research.Option" +
119 "alBoolean\022=\n\017use_swap_active\030\016 \001(\0162$.ope" +
120 "rations_research.OptionalBoolean\022F\n\030use_" +
121 "extended_swap_active\030\017 \001(\0162$.operations_" +
122 "research.OptionalBoolean\022G\n\031use_node_pai" +
123 "r_swap_active\030\024 \001(\0162$.operations_researc" +
124 "h.OptionalBoolean\022:\n\014use_path_lns\030\020 \001(\0162" +
125 "$.operations_research.OptionalBoolean\022?\n" +
126 "\021use_full_path_lns\030\021 \001(\0162$.operations_re" +
127 "search.OptionalBoolean\0229\n\013use_tsp_lns\030\022 " +
128 "\001(\0162$.operations_research.OptionalBoolea" +
129 "n\022>\n\020use_inactive_lns\030\023 \001(\0162$.operations" +
130 "_research.OptionalBoolean\022T\n&use_global_" +
131 "cheapest_insertion_path_lns\030\033 \001(\0162$.oper" +
132 "ations_research.OptionalBoolean\022S\n%use_l" +
133 "ocal_cheapest_insertion_path_lns\030\034 \001(\0162$" +
134 ".operations_research.OptionalBoolean\022_\n1" +
135 "use_global_cheapest_insertion_expensive_" +
136 "chain_lns\030\035 \001(\0162$.operations_research.Op" +
137 "tionalBoolean\022^\n0use_local_cheapest_inse" +
138 "rtion_expensive_chain_lns\030\036 \001(\0162$.operat" +
139 "ions_research.OptionalBoolean\022[\n-use_glo" +
140 "bal_cheapest_insertion_close_nodes_lns\030\037" +
141 " \001(\0162$.operations_research.OptionalBoole" +
142 "an\022Z\n,use_local_cheapest_insertion_close" +
143 "_nodes_lns\030 \001(\0162$.operations_research.O" +
144 "ptionalBoolean\"3\n\020SchedulingSolver\022\t\n\005UN" +
145 "SET\020\000\022\010\n\004GLOP\020\001\022\n\n\006CP_SAT\020\002\"\250\001\n\026RoutingM" +
146 "odelParameters\022J\n\021solver_parameters\030\001 \001(" +
147 "\0132/.operations_research.ConstraintSolver" +
148 "Parameters\022!\n\031reduce_vehicle_cost_model\030" +
149 "\002 \001(\010\022\037\n\027max_callback_cache_size\030\003 \001(\005BI" +
150 "\n#com.google.ortools.constraintsolverP\001\252" +
151 "\002\037Google.OrTools.ConstraintSolverb\006proto" +
154 descriptor =
com.
google.protobuf.Descriptors.FileDescriptor
155 .internalBuildGeneratedFileFrom(descriptorData,
156 new com.
google.protobuf.Descriptors.FileDescriptor[] {
157 com.google.protobuf.DurationProto.getDescriptor(),
158 com.google.ortools.constraintsolver.RoutingEnums.getDescriptor(),
159 com.google.ortools.constraintsolver.SolverParameters.getDescriptor(),
160 com.google.ortools.util.OptionalBooleanOuterClass.getDescriptor(),
162 internal_static_operations_research_RoutingSearchParameters_descriptor =
164 internal_static_operations_research_RoutingSearchParameters_fieldAccessorTable =
new
165 com.
google.protobuf.GeneratedMessageV3.FieldAccessorTable(
166 internal_static_operations_research_RoutingSearchParameters_descriptor,
167 new java.lang.String[] {
"FirstSolutionStrategy",
"UseUnfilteredFirstSolutionStrategy",
"SavingsNeighborsRatio",
"SavingsMaxMemoryUsageBytes",
"SavingsAddReverseArcs",
"SavingsArcCoefficient",
"SavingsParallelRoutes",
"CheapestInsertionFarthestSeedsRatio",
"CheapestInsertionFirstSolutionNeighborsRatio",
"CheapestInsertionLsOperatorNeighborsRatio",
"ChristofidesUseMinimumMatching",
"LocalSearchOperators",
"RelocateExpensiveChainNumArcsToConsider",
"HeuristicExpensiveChainLnsNumArcsToConsider",
"HeuristicCloseNodesLnsNumNodes",
"LocalSearchMetaheuristic",
"GuidedLocalSearchLambdaCoefficient",
"UseDepthFirstSearch",
"UseCp",
"UseCpSat",
"ContinuousSchedulingSolver",
"MixedIntegerSchedulingSolver",
"OptimizationStep",
"NumberOfSolutionsToCollect",
"SolutionLimit",
"TimeLimit",
"LnsTimeLimit",
"UseFullPropagation",
"LogSearch",
"LogCostScalingFactor",
"LogCostOffset",
"LogTag", });
168 internal_static_operations_research_RoutingSearchParameters_LocalSearchNeighborhoodOperators_descriptor =
169 internal_static_operations_research_RoutingSearchParameters_descriptor.getNestedTypes().get(0);
170 internal_static_operations_research_RoutingSearchParameters_LocalSearchNeighborhoodOperators_fieldAccessorTable =
new
171 com.
google.protobuf.GeneratedMessageV3.FieldAccessorTable(
172 internal_static_operations_research_RoutingSearchParameters_LocalSearchNeighborhoodOperators_descriptor,
173 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",
"UseGlobalCheapestInsertionExpensiveChainLns",
"UseLocalCheapestInsertionExpensiveChainLns",
"UseGlobalCheapestInsertionCloseNodesLns",
"UseLocalCheapestInsertionCloseNodesLns", });
174 internal_static_operations_research_RoutingModelParameters_descriptor =
176 internal_static_operations_research_RoutingModelParameters_fieldAccessorTable =
new
177 com.
google.protobuf.GeneratedMessageV3.FieldAccessorTable(
178 internal_static_operations_research_RoutingModelParameters_descriptor,
179 new java.lang.String[] {
"SolverParameters",
"ReduceVehicleCostModel",
"MaxCallbackCacheSize", });
180 com.
google.protobuf.DurationProto.getDescriptor();