Interface GlobalCheapestInsertionParametersOrBuilder

All Superinterfaces:
com.google.protobuf.MessageLiteOrBuilder, com.google.protobuf.MessageOrBuilder
All Known Implementing Classes:
GlobalCheapestInsertionParameters, GlobalCheapestInsertionParameters.Builder
@Generated public interface GlobalCheapestInsertionParametersOrBuilder extends com.google.protobuf.MessageOrBuilder

  • Method Summary

    Modifier and Type
    Method
    Description
    boolean
    getAddUnperformedEntries()
    Whether or not to consider entries making the nodes/pairs unperformed.
    double
    getFarthestSeedsRatio()
    Ratio (between 0 and 1) of available vehicles in the model on which farthest nodes of the model are inserted as seeds.
    int
    getMinNeighbors()
    int32 min_neighbors = 3;
    double
    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.
    boolean
    getUseNeighborsRatioForInitialization()
    Whether or not to only consider closest neighbors when initializing the assignment.

    Methods inherited from interface com.google.protobuf.MessageLiteOrBuilder

    isInitialized

    Methods inherited from interface com.google.protobuf.MessageOrBuilder

    findInitializationErrors, getAllFields, getDefaultInstanceForType, getDescriptorForType, getField, getInitializationErrorString, getOneofFieldDescriptor, getRepeatedField, getRepeatedFieldCount, getUnknownFields, hasField, hasOneof

  • Method Details

    • getFarthestSeedsRatio

      double 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.

    • getNeighborsRatio

      double 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.

    • getMinNeighbors

      int getMinNeighbors()
      int32 min_neighbors = 3;
      Returns:
      The minNeighbors.

    • getUseNeighborsRatioForInitialization

      boolean 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.

    • getAddUnperformedEntries

      boolean 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.