Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
Loading...
Searching...
No Matches
operations_research::LocalCheapestInsertionFilteredHeuristic Member List

This is the complete list of members for operations_research::LocalCheapestInsertionFilteredHeuristic, including all inherited members.

AddSeedNodeToQueue(int node, std::vector< StartEndValue > *start_end_distances, SeedQueue *sq)operations_research::CheapestInsertionFilteredHeuristicprotected
AppendInsertionPositionsAfter(int64_t node_to_insert, int64_t start, int64_t next_after_start, int vehicle, bool ignore_cost, std::vector< NodeInsertion > *node_insertions)operations_research::CheapestInsertionFilteredHeuristicprotected
assignment_operations_research::IntVarFilteredHeuristicprotected
BuildSolution()operations_research::IntVarFilteredHeuristic
BuildSolutionFromRoutes(const std::function< int64_t(int64_t)> &next_accessor)operations_research::RoutingFilteredHeuristic
BuildSolutionInternal() overrideoperations_research::LocalCheapestInsertionFilteredHeuristicvirtual
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)operations_research::CheapestInsertionFilteredHeuristic
ComputeStartEndDistanceForVehicles(const std::vector< int > &vehicles)operations_research::CheapestInsertionFilteredHeuristicprotected
Contains(int64_t index) constoperations_research::IntVarFilteredHeuristicinlineprotected
DebugString() const overrideoperations_research::LocalCheapestInsertionFilteredHeuristicinlinevirtual
delta_indices() constoperations_research::IntVarFilteredHeuristicinlineprotected
Evaluate(bool commit)operations_research::IntVarFilteredHeuristicprotected
evaluator_operations_research::CheapestInsertionFilteredHeuristicprotected
GetEndChainStart(int vehicle) constoperations_research::RoutingFilteredHeuristicinline
GetInsertionCostForNodeAtPosition(int64_t node_to_insert, int64_t insert_after, int64_t insert_before, int vehicle) constoperations_research::CheapestInsertionFilteredHeuristicprotected
GetStartChainEnd(int vehicle) constoperations_research::RoutingFilteredHeuristicinline
GetUnperformedValue(int64_t node_to_insert) constoperations_research::CheapestInsertionFilteredHeuristicprotected
HasSecondaryVars() constoperations_research::IntVarFilteredHeuristicinlineprotected
Initialize() overrideoperations_research::LocalCheapestInsertionFilteredHeuristicprotectedvirtual
InitializeSeedQueue(std::vector< std::vector< StartEndValue > > *start_end_distances_per_node, SeedQueue *sq)operations_research::CheapestInsertionFilteredHeuristicprotected
InsertBetween(int64_t node, int64_t predecessor, int64_t successor, int vehicle=-1)operations_research::CheapestInsertionFilteredHeuristicprotected
IntVarFilteredHeuristic(Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, LocalSearchFilterManager *filter_manager)operations_research::IntVarFilteredHeuristic
IsSecondaryVar(int64_t index) constoperations_research::IntVarFilteredHeuristicinlineprotected
LocalCheapestInsertionFilteredHeuristic(RoutingModel *model, std::function< bool()> stop_search, std::function< int64_t(int64_t, int64_t, int64_t)> evaluator, RoutingSearchParameters::PairInsertionStrategy pair_insertion_strategy, LocalSearchFilterManager *filter_manager, BinCapacities *bin_capacities=nullptr, std::function< bool(const std::vector< RoutingModel::VariableValuePair > &, std::vector< RoutingModel::VariableValuePair > *)> optimize_on_insertion=nullptr)operations_research::LocalCheapestInsertionFilteredHeuristic
MakeDisjunctionNodesUnperformed(int64_t node)operations_research::RoutingFilteredHeuristic
MakePartiallyPerformedPairsUnperformed()operations_research::RoutingFilteredHeuristic
MakeUnassignedNodesUnperformed()operations_research::RoutingFilteredHeuristic
model() constoperations_research::RoutingFilteredHeuristicinline
number_of_decisions() constoperations_research::IntVarFilteredHeuristicinline
number_of_rejects() constoperations_research::IntVarFilteredHeuristicinline
penalty_evaluator_operations_research::CheapestInsertionFilteredHeuristicprotected
ResetSolution()operations_research::IntVarFilteredHeuristicprotected
ResetVehicleIndices()operations_research::RoutingFilteredHeuristicinlineprotectedvirtual
RoutingFilteredHeuristic(RoutingModel *model, std::function< bool()> stop_search, LocalSearchFilterManager *filter_manager)operations_research::RoutingFilteredHeuristic
SecondaryVarIndex(int64_t index) constoperations_research::IntVarFilteredHeuristicinlineprotected
SetNext(int64_t node, int64_t next, int vehicle)operations_research::RoutingFilteredHeuristicinlineprotected
SetValue(int64_t index, int64_t value)operations_research::IntVarFilteredHeuristicinlineprotected
SetVehicleIndex(int64_t, int)operations_research::RoutingFilteredHeuristicinlineprotectedvirtual
StopSearch() overrideoperations_research::RoutingFilteredHeuristicinlineprotectedvirtual
SynchronizeFilters()operations_research::IntVarFilteredHeuristicprotected
Value(int64_t index) constoperations_research::IntVarFilteredHeuristicinlineprotected
Var(int64_t index) constoperations_research::IntVarFilteredHeuristicinlineprotected
VehicleIsEmpty(int vehicle) constoperations_research::RoutingFilteredHeuristicinlineprotected
~CheapestInsertionFilteredHeuristic() overrideoperations_research::CheapestInsertionFilteredHeuristicinline
~IntVarFilteredHeuristic()operations_research::IntVarFilteredHeuristicinlinevirtual
~LocalCheapestInsertionFilteredHeuristic() overrideoperations_research::LocalCheapestInsertionFilteredHeuristicinline
~RoutingFilteredHeuristic() overrideoperations_research::RoutingFilteredHeuristicinline