com.google.ortools.constraintsolver.GlobalCheapestInsertionParametersOrBuilder Interface Reference

Detailed Description

Definition at line 9 of file GlobalCheapestInsertionParametersOrBuilder.java.

Inheritance diagram for com.google.ortools.constraintsolver.GlobalCheapestInsertionParametersOrBuilder:

Public Member Functions
double	getFarthestSeedsRatio ()
double	getNeighborsRatio ()
int	getMinNeighbors ()
boolean	getUseNeighborsRatioForInitialization ()
boolean	getAddUnperformedEntries ()

Member Function Documentation

getAddUnperformedEntries()

boolean com.google.ortools.constraintsolver.GlobalCheapestInsertionParametersOrBuilder.getAddUnperformedEntries

(

)

Whether or not to consider entries making the nodes/pairs unperformed.
More precisely, 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.

bool add_unperformed_entries = 7;

Returns

The addUnperformedEntries.

Implemented in com.google.ortools.constraintsolver.GlobalCheapestInsertionParameters.Builder, and com.google.ortools.constraintsolver.GlobalCheapestInsertionParameters.

getFarthestSeedsRatio()

double com.google.ortools.constraintsolver.GlobalCheapestInsertionParametersOrBuilder.getFarthestSeedsRatio

(

)

Ratio (between 0 and 1) of available vehicles in the model on which
farthest nodes of the model are inserted as seeds.

double farthest_seeds_ratio = 1;

Returns

The farthestSeedsRatio.

Implemented in com.google.ortools.constraintsolver.GlobalCheapestInsertionParameters.Builder, and com.google.ortools.constraintsolver.GlobalCheapestInsertionParameters.

getMinNeighbors()

int com.google.ortools.constraintsolver.GlobalCheapestInsertionParametersOrBuilder.getMinNeighbors

(

)

int32 min_neighbors = 3;

Returns

The minNeighbors.

Implemented in com.google.ortools.constraintsolver.GlobalCheapestInsertionParameters.Builder, and com.google.ortools.constraintsolver.GlobalCheapestInsertionParameters.

getNeighborsRatio()

double com.google.ortools.constraintsolver.GlobalCheapestInsertionParametersOrBuilder.getNeighborsRatio

(

)

Ratio (in ]0, 1]) of closest non start/end nodes to consider as neighbors
for each node when creating new insertions in the parallel/sequential
cheapest insertion heuristic.
If not overridden, its default value is 1, meaning all neighbors will be
considered.
The neighborhood ratio is coupled with the corresponding min_neighbors
integer, indicating the minimum number of neighbors to consider for each
node:
num_closest_neighbors =
max(min_neighbors, neighbors_ratio * NUM_NON_START_END_NODES)
This minimum number of neighbors must be greater or equal to 1, its
default value.

double neighbors_ratio = 2;

Returns

The neighborsRatio.

Implemented in com.google.ortools.constraintsolver.GlobalCheapestInsertionParameters.Builder, and com.google.ortools.constraintsolver.GlobalCheapestInsertionParameters.

getUseNeighborsRatioForInitialization()

boolean com.google.ortools.constraintsolver.GlobalCheapestInsertionParametersOrBuilder.getUseNeighborsRatioForInitialization

(

)

Whether or not to only consider closest neighbors when initializing the
assignment. More precisely, 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.

bool use_neighbors_ratio_for_initialization = 6;

Returns

The useNeighborsRatioForInitialization.

Implemented in com.google.ortools.constraintsolver.GlobalCheapestInsertionParameters.Builder, and com.google.ortools.constraintsolver.GlobalCheapestInsertionParameters.

---

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

• build/java/ortools-java/src/main/java/com/google/ortools/constraintsolver/GlobalCheapestInsertionParametersOrBuilder.java