OR-Tools  9.6
CheapestInsertionFilteredHeuristic Member List

This is the complete list of members for CheapestInsertionFilteredHeuristic, including all inherited members.

AppendInsertionPositionsAfter(int64_t node_to_insert, int64_t start, int64_t next_after_start, int vehicle, bool ignore_cost, std::vector< NodeInsertion > *node_insertions)CheapestInsertionFilteredHeuristicprotected
assignment_IntVarFilteredHeuristicprotected
BuildSolution()IntVarFilteredHeuristic
BuildSolutionFromRoutes(const std::function< int64_t(int64_t)> &next_accessor)RoutingFilteredHeuristic
BuildSolutionInternal()=0IntVarFilteredHeuristicprotectedpure virtual
CheapestInsertionFilteredHeuristic(RoutingModel *model, std::function< bool()> stop_search, std::function< int64_t(int64_t, int64_t, int64_t)> evaluator, std::function< int64_t(int64_t)> penalty_evaluator, LocalSearchFilterManager *filter_manager)CheapestInsertionFilteredHeuristic
ComputeStartEndDistanceForVehicles(const std::vector< int > &vehicles)CheapestInsertionFilteredHeuristicprotected
Contains(int64_t index) constIntVarFilteredHeuristicinlineprotected
DebugString() constIntVarFilteredHeuristicinlinevirtual
Evaluate(bool commit)IntVarFilteredHeuristicprotected
evaluator_CheapestInsertionFilteredHeuristicprotected
GetEndChainStart(int vehicle) constRoutingFilteredHeuristicinline
GetInsertionCostForNodeAtPosition(int64_t node_to_insert, int64_t insert_after, int64_t insert_before, int vehicle) constCheapestInsertionFilteredHeuristicprotected
GetStartChainEnd(int vehicle) constRoutingFilteredHeuristicinline
GetUnperformedValue(int64_t node_to_insert) constCheapestInsertionFilteredHeuristicprotected
HasSecondaryVars() constIntVarFilteredHeuristicinlineprotected
Initialize()IntVarFilteredHeuristicinlineprotectedvirtual
InitializePriorityQueue(std::vector< std::vector< StartEndValue > > *start_end_distances_per_node, Queue *priority_queue)CheapestInsertionFilteredHeuristicprotected
InitializePriorityQueue(std::vector< std::vector< StartEndValue >> *start_end_distances_per_node, Queue *priority_queue)CheapestInsertionFilteredHeuristic
InsertBetween(int64_t node, int64_t predecessor, int64_t successor, int vehicle=-1)CheapestInsertionFilteredHeuristicprotected
IntVarFilteredHeuristic(Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, LocalSearchFilterManager *filter_manager)IntVarFilteredHeuristic
IsSecondaryVar(int64_t index) constIntVarFilteredHeuristicinlineprotected
MakeDisjunctionNodesUnperformed(int64_t node)RoutingFilteredHeuristic
MakePartiallyPerformedPairsUnperformed()RoutingFilteredHeuristic
MakeUnassignedNodesUnperformed()RoutingFilteredHeuristic
model() constRoutingFilteredHeuristicinline
number_of_decisions() constIntVarFilteredHeuristicinline
number_of_rejects() constIntVarFilteredHeuristicinline
penalty_evaluator_CheapestInsertionFilteredHeuristicprotected
ResetSolution()IntVarFilteredHeuristicprotected
ResetVehicleIndices()RoutingFilteredHeuristicinlineprotectedvirtual
RoutingFilteredHeuristic(RoutingModel *model, std::function< bool()> stop_search, LocalSearchFilterManager *filter_manager, bool omit_secondary_vars=true)RoutingFilteredHeuristic
SecondaryVarIndex(int64_t index) constIntVarFilteredHeuristicinlineprotected
Seed typedefCheapestInsertionFilteredHeuristicprotected
SetValue(int64_t index, int64_t value)IntVarFilteredHeuristicinlineprotected
SetVehicleIndex(int64_t, int)RoutingFilteredHeuristicinlineprotectedvirtual
Size() constIntVarFilteredHeuristicinlineprotected
StopSearch() overrideRoutingFilteredHeuristicinlineprotectedvirtual
SynchronizeFilters()IntVarFilteredHeuristicprotected
Value(int64_t index) constIntVarFilteredHeuristicinlineprotected
Var(int64_t index) constIntVarFilteredHeuristicinlineprotected
VehicleIsEmpty(int vehicle) constRoutingFilteredHeuristicinlineprotected
~CheapestInsertionFilteredHeuristic() override=defaultCheapestInsertionFilteredHeuristic
~IntVarFilteredHeuristic()=defaultIntVarFilteredHeuristicvirtual
~RoutingFilteredHeuristic() override=defaultRoutingFilteredHeuristic