Go to the source code of this file.
|
| | 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.
|
| |
|
| | DEFINE_int32 (cp_local_search_sync_frequency, 16, "Frequency of checks for better solutions in the solution pool.") |
| |
| | DEFINE_int32 (cp_local_search_tsp_opt_size, 13, "Size of TSPs solved in the TSPOpt operator.") |
| |
| | DEFINE_int32 (cp_local_search_tsp_lns_size, 10, "Size of TSPs solved in the TSPLns operator.") |
| |
| | DEFINE_bool (cp_use_empty_path_symmetry_breaker, true, "If true, equivalent empty paths are removed from the neighborhood " "of PathOperators") |
| |
| bool | LocalOptimumReached (Search *const search) |
| |
| bool | AcceptDelta (Search *const search, Assignment *delta, Assignment *deltadelta) |
| |
| void | AcceptNeighbor (Search *const search) |
| |
| void | AcceptUncheckedNeighbor (Search *const search) |
| |
| template<class T > |
| LocalSearchOperator * | MakeLocalSearchOperator (Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64)> start_empty_path_class) |
| | Operator Factories. More...
|
| |
| LocalSearchFilter * | MakePathStateFilter (Solver *solver, std::unique_ptr< PathState > path_state, const std::vector< IntVar * > &nexts) |
| |
| LocalSearchFilter * | MakeUnaryDimensionFilter (Solver *solver, std::unique_ptr< UnaryDimensionChecker > checker) |
| |
| void | InstallLocalSearchProfiler (LocalSearchProfiler *monitor) |
| |
| LocalSearchProfiler * | BuildLocalSearchProfiler (Solver *solver) |
| |
| void | DeleteLocalSearchProfiler (LocalSearchProfiler *monitor) |
| |
◆ MAKE_LOCAL_SEARCH_OPERATOR
| #define MAKE_LOCAL_SEARCH_OPERATOR |
( |
|
OperatorClass | ) |
|
Value: template <> \
LocalSearchOperator* MakeLocalSearchOperator<OperatorClass>( \
Solver * solver, const std::vector<IntVar*>& vars, \
const std::vector<IntVar*>& secondary_vars, \
std::function<
int(
int64)> start_empty_path_class) { \
return solver->RevAlloc(new OperatorClass( \
vars, secondary_vars, std::move(start_empty_path_class))); \
}
Definition at line 2148 of file local_search.cc.
◆ DEFINE_bool()
| DEFINE_bool |
( |
cp_use_empty_path_symmetry_breaker |
, |
|
|
true |
, |
|
|
"If |
true, |
|
|
equivalent empty paths are removed from the neighborhood " "of PathOperators" |
|
|
) |
| |
◆ DEFINE_int32() [1/3]
| DEFINE_int32 |
( |
cp_local_search_sync_frequency |
, |
|
|
16 |
, |
|
|
"Frequency of checks for better solutions in the solution pool." |
|
|
) |
| |
◆ DEFINE_int32() [2/3]
| DEFINE_int32 |
( |
cp_local_search_tsp_lns_size |
, |
|
|
10 |
, |
|
|
"Size of TSPs solved in the TSPLns operator." |
|
|
) |
| |
◆ DEFINE_int32() [3/3]
| DEFINE_int32 |
( |
cp_local_search_tsp_opt_size |
, |
|
|
13 |
, |
|
|
"Size of TSPs solved in the TSPOpt operator." |
|
|
) |
| |
◆ delta_costs_
| int64* const delta_costs_ |
|
protected |
◆ delta_sum_
◆ filter_enum_
| Solver::LocalSearchFilterBound filter_enum_ |
|
protected |
◆ incremental_
◆ primary_vars_size_
| const int primary_vars_size_ |
|
protected |
◆ synchronized_costs_
| int64* const synchronized_costs_ |
|
protected |
◆ synchronized_sum_