operations_research::CheapestInsertionFilteredHeuristic::SeedQueue Struct Reference

clang-format off More...

#include <routing_search.h>

Public Member Functions
	SeedQueue (bool prioritize_farthest_nodes)

Public Attributes
std::priority_queue< Seed, std::vector< Seed >, std::greater< Seed > >	priority_queue
const bool	prioritize_farthest_nodes

Detailed Description

clang-format off

Definition at line 365 of file routing_search.h.

Constructor & Destructor Documentation

SeedQueue()

operations_research::CheapestInsertionFilteredHeuristic::SeedQueue::SeedQueue ( bool prioritize_farthest_nodes )

inlineexplicit

Definition at line 366 of file routing_search.h.

Member Data Documentation

prioritize_farthest_nodes

const bool operations_research::CheapestInsertionFilteredHeuristic::SeedQueue::prioritize_farthest_nodes

When 'prioritize_farthest_nodes' is true, the start/end distance is inverted so higher priority is given to farther nodes.

Definition at line 375 of file routing_search.h.

priority_queue

std::priority_queue<Seed, std::vector<Seed>, std::greater<Seed> > operations_research::CheapestInsertionFilteredHeuristic::SeedQueue::priority_queue

By default, the priority is given (hierarchically) to nodes with lower number of allowed vehicles, higher penalty and lower start/end distance.

Definition at line 372 of file routing_search.h.

---

The documentation for this struct was generated from the following file:

• ortools/constraint_solver/routing_search.h