Go to the source code of this file.
|
| namespace | operations_research |
| | The vehicle routing library lets one model and solve generic vehicle routing problems ranging from the Traveling Salesman Problem to more complex problems such as the Capacitated Vehicle Routing Problem with Time Windows.
|
| |
|
| | ABSL_FLAG (bool, cp_use_sparse_gls_penalties, false, "Use sparse implementation to store Guided Local Search penalties") |
| |
| | ABSL_FLAG (bool, cp_log_to_vlog, false, "Whether search related logging should be " "vlog or info.") |
| |
| | ABSL_FLAG (int64, cp_large_domain_no_splitting_limit, 0xFFFFF, "Size limit to allow holes in variables from the strategy.") |
| |
| BaseAssignVariables::Mode | ChooseMode (Solver::IntValueStrategy val_str) |
| |
◆ ABSL_FLAG() [1/3]
| ABSL_FLAG |
( |
bool |
, |
|
|
cp_log_to_vlog |
, |
|
|
false |
, |
|
|
"Whether search related logging should be " "vlog or info." |
|
|
) |
| |
◆ ABSL_FLAG() [2/3]
| ABSL_FLAG |
( |
bool |
, |
|
|
cp_use_sparse_gls_penalties |
, |
|
|
false |
, |
|
|
"Use sparse implementation to store Guided Local Search penalties" |
|
|
) |
| |
◆ ABSL_FLAG() [3/3]
| ABSL_FLAG |
( |
int64 |
, |
|
|
cp_large_domain_no_splitting_limit |
, |
|
|
0xFFFFF |
, |
|
|
"Size limit to allow holes in variables from the strategy." |
|
|
) |
| |
◆ assignment_penalized_value_
| int64 assignment_penalized_value_ |
|
protected |
◆ best_
◆ builders_
| std::vector<DecisionBuilder*> builders_ |
|
protected |
◆ current_
◆ current_penalized_values_
| std::unique_ptr<int64[]> current_penalized_values_ |
|
protected |
◆ delta_cache_
| std::unique_ptr<int64[]> delta_cache_ |
|
protected |
◆ evaluator_
◆ first_unbound_
| Rev<int64> first_unbound_ |
|
protected |
◆ incremental_
◆ indices_
| absl::flat_hash_map<const IntVar*, int64> indices_ |
|
protected |
◆ last_unbound_
◆ maximize_
◆ mode_
◆ objective_
◆ old_penalized_value_
| int64 old_penalized_value_ |
|
protected |
◆ penalized_objective_
| IntVar* penalized_objective_ |
|
protected |
◆ penalty_factor_
| const double penalty_factor_ |
|
protected |
◆ selector_
| BaseVariableAssignmentSelector* const selector_ |
|
protected |
◆ solution_count_
| const int solution_count_ |
◆ solutions_pq_
| std::priority_queue<std::pair<int64, SolutionData> > solutions_pq_ |
◆ solver_
◆ stamp_
◆ step_
◆ value
◆ var
◆ vars_
| const std::vector<IntVar*> vars_ |
|
protected |