C++ Reference

C++ Reference: Routing

GlobalCheapestInsertionFilteredHeuristic::GlobalCheapestInsertionParameters

Detailed Description

Definition at line 3198 of file routing.h.

Public Attributes

bool is_sequential
 Whether the routes are constructed sequentially or in parallel. More...
 
double farthest_seeds_ratio
 The ratio of routes on which to insert farthest nodes as seeds before starting the cheapest insertion. More...
 
double neighbors_ratio
 If neighbors_ratio < 1 then for each node only this ratio of its neighbors leading to the smallest arc costs are considered for insertions, with a minimum of 'min_neighbors': num_closest_neighbors = max(min_neighbors, neighbors_ratio*N), where N is the number of non-start/end nodes in the model. More...
 
int64 min_neighbors
 
bool use_neighbors_ratio_for_initialization
 If true, only closest neighbors (see neighbors_ratio and min_neighbors) are considered as insertion positions during initialization. More...
 
bool add_unperformed_entries
 If true, entries are created for making the nodes/pairs unperformed, and when the cost of making a node unperformed is lower than all insertions, the node/pair will be made unperformed. More...
 

Member Data Documentation

◆ add_unperformed_entries

bool add_unperformed_entries

If true, entries are created for making the nodes/pairs unperformed, and when the cost of making a node unperformed is lower than all insertions, the node/pair will be made unperformed.

If false, only entries making a node/pair performed are considered.

Definition at line 3219 of file routing.h.

◆ farthest_seeds_ratio

double farthest_seeds_ratio

The ratio of routes on which to insert farthest nodes as seeds before starting the cheapest insertion.

Definition at line 3203 of file routing.h.

◆ is_sequential

bool is_sequential

Whether the routes are constructed sequentially or in parallel.

Definition at line 3200 of file routing.h.

◆ min_neighbors

int64 min_neighbors

Definition at line 3210 of file routing.h.

◆ neighbors_ratio

double neighbors_ratio

If neighbors_ratio < 1 then for each node only this ratio of its neighbors leading to the smallest arc costs are considered for insertions, with a minimum of 'min_neighbors': num_closest_neighbors = max(min_neighbors, neighbors_ratio*N), where N is the number of non-start/end nodes in the model.

Definition at line 3209 of file routing.h.

◆ use_neighbors_ratio_for_initialization

bool use_neighbors_ratio_for_initialization

If true, only closest neighbors (see neighbors_ratio and min_neighbors) are considered as insertion positions during initialization.

Otherwise, all possible insertion positions are considered.

Definition at line 3214 of file routing.h.


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