AppendEvaluatedPositionsAfter(int64 node_to_insert, int64 start, int64 next_after_start, int64 vehicle, std::vector< ValuedPosition > *valued_positions) | CheapestInsertionFilteredHeuristic | protected |
assignment_ | IntVarFilteredHeuristic | protected |
BuildSolution() | IntVarFilteredHeuristic | |
BuildSolutionFromRoutes(const std::function< int64(int64)> &next_accessor) | RoutingFilteredHeuristic | |
BuildSolutionInternal()=0 | IntVarFilteredHeuristic | protectedpure virtual |
CheapestInsertionFilteredHeuristic(RoutingModel *model, std::function< int64(int64, int64, int64)> evaluator, std::function< int64(int64)> penalty_evaluator, const std::vector< LocalSearchFilter * > &filters) | CheapestInsertionFilteredHeuristic | |
Commit() | IntVarFilteredHeuristic | protected |
ComputeStartEndDistanceForVehicles(const std::vector< int > &vehicles) | CheapestInsertionFilteredHeuristic | protected |
Contains(int64 index) const | IntVarFilteredHeuristic | inlineprotected |
DebugString() const | IntVarFilteredHeuristic | inlinevirtual |
evaluator_ | CheapestInsertionFilteredHeuristic | protected |
GetEndChainStart(int vehicle) const | RoutingFilteredHeuristic | inline |
GetInsertionCostForNodeAtPosition(int64 node_to_insert, int64 insert_after, int64 insert_before, int vehicle) const | CheapestInsertionFilteredHeuristic | protected |
GetStartChainEnd(int vehicle) const | RoutingFilteredHeuristic | inline |
GetUnperformedValue(int64 node_to_insert) const | CheapestInsertionFilteredHeuristic | protected |
InitializePriorityQueue(std::vector< std::vector< StartEndValue > > *start_end_distances_per_node, Queue *priority_queue) | CheapestInsertionFilteredHeuristic | protected |
InsertBetween(int64 node, int64 predecessor, int64 successor) | CheapestInsertionFilteredHeuristic | protected |
IntVarFilteredHeuristic(Solver *solver, const std::vector< IntVar * > &vars, const std::vector< LocalSearchFilter * > &filters) | IntVarFilteredHeuristic | |
MakeDisjunctionNodesUnperformed(int64 node) | RoutingFilteredHeuristic | |
MakeUnassignedNodesUnperformed() | RoutingFilteredHeuristic | |
model() const | RoutingFilteredHeuristic | inline |
number_of_decisions() const | IntVarFilteredHeuristic | inline |
number_of_rejects() const | IntVarFilteredHeuristic | inline |
penalty_evaluator_ | CheapestInsertionFilteredHeuristic | protected |
ResetSolution() | IntVarFilteredHeuristic | protected |
ResetVehicleIndices() | RoutingFilteredHeuristic | inlineprotectedvirtual |
RoutingFilteredHeuristic(RoutingModel *model, const std::vector< LocalSearchFilter * > &filters) | RoutingFilteredHeuristic | |
Seed typedef | CheapestInsertionFilteredHeuristic | protected |
SetValue(int64 index, int64 value) | IntVarFilteredHeuristic | inlineprotected |
SetVehicleIndex(int64 node, int vehicle) | RoutingFilteredHeuristic | inlineprotectedvirtual |
Size() const | IntVarFilteredHeuristic | inlineprotected |
StopSearch() override | RoutingFilteredHeuristic | inlineprotectedvirtual |
SynchronizeFilters() | IntVarFilteredHeuristic | protected |
Value(int64 index) const | IntVarFilteredHeuristic | inlineprotected |
ValuedPosition typedef | CheapestInsertionFilteredHeuristic | protected |
Var(int64 index) const | IntVarFilteredHeuristic | inlineprotected |
~CheapestInsertionFilteredHeuristic() override | CheapestInsertionFilteredHeuristic | inline |
~IntVarFilteredHeuristic() | IntVarFilteredHeuristic | inlinevirtual |
~RoutingFilteredHeuristic() override | RoutingFilteredHeuristic | inline |