Interface RuinRecreateParametersOrBuilder

All Superinterfaces:
com.google.protobuf.MessageLiteOrBuilder, com.google.protobuf.MessageOrBuilder
All Known Implementing Classes:
RuinRecreateParameters, RuinRecreateParameters.Builder

@Generated public interface RuinRecreateParametersOrBuilder extends com.google.protobuf.MessageOrBuilder
  • Method Details

    • getRuinStrategiesList

      List<RuinStrategy> getRuinStrategiesList()
      List of ruin strategies determining how a reference solution is ruined.
      
      repeated .operations_research.RuinStrategy ruin_strategies = 1;
    • getRuinStrategies

      RuinStrategy getRuinStrategies(int index)
      List of ruin strategies determining how a reference solution is ruined.
      
      repeated .operations_research.RuinStrategy ruin_strategies = 1;
    • getRuinStrategiesCount

      int getRuinStrategiesCount()
      List of ruin strategies determining how a reference solution is ruined.
      
      repeated .operations_research.RuinStrategy ruin_strategies = 1;
    • getRuinStrategiesOrBuilderList

      List<? extends RuinStrategyOrBuilder> getRuinStrategiesOrBuilderList()
      List of ruin strategies determining how a reference solution is ruined.
      
      repeated .operations_research.RuinStrategy ruin_strategies = 1;
    • getRuinStrategiesOrBuilder

      RuinStrategyOrBuilder getRuinStrategiesOrBuilder(int index)
      List of ruin strategies determining how a reference solution is ruined.
      
      repeated .operations_research.RuinStrategy ruin_strategies = 1;
    • getRuinCompositionStrategyValue

      int getRuinCompositionStrategyValue()
      The composition strategy to use when combining the given 'ruin_strategies'.
      Has no effect when ruin_strategies is composed of a single strategy.
      
      .operations_research.RuinCompositionStrategy.Value ruin_composition_strategy = 2;
      Returns:
      The enum numeric value on the wire for ruinCompositionStrategy.
    • getRuinCompositionStrategy

      RuinCompositionStrategy.Value getRuinCompositionStrategy()
      The composition strategy to use when combining the given 'ruin_strategies'.
      Has no effect when ruin_strategies is composed of a single strategy.
      
      .operations_research.RuinCompositionStrategy.Value ruin_composition_strategy = 2;
      Returns:
      The ruinCompositionStrategy.
    • hasRecreateStrategy

      boolean hasRecreateStrategy()
      Strategy defining how a reference solution is recreated.
      
      .operations_research.RecreateStrategy recreate_strategy = 3;
      Returns:
      Whether the recreateStrategy field is set.
    • getRecreateStrategy

      RecreateStrategy getRecreateStrategy()
      Strategy defining how a reference solution is recreated.
      
      .operations_research.RecreateStrategy recreate_strategy = 3;
      Returns:
      The recreateStrategy.
    • getRecreateStrategyOrBuilder

      RecreateStrategyOrBuilder getRecreateStrategyOrBuilder()
      Strategy defining how a reference solution is recreated.
      
      .operations_research.RecreateStrategy recreate_strategy = 3;
    • hasRouteSelectionNeighborsRatio

      boolean hasRouteSelectionNeighborsRatio()
      Ratio in [0, 1] of non start/end nodes to consider as neighbors for the
      identification of routes spatially close to a non start/end seed node.
      
      In particular, given a non start/end seed node s served by route r, we say
      that a route r' is spatially close to the seed node s if there is at
      least one non start/end node s' among the neighbors of s, such that s' is
      served by r'.
      
      The neighbors_ratio is coupled with the corresponding min_neighbors and
      max_neighbors values, defining the minimum and maximum number of neighbor
      nodes considered for a given seed node:
      num_neighbors = min(max_neighbors,
      max(min_neighbors, neighbors_ratio * NUM_NON_START_END_NODES))
      
      Neighbors ratio, and minimum and maximum number of non start/end neighbor
      nodes for the identification of spatially close routes.
      
      optional double route_selection_neighbors_ratio = 4;
      Returns:
      Whether the routeSelectionNeighborsRatio field is set.
    • getRouteSelectionNeighborsRatio

      double getRouteSelectionNeighborsRatio()
      Ratio in [0, 1] of non start/end nodes to consider as neighbors for the
      identification of routes spatially close to a non start/end seed node.
      
      In particular, given a non start/end seed node s served by route r, we say
      that a route r' is spatially close to the seed node s if there is at
      least one non start/end node s' among the neighbors of s, such that s' is
      served by r'.
      
      The neighbors_ratio is coupled with the corresponding min_neighbors and
      max_neighbors values, defining the minimum and maximum number of neighbor
      nodes considered for a given seed node:
      num_neighbors = min(max_neighbors,
      max(min_neighbors, neighbors_ratio * NUM_NON_START_END_NODES))
      
      Neighbors ratio, and minimum and maximum number of non start/end neighbor
      nodes for the identification of spatially close routes.
      
      optional double route_selection_neighbors_ratio = 4;
      Returns:
      The routeSelectionNeighborsRatio.
    • hasRouteSelectionMinNeighbors

      boolean hasRouteSelectionMinNeighbors()
      optional uint32 route_selection_min_neighbors = 5;
      Returns:
      Whether the routeSelectionMinNeighbors field is set.
    • getRouteSelectionMinNeighbors

      int getRouteSelectionMinNeighbors()
      optional uint32 route_selection_min_neighbors = 5;
      Returns:
      The routeSelectionMinNeighbors.
    • hasRouteSelectionMaxNeighbors

      boolean hasRouteSelectionMaxNeighbors()
      optional uint32 route_selection_max_neighbors = 6;
      Returns:
      Whether the routeSelectionMaxNeighbors field is set.
    • getRouteSelectionMaxNeighbors

      int getRouteSelectionMaxNeighbors()
      optional uint32 route_selection_max_neighbors = 6;
      Returns:
      The routeSelectionMaxNeighbors.