C++ Reference

C++ Reference: Routing

GlobalCheapestInsertionFilteredHeuristic::GlobalCheapestInsertionParameters

Detailed Description

Definition at line 2887 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. More...
 
bool use_neighbors_ratio_for_initialization
 If true, only closest neighbors (see neighbors_ratio) are considered as insertion positions during initialization. More...
 

Member Data Documentation

◆ 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 2892 of file routing.h.

◆ is_sequential

bool is_sequential

Whether the routes are constructed sequentially or in parallel.

Definition at line 2889 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.

Definition at line 2895 of file routing.h.

◆ use_neighbors_ratio_for_initialization

bool use_neighbors_ratio_for_initialization

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

Otherwise, all possible insertion positions are considered.

Definition at line 2899 of file routing.h.


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