21#include "absl/status/status.h"
22#include "absl/time/time.h"
34 "Routing: forbids use of Large Neighborhood Search.");
36 "Routing: forbids use of Full-path Large Neighborhood Search.");
38 "Routing: forbids use of Relocate neighborhood.");
40 "Routing: forbids use of RelocateNeighbors neighborhood.");
42 "Routing: forbids use of RelocateSubtrips neighborhood.");
44 "Routing: forbids use of Exchange neighborhood.");
46 "Routing: forbids use of ExchangeSubtrips neighborhood.");
48 "Routing: forbids use of Cross neighborhood.");
50 "Routing: forbids use of 2Opt neighborhood.");
52 "Routing: forbids use of OrOpt neighborhood.");
54 "Routing: forbids use of MakeActive/SwapActive/MakeInactive "
57 "Routing: forbids use of LKH neighborhood.");
58ABSL_FLAG(
bool, routing_no_relocate_expensive_chain,
false,
59 "Routing: forbids use of RelocateExpensiveChain operator.");
61 "Routing: forbids use of TSPOpt neighborhood.");
63 "Routing: forbids use of TSPLNS neighborhood.");
64ABSL_FLAG(
bool, routing_use_chain_make_inactive,
false,
65 "Routing: use chain version of MakeInactive neighborhood.");
66ABSL_FLAG(
bool, routing_use_extended_swap_active,
false,
67 "Routing: use extended version of SwapActive neighborhood.");
70ABSL_FLAG(
bool, routing_guided_local_search,
false,
"Routing: use GLS.");
71ABSL_FLAG(
double, routing_guided_local_search_lambda_coefficient, 0.1,
72 "Lambda coefficient in GLS.");
74 "Routing: use simulated annealing.");
75ABSL_FLAG(
bool, routing_tabu_search,
false,
"Routing: use tabu search.");
77 "Routing: use tabu search based on a list of values.");
81 "Routing: number of solutions limit.");
83 "Routing: time limit in ms.");
85 "Routing: time limit in ms for LNS sub-decisionbuilder.");
89 "Routing first solution heuristic. See SetupParametersFromFlags "
90 "in the code to get a full list.");
91ABSL_FLAG(
bool, routing_use_filtered_first_solutions,
true,
92 "Use filtered version of first solution heuristics if available.");
94 "Ratio of neighbors to consider for each node when "
95 "constructing the savings.");
97 "Add savings related to reverse arcs when finding the nearest "
98 "neighbors of the nodes.");
100 "Coefficient of the cost of the arc for which the saving value "
101 "is being computed.");
102ABSL_FLAG(
double, cheapest_insertion_farthest_seeds_ratio, 0,
103 "Ratio of available vehicles in the model on which farthest "
104 "nodes of the model are inserted as seeds.");
105ABSL_FLAG(
double, cheapest_insertion_first_solution_neighbors_ratio, 1.0,
106 "Ratio of nodes considered as neighbors in the "
107 "GlobalCheapestInsertion first solution heuristic.");
109 "Routing: use a complete depth-first search.");
110ABSL_FLAG(
double, routing_optimization_step, 0.0,
"Optimization step.");
111ABSL_FLAG(
int, routing_number_of_solutions_to_collect, 1,
112 "Number of solutions to collect.");
113ABSL_FLAG(
int, routing_relocate_expensive_chain_num_arcs_to_consider, 4,
114 "Number of arcs to consider in the RelocateExpensiveChain "
115 "neighborhood operator.");
119 "Use constraints with light propagation in routing model.");
122ABSL_FLAG(
bool, routing_cache_callbacks,
false,
"Cache callback calls.");
124 "Maximum cache size when callback caching is on.");
127ABSL_FLAG(
bool, routing_trace,
false,
"Routing: trace search.");
128ABSL_FLAG(
bool, routing_profile,
false,
"Routing: profile search.");
132 "Routing: use homogeneous cost model when possible.");
134 "Use gzip to compress the trail, zippy otherwise.");
140 const std::map<std::string, FirstSolutionStrategy::Value>
141 first_solution_string_to_parameters = {
143 {
"PathMostConstrainedArc",
151 {
"GlobalCheapestInsertion",
153 {
"SequentialGlobalCheapestInsertion",
155 {
"LocalCheapestInsertion",
163 absl::GetFlag(FLAGS_routing_first_solution), &strategy)) {
164 parameters->set_first_solution_strategy(strategy);
166 parameters->set_use_unfiltered_first_solution_strategy(
167 !absl::GetFlag(FLAGS_routing_use_filtered_first_solutions));
169 absl::GetFlag(FLAGS_savings_neighbors_ratio));
170 parameters->set_savings_max_memory_usage_bytes(6e9);
172 absl::GetFlag(FLAGS_savings_add_reverse_arcs));
174 absl::GetFlag(FLAGS_savings_arc_coefficient));
175 parameters->set_cheapest_insertion_farthest_seeds_ratio(
176 absl::GetFlag(FLAGS_cheapest_insertion_farthest_seeds_ratio));
177 parameters->set_cheapest_insertion_first_solution_neighbors_ratio(
178 absl::GetFlag(FLAGS_cheapest_insertion_first_solution_neighbors_ratio));
179 parameters->set_cheapest_insertion_first_solution_min_neighbors(1);
184 if (absl::GetFlag(FLAGS_routing_tabu_search)) {
187 }
else if (absl::GetFlag(FLAGS_routing_generic_tabu_search)) {
190 }
else if (absl::GetFlag(FLAGS_routing_simulated_annealing)) {
193 }
else if (absl::GetFlag(FLAGS_routing_guided_local_search)) {
197 parameters->set_guided_local_search_lambda_coefficient(
198 absl::GetFlag(FLAGS_routing_guided_local_search_lambda_coefficient));
208 parameters->set_cheapest_insertion_ls_operator_neighbors_ratio(1.0);
209 parameters->set_cheapest_insertion_ls_operator_min_neighbors(1);
211 local_search_operators =
parameters->mutable_local_search_operators();
223 local_search_operators
236 ToOptionalBoolean(!absl::GetFlag(FLAGS_routing_no_relocate)));
238 ToOptionalBoolean(!absl::GetFlag(FLAGS_routing_no_relocate_neighbors)));
240 ToOptionalBoolean(!absl::GetFlag(FLAGS_routing_no_relocate_subtrip)));
242 ToOptionalBoolean(!absl::GetFlag(FLAGS_routing_no_exchange_subtrip)));
244 ToOptionalBoolean(!absl::GetFlag(FLAGS_routing_no_exchange)));
246 ToOptionalBoolean(!absl::GetFlag(FLAGS_routing_no_cross)));
248 ToOptionalBoolean(!absl::GetFlag(FLAGS_routing_no_2opt)));
250 ToOptionalBoolean(!absl::GetFlag(FLAGS_routing_no_oropt)));
252 ToOptionalBoolean(!absl::GetFlag(FLAGS_routing_no_lkh)));
254 !absl::GetFlag(FLAGS_routing_no_relocate_expensive_chain)));
256 ToOptionalBoolean(!absl::GetFlag(FLAGS_routing_no_tsp)));
258 ToOptionalBoolean(!absl::GetFlag(FLAGS_routing_no_make_active)));
260 ToOptionalBoolean(!absl::GetFlag(FLAGS_routing_use_chain_make_inactive) &&
261 !absl::GetFlag(FLAGS_routing_no_make_active)));
263 ToOptionalBoolean(absl::GetFlag(FLAGS_routing_use_chain_make_inactive) &&
264 !absl::GetFlag(FLAGS_routing_no_make_active)));
266 !absl::GetFlag(FLAGS_routing_use_extended_swap_active) &&
267 !absl::GetFlag(FLAGS_routing_no_make_active)));
269 ToOptionalBoolean(absl::GetFlag(FLAGS_routing_use_extended_swap_active) &&
270 !absl::GetFlag(FLAGS_routing_no_make_active)));
272 ToOptionalBoolean(!absl::GetFlag(FLAGS_routing_no_lns)));
274 ToOptionalBoolean(!absl::GetFlag(FLAGS_routing_no_lns)));
276 ToOptionalBoolean(!absl::GetFlag(FLAGS_routing_no_fullpathlns)));
278 ToOptionalBoolean(!absl::GetFlag(FLAGS_routing_no_tsplns)));
283 parameters->set_use_depth_first_search(absl::GetFlag(FLAGS_routing_dfs));
287 absl::GetFlag(FLAGS_routing_optimization_step));
288 parameters->set_number_of_solutions_to_collect(
289 absl::GetFlag(FLAGS_routing_number_of_solutions_to_collect));
290 parameters->set_solution_limit(absl::GetFlag(FLAGS_routing_solution_limit));
291 if (absl::GetFlag(FLAGS_routing_time_limit) !=
294 absl::Milliseconds(absl::GetFlag(FLAGS_routing_time_limit)),
297 if (absl::GetFlag(FLAGS_routing_lns_time_limit) !=
300 absl::Milliseconds(absl::GetFlag(FLAGS_routing_lns_time_limit)),
308 !absl::GetFlag(FLAGS_routing_use_light_propagation));
309 parameters->set_log_search(absl::GetFlag(FLAGS_routing_trace));
311 parameters->set_relocate_expensive_chain_num_arcs_to_consider(absl::GetFlag(
312 FLAGS_routing_relocate_expensive_chain_num_arcs_to_consider));
313 parameters->set_heuristic_expensive_chain_lns_num_arcs_to_consider(4);
314 parameters->set_heuristic_close_nodes_lns_num_nodes(5);
316 parameters->set_mixed_integer_scheduling_solver(
328 LOG_IF(DFATAL, !error.empty())
329 <<
"Error in the routing search parameters built from flags: " << error;
339 absl::GetFlag(FLAGS_routing_use_homogeneous_costs));
340 if (absl::GetFlag(FLAGS_routing_cache_callbacks)) {
342 absl::GetFlag(FLAGS_routing_max_cache_size));
345 absl::GetFlag(FLAGS_routing_profile));
#define LOG_IF(severity, condition)
void set_profile_local_search(bool value)
static constexpr Value GLOBAL_CHEAPEST_ARC
static constexpr Value BEST_INSERTION
static constexpr Value SAVINGS
static constexpr Value LOCAL_CHEAPEST_ARC
static constexpr Value FIRST_UNBOUND_MIN_VALUE
static constexpr Value ALL_UNPERFORMED
static constexpr Value LOCAL_CHEAPEST_INSERTION
static constexpr Value PATH_MOST_CONSTRAINED_ARC
static constexpr Value CHRISTOFIDES
static constexpr Value SWEEP
static constexpr Value PARALLEL_CHEAPEST_INSERTION
static constexpr Value EVALUATOR_STRATEGY
static constexpr Value SEQUENTIAL_CHEAPEST_INSERTION
static constexpr Value PATH_CHEAPEST_ARC
void set_use_exchange_subtrip(::operations_research::OptionalBoolean value)
void set_use_node_pair_swap_active(::operations_research::OptionalBoolean value)
void set_use_make_inactive(::operations_research::OptionalBoolean value)
void set_use_cross_exchange(::operations_research::OptionalBoolean value)
void set_use_make_chain_inactive(::operations_research::OptionalBoolean value)
void set_use_light_relocate_pair(::operations_research::OptionalBoolean value)
void set_use_local_cheapest_insertion_expensive_chain_lns(::operations_research::OptionalBoolean value)
void set_use_relocate_path_global_cheapest_insertion_insert_unperformed(::operations_research::OptionalBoolean value)
void set_use_make_active(::operations_research::OptionalBoolean value)
void set_use_exchange_pair(::operations_research::OptionalBoolean value)
void set_use_tsp_lns(::operations_research::OptionalBoolean value)
void set_use_cross(::operations_research::OptionalBoolean value)
void set_use_relocate_subtrip(::operations_research::OptionalBoolean value)
void set_use_relocate(::operations_research::OptionalBoolean value)
void set_use_global_cheapest_insertion_close_nodes_lns(::operations_research::OptionalBoolean value)
void set_use_tsp_opt(::operations_research::OptionalBoolean value)
void set_use_global_cheapest_insertion_expensive_chain_lns(::operations_research::OptionalBoolean value)
void set_use_global_cheapest_insertion_path_lns(::operations_research::OptionalBoolean value)
void set_use_extended_swap_active(::operations_research::OptionalBoolean value)
void set_use_relocate_expensive_chain(::operations_research::OptionalBoolean value)
void set_use_swap_active(::operations_research::OptionalBoolean value)
void set_use_relocate_pair(::operations_research::OptionalBoolean value)
void set_use_inactive_lns(::operations_research::OptionalBoolean value)
void set_use_full_path_lns(::operations_research::OptionalBoolean value)
void set_use_exchange(::operations_research::OptionalBoolean value)
void set_use_local_cheapest_insertion_path_lns(::operations_research::OptionalBoolean value)
void set_use_relocate_and_make_active(::operations_research::OptionalBoolean value)
void set_use_lin_kernighan(::operations_research::OptionalBoolean value)
void set_use_relocate_neighbors(::operations_research::OptionalBoolean value)
void set_use_or_opt(::operations_research::OptionalBoolean value)
void set_use_two_opt(::operations_research::OptionalBoolean value)
void set_use_local_cheapest_insertion_close_nodes_lns(::operations_research::OptionalBoolean value)
void set_use_path_lns(::operations_research::OptionalBoolean value)
static constexpr SchedulingSolver GLOP
static constexpr SchedulingSolver CP_SAT
static ConstraintSolverParameters DefaultSolverParameters()
Create a ConstraintSolverParameters proto with all the default values.
bool FindCopy(const Collection &collection, const Key &key, Value *const value)
Collection of objects used to extend the Constraint Solver library.
void SetLocalSearchMetaheuristicFromFlags(RoutingSearchParameters *parameters)
std::string FindErrorInRoutingSearchParameters(const RoutingSearchParameters &search_parameters)
Returns an empty std::string if the routing search parameters are valid, and a non-empty,...
FirstSolutionStrategy_Value
RoutingSearchParameters BuildSearchParametersFromFlags()
Builds routing search parameters from flags.
void SetSearchLimitsFromFlags(RoutingSearchParameters *parameters)
void SetFirstSolutionStrategyFromFlags(RoutingSearchParameters *parameters)
void AddLocalSearchNeighborhoodOperatorsFromFlags(RoutingSearchParameters *parameters)
void SetMiscellaneousParametersFromFlags(RoutingSearchParameters *parameters)
RoutingModelParameters BuildModelParametersFromFlags()
Builds routing search parameters from flags.
inline ::absl::StatusOr< google::protobuf::Duration > EncodeGoogleApiProto(absl::Duration d)
ABSL_FLAG(bool, routing_no_lns, false, "Routing: forbids use of Large Neighborhood Search.")