![]() |
Google OR-Tools v9.15
a fast and portable software suite for combinatorial optimization
|
Ruin strategy based on the "Slack Induction by String Removals for Vehicle
Routing Problems" by Jan Christiaens and Greet Vanden Berghe, Transportation
Science 2020.
Note that, in this implementation, the notion of "string" is replaced by
"sequence".
The main idea of this ruin is to remove a number of geographically close
sequences of nodes. In particular, at every ruin application, a maximum
number max_ruined_routes of routes are disrupted. The value for
max_ruined_routes is defined as
(4 * avg_num_removed_visits) / (1 + max_sequence_size) + 1
with
- avg_num_removed_visits: user-defined parameter ruling the average number of
visits that are removed in face of several ruin applications (see also the
proto message below)
- max_sequence_size is defined as
min{max_removed_sequence_size, average_route_size}
with
- max_removed_sequence_size: user-defined parameter that specifies
the maximum number of visits removed from a single route (see also the
proto message below)
- average_route_size: the average size of a non-empty route in the current
solution
The actual number of ruined routes is then obtained as
floor(U(1, max_ruined_routes + 1))
where U is a continuous uniform distribution of real values in the given
interval.
The routes affected by the ruin procedure are selected as follows.
First, a non start/end seed node is randomly selected. The route serving this
node is the first ruined route. Then, until the required number of routes has
been ruined, neighbor nodes of the initial seed node are scanned and the
associated not yet ruined routes are disrupted. Nodes defining the selected
routes are designated as seed nodes for the "sequence" and "split sequence"
removal procedures described below.
For every selected route, a maximum number route_max_sequence_size of nodes
are removed. In particular, route_max_sequence_size is defined as
min{route_size, max_sequence_size}
with route_size being the size of the current route.
Then, the actual number of removed nodes num_removed_nodes is defined as
floor(U(1, route_max_sequence_size + 1))
where U is a continuous uniform distribution of real values in the given
interval.
As mentioned above, the selected num_removed_nodes number of nodes is removed
either via the "sequence" removal or "split sequence" removal procedures. The
two removal procedures are executed with equal probabilities.
The "sequence" removal procedure removes a randomly selected sequence of size
num_removed_nodes that includes the seed node.
The "split sequence" removal procedure also removes a randomly selected
sequence of size num_removed_nodes that includes the seed node, but it can
possibly preserve a subsequence of contiguous nodes.
In particular, the procedure first selects a sequence of size
num_removed_nodes + num_bypassed, then num_bypassed contiguous nodes in the
selected sequence are preserved while the others removed.
The definition of num_bypassed is as follows. First num_bypassed = 1. The
current value of num_bypassed is maintaned if
U(0, 1) < bypass_factor * U(0, 1)
or the maximum value for num_bypassed, equal to
route_size - num_removed_nodes
is reached. The value is incremented of a unit otherwise,
and the process is repeated. The value assigned to bypass_factor affects the
number of preserved visits (see also the proto message below).
Protobuf type operations_research.SISRRuinStrategy
Definition at line 85 of file SISRRuinStrategy.java.
Classes | |
| class | Builder |
Public Member Functions | |
| boolean | hasMaxRemovedSequenceSize () |
| int | getMaxRemovedSequenceSize () |
| boolean | hasAvgNumRemovedVisits () |
| int | getAvgNumRemovedVisits () |
| boolean | hasBypassFactor () |
| double | getBypassFactor () |
| final boolean | isInitialized () |
| void | writeTo (com.google.protobuf.CodedOutputStream output) throws java.io.IOException |
| int | getSerializedSize () |
| boolean | equals (final java.lang.Object obj) |
| int | hashCode () |
| Builder | newBuilderForType () |
| Builder | toBuilder () |
| com.google.protobuf.Parser< SISRRuinStrategy > | getParserForType () |
| com.google.ortools.constraintsolver.SISRRuinStrategy | getDefaultInstanceForType () |
Static Public Member Functions | |
| static final com.google.protobuf.Descriptors.Descriptor | getDescriptor () |
| static com.google.ortools.constraintsolver.SISRRuinStrategy | parseFrom (java.nio.ByteBuffer data) throws com.google.protobuf.InvalidProtocolBufferException |
| static com.google.ortools.constraintsolver.SISRRuinStrategy | parseFrom (java.nio.ByteBuffer data, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws com.google.protobuf.InvalidProtocolBufferException |
| static com.google.ortools.constraintsolver.SISRRuinStrategy | parseFrom (com.google.protobuf.ByteString data) throws com.google.protobuf.InvalidProtocolBufferException |
| static com.google.ortools.constraintsolver.SISRRuinStrategy | parseFrom (com.google.protobuf.ByteString data, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws com.google.protobuf.InvalidProtocolBufferException |
| static com.google.ortools.constraintsolver.SISRRuinStrategy | parseFrom (byte[] data) throws com.google.protobuf.InvalidProtocolBufferException |
| static com.google.ortools.constraintsolver.SISRRuinStrategy | parseFrom (byte[] data, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws com.google.protobuf.InvalidProtocolBufferException |
| static com.google.ortools.constraintsolver.SISRRuinStrategy | parseFrom (java.io.InputStream input) throws java.io.IOException |
| static com.google.ortools.constraintsolver.SISRRuinStrategy | parseFrom (java.io.InputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws java.io.IOException |
| static com.google.ortools.constraintsolver.SISRRuinStrategy | parseDelimitedFrom (java.io.InputStream input) throws java.io.IOException |
| static com.google.ortools.constraintsolver.SISRRuinStrategy | parseDelimitedFrom (java.io.InputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws java.io.IOException |
| static com.google.ortools.constraintsolver.SISRRuinStrategy | parseFrom (com.google.protobuf.CodedInputStream input) throws java.io.IOException |
| static com.google.ortools.constraintsolver.SISRRuinStrategy | parseFrom (com.google.protobuf.CodedInputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws java.io.IOException |
| static Builder | newBuilder () |
| static Builder | newBuilder (com.google.ortools.constraintsolver.SISRRuinStrategy prototype) |
| static com.google.ortools.constraintsolver.SISRRuinStrategy | getDefaultInstance () |
| static com.google.protobuf.Parser< SISRRuinStrategy > | parser () |
Static Public Attributes | |
| static final int | MAX_REMOVED_SEQUENCE_SIZE_FIELD_NUMBER = 1 |
| static final int | AVG_NUM_REMOVED_VISITS_FIELD_NUMBER = 2 |
| static final int | BYPASS_FACTOR_FIELD_NUMBER = 3 |
Protected Member Functions | |
| com.google.protobuf.GeneratedMessage.FieldAccessorTable | internalGetFieldAccessorTable () |
| Builder | newBuilderForType (com.google.protobuf.GeneratedMessage.BuilderParent parent) |
| boolean com.google.ortools.constraintsolver.SISRRuinStrategy.equals | ( | final java.lang.Object | obj | ) |
Definition at line 259 of file SISRRuinStrategy.java.
| int com.google.ortools.constraintsolver.SISRRuinStrategy.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;
Implements com.google.ortools.constraintsolver.SISRRuinStrategyOrBuilder.
Definition at line 174 of file SISRRuinStrategy.java.
| double com.google.ortools.constraintsolver.SISRRuinStrategy.getBypassFactor | ( | ) |
Value in [0, 1] ruling the number of preserved nodes 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;
Implements com.google.ortools.constraintsolver.SISRRuinStrategyOrBuilder.
Definition at line 205 of file SISRRuinStrategy.java.
|
static |
Definition at line 836 of file SISRRuinStrategy.java.
| com.google.ortools.constraintsolver.SISRRuinStrategy com.google.ortools.constraintsolver.SISRRuinStrategy.getDefaultInstanceForType | ( | ) |
Definition at line 872 of file SISRRuinStrategy.java.
|
static |
Definition at line 107 of file SISRRuinStrategy.java.
| int com.google.ortools.constraintsolver.SISRRuinStrategy.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;
Implements com.google.ortools.constraintsolver.SISRRuinStrategyOrBuilder.
Definition at line 145 of file SISRRuinStrategy.java.
| com.google.protobuf.Parser< SISRRuinStrategy > com.google.ortools.constraintsolver.SISRRuinStrategy.getParserForType | ( | ) |
Definition at line 867 of file SISRRuinStrategy.java.
| int com.google.ortools.constraintsolver.SISRRuinStrategy.getSerializedSize | ( | ) |
Definition at line 236 of file SISRRuinStrategy.java.
| boolean com.google.ortools.constraintsolver.SISRRuinStrategy.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;
Implements com.google.ortools.constraintsolver.SISRRuinStrategyOrBuilder.
Definition at line 161 of file SISRRuinStrategy.java.
| boolean com.google.ortools.constraintsolver.SISRRuinStrategy.hasBypassFactor | ( | ) |
Value in [0, 1] ruling the number of preserved nodes 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;
Implements com.google.ortools.constraintsolver.SISRRuinStrategyOrBuilder.
Definition at line 191 of file SISRRuinStrategy.java.
| int com.google.ortools.constraintsolver.SISRRuinStrategy.hashCode | ( | ) |
Definition at line 289 of file SISRRuinStrategy.java.
| boolean com.google.ortools.constraintsolver.SISRRuinStrategy.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;
Implements com.google.ortools.constraintsolver.SISRRuinStrategyOrBuilder.
Definition at line 132 of file SISRRuinStrategy.java.
|
protected |
Definition at line 113 of file SISRRuinStrategy.java.
| final boolean com.google.ortools.constraintsolver.SISRRuinStrategy.isInitialized | ( | ) |
Definition at line 211 of file SISRRuinStrategy.java.
|
static |
Definition at line 387 of file SISRRuinStrategy.java.
|
static |
Definition at line 390 of file SISRRuinStrategy.java.
| Builder com.google.ortools.constraintsolver.SISRRuinStrategy.newBuilderForType | ( | ) |
Definition at line 386 of file SISRRuinStrategy.java.
|
protected |
Definition at line 400 of file SISRRuinStrategy.java.
|
static |
Definition at line 358 of file SISRRuinStrategy.java.
|
static |
Definition at line 364 of file SISRRuinStrategy.java.
|
static |
Definition at line 335 of file SISRRuinStrategy.java.
|
static |
Definition at line 339 of file SISRRuinStrategy.java.
|
static |
Definition at line 324 of file SISRRuinStrategy.java.
|
static |
Definition at line 329 of file SISRRuinStrategy.java.
|
static |
Definition at line 371 of file SISRRuinStrategy.java.
|
static |
Definition at line 377 of file SISRRuinStrategy.java.
|
static |
Definition at line 345 of file SISRRuinStrategy.java.
|
static |
Definition at line 350 of file SISRRuinStrategy.java.
|
static |
Definition at line 313 of file SISRRuinStrategy.java.
|
static |
Definition at line 318 of file SISRRuinStrategy.java.
|
static |
Definition at line 862 of file SISRRuinStrategy.java.
| Builder com.google.ortools.constraintsolver.SISRRuinStrategy.toBuilder | ( | ) |
Definition at line 394 of file SISRRuinStrategy.java.
| void com.google.ortools.constraintsolver.SISRRuinStrategy.writeTo | ( | com.google.protobuf.CodedOutputStream | output | ) | throws java.io.IOException |
Definition at line 221 of file SISRRuinStrategy.java.
|
static |
Definition at line 149 of file SISRRuinStrategy.java.
|
static |
Definition at line 178 of file SISRRuinStrategy.java.
|
static |
Definition at line 120 of file SISRRuinStrategy.java.