A CheapestAdditionFilteredHeuristic where the notion of 'cheapest arc' comes from an arc comparator.
Definition at line 3606 of file routing.h.
◆ ComparatorCheapestAdditionFilteredHeuristic()
◆ ~ComparatorCheapestAdditionFilteredHeuristic()
◆ BuildSolution()
Builds a solution.
Returns the resulting assignment if a solution was found, and nullptr otherwise.
Definition at line 2907 of file routing_search.cc.
◆ BuildSolutionFromRoutes()
Builds a solution starting from the routes formed by the next accessor.
Definition at line 2919 of file routing_search.cc.
◆ BuildSolutionInternal()
bool BuildSolutionInternal |
( |
| ) |
|
|
overridevirtualinherited |
◆ Commit()
Commits the modifications to the current solution if these modifications are "filter-feasible", returns false otherwise; in any case discards all modifications.
Definition at line 2952 of file routing_search.cc.
◆ Contains()
bool Contains |
( |
int64 |
index | ) |
const |
|
inlineprotectedinherited |
Returns true if the variable of index 'index' is in the current solution.
Definition at line 3045 of file routing.h.
◆ DebugString()
std::string DebugString |
( |
| ) |
const |
|
inlineoverridevirtual |
◆ GetEndChainStart()
int GetEndChainStart |
( |
int |
vehicle | ) |
const |
|
inlineinherited |
Returns the start of the end chain of vehicle,.
Definition at line 3088 of file routing.h.
◆ GetStartChainEnd()
int GetStartChainEnd |
( |
int |
vehicle | ) |
const |
|
inlineinherited |
Returns the end of the start chain of vehicle,.
Definition at line 3086 of file routing.h.
◆ MakeDisjunctionNodesUnperformed()
void MakeDisjunctionNodesUnperformed |
( |
int64 |
node | ) |
|
|
inherited |
Make nodes in the same disjunction as 'node' unperformed.
'node' is a variable index corresponding to a node.
Definition at line 3073 of file routing_search.cc.
◆ MakePartiallyPerformedPairsUnperformed()
void MakePartiallyPerformedPairsUnperformed |
( |
| ) |
|
|
inherited |
Make all partially performed pickup and delivery pairs unperformed.
A pair is partially unperformed if one element of the pair has one of its alternatives performed in the solution and the other has no alternatives in the solution or none performed.
Definition at line 3090 of file routing_search.cc.
◆ MakeUnassignedNodesUnperformed()
void MakeUnassignedNodesUnperformed |
( |
| ) |
|
|
inherited |
◆ model()
◆ number_of_decisions()
int64 number_of_decisions |
( |
| ) |
const |
|
inlineinherited |
Returns statistics on search, number of decisions sent to filters, number of decisions rejected by filters.
Definition at line 3010 of file routing.h.
◆ number_of_rejects()
int64 number_of_rejects |
( |
| ) |
const |
|
inlineinherited |
◆ ResetSolution()
◆ ResetVehicleIndices()
virtual void ResetVehicleIndices |
( |
| ) |
|
|
inlineprotectedvirtualinherited |
◆ SetValue()
Modifies the current solution by setting the variable of index 'index' to value 'value'.
Definition at line 3030 of file routing.h.
◆ SetVehicleIndex()
virtual void SetVehicleIndex |
( |
int64 |
node, |
|
|
int |
vehicle |
|
) |
| |
|
inlineprotectedvirtualinherited |
◆ Size()
Returns the number of variables the decision builder is trying to instantiate.
Definition at line 3050 of file routing.h.
◆ StopSearch()
|
inlineoverrideprotectedvirtualinherited |
◆ SynchronizeFilters()
void SynchronizeFilters |
( |
| ) |
|
|
protectedinherited |
Synchronizes filters with an assignment (the current solution).
Definition at line 2980 of file routing_search.cc.
◆ Value()
Returns the value of the variable of index 'index' in the last committed solution.
Definition at line 3041 of file routing.h.
◆ Var()
Returns the variable of index 'index'.
Definition at line 3052 of file routing.h.
◆ VehicleIsEmpty()
bool VehicleIsEmpty |
( |
int |
vehicle | ) |
const |
|
inlineprotectedinherited |
◆ assignment_
The documentation for this class was generated from the following files: