4 #ifndef GOOGLE_PROTOBUF_INCLUDED_ortools_2fconstraint_5fsolver_2frouting_5fparameters_2eproto 5 #define GOOGLE_PROTOBUF_INCLUDED_ortools_2fconstraint_5fsolver_2frouting_5fparameters_2eproto 10 #include <google/protobuf/port_def.inc> 11 #if PROTOBUF_VERSION < 3017000 12 #error This file was generated by a newer version of protoc which is 13 #error incompatible with your Protocol Buffer headers. Please update 16 #if 3017003 < PROTOBUF_MIN_PROTOC_VERSION 17 #error This file was generated by an older version of protoc which is 18 #error incompatible with your Protocol Buffer headers. Please 19 #error regenerate this file with a newer version of protoc. 22 #include <google/protobuf/port_undef.inc> 23 #include <google/protobuf/io/coded_stream.h> 24 #include <google/protobuf/arena.h> 25 #include <google/protobuf/arenastring.h> 26 #include <google/protobuf/generated_message_table_driven.h> 27 #include <google/protobuf/generated_message_util.h> 28 #include <google/protobuf/metadata_lite.h> 29 #include <google/protobuf/generated_message_reflection.h> 30 #include <google/protobuf/message.h> 31 #include <google/protobuf/repeated_field.h> 32 #include <google/protobuf/extension_set.h> 33 #include <google/protobuf/generated_enum_reflection.h> 34 #include <google/protobuf/unknown_field_set.h> 35 #include <google/protobuf/duration.pb.h> 41 #include <google/protobuf/port_def.inc> 42 #define PROTOBUF_INTERNAL_EXPORT_ortools_2fconstraint_5fsolver_2frouting_5fparameters_2eproto 43 PROTOBUF_NAMESPACE_OPEN
47 PROTOBUF_NAMESPACE_CLOSE
51 static const ::PROTOBUF_NAMESPACE_ID::internal::ParseTableField entries[]
53 static const ::PROTOBUF_NAMESPACE_ID::internal::AuxiliaryParseTableField aux[]
55 static const ::PROTOBUF_NAMESPACE_ID::internal::ParseTable schema[4]
57 static const ::PROTOBUF_NAMESPACE_ID::internal::FieldMetadata
field_metadata[];
59 static const ::PROTOBUF_NAMESPACE_ID::uint32
offsets[];
63 class RoutingModelParameters;
64 struct RoutingModelParametersDefaultTypeInternal;
66 class RoutingSearchParameters;
67 struct RoutingSearchParametersDefaultTypeInternal;
69 class RoutingSearchParameters_ImprovementSearchLimitParameters;
70 struct RoutingSearchParameters_ImprovementSearchLimitParametersDefaultTypeInternal;
72 class RoutingSearchParameters_LocalSearchNeighborhoodOperators;
73 struct RoutingSearchParameters_LocalSearchNeighborhoodOperatorsDefaultTypeInternal;
76 PROTOBUF_NAMESPACE_OPEN
81 PROTOBUF_NAMESPACE_CLOSE
101 "Incorrect type passed to function RoutingSearchParameters_SchedulingSolver_Name.");
102 return ::PROTOBUF_NAMESPACE_ID::internal::NameOfEnum(
107 return ::PROTOBUF_NAMESPACE_ID::internal::ParseNamedEnum<RoutingSearchParameters_SchedulingSolver>(
113 public ::PROTOBUF_NAMESPACE_ID::Message {
122 *
this = ::std::move(from);
130 if (
this == &from)
return *
this;
131 if (GetOwningArena() == from.GetOwningArena()) {
139 static const ::PROTOBUF_NAMESPACE_ID::Descriptor*
descriptor() {
152 return reinterpret_cast<const RoutingSearchParameters_LocalSearchNeighborhoodOperators*>(
162 if (other ==
this)
return;
163 if (GetOwningArena() == other->GetOwningArena()) {
166 ::PROTOBUF_NAMESPACE_ID::internal::GenericSwap(
this, other);
170 if (other ==
this)
return;
171 GOOGLE_DCHECK(GetOwningArena() == other->GetOwningArena());
182 return CreateMaybeMessage<RoutingSearchParameters_LocalSearchNeighborhoodOperators>(arena);
184 using ::PROTOBUF_NAMESPACE_ID::Message::CopyFrom;
186 using ::PROTOBUF_NAMESPACE_ID::Message::MergeFrom;
189 static void MergeImpl(::PROTOBUF_NAMESPACE_ID::Message*to, const ::PROTOBUF_NAMESPACE_ID::Message&from);
191 PROTOBUF_ATTRIBUTE_REINITIALIZES
void Clear() final;
197 ::PROTOBUF_NAMESPACE_ID::uint8* target, ::PROTOBUF_NAMESPACE_ID::io::EpsCopyOutputStream* stream) const final;
203 void SetCachedSize(
int size)
const final;
205 friend class ::PROTOBUF_NAMESPACE_ID::internal::AnyMetadata;
206 static ::PROTOBUF_NAMESPACE_ID::StringPiece FullMessageName() {
207 return "operations_research.RoutingSearchParameters.LocalSearchNeighborhoodOperators";
211 bool is_message_owned =
false);
213 static void ArenaDtor(
void*
object);
214 inline void RegisterArenaDtor(::PROTOBUF_NAMESPACE_ID::Arena* arena);
218 const ::PROTOBUF_NAMESPACE_ID::Message::ClassData*
GetClassData() const final;
220 ::PROTOBUF_NAMESPACE_ID::Metadata
GetMetadata() const final;
562 template <
typename T>
friend class ::PROTOBUF_NAMESPACE_ID::Arena::InternalHelper;
563 typedef void InternalArenaConstructable_;
564 typedef void DestructorSkippable_;
566 int use_relocate_pair_;
567 int use_relocate_neighbors_;
570 int use_cross_exchange_;
573 int use_lin_kernighan_;
575 int use_make_active_;
576 int use_make_inactive_;
577 int use_make_chain_inactive_;
578 int use_swap_active_;
579 int use_extended_swap_active_;
581 int use_full_path_lns_;
583 int use_inactive_lns_;
584 int use_node_pair_swap_active_;
585 int use_relocate_and_make_active_;
586 int use_exchange_pair_;
587 int use_relocate_expensive_chain_;
588 int use_light_relocate_pair_;
589 int use_relocate_subtrip_;
590 int use_exchange_subtrip_;
591 int use_global_cheapest_insertion_path_lns_;
592 int use_local_cheapest_insertion_path_lns_;
593 int use_global_cheapest_insertion_expensive_chain_lns_;
594 int use_local_cheapest_insertion_expensive_chain_lns_;
595 int use_global_cheapest_insertion_close_nodes_lns_;
596 int use_local_cheapest_insertion_close_nodes_lns_;
597 int use_relocate_path_global_cheapest_insertion_insert_unperformed_;
598 mutable ::PROTOBUF_NAMESPACE_ID::internal::CachedSize _cached_size_;
599 friend struct ::TableStruct_ortools_2fconstraint_5fsolver_2frouting_5fparameters_2eproto;
604 public ::PROTOBUF_NAMESPACE_ID::Message {
613 *
this = ::std::move(from);
621 if (
this == &from)
return *
this;
622 if (GetOwningArena() == from.GetOwningArena()) {
630 static const ::PROTOBUF_NAMESPACE_ID::Descriptor*
descriptor() {
643 return reinterpret_cast<const RoutingSearchParameters_ImprovementSearchLimitParameters*>(
653 if (other ==
this)
return;
654 if (GetOwningArena() == other->GetOwningArena()) {
657 ::PROTOBUF_NAMESPACE_ID::internal::GenericSwap(
this, other);
661 if (other ==
this)
return;
662 GOOGLE_DCHECK(GetOwningArena() == other->GetOwningArena());
673 return CreateMaybeMessage<RoutingSearchParameters_ImprovementSearchLimitParameters>(arena);
675 using ::PROTOBUF_NAMESPACE_ID::Message::CopyFrom;
677 using ::PROTOBUF_NAMESPACE_ID::Message::MergeFrom;
680 static void MergeImpl(::PROTOBUF_NAMESPACE_ID::Message*to, const ::PROTOBUF_NAMESPACE_ID::Message&from);
682 PROTOBUF_ATTRIBUTE_REINITIALIZES
void Clear() final;
688 ::PROTOBUF_NAMESPACE_ID::uint8* target, ::PROTOBUF_NAMESPACE_ID::io::EpsCopyOutputStream* stream) const final;
694 void SetCachedSize(
int size)
const final;
696 friend class ::PROTOBUF_NAMESPACE_ID::internal::AnyMetadata;
697 static ::PROTOBUF_NAMESPACE_ID::StringPiece FullMessageName() {
698 return "operations_research.RoutingSearchParameters.ImprovementSearchLimitParameters";
702 bool is_message_owned =
false);
704 static void ArenaDtor(
void*
object);
705 inline void RegisterArenaDtor(::PROTOBUF_NAMESPACE_ID::Arena* arena);
709 const ::PROTOBUF_NAMESPACE_ID::Message::ClassData*
GetClassData() const final;
711 ::PROTOBUF_NAMESPACE_ID::Metadata
GetMetadata() const final;
726 ::PROTOBUF_NAMESPACE_ID::int32 _internal_improvement_rate_solutions_distance()
const;
727 void _internal_set_improvement_rate_solutions_distance(::PROTOBUF_NAMESPACE_ID::int32
value);
735 double _internal_improvement_rate_coefficient()
const;
736 void _internal_set_improvement_rate_coefficient(
double value);
743 template <
typename T>
friend class ::PROTOBUF_NAMESPACE_ID::Arena::InternalHelper;
744 typedef void InternalArenaConstructable_;
745 typedef void DestructorSkippable_;
746 ::PROTOBUF_NAMESPACE_ID::int32 improvement_rate_solutions_distance_;
747 double improvement_rate_coefficient_;
748 mutable ::PROTOBUF_NAMESPACE_ID::internal::CachedSize _cached_size_;
749 friend struct ::TableStruct_ortools_2fconstraint_5fsolver_2frouting_5fparameters_2eproto;
754 public ::PROTOBUF_NAMESPACE_ID::Message {
763 *
this = ::std::move(from);
771 if (
this == &from)
return *
this;
772 if (GetOwningArena() == from.GetOwningArena()) {
780 static const ::PROTOBUF_NAMESPACE_ID::Descriptor*
descriptor() {
793 return reinterpret_cast<const RoutingSearchParameters*>(
803 if (other ==
this)
return;
804 if (GetOwningArena() == other->GetOwningArena()) {
807 ::PROTOBUF_NAMESPACE_ID::internal::GenericSwap(
this, other);
811 if (other ==
this)
return;
812 GOOGLE_DCHECK(GetOwningArena() == other->GetOwningArena());
823 return CreateMaybeMessage<RoutingSearchParameters>(arena);
825 using ::PROTOBUF_NAMESPACE_ID::Message::CopyFrom;
827 using ::PROTOBUF_NAMESPACE_ID::Message::MergeFrom;
830 static void MergeImpl(::PROTOBUF_NAMESPACE_ID::Message*to, const ::PROTOBUF_NAMESPACE_ID::Message&from);
832 PROTOBUF_ATTRIBUTE_REINITIALIZES
void Clear() final;
838 ::PROTOBUF_NAMESPACE_ID::uint8* target, ::PROTOBUF_NAMESPACE_ID::io::EpsCopyOutputStream* stream) const final;
844 void SetCachedSize(
int size)
const final;
846 friend class ::PROTOBUF_NAMESPACE_ID::internal::AnyMetadata;
847 static ::PROTOBUF_NAMESPACE_ID::StringPiece FullMessageName() {
848 return "operations_research.RoutingSearchParameters";
852 bool is_message_owned =
false);
854 static void ArenaDtor(
void*
object);
855 inline void RegisterArenaDtor(::PROTOBUF_NAMESPACE_ID::Arena* arena);
859 const ::PROTOBUF_NAMESPACE_ID::Message::ClassData*
GetClassData() const final;
861 ::PROTOBUF_NAMESPACE_ID::Metadata
GetMetadata() const final;
884 static inline const ::PROTOBUF_NAMESPACE_ID::EnumDescriptor*
892 "Incorrect type passed to function SchedulingSolver_Name.");
948 const std::string&
log_tag()
const;
949 template <
typename ArgT0 =
const std::string&,
typename... ArgT>
955 const std::string& _internal_log_tag()
const;
956 inline PROTOBUF_ALWAYS_INLINE
void _internal_set_log_tag(
const std::string&
value);
957 std::string* _internal_mutable_log_tag();
963 bool _internal_has_local_search_operators()
const;
966 const ::operations_research::RoutingSearchParameters_LocalSearchNeighborhoodOperators&
local_search_operators()
const;
971 const ::operations_research::RoutingSearchParameters_LocalSearchNeighborhoodOperators& _internal_local_search_operators()
const;
981 bool _internal_has_time_limit()
const;
984 const PROTOBUF_NAMESPACE_ID::Duration&
time_limit()
const;
989 const PROTOBUF_NAMESPACE_ID::Duration& _internal_time_limit()
const;
990 PROTOBUF_NAMESPACE_ID::Duration* _internal_mutable_time_limit();
999 bool _internal_has_lns_time_limit()
const;
1007 const PROTOBUF_NAMESPACE_ID::Duration& _internal_lns_time_limit()
const;
1008 PROTOBUF_NAMESPACE_ID::Duration* _internal_mutable_lns_time_limit();
1017 bool _internal_has_improvement_limit_parameters()
const;
1025 const ::operations_research::RoutingSearchParameters_ImprovementSearchLimitParameters& _internal_improvement_limit_parameters()
const;
1035 bool _internal_has_sat_parameters()
const;
1038 const ::operations_research::sat::SatParameters&
sat_parameters()
const;
1043 const ::operations_research::sat::SatParameters& _internal_sat_parameters()
const;
1073 double _internal_guided_local_search_lambda_coefficient()
const;
1074 void _internal_set_guided_local_search_lambda_coefficient(
double value);
1082 double _internal_optimization_step()
const;
1083 void _internal_set_optimization_step(
double value);
1091 ::PROTOBUF_NAMESPACE_ID::int64 _internal_solution_limit()
const;
1092 void _internal_set_solution_limit(::PROTOBUF_NAMESPACE_ID::int64
value);
1100 bool _internal_use_full_propagation()
const;
1101 void _internal_set_use_full_propagation(
bool value);
1109 bool _internal_log_search()
const;
1110 void _internal_set_log_search(
bool value);
1118 ::PROTOBUF_NAMESPACE_ID::int32 _internal_number_of_solutions_to_collect()
const;
1119 void _internal_set_number_of_solutions_to_collect(::PROTOBUF_NAMESPACE_ID::int32
value);
1127 double _internal_savings_neighbors_ratio()
const;
1128 void _internal_set_savings_neighbors_ratio(
double value);
1136 double _internal_cheapest_insertion_farthest_seeds_ratio()
const;
1137 void _internal_set_cheapest_insertion_farthest_seeds_ratio(
double value);
1145 double _internal_savings_arc_coefficient()
const;
1146 void _internal_set_savings_arc_coefficient(
double value);
1154 ::PROTOBUF_NAMESPACE_ID::int32 _internal_relocate_expensive_chain_num_arcs_to_consider()
const;
1155 void _internal_set_relocate_expensive_chain_num_arcs_to_consider(::PROTOBUF_NAMESPACE_ID::int32
value);
1163 bool _internal_use_unfiltered_first_solution_strategy()
const;
1164 void _internal_set_use_unfiltered_first_solution_strategy(
bool value);
1172 bool _internal_savings_add_reverse_arcs()
const;
1173 void _internal_set_savings_add_reverse_arcs(
bool value);
1181 bool _internal_savings_parallel_routes()
const;
1182 void _internal_set_savings_parallel_routes(
bool value);
1190 bool _internal_cheapest_insertion_first_solution_use_neighbors_ratio_for_initialization()
const;
1191 void _internal_set_cheapest_insertion_first_solution_use_neighbors_ratio_for_initialization(
bool value);
1199 double _internal_cheapest_insertion_first_solution_neighbors_ratio()
const;
1200 void _internal_set_cheapest_insertion_first_solution_neighbors_ratio(
double value);
1208 double _internal_log_cost_scaling_factor()
const;
1209 void _internal_set_log_cost_scaling_factor(
double value);
1217 double _internal_savings_max_memory_usage_bytes()
const;
1218 void _internal_set_savings_max_memory_usage_bytes(
double value);
1244 double _internal_log_cost_offset()
const;
1245 void _internal_set_log_cost_offset(
double value);
1253 bool _internal_cheapest_insertion_add_unperformed_entries()
const;
1254 void _internal_set_cheapest_insertion_add_unperformed_entries(
bool value);
1262 bool _internal_christofides_use_minimum_matching()
const;
1263 void _internal_set_christofides_use_minimum_matching(
bool value);
1271 bool _internal_use_multi_armed_bandit_concatenate_operators()
const;
1272 void _internal_set_use_multi_armed_bandit_concatenate_operators(
bool value);
1280 bool _internal_use_depth_first_search()
const;
1281 void _internal_set_use_depth_first_search(
bool value);
1289 ::PROTOBUF_NAMESPACE_ID::int32 _internal_heuristic_expensive_chain_lns_num_arcs_to_consider()
const;
1290 void _internal_set_heuristic_expensive_chain_lns_num_arcs_to_consider(::PROTOBUF_NAMESPACE_ID::int32
value);
1298 double _internal_cheapest_insertion_ls_operator_neighbors_ratio()
const;
1299 void _internal_set_cheapest_insertion_ls_operator_neighbors_ratio(
double value);
1325 ::PROTOBUF_NAMESPACE_ID::int32 _internal_heuristic_close_nodes_lns_num_nodes()
const;
1326 void _internal_set_heuristic_close_nodes_lns_num_nodes(::PROTOBUF_NAMESPACE_ID::int32
value);
1334 ::PROTOBUF_NAMESPACE_ID::int32 _internal_cheapest_insertion_first_solution_min_neighbors()
const;
1335 void _internal_set_cheapest_insertion_first_solution_min_neighbors(::PROTOBUF_NAMESPACE_ID::int32
value);
1343 double _internal_multi_armed_bandit_compound_operator_memory_coefficient()
const;
1344 void _internal_set_multi_armed_bandit_compound_operator_memory_coefficient(
double value);
1352 double _internal_multi_armed_bandit_compound_operator_exploration_coefficient()
const;
1353 void _internal_set_multi_armed_bandit_compound_operator_exploration_coefficient(
double value);
1361 ::PROTOBUF_NAMESPACE_ID::int32 _internal_cheapest_insertion_ls_operator_min_neighbors()
const;
1362 void _internal_set_cheapest_insertion_ls_operator_min_neighbors(::PROTOBUF_NAMESPACE_ID::int32
value);
1378 template <
typename T>
friend class ::PROTOBUF_NAMESPACE_ID::Arena::InternalHelper;
1379 typedef void InternalArenaConstructable_;
1380 typedef void DestructorSkippable_;
1381 ::PROTOBUF_NAMESPACE_ID::internal::ArenaStringPtr log_tag_;
1383 PROTOBUF_NAMESPACE_ID::Duration* time_limit_;
1384 PROTOBUF_NAMESPACE_ID::Duration* lns_time_limit_;
1387 int first_solution_strategy_;
1388 int local_search_metaheuristic_;
1389 double guided_local_search_lambda_coefficient_;
1390 double optimization_step_;
1391 ::PROTOBUF_NAMESPACE_ID::int64 solution_limit_;
1392 bool use_full_propagation_;
1394 ::PROTOBUF_NAMESPACE_ID::int32 number_of_solutions_to_collect_;
1395 double savings_neighbors_ratio_;
1396 double cheapest_insertion_farthest_seeds_ratio_;
1397 double savings_arc_coefficient_;
1398 ::PROTOBUF_NAMESPACE_ID::int32 relocate_expensive_chain_num_arcs_to_consider_;
1399 bool use_unfiltered_first_solution_strategy_;
1400 bool savings_add_reverse_arcs_;
1401 bool savings_parallel_routes_;
1402 bool cheapest_insertion_first_solution_use_neighbors_ratio_for_initialization_;
1403 double cheapest_insertion_first_solution_neighbors_ratio_;
1404 double log_cost_scaling_factor_;
1405 double savings_max_memory_usage_bytes_;
1408 double log_cost_offset_;
1409 bool cheapest_insertion_add_unperformed_entries_;
1410 bool christofides_use_minimum_matching_;
1411 bool use_multi_armed_bandit_concatenate_operators_;
1412 bool use_depth_first_search_;
1413 ::PROTOBUF_NAMESPACE_ID::int32 heuristic_expensive_chain_lns_num_arcs_to_consider_;
1414 double cheapest_insertion_ls_operator_neighbors_ratio_;
1415 int continuous_scheduling_solver_;
1416 int mixed_integer_scheduling_solver_;
1417 ::PROTOBUF_NAMESPACE_ID::int32 heuristic_close_nodes_lns_num_nodes_;
1418 ::PROTOBUF_NAMESPACE_ID::int32 cheapest_insertion_first_solution_min_neighbors_;
1419 double multi_armed_bandit_compound_operator_memory_coefficient_;
1420 double multi_armed_bandit_compound_operator_exploration_coefficient_;
1421 ::PROTOBUF_NAMESPACE_ID::int32 cheapest_insertion_ls_operator_min_neighbors_;
1422 int use_generalized_cp_sat_;
1423 mutable ::PROTOBUF_NAMESPACE_ID::internal::CachedSize _cached_size_;
1424 friend struct ::TableStruct_ortools_2fconstraint_5fsolver_2frouting_5fparameters_2eproto;
1429 public ::PROTOBUF_NAMESPACE_ID::Message {
1438 *
this = ::std::move(from);
1446 if (
this == &from)
return *
this;
1447 if (GetOwningArena() == from.GetOwningArena()) {
1448 InternalSwap(&from);
1468 return reinterpret_cast<const RoutingModelParameters*>(
1478 if (other ==
this)
return;
1479 if (GetOwningArena() == other->GetOwningArena()) {
1480 InternalSwap(other);
1482 ::PROTOBUF_NAMESPACE_ID::internal::GenericSwap(
this, other);
1486 if (other ==
this)
return;
1487 GOOGLE_DCHECK(GetOwningArena() == other->GetOwningArena());
1488 InternalSwap(other);
1498 return CreateMaybeMessage<RoutingModelParameters>(arena);
1500 using ::PROTOBUF_NAMESPACE_ID::Message::CopyFrom;
1502 using ::PROTOBUF_NAMESPACE_ID::Message::MergeFrom;
1505 static void MergeImpl(::PROTOBUF_NAMESPACE_ID::Message*to, const ::PROTOBUF_NAMESPACE_ID::Message&from);
1507 PROTOBUF_ATTRIBUTE_REINITIALIZES
void Clear() final;
1513 ::PROTOBUF_NAMESPACE_ID::uint8* target, ::PROTOBUF_NAMESPACE_ID::io::EpsCopyOutputStream* stream) const final;
1519 void SetCachedSize(
int size)
const final;
1521 friend class ::PROTOBUF_NAMESPACE_ID::internal::AnyMetadata;
1522 static ::PROTOBUF_NAMESPACE_ID::StringPiece FullMessageName() {
1523 return "operations_research.RoutingModelParameters";
1527 bool is_message_owned =
false);
1529 static void ArenaDtor(
void*
object);
1530 inline void RegisterArenaDtor(::PROTOBUF_NAMESPACE_ID::Arena* arena);
1534 const ::PROTOBUF_NAMESPACE_ID::Message::ClassData*
GetClassData() const final;
1536 ::PROTOBUF_NAMESPACE_ID::Metadata
GetMetadata() const final;
1550 bool _internal_has_solver_parameters()
const;
1553 const ::operations_research::ConstraintSolverParameters&
solver_parameters()
const;
1558 const ::operations_research::ConstraintSolverParameters& _internal_solver_parameters()
const;
1570 bool _internal_reduce_vehicle_cost_model()
const;
1571 void _internal_set_reduce_vehicle_cost_model(
bool value);
1579 ::PROTOBUF_NAMESPACE_ID::int32 _internal_max_callback_cache_size()
const;
1580 void _internal_set_max_callback_cache_size(::PROTOBUF_NAMESPACE_ID::int32
value);
1587 template <
typename T>
friend class ::PROTOBUF_NAMESPACE_ID::Arena::InternalHelper;
1588 typedef void InternalArenaConstructable_;
1589 typedef void DestructorSkippable_;
1591 bool reduce_vehicle_cost_model_;
1592 ::PROTOBUF_NAMESPACE_ID::int32 max_callback_cache_size_;
1593 mutable ::PROTOBUF_NAMESPACE_ID::internal::CachedSize _cached_size_;
1594 friend struct ::TableStruct_ortools_2fconstraint_5fsolver_2frouting_5fparameters_2eproto;
1602 #pragma GCC diagnostic push 1603 #pragma GCC diagnostic ignored "-Wstrict-aliasing" 1612 return static_cast< ::operations_research::OptionalBoolean >(use_relocate_);
1616 return _internal_use_relocate();
1620 use_relocate_ =
value;
1623 _internal_set_use_relocate(
value);
1629 use_relocate_pair_ = 0;
1632 return static_cast< ::operations_research::OptionalBoolean >(use_relocate_pair_);
1636 return _internal_use_relocate_pair();
1640 use_relocate_pair_ =
value;
1643 _internal_set_use_relocate_pair(
value);
1649 use_light_relocate_pair_ = 0;
1652 return static_cast< ::operations_research::OptionalBoolean >(use_light_relocate_pair_);
1656 return _internal_use_light_relocate_pair();
1660 use_light_relocate_pair_ =
value;
1663 _internal_set_use_light_relocate_pair(
value);
1669 use_relocate_neighbors_ = 0;
1672 return static_cast< ::operations_research::OptionalBoolean >(use_relocate_neighbors_);
1676 return _internal_use_relocate_neighbors();
1680 use_relocate_neighbors_ =
value;
1683 _internal_set_use_relocate_neighbors(
value);
1689 use_relocate_subtrip_ = 0;
1692 return static_cast< ::operations_research::OptionalBoolean >(use_relocate_subtrip_);
1696 return _internal_use_relocate_subtrip();
1700 use_relocate_subtrip_ =
value;
1703 _internal_set_use_relocate_subtrip(
value);
1712 return static_cast< ::operations_research::OptionalBoolean >(use_exchange_);
1716 return _internal_use_exchange();
1720 use_exchange_ =
value;
1723 _internal_set_use_exchange(
value);
1729 use_exchange_pair_ = 0;
1732 return static_cast< ::operations_research::OptionalBoolean >(use_exchange_pair_);
1736 return _internal_use_exchange_pair();
1740 use_exchange_pair_ =
value;
1743 _internal_set_use_exchange_pair(
value);
1749 use_exchange_subtrip_ = 0;
1752 return static_cast< ::operations_research::OptionalBoolean >(use_exchange_subtrip_);
1756 return _internal_use_exchange_subtrip();
1760 use_exchange_subtrip_ =
value;
1763 _internal_set_use_exchange_subtrip(
value);
1772 return static_cast< ::operations_research::OptionalBoolean >(use_cross_);
1776 return _internal_use_cross();
1783 _internal_set_use_cross(
value);
1789 use_cross_exchange_ = 0;
1792 return static_cast< ::operations_research::OptionalBoolean >(use_cross_exchange_);
1796 return _internal_use_cross_exchange();
1800 use_cross_exchange_ =
value;
1803 _internal_set_use_cross_exchange(
value);
1809 use_relocate_expensive_chain_ = 0;
1812 return static_cast< ::operations_research::OptionalBoolean >(use_relocate_expensive_chain_);
1816 return _internal_use_relocate_expensive_chain();
1820 use_relocate_expensive_chain_ =
value;
1823 _internal_set_use_relocate_expensive_chain(
value);
1832 return static_cast< ::operations_research::OptionalBoolean >(use_two_opt_);
1836 return _internal_use_two_opt();
1840 use_two_opt_ =
value;
1843 _internal_set_use_two_opt(
value);
1852 return static_cast< ::operations_research::OptionalBoolean >(use_or_opt_);
1856 return _internal_use_or_opt();
1860 use_or_opt_ =
value;
1863 _internal_set_use_or_opt(
value);
1869 use_lin_kernighan_ = 0;
1872 return static_cast< ::operations_research::OptionalBoolean >(use_lin_kernighan_);
1876 return _internal_use_lin_kernighan();
1880 use_lin_kernighan_ =
value;
1883 _internal_set_use_lin_kernighan(
value);
1892 return static_cast< ::operations_research::OptionalBoolean >(use_tsp_opt_);
1896 return _internal_use_tsp_opt();
1900 use_tsp_opt_ =
value;
1903 _internal_set_use_tsp_opt(
value);
1909 use_make_active_ = 0;
1912 return static_cast< ::operations_research::OptionalBoolean >(use_make_active_);
1916 return _internal_use_make_active();
1920 use_make_active_ =
value;
1923 _internal_set_use_make_active(
value);
1929 use_relocate_and_make_active_ = 0;
1932 return static_cast< ::operations_research::OptionalBoolean >(use_relocate_and_make_active_);
1936 return _internal_use_relocate_and_make_active();
1940 use_relocate_and_make_active_ =
value;
1943 _internal_set_use_relocate_and_make_active(
value);
1949 use_make_inactive_ = 0;
1952 return static_cast< ::operations_research::OptionalBoolean >(use_make_inactive_);
1956 return _internal_use_make_inactive();
1960 use_make_inactive_ =
value;
1963 _internal_set_use_make_inactive(
value);
1969 use_make_chain_inactive_ = 0;
1972 return static_cast< ::operations_research::OptionalBoolean >(use_make_chain_inactive_);
1976 return _internal_use_make_chain_inactive();
1980 use_make_chain_inactive_ =
value;
1983 _internal_set_use_make_chain_inactive(
value);
1989 use_swap_active_ = 0;
1992 return static_cast< ::operations_research::OptionalBoolean >(use_swap_active_);
1996 return _internal_use_swap_active();
2000 use_swap_active_ =
value;
2003 _internal_set_use_swap_active(
value);
2009 use_extended_swap_active_ = 0;
2012 return static_cast< ::operations_research::OptionalBoolean >(use_extended_swap_active_);
2016 return _internal_use_extended_swap_active();
2020 use_extended_swap_active_ =
value;
2023 _internal_set_use_extended_swap_active(
value);
2029 use_node_pair_swap_active_ = 0;
2032 return static_cast< ::operations_research::OptionalBoolean >(use_node_pair_swap_active_);
2036 return _internal_use_node_pair_swap_active();
2040 use_node_pair_swap_active_ =
value;
2043 _internal_set_use_node_pair_swap_active(
value);
2052 return static_cast< ::operations_research::OptionalBoolean >(use_path_lns_);
2056 return _internal_use_path_lns();
2060 use_path_lns_ =
value;
2063 _internal_set_use_path_lns(
value);
2069 use_full_path_lns_ = 0;
2072 return static_cast< ::operations_research::OptionalBoolean >(use_full_path_lns_);
2076 return _internal_use_full_path_lns();
2080 use_full_path_lns_ =
value;
2083 _internal_set_use_full_path_lns(
value);
2092 return static_cast< ::operations_research::OptionalBoolean >(use_tsp_lns_);
2096 return _internal_use_tsp_lns();
2100 use_tsp_lns_ =
value;
2103 _internal_set_use_tsp_lns(
value);
2109 use_inactive_lns_ = 0;
2112 return static_cast< ::operations_research::OptionalBoolean >(use_inactive_lns_);
2116 return _internal_use_inactive_lns();
2120 use_inactive_lns_ =
value;
2123 _internal_set_use_inactive_lns(
value);
2129 use_global_cheapest_insertion_path_lns_ = 0;
2132 return static_cast< ::operations_research::OptionalBoolean >(use_global_cheapest_insertion_path_lns_);
2136 return _internal_use_global_cheapest_insertion_path_lns();
2140 use_global_cheapest_insertion_path_lns_ =
value;
2143 _internal_set_use_global_cheapest_insertion_path_lns(
value);
2149 use_local_cheapest_insertion_path_lns_ = 0;
2152 return static_cast< ::operations_research::OptionalBoolean >(use_local_cheapest_insertion_path_lns_);
2156 return _internal_use_local_cheapest_insertion_path_lns();
2160 use_local_cheapest_insertion_path_lns_ =
value;
2163 _internal_set_use_local_cheapest_insertion_path_lns(
value);
2169 use_relocate_path_global_cheapest_insertion_insert_unperformed_ = 0;
2172 return static_cast< ::operations_research::OptionalBoolean >(use_relocate_path_global_cheapest_insertion_insert_unperformed_);
2176 return _internal_use_relocate_path_global_cheapest_insertion_insert_unperformed();
2180 use_relocate_path_global_cheapest_insertion_insert_unperformed_ =
value;
2183 _internal_set_use_relocate_path_global_cheapest_insertion_insert_unperformed(
value);
2189 use_global_cheapest_insertion_expensive_chain_lns_ = 0;
2192 return static_cast< ::operations_research::OptionalBoolean >(use_global_cheapest_insertion_expensive_chain_lns_);
2196 return _internal_use_global_cheapest_insertion_expensive_chain_lns();
2200 use_global_cheapest_insertion_expensive_chain_lns_ =
value;
2203 _internal_set_use_global_cheapest_insertion_expensive_chain_lns(
value);
2209 use_local_cheapest_insertion_expensive_chain_lns_ = 0;
2212 return static_cast< ::operations_research::OptionalBoolean >(use_local_cheapest_insertion_expensive_chain_lns_);
2216 return _internal_use_local_cheapest_insertion_expensive_chain_lns();
2220 use_local_cheapest_insertion_expensive_chain_lns_ =
value;
2223 _internal_set_use_local_cheapest_insertion_expensive_chain_lns(
value);
2229 use_global_cheapest_insertion_close_nodes_lns_ = 0;
2232 return static_cast< ::operations_research::OptionalBoolean >(use_global_cheapest_insertion_close_nodes_lns_);
2236 return _internal_use_global_cheapest_insertion_close_nodes_lns();
2240 use_global_cheapest_insertion_close_nodes_lns_ =
value;
2243 _internal_set_use_global_cheapest_insertion_close_nodes_lns(
value);
2249 use_local_cheapest_insertion_close_nodes_lns_ = 0;
2252 return static_cast< ::operations_research::OptionalBoolean >(use_local_cheapest_insertion_close_nodes_lns_);
2256 return _internal_use_local_cheapest_insertion_close_nodes_lns();
2260 use_local_cheapest_insertion_close_nodes_lns_ =
value;
2263 _internal_set_use_local_cheapest_insertion_close_nodes_lns(
value);
2273 improvement_rate_coefficient_ = 0;
2275 inline double RoutingSearchParameters_ImprovementSearchLimitParameters::_internal_improvement_rate_coefficient()
const {
2276 return improvement_rate_coefficient_;
2280 return _internal_improvement_rate_coefficient();
2282 inline void RoutingSearchParameters_ImprovementSearchLimitParameters::_internal_set_improvement_rate_coefficient(
double value) {
2284 improvement_rate_coefficient_ =
value;
2287 _internal_set_improvement_rate_coefficient(
value);
2293 improvement_rate_solutions_distance_ = 0;
2295 inline ::PROTOBUF_NAMESPACE_ID::int32 RoutingSearchParameters_ImprovementSearchLimitParameters::_internal_improvement_rate_solutions_distance()
const {
2296 return improvement_rate_solutions_distance_;
2300 return _internal_improvement_rate_solutions_distance();
2302 inline void RoutingSearchParameters_ImprovementSearchLimitParameters::_internal_set_improvement_rate_solutions_distance(::PROTOBUF_NAMESPACE_ID::int32
value) {
2304 improvement_rate_solutions_distance_ =
value;
2307 _internal_set_improvement_rate_solutions_distance(
value);
2317 first_solution_strategy_ = 0;
2320 return static_cast< ::operations_research::FirstSolutionStrategy_Value >(first_solution_strategy_);
2324 return _internal_first_solution_strategy();
2328 first_solution_strategy_ =
value;
2331 _internal_set_first_solution_strategy(
value);
2337 use_unfiltered_first_solution_strategy_ =
false;
2339 inline bool RoutingSearchParameters::_internal_use_unfiltered_first_solution_strategy()
const {
2340 return use_unfiltered_first_solution_strategy_;
2344 return _internal_use_unfiltered_first_solution_strategy();
2346 inline void RoutingSearchParameters::_internal_set_use_unfiltered_first_solution_strategy(
bool value) {
2348 use_unfiltered_first_solution_strategy_ =
value;
2351 _internal_set_use_unfiltered_first_solution_strategy(
value);
2357 savings_neighbors_ratio_ = 0;
2359 inline double RoutingSearchParameters::_internal_savings_neighbors_ratio()
const {
2360 return savings_neighbors_ratio_;
2364 return _internal_savings_neighbors_ratio();
2366 inline void RoutingSearchParameters::_internal_set_savings_neighbors_ratio(
double value) {
2368 savings_neighbors_ratio_ =
value;
2371 _internal_set_savings_neighbors_ratio(
value);
2377 savings_max_memory_usage_bytes_ = 0;
2379 inline double RoutingSearchParameters::_internal_savings_max_memory_usage_bytes()
const {
2380 return savings_max_memory_usage_bytes_;
2384 return _internal_savings_max_memory_usage_bytes();
2386 inline void RoutingSearchParameters::_internal_set_savings_max_memory_usage_bytes(
double value) {
2388 savings_max_memory_usage_bytes_ =
value;
2391 _internal_set_savings_max_memory_usage_bytes(
value);
2397 savings_add_reverse_arcs_ =
false;
2399 inline bool RoutingSearchParameters::_internal_savings_add_reverse_arcs()
const {
2400 return savings_add_reverse_arcs_;
2404 return _internal_savings_add_reverse_arcs();
2406 inline void RoutingSearchParameters::_internal_set_savings_add_reverse_arcs(
bool value) {
2408 savings_add_reverse_arcs_ =
value;
2411 _internal_set_savings_add_reverse_arcs(
value);
2417 savings_arc_coefficient_ = 0;
2419 inline double RoutingSearchParameters::_internal_savings_arc_coefficient()
const {
2420 return savings_arc_coefficient_;
2424 return _internal_savings_arc_coefficient();
2426 inline void RoutingSearchParameters::_internal_set_savings_arc_coefficient(
double value) {
2428 savings_arc_coefficient_ =
value;
2431 _internal_set_savings_arc_coefficient(
value);
2437 savings_parallel_routes_ =
false;
2439 inline bool RoutingSearchParameters::_internal_savings_parallel_routes()
const {
2440 return savings_parallel_routes_;
2444 return _internal_savings_parallel_routes();
2446 inline void RoutingSearchParameters::_internal_set_savings_parallel_routes(
bool value) {
2448 savings_parallel_routes_ =
value;
2451 _internal_set_savings_parallel_routes(
value);
2457 cheapest_insertion_farthest_seeds_ratio_ = 0;
2459 inline double RoutingSearchParameters::_internal_cheapest_insertion_farthest_seeds_ratio()
const {
2460 return cheapest_insertion_farthest_seeds_ratio_;
2464 return _internal_cheapest_insertion_farthest_seeds_ratio();
2466 inline void RoutingSearchParameters::_internal_set_cheapest_insertion_farthest_seeds_ratio(
double value) {
2468 cheapest_insertion_farthest_seeds_ratio_ =
value;
2471 _internal_set_cheapest_insertion_farthest_seeds_ratio(
value);
2477 cheapest_insertion_first_solution_neighbors_ratio_ = 0;
2479 inline double RoutingSearchParameters::_internal_cheapest_insertion_first_solution_neighbors_ratio()
const {
2480 return cheapest_insertion_first_solution_neighbors_ratio_;
2484 return _internal_cheapest_insertion_first_solution_neighbors_ratio();
2486 inline void RoutingSearchParameters::_internal_set_cheapest_insertion_first_solution_neighbors_ratio(
double value) {
2488 cheapest_insertion_first_solution_neighbors_ratio_ =
value;
2491 _internal_set_cheapest_insertion_first_solution_neighbors_ratio(
value);
2497 cheapest_insertion_first_solution_min_neighbors_ = 0;
2499 inline ::PROTOBUF_NAMESPACE_ID::int32 RoutingSearchParameters::_internal_cheapest_insertion_first_solution_min_neighbors()
const {
2500 return cheapest_insertion_first_solution_min_neighbors_;
2504 return _internal_cheapest_insertion_first_solution_min_neighbors();
2506 inline void RoutingSearchParameters::_internal_set_cheapest_insertion_first_solution_min_neighbors(::PROTOBUF_NAMESPACE_ID::int32
value) {
2508 cheapest_insertion_first_solution_min_neighbors_ =
value;
2511 _internal_set_cheapest_insertion_first_solution_min_neighbors(
value);
2517 cheapest_insertion_ls_operator_neighbors_ratio_ = 0;
2519 inline double RoutingSearchParameters::_internal_cheapest_insertion_ls_operator_neighbors_ratio()
const {
2520 return cheapest_insertion_ls_operator_neighbors_ratio_;
2524 return _internal_cheapest_insertion_ls_operator_neighbors_ratio();
2526 inline void RoutingSearchParameters::_internal_set_cheapest_insertion_ls_operator_neighbors_ratio(
double value) {
2528 cheapest_insertion_ls_operator_neighbors_ratio_ =
value;
2531 _internal_set_cheapest_insertion_ls_operator_neighbors_ratio(
value);
2537 cheapest_insertion_ls_operator_min_neighbors_ = 0;
2539 inline ::PROTOBUF_NAMESPACE_ID::int32 RoutingSearchParameters::_internal_cheapest_insertion_ls_operator_min_neighbors()
const {
2540 return cheapest_insertion_ls_operator_min_neighbors_;
2544 return _internal_cheapest_insertion_ls_operator_min_neighbors();
2546 inline void RoutingSearchParameters::_internal_set_cheapest_insertion_ls_operator_min_neighbors(::PROTOBUF_NAMESPACE_ID::int32
value) {
2548 cheapest_insertion_ls_operator_min_neighbors_ =
value;
2551 _internal_set_cheapest_insertion_ls_operator_min_neighbors(
value);
2557 cheapest_insertion_first_solution_use_neighbors_ratio_for_initialization_ =
false;
2559 inline bool RoutingSearchParameters::_internal_cheapest_insertion_first_solution_use_neighbors_ratio_for_initialization()
const {
2560 return cheapest_insertion_first_solution_use_neighbors_ratio_for_initialization_;
2564 return _internal_cheapest_insertion_first_solution_use_neighbors_ratio_for_initialization();
2566 inline void RoutingSearchParameters::_internal_set_cheapest_insertion_first_solution_use_neighbors_ratio_for_initialization(
bool value) {
2568 cheapest_insertion_first_solution_use_neighbors_ratio_for_initialization_ =
value;
2571 _internal_set_cheapest_insertion_first_solution_use_neighbors_ratio_for_initialization(
value);
2577 cheapest_insertion_add_unperformed_entries_ =
false;
2579 inline bool RoutingSearchParameters::_internal_cheapest_insertion_add_unperformed_entries()
const {
2580 return cheapest_insertion_add_unperformed_entries_;
2584 return _internal_cheapest_insertion_add_unperformed_entries();
2586 inline void RoutingSearchParameters::_internal_set_cheapest_insertion_add_unperformed_entries(
bool value) {
2588 cheapest_insertion_add_unperformed_entries_ =
value;
2591 _internal_set_cheapest_insertion_add_unperformed_entries(
value);
2597 christofides_use_minimum_matching_ =
false;
2599 inline bool RoutingSearchParameters::_internal_christofides_use_minimum_matching()
const {
2600 return christofides_use_minimum_matching_;
2604 return _internal_christofides_use_minimum_matching();
2606 inline void RoutingSearchParameters::_internal_set_christofides_use_minimum_matching(
bool value) {
2608 christofides_use_minimum_matching_ =
value;
2611 _internal_set_christofides_use_minimum_matching(
value);
2616 inline bool RoutingSearchParameters::_internal_has_local_search_operators()
const {
2620 return _internal_has_local_search_operators();
2623 if (GetArenaForAllocation() ==
nullptr && local_search_operators_ !=
nullptr) {
2624 delete local_search_operators_;
2626 local_search_operators_ =
nullptr;
2628 inline const ::operations_research::RoutingSearchParameters_LocalSearchNeighborhoodOperators& RoutingSearchParameters::_internal_local_search_operators()
const {
2629 const ::operations_research::RoutingSearchParameters_LocalSearchNeighborhoodOperators* p = local_search_operators_;
2630 return p !=
nullptr ? *p : reinterpret_cast<const ::operations_research::RoutingSearchParameters_LocalSearchNeighborhoodOperators&>(
2635 return _internal_local_search_operators();
2639 if (GetArenaForAllocation() ==
nullptr) {
2640 delete reinterpret_cast<::PROTOBUF_NAMESPACE_ID::MessageLite*>(local_search_operators_);
2653 local_search_operators_ =
nullptr;
2654 #ifdef PROTOBUF_FORCE_COPY_IN_RELEASE 2655 auto* old = reinterpret_cast<::PROTOBUF_NAMESPACE_ID::MessageLite*>(temp);
2656 temp = ::PROTOBUF_NAMESPACE_ID::internal::DuplicateIfNonNull(temp);
2657 if (GetArenaForAllocation() ==
nullptr) {
delete old; }
2658 #else // PROTOBUF_FORCE_COPY_IN_RELEASE 2659 if (GetArenaForAllocation() !=
nullptr) {
2660 temp = ::PROTOBUF_NAMESPACE_ID::internal::DuplicateIfNonNull(temp);
2662 #endif // !PROTOBUF_FORCE_COPY_IN_RELEASE 2669 local_search_operators_ =
nullptr;
2672 inline ::operations_research::RoutingSearchParameters_LocalSearchNeighborhoodOperators* RoutingSearchParameters::_internal_mutable_local_search_operators() {
2674 if (local_search_operators_ ==
nullptr) {
2675 auto* p = CreateMaybeMessage<::operations_research::RoutingSearchParameters_LocalSearchNeighborhoodOperators>(GetArenaForAllocation());
2676 local_search_operators_ = p;
2678 return local_search_operators_;
2686 ::PROTOBUF_NAMESPACE_ID::Arena* message_arena = GetArenaForAllocation();
2687 if (message_arena ==
nullptr) {
2688 delete local_search_operators_;
2691 ::PROTOBUF_NAMESPACE_ID::Arena* submessage_arena =
2692 ::PROTOBUF_NAMESPACE_ID::Arena::InternalHelper<::operations_research::RoutingSearchParameters_LocalSearchNeighborhoodOperators>::GetOwningArena(
local_search_operators);
2693 if (message_arena != submessage_arena) {
2707 use_multi_armed_bandit_concatenate_operators_ =
false;
2709 inline bool RoutingSearchParameters::_internal_use_multi_armed_bandit_concatenate_operators()
const {
2710 return use_multi_armed_bandit_concatenate_operators_;
2714 return _internal_use_multi_armed_bandit_concatenate_operators();
2716 inline void RoutingSearchParameters::_internal_set_use_multi_armed_bandit_concatenate_operators(
bool value) {
2718 use_multi_armed_bandit_concatenate_operators_ =
value;
2721 _internal_set_use_multi_armed_bandit_concatenate_operators(
value);
2727 multi_armed_bandit_compound_operator_memory_coefficient_ = 0;
2729 inline double RoutingSearchParameters::_internal_multi_armed_bandit_compound_operator_memory_coefficient()
const {
2730 return multi_armed_bandit_compound_operator_memory_coefficient_;
2734 return _internal_multi_armed_bandit_compound_operator_memory_coefficient();
2736 inline void RoutingSearchParameters::_internal_set_multi_armed_bandit_compound_operator_memory_coefficient(
double value) {
2738 multi_armed_bandit_compound_operator_memory_coefficient_ =
value;
2741 _internal_set_multi_armed_bandit_compound_operator_memory_coefficient(
value);
2747 multi_armed_bandit_compound_operator_exploration_coefficient_ = 0;
2749 inline double RoutingSearchParameters::_internal_multi_armed_bandit_compound_operator_exploration_coefficient()
const {
2750 return multi_armed_bandit_compound_operator_exploration_coefficient_;
2754 return _internal_multi_armed_bandit_compound_operator_exploration_coefficient();
2756 inline void RoutingSearchParameters::_internal_set_multi_armed_bandit_compound_operator_exploration_coefficient(
double value) {
2758 multi_armed_bandit_compound_operator_exploration_coefficient_ =
value;
2761 _internal_set_multi_armed_bandit_compound_operator_exploration_coefficient(
value);
2767 relocate_expensive_chain_num_arcs_to_consider_ = 0;
2769 inline ::PROTOBUF_NAMESPACE_ID::int32 RoutingSearchParameters::_internal_relocate_expensive_chain_num_arcs_to_consider()
const {
2770 return relocate_expensive_chain_num_arcs_to_consider_;
2774 return _internal_relocate_expensive_chain_num_arcs_to_consider();
2776 inline void RoutingSearchParameters::_internal_set_relocate_expensive_chain_num_arcs_to_consider(::PROTOBUF_NAMESPACE_ID::int32
value) {
2778 relocate_expensive_chain_num_arcs_to_consider_ =
value;
2781 _internal_set_relocate_expensive_chain_num_arcs_to_consider(
value);
2787 heuristic_expensive_chain_lns_num_arcs_to_consider_ = 0;
2789 inline ::PROTOBUF_NAMESPACE_ID::int32 RoutingSearchParameters::_internal_heuristic_expensive_chain_lns_num_arcs_to_consider()
const {
2790 return heuristic_expensive_chain_lns_num_arcs_to_consider_;
2794 return _internal_heuristic_expensive_chain_lns_num_arcs_to_consider();
2796 inline void RoutingSearchParameters::_internal_set_heuristic_expensive_chain_lns_num_arcs_to_consider(::PROTOBUF_NAMESPACE_ID::int32
value) {
2798 heuristic_expensive_chain_lns_num_arcs_to_consider_ =
value;
2801 _internal_set_heuristic_expensive_chain_lns_num_arcs_to_consider(
value);
2807 heuristic_close_nodes_lns_num_nodes_ = 0;
2809 inline ::PROTOBUF_NAMESPACE_ID::int32 RoutingSearchParameters::_internal_heuristic_close_nodes_lns_num_nodes()
const {
2810 return heuristic_close_nodes_lns_num_nodes_;
2814 return _internal_heuristic_close_nodes_lns_num_nodes();
2816 inline void RoutingSearchParameters::_internal_set_heuristic_close_nodes_lns_num_nodes(::PROTOBUF_NAMESPACE_ID::int32
value) {
2818 heuristic_close_nodes_lns_num_nodes_ =
value;
2821 _internal_set_heuristic_close_nodes_lns_num_nodes(
value);
2827 local_search_metaheuristic_ = 0;
2830 return static_cast< ::operations_research::LocalSearchMetaheuristic_Value >(local_search_metaheuristic_);
2834 return _internal_local_search_metaheuristic();
2838 local_search_metaheuristic_ =
value;
2841 _internal_set_local_search_metaheuristic(
value);
2847 guided_local_search_lambda_coefficient_ = 0;
2849 inline double RoutingSearchParameters::_internal_guided_local_search_lambda_coefficient()
const {
2850 return guided_local_search_lambda_coefficient_;
2854 return _internal_guided_local_search_lambda_coefficient();
2856 inline void RoutingSearchParameters::_internal_set_guided_local_search_lambda_coefficient(
double value) {
2858 guided_local_search_lambda_coefficient_ =
value;
2861 _internal_set_guided_local_search_lambda_coefficient(
value);
2867 use_depth_first_search_ =
false;
2869 inline bool RoutingSearchParameters::_internal_use_depth_first_search()
const {
2870 return use_depth_first_search_;
2874 return _internal_use_depth_first_search();
2876 inline void RoutingSearchParameters::_internal_set_use_depth_first_search(
bool value) {
2878 use_depth_first_search_ =
value;
2881 _internal_set_use_depth_first_search(
value);
2890 return static_cast< ::operations_research::OptionalBoolean >(use_cp_);
2894 return _internal_use_cp();
2901 _internal_set_use_cp(
value);
2910 return static_cast< ::operations_research::OptionalBoolean >(use_cp_sat_);
2914 return _internal_use_cp_sat();
2918 use_cp_sat_ =
value;
2921 _internal_set_use_cp_sat(
value);
2927 use_generalized_cp_sat_ = 0;
2930 return static_cast< ::operations_research::OptionalBoolean >(use_generalized_cp_sat_);
2934 return _internal_use_generalized_cp_sat();
2938 use_generalized_cp_sat_ =
value;
2941 _internal_set_use_generalized_cp_sat(
value);
2946 inline bool RoutingSearchParameters::_internal_has_sat_parameters()
const {
2950 return _internal_has_sat_parameters();
2952 inline const ::operations_research::sat::SatParameters& RoutingSearchParameters::_internal_sat_parameters()
const {
2953 const ::operations_research::sat::SatParameters* p = sat_parameters_;
2954 return p !=
nullptr ? *p : reinterpret_cast<const ::operations_research::sat::SatParameters&>(
2959 return _internal_sat_parameters();
2963 if (GetArenaForAllocation() ==
nullptr) {
2964 delete reinterpret_cast<::PROTOBUF_NAMESPACE_ID::MessageLite*>(sat_parameters_);
2977 sat_parameters_ =
nullptr;
2978 #ifdef PROTOBUF_FORCE_COPY_IN_RELEASE 2979 auto* old = reinterpret_cast<::PROTOBUF_NAMESPACE_ID::MessageLite*>(temp);
2980 temp = ::PROTOBUF_NAMESPACE_ID::internal::DuplicateIfNonNull(temp);
2981 if (GetArenaForAllocation() ==
nullptr) {
delete old; }
2982 #else // PROTOBUF_FORCE_COPY_IN_RELEASE 2983 if (GetArenaForAllocation() !=
nullptr) {
2984 temp = ::PROTOBUF_NAMESPACE_ID::internal::DuplicateIfNonNull(temp);
2986 #endif // !PROTOBUF_FORCE_COPY_IN_RELEASE 2993 sat_parameters_ =
nullptr;
2996 inline ::operations_research::sat::SatParameters* RoutingSearchParameters::_internal_mutable_sat_parameters() {
2998 if (sat_parameters_ ==
nullptr) {
2999 auto* p = CreateMaybeMessage<::operations_research::sat::SatParameters>(GetArenaForAllocation());
3000 sat_parameters_ = p;
3002 return sat_parameters_;
3010 ::PROTOBUF_NAMESPACE_ID::Arena* message_arena = GetArenaForAllocation();
3011 if (message_arena ==
nullptr) {
3012 delete reinterpret_cast< ::PROTOBUF_NAMESPACE_ID::MessageLite*>(sat_parameters_);
3015 ::PROTOBUF_NAMESPACE_ID::Arena* submessage_arena =
3017 ::PROTOBUF_NAMESPACE_ID::MessageLite>::GetOwningArena(
3018 reinterpret_cast<::PROTOBUF_NAMESPACE_ID::MessageLite*>(
sat_parameters));
3019 if (message_arena != submessage_arena) {
3020 sat_parameters = ::PROTOBUF_NAMESPACE_ID::internal::GetOwnedMessage(
3033 continuous_scheduling_solver_ = 0;
3036 return static_cast< ::operations_research::RoutingSearchParameters_SchedulingSolver >(continuous_scheduling_solver_);
3040 return _internal_continuous_scheduling_solver();
3044 continuous_scheduling_solver_ =
value;
3047 _internal_set_continuous_scheduling_solver(
value);
3053 mixed_integer_scheduling_solver_ = 0;
3056 return static_cast< ::operations_research::RoutingSearchParameters_SchedulingSolver >(mixed_integer_scheduling_solver_);
3060 return _internal_mixed_integer_scheduling_solver();
3064 mixed_integer_scheduling_solver_ =
value;
3067 _internal_set_mixed_integer_scheduling_solver(
value);
3073 optimization_step_ = 0;
3075 inline double RoutingSearchParameters::_internal_optimization_step()
const {
3076 return optimization_step_;
3080 return _internal_optimization_step();
3082 inline void RoutingSearchParameters::_internal_set_optimization_step(
double value) {
3084 optimization_step_ =
value;
3087 _internal_set_optimization_step(
value);
3093 number_of_solutions_to_collect_ = 0;
3095 inline ::PROTOBUF_NAMESPACE_ID::int32 RoutingSearchParameters::_internal_number_of_solutions_to_collect()
const {
3096 return number_of_solutions_to_collect_;
3100 return _internal_number_of_solutions_to_collect();
3102 inline void RoutingSearchParameters::_internal_set_number_of_solutions_to_collect(::PROTOBUF_NAMESPACE_ID::int32
value) {
3104 number_of_solutions_to_collect_ =
value;
3107 _internal_set_number_of_solutions_to_collect(
value);
3113 solution_limit_ = int64_t{0};
3115 inline ::PROTOBUF_NAMESPACE_ID::int64 RoutingSearchParameters::_internal_solution_limit()
const {
3116 return solution_limit_;
3120 return _internal_solution_limit();
3122 inline void RoutingSearchParameters::_internal_set_solution_limit(::PROTOBUF_NAMESPACE_ID::int64
value) {
3124 solution_limit_ =
value;
3127 _internal_set_solution_limit(
value);
3132 inline bool RoutingSearchParameters::_internal_has_time_limit()
const {
3136 return _internal_has_time_limit();
3138 inline const PROTOBUF_NAMESPACE_ID::Duration& RoutingSearchParameters::_internal_time_limit()
const {
3139 const PROTOBUF_NAMESPACE_ID::Duration* p = time_limit_;
3140 return p !=
nullptr ? *p : reinterpret_cast<const PROTOBUF_NAMESPACE_ID::Duration&>(
3141 PROTOBUF_NAMESPACE_ID::_Duration_default_instance_);
3145 return _internal_time_limit();
3148 PROTOBUF_NAMESPACE_ID::Duration*
time_limit) {
3149 if (GetArenaForAllocation() ==
nullptr) {
3150 delete reinterpret_cast<::PROTOBUF_NAMESPACE_ID::MessageLite*>(time_limit_);
3162 PROTOBUF_NAMESPACE_ID::Duration* temp = time_limit_;
3163 time_limit_ =
nullptr;
3164 #ifdef PROTOBUF_FORCE_COPY_IN_RELEASE 3165 auto* old = reinterpret_cast<::PROTOBUF_NAMESPACE_ID::MessageLite*>(temp);
3166 temp = ::PROTOBUF_NAMESPACE_ID::internal::DuplicateIfNonNull(temp);
3167 if (GetArenaForAllocation() ==
nullptr) {
delete old; }
3168 #else // PROTOBUF_FORCE_COPY_IN_RELEASE 3169 if (GetArenaForAllocation() !=
nullptr) {
3170 temp = ::PROTOBUF_NAMESPACE_ID::internal::DuplicateIfNonNull(temp);
3172 #endif // !PROTOBUF_FORCE_COPY_IN_RELEASE 3178 PROTOBUF_NAMESPACE_ID::Duration* temp = time_limit_;
3179 time_limit_ =
nullptr;
3182 inline PROTOBUF_NAMESPACE_ID::Duration* RoutingSearchParameters::_internal_mutable_time_limit() {
3184 if (time_limit_ ==
nullptr) {
3185 auto* p = CreateMaybeMessage<PROTOBUF_NAMESPACE_ID::Duration>(GetArenaForAllocation());
3191 PROTOBUF_NAMESPACE_ID::Duration* _msg = _internal_mutable_time_limit();
3196 ::PROTOBUF_NAMESPACE_ID::Arena* message_arena = GetArenaForAllocation();
3197 if (message_arena ==
nullptr) {
3198 delete reinterpret_cast< ::PROTOBUF_NAMESPACE_ID::MessageLite*>(time_limit_);
3201 ::PROTOBUF_NAMESPACE_ID::Arena* submessage_arena =
3203 ::PROTOBUF_NAMESPACE_ID::MessageLite>::GetOwningArena(
3204 reinterpret_cast<::PROTOBUF_NAMESPACE_ID::MessageLite*>(
time_limit));
3205 if (message_arena != submessage_arena) {
3206 time_limit = ::PROTOBUF_NAMESPACE_ID::internal::GetOwnedMessage(
3207 message_arena,
time_limit, submessage_arena);
3218 inline bool RoutingSearchParameters::_internal_has_lns_time_limit()
const {
3222 return _internal_has_lns_time_limit();
3224 inline const PROTOBUF_NAMESPACE_ID::Duration& RoutingSearchParameters::_internal_lns_time_limit()
const {
3225 const PROTOBUF_NAMESPACE_ID::Duration* p = lns_time_limit_;
3226 return p !=
nullptr ? *p : reinterpret_cast<const PROTOBUF_NAMESPACE_ID::Duration&>(
3227 PROTOBUF_NAMESPACE_ID::_Duration_default_instance_);
3231 return _internal_lns_time_limit();
3234 PROTOBUF_NAMESPACE_ID::Duration* lns_time_limit) {
3235 if (GetArenaForAllocation() ==
nullptr) {
3236 delete reinterpret_cast<::PROTOBUF_NAMESPACE_ID::MessageLite*>(lns_time_limit_);
3248 PROTOBUF_NAMESPACE_ID::Duration* temp = lns_time_limit_;
3249 lns_time_limit_ =
nullptr;
3250 #ifdef PROTOBUF_FORCE_COPY_IN_RELEASE 3251 auto* old = reinterpret_cast<::PROTOBUF_NAMESPACE_ID::MessageLite*>(temp);
3252 temp = ::PROTOBUF_NAMESPACE_ID::internal::DuplicateIfNonNull(temp);
3253 if (GetArenaForAllocation() ==
nullptr) {
delete old; }
3254 #else // PROTOBUF_FORCE_COPY_IN_RELEASE 3255 if (GetArenaForAllocation() !=
nullptr) {
3256 temp = ::PROTOBUF_NAMESPACE_ID::internal::DuplicateIfNonNull(temp);
3258 #endif // !PROTOBUF_FORCE_COPY_IN_RELEASE 3264 PROTOBUF_NAMESPACE_ID::Duration* temp = lns_time_limit_;
3265 lns_time_limit_ =
nullptr;
3268 inline PROTOBUF_NAMESPACE_ID::Duration* RoutingSearchParameters::_internal_mutable_lns_time_limit() {
3270 if (lns_time_limit_ ==
nullptr) {
3271 auto* p = CreateMaybeMessage<PROTOBUF_NAMESPACE_ID::Duration>(GetArenaForAllocation());
3272 lns_time_limit_ = p;
3274 return lns_time_limit_;
3277 PROTOBUF_NAMESPACE_ID::Duration* _msg = _internal_mutable_lns_time_limit();
3282 ::PROTOBUF_NAMESPACE_ID::Arena* message_arena = GetArenaForAllocation();
3283 if (message_arena ==
nullptr) {
3284 delete reinterpret_cast< ::PROTOBUF_NAMESPACE_ID::MessageLite*>(lns_time_limit_);
3287 ::PROTOBUF_NAMESPACE_ID::Arena* submessage_arena =
3289 ::PROTOBUF_NAMESPACE_ID::MessageLite>::GetOwningArena(
3290 reinterpret_cast<::PROTOBUF_NAMESPACE_ID::MessageLite*>(
lns_time_limit));
3291 if (message_arena != submessage_arena) {
3292 lns_time_limit = ::PROTOBUF_NAMESPACE_ID::internal::GetOwnedMessage(
3304 inline bool RoutingSearchParameters::_internal_has_improvement_limit_parameters()
const {
3308 return _internal_has_improvement_limit_parameters();
3311 if (GetArenaForAllocation() ==
nullptr && improvement_limit_parameters_ !=
nullptr) {
3312 delete improvement_limit_parameters_;
3314 improvement_limit_parameters_ =
nullptr;
3316 inline const ::operations_research::RoutingSearchParameters_ImprovementSearchLimitParameters& RoutingSearchParameters::_internal_improvement_limit_parameters()
const {
3317 const ::operations_research::RoutingSearchParameters_ImprovementSearchLimitParameters* p = improvement_limit_parameters_;
3318 return p !=
nullptr ? *p : reinterpret_cast<const ::operations_research::RoutingSearchParameters_ImprovementSearchLimitParameters&>(
3323 return _internal_improvement_limit_parameters();
3327 if (GetArenaForAllocation() ==
nullptr) {
3328 delete reinterpret_cast<::PROTOBUF_NAMESPACE_ID::MessageLite*>(improvement_limit_parameters_);
3341 improvement_limit_parameters_ =
nullptr;
3342 #ifdef PROTOBUF_FORCE_COPY_IN_RELEASE 3343 auto* old = reinterpret_cast<::PROTOBUF_NAMESPACE_ID::MessageLite*>(temp);
3344 temp = ::PROTOBUF_NAMESPACE_ID::internal::DuplicateIfNonNull(temp);
3345 if (GetArenaForAllocation() ==
nullptr) {
delete old; }
3346 #else // PROTOBUF_FORCE_COPY_IN_RELEASE 3347 if (GetArenaForAllocation() !=
nullptr) {
3348 temp = ::PROTOBUF_NAMESPACE_ID::internal::DuplicateIfNonNull(temp);
3350 #endif // !PROTOBUF_FORCE_COPY_IN_RELEASE 3357 improvement_limit_parameters_ =
nullptr;
3360 inline ::operations_research::RoutingSearchParameters_ImprovementSearchLimitParameters* RoutingSearchParameters::_internal_mutable_improvement_limit_parameters() {
3362 if (improvement_limit_parameters_ ==
nullptr) {
3363 auto* p = CreateMaybeMessage<::operations_research::RoutingSearchParameters_ImprovementSearchLimitParameters>(GetArenaForAllocation());
3364 improvement_limit_parameters_ = p;
3366 return improvement_limit_parameters_;
3374 ::PROTOBUF_NAMESPACE_ID::Arena* message_arena = GetArenaForAllocation();
3375 if (message_arena ==
nullptr) {
3376 delete improvement_limit_parameters_;
3379 ::PROTOBUF_NAMESPACE_ID::Arena* submessage_arena =
3380 ::PROTOBUF_NAMESPACE_ID::Arena::InternalHelper<::operations_research::RoutingSearchParameters_ImprovementSearchLimitParameters>::GetOwningArena(
improvement_limit_parameters);
3381 if (message_arena != submessage_arena) {
3395 use_full_propagation_ =
false;
3397 inline bool RoutingSearchParameters::_internal_use_full_propagation()
const {
3398 return use_full_propagation_;
3402 return _internal_use_full_propagation();
3404 inline void RoutingSearchParameters::_internal_set_use_full_propagation(
bool value) {
3406 use_full_propagation_ =
value;
3409 _internal_set_use_full_propagation(
value);
3415 log_search_ =
false;
3417 inline bool RoutingSearchParameters::_internal_log_search()
const {
3422 return _internal_log_search();
3424 inline void RoutingSearchParameters::_internal_set_log_search(
bool value) {
3426 log_search_ =
value;
3429 _internal_set_log_search(
value);
3435 log_cost_scaling_factor_ = 0;
3437 inline double RoutingSearchParameters::_internal_log_cost_scaling_factor()
const {
3438 return log_cost_scaling_factor_;
3442 return _internal_log_cost_scaling_factor();
3444 inline void RoutingSearchParameters::_internal_set_log_cost_scaling_factor(
double value) {
3446 log_cost_scaling_factor_ =
value;
3449 _internal_set_log_cost_scaling_factor(
value);
3455 log_cost_offset_ = 0;
3457 inline double RoutingSearchParameters::_internal_log_cost_offset()
const {
3458 return log_cost_offset_;
3462 return _internal_log_cost_offset();
3464 inline void RoutingSearchParameters::_internal_set_log_cost_offset(
double value) {
3466 log_cost_offset_ =
value;
3469 _internal_set_log_cost_offset(
value);
3475 log_tag_.ClearToEmpty();
3479 return _internal_log_tag();
3481 template <
typename ArgT0,
typename... ArgT>
3482 inline PROTOBUF_ALWAYS_INLINE
3485 log_tag_.Set(::PROTOBUF_NAMESPACE_ID::internal::ArenaStringPtr::EmptyDefault{}, static_cast<ArgT0 &&>(arg0), args..., GetArenaForAllocation());
3489 std::string* _s = _internal_mutable_log_tag();
3493 inline const std::string& RoutingSearchParameters::_internal_log_tag()
const {
3494 return log_tag_.Get();
3496 inline void RoutingSearchParameters::_internal_set_log_tag(
const std::string&
value) {
3498 log_tag_.Set(::PROTOBUF_NAMESPACE_ID::internal::ArenaStringPtr::EmptyDefault{},
value, GetArenaForAllocation());
3500 inline std::string* RoutingSearchParameters::_internal_mutable_log_tag() {
3502 return log_tag_.Mutable(::PROTOBUF_NAMESPACE_ID::internal::ArenaStringPtr::EmptyDefault{}, GetArenaForAllocation());
3506 return log_tag_.Release(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited(), GetArenaForAllocation());
3514 log_tag_.SetAllocated(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited(),
log_tag,
3515 GetArenaForAllocation());
3524 inline bool RoutingModelParameters::_internal_has_solver_parameters()
const {
3528 return _internal_has_solver_parameters();
3530 inline const ::operations_research::ConstraintSolverParameters& RoutingModelParameters::_internal_solver_parameters()
const {
3531 const ::operations_research::ConstraintSolverParameters* p = solver_parameters_;
3532 return p !=
nullptr ? *p : reinterpret_cast<const ::operations_research::ConstraintSolverParameters&>(
3537 return _internal_solver_parameters();
3541 if (GetArenaForAllocation() ==
nullptr) {
3542 delete reinterpret_cast<::PROTOBUF_NAMESPACE_ID::MessageLite*>(solver_parameters_);
3555 solver_parameters_ =
nullptr;
3556 #ifdef PROTOBUF_FORCE_COPY_IN_RELEASE 3557 auto* old = reinterpret_cast<::PROTOBUF_NAMESPACE_ID::MessageLite*>(temp);
3558 temp = ::PROTOBUF_NAMESPACE_ID::internal::DuplicateIfNonNull(temp);
3559 if (GetArenaForAllocation() ==
nullptr) {
delete old; }
3560 #else // PROTOBUF_FORCE_COPY_IN_RELEASE 3561 if (GetArenaForAllocation() !=
nullptr) {
3562 temp = ::PROTOBUF_NAMESPACE_ID::internal::DuplicateIfNonNull(temp);
3564 #endif // !PROTOBUF_FORCE_COPY_IN_RELEASE 3571 solver_parameters_ =
nullptr;
3574 inline ::operations_research::ConstraintSolverParameters* RoutingModelParameters::_internal_mutable_solver_parameters() {
3576 if (solver_parameters_ ==
nullptr) {
3577 auto* p = CreateMaybeMessage<::operations_research::ConstraintSolverParameters>(GetArenaForAllocation());
3578 solver_parameters_ = p;
3580 return solver_parameters_;
3588 ::PROTOBUF_NAMESPACE_ID::Arena* message_arena = GetArenaForAllocation();
3589 if (message_arena ==
nullptr) {
3590 delete reinterpret_cast< ::PROTOBUF_NAMESPACE_ID::MessageLite*>(solver_parameters_);
3593 ::PROTOBUF_NAMESPACE_ID::Arena* submessage_arena =
3595 ::PROTOBUF_NAMESPACE_ID::MessageLite>::GetOwningArena(
3597 if (message_arena != submessage_arena) {
3611 reduce_vehicle_cost_model_ =
false;
3613 inline bool RoutingModelParameters::_internal_reduce_vehicle_cost_model()
const {
3614 return reduce_vehicle_cost_model_;
3618 return _internal_reduce_vehicle_cost_model();
3620 inline void RoutingModelParameters::_internal_set_reduce_vehicle_cost_model(
bool value) {
3622 reduce_vehicle_cost_model_ =
value;
3625 _internal_set_reduce_vehicle_cost_model(
value);
3631 max_callback_cache_size_ = 0;
3633 inline ::PROTOBUF_NAMESPACE_ID::int32 RoutingModelParameters::_internal_max_callback_cache_size()
const {
3634 return max_callback_cache_size_;
3638 return _internal_max_callback_cache_size();
3640 inline void RoutingModelParameters::_internal_set_max_callback_cache_size(::PROTOBUF_NAMESPACE_ID::int32
value) {
3642 max_callback_cache_size_ =
value;
3645 _internal_set_max_callback_cache_size(
value);
3650 #pragma GCC diagnostic pop 3663 PROTOBUF_NAMESPACE_OPEN
3667 inline const EnumDescriptor* GetEnumDescriptor< ::operations_research::RoutingSearchParameters_SchedulingSolver>() {
3671 PROTOBUF_NAMESPACE_CLOSE
3675 #include <google/protobuf/port_undef.inc> 3676 #endif // GOOGLE_PROTOBUF_INCLUDED_GOOGLE_PROTOBUF_INCLUDED_ortools_2fconstraint_5fsolver_2frouting_5fparameters_2eproto friend void swap(RoutingSearchParameters &a, RoutingSearchParameters &b)
::PROTOBUF_NAMESPACE_ID::uint8 * _InternalSerialize(::PROTOBUF_NAMESPACE_ID::uint8 *target, ::PROTOBUF_NAMESPACE_ID::io::EpsCopyOutputStream *stream) const final
bool has_time_limit() const
const ::PROTOBUF_NAMESPACE_ID::Message::ClassData * GetClassData() const final
::operations_research::OptionalBoolean use_swap_active() const
static const ClassData _class_data_
void clear_cheapest_insertion_first_solution_neighbors_ratio()
::PROTOBUF_NAMESPACE_ID::uint8 * _InternalSerialize(::PROTOBUF_NAMESPACE_ID::uint8 *target, ::PROTOBUF_NAMESPACE_ID::io::EpsCopyOutputStream *stream) const final
::operations_research::OptionalBoolean use_cross() const
void CopyFrom(const RoutingSearchParameters_LocalSearchNeighborhoodOperators &from)
void clear_use_generalized_cp_sat()
::operations_research::OptionalBoolean use_extended_swap_active() const
const ::PROTOBUF_NAMESPACE_ID::Message::ClassData * GetClassData() const final
void set_use_make_inactive(::operations_research::OptionalBoolean value)
::operations_research::OptionalBoolean use_local_cheapest_insertion_expensive_chain_lns() const
void set_use_relocate_and_make_active(::operations_research::OptionalBoolean value)
bool has_solver_parameters() const
const PROTOBUF_NAMESPACE_ID::Duration & lns_time_limit() const
void set_reduce_vehicle_cost_model(bool value)
void clear_use_extended_swap_active()
~RoutingSearchParameters_ImprovementSearchLimitParameters() override
bool cheapest_insertion_add_unperformed_entries() const
double cheapest_insertion_farthest_seeds_ratio() const
PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT RoutingSearchParameters_ImprovementSearchLimitParametersDefaultTypeInternal _RoutingSearchParameters_ImprovementSearchLimitParameters_default_instance_
void set_use_relocate_path_global_cheapest_insertion_insert_unperformed(::operations_research::OptionalBoolean value)
RoutingSearchParameters(RoutingSearchParameters &&from) noexcept
RoutingSearchParameters * New(::PROTOBUF_NAMESPACE_ID::Arena *arena) const final
bool cheapest_insertion_first_solution_use_neighbors_ratio_for_initialization() const
void unsafe_arena_set_allocated_time_limit(PROTOBUF_NAMESPACE_ID::Duration *time_limit)
~RoutingModelParameters() override
bool IsInitialized() const final
size_t ByteSizeLong() const final
PROTOBUF_ATTRIBUTE_REINITIALIZES void Clear() final
void unsafe_arena_set_allocated_lns_time_limit(PROTOBUF_NAMESPACE_ID::Duration *lns_time_limit)
LocalSearchMetaheuristic_Value
double guided_local_search_lambda_coefficient() const
void set_savings_max_memory_usage_bytes(double value)
ModelSharedTimeLimit * time_limit
static const ::PROTOBUF_NAMESPACE_ID::Descriptor * descriptor()
void set_multi_armed_bandit_compound_operator_exploration_coefficient(double value)
::operations_research::OptionalBoolean use_make_chain_inactive() const
RoutingSearchParameters_LocalSearchNeighborhoodOperators * New() const final
RoutingModelParameters & operator=(RoutingModelParameters &&from) noexcept
double log_cost_scaling_factor() const
void clear_use_inactive_lns()
::operations_research::ConstraintSolverParameters * unsafe_arena_release_solver_parameters()
static const RoutingSearchParameters_ImprovementSearchLimitParameters & default_instance()
PROTOBUF_MUST_USE_RESULT PROTOBUF_NAMESPACE_ID::Duration * release_time_limit()
static const ::PROTOBUF_NAMESPACE_ID::EnumDescriptor * SchedulingSolver_descriptor()
void set_use_generalized_cp_sat(::operations_research::OptionalBoolean value)
PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT RoutingModelParametersDefaultTypeInternal _RoutingModelParameters_default_instance_
static constexpr int SchedulingSolver_ARRAYSIZE
::operations_research::RoutingSearchParameters_SchedulingSolver mixed_integer_scheduling_solver() const
void clear_use_lin_kernighan()
PROTOBUF_MUST_USE_RESULT PROTOBUF_NAMESPACE_ID::Duration * release_lns_time_limit()
::operations_research::OptionalBoolean use_node_pair_swap_active() const
void set_allocated_lns_time_limit(PROTOBUF_NAMESPACE_ID::Duration *lns_time_limit)
::operations_research::OptionalBoolean use_make_inactive() const
bool use_unfiltered_first_solution_strategy() const
::operations_research::sat::SatParameters * unsafe_arena_release_sat_parameters()
void clear_use_exchange()
void clear_multi_armed_bandit_compound_operator_exploration_coefficient()
void set_savings_parallel_routes(bool value)
RoutingSearchParameters_ImprovementSearchLimitParameters & operator=(const RoutingSearchParameters_ImprovementSearchLimitParameters &from)
PROTOBUF_NAMESPACE_ID::Duration * mutable_time_limit()
void set_allocated_solver_parameters(::operations_research::ConstraintSolverParameters *solver_parameters)
void clear_use_global_cheapest_insertion_close_nodes_lns()
void set_use_full_propagation(bool value)
int GetCachedSize() const final
void clear_use_relocate_and_make_active()
static bool SchedulingSolver_IsValid(int value)
void Swap(RoutingSearchParameters_ImprovementSearchLimitParameters *other)
void set_relocate_expensive_chain_num_arcs_to_consider(::PROTOBUF_NAMESPACE_ID::int32 value)
void CopyFrom(const RoutingSearchParameters_ImprovementSearchLimitParameters &from)
bool IsInitialized() const final
void clear_cheapest_insertion_first_solution_min_neighbors()
bool has_lns_time_limit() const
::operations_research::OptionalBoolean use_exchange_pair() const
const ::PROTOBUF_NAMESPACE_ID::internal::DescriptorTable descriptor_table_ortools_2fconstraint_5fsolver_2frouting_5fparameters_2eproto
void clear_use_relocate_subtrip()
const ::PROTOBUF_NAMESPACE_ID::Message::ClassData * GetClassData() const final
void clear_number_of_solutions_to_collect()
::PROTOBUF_NAMESPACE_ID::Metadata GetMetadata() const final
void clear_cheapest_insertion_first_solution_use_neighbors_ratio_for_initialization()
::operations_research::OptionalBoolean use_relocate_pair() const
static constexpr int kIndexInFileMessages
RoutingSearchParameters_LocalSearchNeighborhoodOperators * New(::PROTOBUF_NAMESPACE_ID::Arena *arena) const final
void set_use_path_lns(::operations_research::OptionalBoolean value)
void unsafe_arena_set_allocated_solver_parameters(::operations_research::ConstraintSolverParameters *solver_parameters)
constexpr RoutingSearchParameters_SchedulingSolver RoutingSearchParameters_SchedulingSolver_SchedulingSolver_MIN
void set_heuristic_close_nodes_lns_num_nodes(::PROTOBUF_NAMESPACE_ID::int32 value)
bool has_local_search_operators() const
friend class ::PROTOBUF_NAMESPACE_ID::Arena::InternalHelper
void MergeFrom(const RoutingSearchParameters_LocalSearchNeighborhoodOperators &from)
PROTOBUF_ATTRIBUTE_REINITIALIZES void Clear() final
double multi_armed_bandit_compound_operator_exploration_coefficient() const
::operations_research::sat::SatParameters * mutable_sat_parameters()
bool savings_parallel_routes() const
RoutingModelParameters * New() const final
static const ::PROTOBUF_NAMESPACE_ID::Descriptor * descriptor()
PROTOBUF_ATTRIBUTE_REINITIALIZES void Clear() final
void clear_use_depth_first_search()
::operations_research::OptionalBoolean use_light_relocate_pair() const
::operations_research::RoutingSearchParameters_SchedulingSolver continuous_scheduling_solver() const
void clear_christofides_use_minimum_matching()
::operations_research::FirstSolutionStrategy_Value first_solution_strategy() const
const char * _InternalParse(const char *ptr, ::PROTOBUF_NAMESPACE_ID::internal::ParseContext *ctx) final
void set_solution_limit(::PROTOBUF_NAMESPACE_ID::int64 value)
void MergeFrom(const RoutingModelParameters &from)
void unsafe_arena_set_allocated_sat_parameters(::operations_research::sat::SatParameters *sat_parameters)
void set_use_extended_swap_active(::operations_research::OptionalBoolean value)
void set_use_local_cheapest_insertion_path_lns(::operations_research::OptionalBoolean value)
void set_use_inactive_lns(::operations_research::OptionalBoolean value)
void clear_use_full_propagation()
bool IsInitialized() const final
void clear_use_make_chain_inactive()
::operations_research::OptionalBoolean use_relocate_and_make_active() const
::operations_research::OptionalBoolean use_lin_kernighan() const
::operations_research::RoutingSearchParameters_ImprovementSearchLimitParameters * mutable_improvement_limit_parameters()
void clear_sat_parameters()
void set_use_global_cheapest_insertion_path_lns(::operations_research::OptionalBoolean value)
::operations_research::OptionalBoolean use_cross_exchange() const
void UnsafeArenaSwap(RoutingModelParameters *other)
static constexpr SchedulingSolver UNSET
::operations_research::OptionalBoolean use_inactive_lns() const
::operations_research::OptionalBoolean use_tsp_lns() const
void set_use_depth_first_search(bool value)
const ::PROTOBUF_NAMESPACE_ID::Message::ClassData * GetClassData() const final
constexpr RoutingSearchParameters_SchedulingSolver RoutingSearchParameters_SchedulingSolver_SchedulingSolver_MAX
void set_log_search(bool value)
::operations_research::OptionalBoolean use_global_cheapest_insertion_expensive_chain_lns() const
~RoutingSearchParameters() override
friend class ::PROTOBUF_NAMESPACE_ID::Arena::InternalHelper
void set_use_swap_active(::operations_research::OptionalBoolean value)
static const ::PROTOBUF_NAMESPACE_ID::Descriptor * GetDescriptor()
void clear_solution_limit()
PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT RoutingSearchParametersDefaultTypeInternal _RoutingSearchParameters_default_instance_
::operations_research::OptionalBoolean use_local_cheapest_insertion_path_lns() const
void clear_use_global_cheapest_insertion_expensive_chain_lns()
void clear_use_local_cheapest_insertion_path_lns()
bool has_sat_parameters() const
static const ::PROTOBUF_NAMESPACE_ID::Reflection * GetReflection()
static constexpr int kIndexInFileMessages
void set_use_relocate_neighbors(::operations_research::OptionalBoolean value)
void clear_reduce_vehicle_cost_model()
static const ::PROTOBUF_NAMESPACE_ID::Descriptor * descriptor()
void MergeFrom(const RoutingSearchParameters &from)
void set_savings_add_reverse_arcs(bool value)
size_t ByteSizeLong() const final
void set_allocated_time_limit(PROTOBUF_NAMESPACE_ID::Duration *time_limit)
RoutingModelParameters & operator=(const RoutingModelParameters &from)
::operations_research::OptionalBoolean use_tsp_opt() const
void set_local_search_metaheuristic(::operations_research::LocalSearchMetaheuristic_Value value)
void clear_optimization_step()
void set_use_exchange_pair(::operations_research::OptionalBoolean value)
::PROTOBUF_NAMESPACE_ID::Metadata GetMetadata() const final
bool use_full_propagation() const
void set_guided_local_search_lambda_coefficient(double value)
std::string * mutable_log_tag()
void clear_use_unfiltered_first_solution_strategy()
void Swap(RoutingModelParameters *other)
static constexpr int kIndexInFileMessages
bool RoutingSearchParameters_SchedulingSolver_IsValid(int value)
void clear_cheapest_insertion_add_unperformed_entries()
void clear_improvement_rate_solutions_distance()
bool IsInitialized() const final
::operations_research::OptionalBoolean use_relocate_subtrip() const
static const ::PROTOBUF_NAMESPACE_ID::Descriptor * GetDescriptor()
void set_use_cp_sat(::operations_research::OptionalBoolean value)
void CopyFrom(const RoutingModelParameters &from)
::operations_research::OptionalBoolean use_relocate_neighbors() const
const std::string & log_tag() const
bool savings_add_reverse_arcs() const
void set_cheapest_insertion_first_solution_min_neighbors(::PROTOBUF_NAMESPACE_ID::int32 value)
void set_use_or_opt(::operations_research::OptionalBoolean value)
static const ClassData _class_data_
void set_use_relocate_subtrip(::operations_research::OptionalBoolean value)
void clear_use_exchange_pair()
void clear_use_local_cheapest_insertion_close_nodes_lns()
void MergeFrom(const RoutingSearchParameters_ImprovementSearchLimitParameters &from)
void set_use_relocate_expensive_chain(::operations_research::OptionalBoolean value)
void UnsafeArenaSwap(RoutingSearchParameters_ImprovementSearchLimitParameters *other)
double improvement_rate_coefficient() const
void set_use_tsp_opt(::operations_research::OptionalBoolean value)
void clear_lns_time_limit()
void set_allocated_sat_parameters(::operations_research::sat::SatParameters *sat_parameters)
size_t ByteSizeLong() const final
::PROTOBUF_NAMESPACE_ID::Metadata GetMetadata() const final
double savings_arc_coefficient() const
const ::operations_research::sat::SatParameters & sat_parameters() const
::operations_research::OptionalBoolean use_or_opt() const
void clear_cheapest_insertion_ls_operator_neighbors_ratio()
void set_improvement_rate_solutions_distance(::PROTOBUF_NAMESPACE_ID::int32 value)
::PROTOBUF_NAMESPACE_ID::uint8 * _InternalSerialize(::PROTOBUF_NAMESPACE_ID::uint8 *target, ::PROTOBUF_NAMESPACE_ID::io::EpsCopyOutputStream *stream) const final
static const RoutingSearchParameters & default_instance()
::PROTOBUF_NAMESPACE_ID::int32 cheapest_insertion_ls_operator_min_neighbors() const
const char * _InternalParse(const char *ptr, ::PROTOBUF_NAMESPACE_ID::internal::ParseContext *ctx) final
void clear_savings_arc_coefficient()
void set_use_global_cheapest_insertion_expensive_chain_lns(::operations_research::OptionalBoolean value)
static const RoutingSearchParameters_LocalSearchNeighborhoodOperators * internal_default_instance()
static constexpr SchedulingSolver SchedulingSolver_MIN
static const RoutingSearchParameters * internal_default_instance()
void set_use_tsp_lns(::operations_research::OptionalBoolean value)
void set_first_solution_strategy(::operations_research::FirstSolutionStrategy_Value value)
::operations_research::OptionalBoolean use_exchange() const
void clear_solver_parameters()
void clear_savings_neighbors_ratio()
static constexpr int kIndexInFileMessages
void clear_log_cost_offset()
void clear_use_path_lns()
void clear_multi_armed_bandit_compound_operator_memory_coefficient()
RoutingSearchParameters_LocalSearchNeighborhoodOperators(RoutingSearchParameters_LocalSearchNeighborhoodOperators &&from) noexcept
void set_use_light_relocate_pair(::operations_research::OptionalBoolean value)
void clear_use_local_cheapest_insertion_expensive_chain_lns()
void set_mixed_integer_scheduling_solver(::operations_research::RoutingSearchParameters_SchedulingSolver value)
~RoutingSearchParameters_LocalSearchNeighborhoodOperators() override
static const ::PROTOBUF_NAMESPACE_ID::Reflection * GetReflection()
::operations_research::LocalSearchMetaheuristic_Value local_search_metaheuristic() const
const ::operations_research::ConstraintSolverParameters & solver_parameters() const
double cheapest_insertion_first_solution_neighbors_ratio() const
::operations_research::OptionalBoolean use_two_opt() const
void clear_first_solution_strategy()
PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT ConstraintSolverParametersDefaultTypeInternal _ConstraintSolverParameters_default_instance_
void clear_savings_add_reverse_arcs()
::operations_research::RoutingSearchParameters_LocalSearchNeighborhoodOperators * mutable_local_search_operators()
void clear_guided_local_search_lambda_coefficient()
static const ClassData _class_data_
void clear_log_cost_scaling_factor()
static const RoutingModelParameters & default_instance()
void set_use_full_path_lns(::operations_research::OptionalBoolean value)
::PROTOBUF_NAMESPACE_ID::int32 max_callback_cache_size() const
void unsafe_arena_set_allocated_improvement_limit_parameters(::operations_research::RoutingSearchParameters_ImprovementSearchLimitParameters *improvement_limit_parameters)
::operations_research::OptionalBoolean use_full_path_lns() const
void set_cheapest_insertion_ls_operator_min_neighbors(::PROTOBUF_NAMESPACE_ID::int32 value)
bool RoutingSearchParameters_SchedulingSolver_Parse(::PROTOBUF_NAMESPACE_ID::ConstStringParam name, RoutingSearchParameters_SchedulingSolver *value)
void CopyFrom(const RoutingSearchParameters &from)
::operations_research::OptionalBoolean use_local_cheapest_insertion_close_nodes_lns() const
void set_cheapest_insertion_ls_operator_neighbors_ratio(double value)
bool reduce_vehicle_cost_model() const
void set_optimization_step(double value)
void clear_max_callback_cache_size()
RoutingSearchParameters_ImprovementSearchLimitParameters * New() const final
void clear_local_search_operators()
static const ::PROTOBUF_NAMESPACE_ID::Reflection * GetReflection()
static const ::PROTOBUF_NAMESPACE_ID::Descriptor * GetDescriptor()
friend void swap(RoutingModelParameters &a, RoutingModelParameters &b)
const ::operations_research::RoutingSearchParameters_ImprovementSearchLimitParameters & improvement_limit_parameters() const
void clear_use_make_inactive()
void set_cheapest_insertion_farthest_seeds_ratio(double value)
::PROTOBUF_NAMESPACE_ID::Metadata GetMetadata() const final
double optimization_step() const
static constexpr SchedulingSolver GLOP
void set_allocated_improvement_limit_parameters(::operations_research::RoutingSearchParameters_ImprovementSearchLimitParameters *improvement_limit_parameters)
::PROTOBUF_NAMESPACE_ID::int64 solution_limit() const
void clear_improvement_rate_coefficient()
PROTOBUF_MUST_USE_RESULT ::operations_research::ConstraintSolverParameters * release_solver_parameters()
void clear_savings_max_memory_usage_bytes()
::PROTOBUF_NAMESPACE_ID::int32 heuristic_close_nodes_lns_num_nodes() const
void Swap(RoutingSearchParameters_LocalSearchNeighborhoodOperators *other)
void set_cheapest_insertion_first_solution_neighbors_ratio(double value)
void clear_use_node_pair_swap_active()
FirstSolutionStrategy_Value
void set_log_cost_offset(double value)
static const ::PROTOBUF_NAMESPACE_ID::Reflection * GetReflection()
double savings_max_memory_usage_bytes() const
void set_allocated_log_tag(std::string *log_tag)
void set_number_of_solutions_to_collect(::PROTOBUF_NAMESPACE_ID::int32 value)
static const ::PROTOBUF_NAMESPACE_ID::Descriptor * GetDescriptor()
void set_heuristic_expensive_chain_lns_num_arcs_to_consider(::PROTOBUF_NAMESPACE_ID::int32 value)
void clear_use_exchange_subtrip()
void set_use_multi_armed_bandit_concatenate_operators(bool value)
void set_savings_neighbors_ratio(double value)
::operations_research::OptionalBoolean use_global_cheapest_insertion_close_nodes_lns() const
static const RoutingModelParameters * internal_default_instance()
::operations_research::ConstraintSolverParameters * mutable_solver_parameters()
void clear_heuristic_close_nodes_lns_num_nodes()
PROTOBUF_NAMESPACE_ID::Duration * mutable_lns_time_limit()
void unsafe_arena_set_allocated_local_search_operators(::operations_research::RoutingSearchParameters_LocalSearchNeighborhoodOperators *local_search_operators)
bool use_multi_armed_bandit_concatenate_operators() const
RoutingSearchParameters_LocalSearchNeighborhoodOperators & operator=(RoutingSearchParameters_LocalSearchNeighborhoodOperators &&from) noexcept
void set_continuous_scheduling_solver(::operations_research::RoutingSearchParameters_SchedulingSolver value)
double log_cost_offset() const
void clear_use_full_path_lns()
void set_use_cross_exchange(::operations_research::OptionalBoolean value)
static bool SchedulingSolver_Parse(::PROTOBUF_NAMESPACE_ID::ConstStringParam name, SchedulingSolver *value)
void clear_use_relocate()
void set_use_relocate(::operations_research::OptionalBoolean value)
PROTOBUF_NAMESPACE_ID::Duration * unsafe_arena_release_time_limit()
RoutingSearchParameters_ImprovementSearchLimitParameters * New(::PROTOBUF_NAMESPACE_ID::Arena *arena) const final
void set_christofides_use_minimum_matching(bool value)
void clear_relocate_expensive_chain_num_arcs_to_consider()
::operations_research::RoutingSearchParameters_LocalSearchNeighborhoodOperators * unsafe_arena_release_local_search_operators()
void clear_use_relocate_path_global_cheapest_insertion_insert_unperformed()
::operations_research::OptionalBoolean use_generalized_cp_sat() const
void clear_use_global_cheapest_insertion_path_lns()
void clear_cheapest_insertion_farthest_seeds_ratio()
::operations_research::OptionalBoolean use_cp_sat() const
::operations_research::OptionalBoolean use_relocate_path_global_cheapest_insertion_insert_unperformed() const
::PROTOBUF_NAMESPACE_ID::uint8 * _InternalSerialize(::PROTOBUF_NAMESPACE_ID::uint8 *target, ::PROTOBUF_NAMESPACE_ID::io::EpsCopyOutputStream *stream) const final
void clear_use_relocate_expensive_chain()
RoutingSearchParameters_SchedulingSolver
PROTOBUF_NAMESPACE_ID::Duration * unsafe_arena_release_lns_time_limit()
void set_use_make_chain_inactive(::operations_research::OptionalBoolean value)
int GetCachedSize() const final
void clear_savings_parallel_routes()
::PROTOBUF_NAMESPACE_ID::int32 relocate_expensive_chain_num_arcs_to_consider() const
const std::string & RoutingSearchParameters_SchedulingSolver_Name(T enum_t_value)
void set_use_make_active(::operations_research::OptionalBoolean value)
::operations_research::OptionalBoolean use_cp() const
::operations_research::OptionalBoolean use_exchange_subtrip() const
void clear_local_search_metaheuristic()
static const ::PROTOBUF_NAMESPACE_ID::Descriptor * descriptor()
void set_use_relocate_pair(::operations_research::OptionalBoolean value)
static const RoutingSearchParameters_LocalSearchNeighborhoodOperators & default_instance()
bool use_depth_first_search() const
void set_allocated_local_search_operators(::operations_research::RoutingSearchParameters_LocalSearchNeighborhoodOperators *local_search_operators)
void clear_use_relocate_pair()
::PROTOBUF_NAMESPACE_ID::int32 number_of_solutions_to_collect() const
void set_use_two_opt(::operations_research::OptionalBoolean value)
void set_log_tag(ArgT0 &&arg0, ArgT... args)
Collection of objects used to extend the Constraint Solver library.
PROTOBUF_ATTRIBUTE_REINITIALIZES void Clear() final
void clear_use_make_active()
RoutingModelParameters * New(::PROTOBUF_NAMESPACE_ID::Arena *arena) const final
int GetCachedSize() const final
void clear_heuristic_expensive_chain_lns_num_arcs_to_consider()
void set_multi_armed_bandit_compound_operator_memory_coefficient(double value)
PROTOBUF_MUST_USE_RESULT ::operations_research::RoutingSearchParameters_ImprovementSearchLimitParameters * release_improvement_limit_parameters()
::operations_research::OptionalBoolean use_path_lns() const
const ::PROTOBUF_NAMESPACE_ID::EnumDescriptor * RoutingSearchParameters_SchedulingSolver_descriptor()
constexpr int RoutingSearchParameters_SchedulingSolver_SchedulingSolver_ARRAYSIZE
void set_use_global_cheapest_insertion_close_nodes_lns(::operations_research::OptionalBoolean value)
void clear_use_light_relocate_pair()
RoutingSearchParameters_ImprovementSearchLimitParameters()
PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT RoutingSearchParameters_LocalSearchNeighborhoodOperatorsDefaultTypeInternal _RoutingSearchParameters_LocalSearchNeighborhoodOperators_default_instance_
void set_savings_arc_coefficient(double value)
void set_use_unfiltered_first_solution_strategy(bool value)
size_t ByteSizeLong() const final
static constexpr SchedulingSolver SchedulingSolver_MAX
::PROTOBUF_NAMESPACE_ID::int32 heuristic_expensive_chain_lns_num_arcs_to_consider() const
void set_improvement_rate_coefficient(double value)
bool christofides_use_minimum_matching() const
void UnsafeArenaSwap(RoutingSearchParameters_LocalSearchNeighborhoodOperators *other)
::operations_research::RoutingSearchParameters_ImprovementSearchLimitParameters * unsafe_arena_release_improvement_limit_parameters()
int GetCachedSize() const final
static const ClassData _class_data_
::operations_research::OptionalBoolean use_relocate() const
PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT SatParametersDefaultTypeInternal _SatParameters_default_instance_
const ::operations_research::RoutingSearchParameters_LocalSearchNeighborhoodOperators & local_search_operators() const
::operations_research::OptionalBoolean use_global_cheapest_insertion_path_lns() const
void clear_cheapest_insertion_ls_operator_min_neighbors()
void set_cheapest_insertion_first_solution_use_neighbors_ratio_for_initialization(bool value)
void clear_use_swap_active()
void set_log_cost_scaling_factor(double value)
RoutingSearchParameters & operator=(const RoutingSearchParameters &from)
RoutingModelParameters(RoutingModelParameters &&from) noexcept
void set_use_lin_kernighan(::operations_research::OptionalBoolean value)
static const RoutingSearchParameters_ImprovementSearchLimitParameters * internal_default_instance()
double multi_armed_bandit_compound_operator_memory_coefficient() const
friend void swap(RoutingSearchParameters_ImprovementSearchLimitParameters &a, RoutingSearchParameters_ImprovementSearchLimitParameters &b)
static constexpr SchedulingSolver CP_SAT
void clear_use_relocate_neighbors()
const PROTOBUF_NAMESPACE_ID::Duration & time_limit() const
const char * _InternalParse(const char *ptr, ::PROTOBUF_NAMESPACE_ID::internal::ParseContext *ctx) final
void set_use_local_cheapest_insertion_close_nodes_lns(::operations_research::OptionalBoolean value)
RoutingSearchParameters_ImprovementSearchLimitParameters & operator=(RoutingSearchParameters_ImprovementSearchLimitParameters &&from) noexcept
void clear_continuous_scheduling_solver()
double savings_neighbors_ratio() const
::PROTOBUF_NAMESPACE_ID::int32 cheapest_insertion_first_solution_min_neighbors() const
RoutingSearchParameters_ImprovementSearchLimitParameters(RoutingSearchParameters_ImprovementSearchLimitParameters &&from) noexcept
static const std::string & SchedulingSolver_Name(T enum_t_value)
RoutingSearchParameters_LocalSearchNeighborhoodOperators()
const char * _InternalParse(const char *ptr, ::PROTOBUF_NAMESPACE_ID::internal::ParseContext *ctx) final
void set_use_exchange_subtrip(::operations_research::OptionalBoolean value)
void clear_use_multi_armed_bandit_concatenate_operators()
bool has_improvement_limit_parameters() const
::operations_research::OptionalBoolean use_make_active() const
PROTOBUF_MUST_USE_RESULT ::operations_research::RoutingSearchParameters_LocalSearchNeighborhoodOperators * release_local_search_operators()
void clear_mixed_integer_scheduling_solver()
void clear_use_cross_exchange()
void set_use_cp(::operations_research::OptionalBoolean value)
void set_max_callback_cache_size(::PROTOBUF_NAMESPACE_ID::int32 value)
RoutingSearchParameters * New() const final
double cheapest_insertion_ls_operator_neighbors_ratio() const
PROTOBUF_MUST_USE_RESULT std::string * release_log_tag()
void set_use_cross(::operations_research::OptionalBoolean value)
void set_use_exchange(::operations_research::OptionalBoolean value)
void set_use_local_cheapest_insertion_expensive_chain_lns(::operations_research::OptionalBoolean value)
RoutingSearchParameters & operator=(RoutingSearchParameters &&from) noexcept
friend void swap(RoutingSearchParameters_LocalSearchNeighborhoodOperators &a, RoutingSearchParameters_LocalSearchNeighborhoodOperators &b)
void set_use_node_pair_swap_active(::operations_research::OptionalBoolean value)
RoutingSearchParameters()
void clear_improvement_limit_parameters()
::operations_research::OptionalBoolean use_relocate_expensive_chain() const
void set_cheapest_insertion_add_unperformed_entries(bool value)
::PROTOBUF_NAMESPACE_ID::int32 improvement_rate_solutions_distance() const
PROTOBUF_MUST_USE_RESULT ::operations_research::sat::SatParameters * release_sat_parameters()
void UnsafeArenaSwap(RoutingSearchParameters *other)
void Swap(RoutingSearchParameters *other)
RoutingSearchParameters_LocalSearchNeighborhoodOperators & operator=(const RoutingSearchParameters_LocalSearchNeighborhoodOperators &from)