#include <routing_search.h>

Inheritance diagram for operations_research::CheapestInsertionFilteredHeuristic:

Classes
struct	NodeInsertion

struct	Seed

struct	SeedQueue
	clang-format off More...

struct	StartEndValue

Public Member Functions
	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)
	Takes ownership of evaluator.

	~CheapestInsertionFilteredHeuristic () override

Public Member Functions inherited from operations_research::RoutingFilteredHeuristic
	RoutingFilteredHeuristic (RoutingModel model, std::function< bool()> stop_search, LocalSearchFilterManager filter_manager)
	RoutingFilteredHeuristic.

	~RoutingFilteredHeuristic () override

Assignment *	BuildSolutionFromRoutes (const std::function< int64_t(int64_t)> &next_accessor)
	Builds a solution starting from the routes formed by the next accessor.

RoutingModel *	model () const

int	GetStartChainEnd (int vehicle) const
	Returns the end of the start chain of vehicle,.

int	GetEndChainStart (int vehicle) const
	Returns the start of the end chain of vehicle,.

void	MakeDisjunctionNodesUnperformed (int64_t node)

bool	MakeUnassignedNodesUnperformed ()
	Make all unassigned nodes unperformed, always returns true.

void	MakePartiallyPerformedPairsUnperformed ()

Public Member Functions inherited from operations_research::IntVarFilteredHeuristic
	IntVarFilteredHeuristic (Solver solver, const std::vector< IntVar > &vars, const std::vector< IntVar * > &secondary_vars, LocalSearchFilterManager *filter_manager)
	— First solution heuristics —

virtual	~IntVarFilteredHeuristic ()

Assignment *	BuildSolution ()

int64_t	number_of_decisions () const

int64_t	number_of_rejects () const

virtual std::string	DebugString () const

Protected Member Functions
std::vector< std::vector< StartEndValue > >	ComputeStartEndDistanceForVehicles (const std::vector< int > &vehicles)

void	InitializeSeedQueue (std::vector< std::vector< StartEndValue > > start_end_distances_per_node, SeedQueue sq)

void	AddSeedNodeToQueue (int node, std::vector< StartEndValue > start_end_distances, SeedQueue sq)
	clang-format on

void	InsertBetween (int64_t node, int64_t predecessor, int64_t successor, int vehicle=-1)

void	AppendInsertionPositionsAfter (int64_t node_to_insert, int64_t start, int64_t next_after_start, int vehicle, bool ignore_cost, std::vector< NodeInsertion > *node_insertions)

int64_t	GetInsertionCostForNodeAtPosition (int64_t node_to_insert, int64_t insert_after, int64_t insert_before, int vehicle) const

int64_t	GetUnperformedValue (int64_t node_to_insert) const

Protected Member Functions inherited from operations_research::RoutingFilteredHeuristic
bool	StopSearch () override
	Returns true if the search must be stopped.

virtual void	SetVehicleIndex (int64_t, int)

virtual void	ResetVehicleIndices ()

bool	VehicleIsEmpty (int vehicle) const

void	SetNext (int64_t node, int64_t next, int vehicle)

Protected Member Functions inherited from operations_research::IntVarFilteredHeuristic
void	ResetSolution ()
	Resets the data members for a new solution.

virtual void	Initialize ()
	Initialize the heuristic; called before starting to build a new solution.

virtual bool	BuildSolutionInternal ()=0
	Virtual method to redefine how to build a solution.

std::optional< int64_t >	Evaluate (bool commit)

void	SetValue (int64_t index, int64_t value)

const std::vector< int > &	delta_indices () const
	Returns the indices of the nodes currently in the insertion delta.

int64_t	Value (int64_t index) const

bool	Contains (int64_t index) const
	Returns true if the variable of index 'index' is in the current solution.

IntVar *	Var (int64_t index) const
	Returns the variable of index 'index'.

int64_t	SecondaryVarIndex (int64_t index) const
	Returns the index of a secondary var.

bool	HasSecondaryVars () const
	Returns true if there are secondary variables.

bool	IsSecondaryVar (int64_t index) const
	Returns true if 'index' is a secondary variable index.

void	SynchronizeFilters ()
	Synchronizes filters with an assignment (the current solution).

Protected Attributes
std::function< int64_t(int64_t, int64_t, int64_t)>	evaluator_

std::function< int64_t(int64_t)>	penalty_evaluator_

Protected Attributes inherited from operations_research::IntVarFilteredHeuristic
Assignment *const	assignment_

Detailed Description

Definition at line 318 of file routing_search.h.

Constructor & Destructor Documentation

◆ CheapestInsertionFilteredHeuristic()

operations_research::CheapestInsertionFilteredHeuristic::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 )

Takes ownership of evaluator.

CheapestInsertionFilteredHeuristic.

Definition at line 529 of file routing_search.cc.

◆ ~CheapestInsertionFilteredHeuristic()

operations_research::CheapestInsertionFilteredHeuristic::~CheapestInsertionFilteredHeuristic ( )

inlineoverride

Definition at line 326 of file routing_search.h.

Member Function Documentation

◆ AddSeedNodeToQueue()

void operations_research::CheapestInsertionFilteredHeuristic::AddSeedNodeToQueue	(	int	node,
		std::vector< StartEndValue > *	start_end_distances,
		SeedQueue *	sq )

protected

clang-format on

Adds a Seed corresponding to the given 'node' to sq.priority_queue, based on the last entry in its 'start_end_distances' (from which it's deleted).

Put the best StartEndValue for this node in the priority queue.

Definition at line 610 of file routing_search.cc.

◆ AppendInsertionPositionsAfter()

void operations_research::CheapestInsertionFilteredHeuristic::AppendInsertionPositionsAfter	(	int64_t	node_to_insert,
		int64_t	start,
		int64_t	next_after_start,
		int	vehicle,
		bool	ignore_cost,
		std::vector< NodeInsertion > *	node_insertions )

protected

Helper method to the ComputeEvaluatorSortedPositions* methods. Finds all possible insertion positions of node 'node_to_insert' in the partial route starting at node 'start' and adds them to 'node_insertions' (no sorting is done). If ignore_cost is true, insertion costs may not be computed.

Definition at line 654 of file routing_search.cc.

◆ ComputeStartEndDistanceForVehicles()

std::vector< std::vector< CheapestInsertionFilteredHeuristic::StartEndValue > > operations_research::CheapestInsertionFilteredHeuristic::ComputeStartEndDistanceForVehicles ( const std::vector< int > & vehicles )

protected

Computes and returns the distance of each uninserted node to every vehicle in 'vehicles' as a std::vector<std::vector<StartEndValue>>, start_end_distances_per_node. For each node, start_end_distances_per_node[node] is sorted in decreasing order.

Todo: (user): consider checking search limits.

Sort the distances for the node to all start/ends of available vehicles in decreasing order.

Definition at line 575 of file routing_search.cc.

◆ GetInsertionCostForNodeAtPosition()

int64_t operations_research::CheapestInsertionFilteredHeuristic::GetInsertionCostForNodeAtPosition	(	int64_t	node_to_insert,
		int64_t	insert_after,
		int64_t	insert_before,
		int	vehicle ) const

protected

Returns the cost of inserting 'node_to_insert' between 'insert_after' and 'insert_before' on the 'vehicle', i.e. Cost(insert_after-->node) + Cost(node-->insert_before)

Cost (insert_after-->insert_before).
Todo
(user): Replace 'insert_before' and 'insert_after' by 'predecessor' and 'successor' in the code.

Definition at line 682 of file routing_search.cc.

◆ GetUnperformedValue()

int64_t operations_research::CheapestInsertionFilteredHeuristic::GetUnperformedValue ( int64_t node_to_insert ) const

protected

Returns the cost of unperforming node 'node_to_insert'. Returns kint64max if penalty callback is null or if the node cannot be unperformed.

Definition at line 691 of file routing_search.cc.

◆ InitializeSeedQueue()

void operations_research::CheapestInsertionFilteredHeuristic::InitializeSeedQueue	(	std::vector< std::vector< StartEndValue > > *	start_end_distances_per_node,
		SeedQueue *	sq )

protected

Initializes sq->priority_queue by inserting the best entry corresponding to each node, i.e. the last element of start_end_distances_per_node[node], which is supposed to be sorted in decreasing order.

Definition at line 628 of file routing_search.cc.

◆ InsertBetween()

void operations_research::CheapestInsertionFilteredHeuristic::InsertBetween	(	int64_t	node,
		int64_t	predecessor,
		int64_t	successor,
		int	vehicle = -1 )

protected

Inserts 'node' just after 'predecessor', and just before 'successor' on the route of 'vehicle', resulting in the following subsequence: predecessor -> node -> successor. If 'node' is part of a disjunction, other nodes of the disjunction are made unperformed.

Definition at line 640 of file routing_search.cc.

Member Data Documentation

◆ evaluator_

std::function<int64_t(int64_t, int64_t, int64_t)> operations_research::CheapestInsertionFilteredHeuristic::evaluator_

protected

Definition at line 429 of file routing_search.h.

◆ penalty_evaluator_

std::function<int64_t(int64_t)> operations_research::CheapestInsertionFilteredHeuristic::penalty_evaluator_

protected

Definition at line 430 of file routing_search.h.

The documentation for this class was generated from the following files:

ortools/constraint_solver/routing_search.h
ortools/constraint_solver/routing_search.cc

Classes

Public Member Functions

Protected Member Functions

Protected Attributes

Detailed Description

Constructor & Destructor Documentation

◆ CheapestInsertionFilteredHeuristic()

◆ ~CheapestInsertionFilteredHeuristic()

Member Function Documentation

◆ AddSeedNodeToQueue()

◆ AppendInsertionPositionsAfter()

◆ ComputeStartEndDistanceForVehicles()

◆ GetInsertionCostForNodeAtPosition()

◆ GetUnperformedValue()

◆ InitializeSeedQueue()

◆ InsertBetween()

Member Data Documentation

◆ evaluator_

◆ penalty_evaluator_