![]() |
Google OR-Tools v9.14
a fast and portable software suite for combinatorial optimization
|
Definition at line 9 of file SISRRuinStrategyOrBuilder.java.
Public Member Functions | |
| boolean | hasMaxRemovedSequenceSize () |
| int | getMaxRemovedSequenceSize () |
| boolean | hasAvgNumRemovedVisits () |
| int | getAvgNumRemovedVisits () |
| boolean | hasBypassFactor () |
| double | getBypassFactor () |
| int com.google.ortools.constraintsolver.SISRRuinStrategyOrBuilder.getAvgNumRemovedVisits | ( | ) |
Number of visits that are removed on average. The parameter name in the
paper is \bar{c} and the suggested value is 10.
optional uint32 avg_num_removed_visits = 2;
Implemented in com.google.ortools.constraintsolver.SISRRuinStrategy.Builder, and com.google.ortools.constraintsolver.SISRRuinStrategy.
| double com.google.ortools.constraintsolver.SISRRuinStrategyOrBuilder.getBypassFactor | ( | ) |
Value in [0, 1] ruling the number of preserved customers in the split sequence removal. The parameter name in the paper is \alpha and the suggested value is 0.01.
optional double bypass_factor = 3;
Implemented in com.google.ortools.constraintsolver.SISRRuinStrategy.Builder, and com.google.ortools.constraintsolver.SISRRuinStrategy.
| int com.google.ortools.constraintsolver.SISRRuinStrategyOrBuilder.getMaxRemovedSequenceSize | ( | ) |
Maximum number of removed visits per sequence. The parameter name in the
paper is L^{max} and the suggested value is 10.
optional uint32 max_removed_sequence_size = 1;
Implemented in com.google.ortools.constraintsolver.SISRRuinStrategy.Builder, and com.google.ortools.constraintsolver.SISRRuinStrategy.
| boolean com.google.ortools.constraintsolver.SISRRuinStrategyOrBuilder.hasAvgNumRemovedVisits | ( | ) |
Number of visits that are removed on average. The parameter name in the
paper is \bar{c} and the suggested value is 10.
optional uint32 avg_num_removed_visits = 2;
Implemented in com.google.ortools.constraintsolver.SISRRuinStrategy.Builder, and com.google.ortools.constraintsolver.SISRRuinStrategy.
| boolean com.google.ortools.constraintsolver.SISRRuinStrategyOrBuilder.hasBypassFactor | ( | ) |
Value in [0, 1] ruling the number of preserved customers in the split sequence removal. The parameter name in the paper is \alpha and the suggested value is 0.01.
optional double bypass_factor = 3;
Implemented in com.google.ortools.constraintsolver.SISRRuinStrategy.Builder, and com.google.ortools.constraintsolver.SISRRuinStrategy.
| boolean com.google.ortools.constraintsolver.SISRRuinStrategyOrBuilder.hasMaxRemovedSequenceSize | ( | ) |
Maximum number of removed visits per sequence. The parameter name in the
paper is L^{max} and the suggested value is 10.
optional uint32 max_removed_sequence_size = 1;
Implemented in com.google.ortools.constraintsolver.SISRRuinStrategy.Builder, and com.google.ortools.constraintsolver.SISRRuinStrategy.