Google OR-Tools v9.9
a fast and portable software suite for combinatorial optimization
|
Classes | |
class | Builder |
Static Public Member Functions | |
static final com.google.protobuf.Descriptors.Descriptor | getDescriptor () |
static com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators | parseFrom (java.nio.ByteBuffer data) throws com.google.protobuf.InvalidProtocolBufferException |
static com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators | parseFrom (java.nio.ByteBuffer data, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws com.google.protobuf.InvalidProtocolBufferException |
static com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators | parseFrom (com.google.protobuf.ByteString data) throws com.google.protobuf.InvalidProtocolBufferException |
static com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators | parseFrom (com.google.protobuf.ByteString data, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws com.google.protobuf.InvalidProtocolBufferException |
static com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators | parseFrom (byte[] data) throws com.google.protobuf.InvalidProtocolBufferException |
static com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators | parseFrom (byte[] data, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws com.google.protobuf.InvalidProtocolBufferException |
static com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators | parseFrom (java.io.InputStream input) throws java.io.IOException |
static com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators | parseFrom (java.io.InputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws java.io.IOException |
static com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators | parseDelimitedFrom (java.io.InputStream input) throws java.io.IOException |
static com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators | parseDelimitedFrom (java.io.InputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws java.io.IOException |
static com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators | parseFrom (com.google.protobuf.CodedInputStream input) throws java.io.IOException |
static com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators | 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.RoutingSearchParameters.LocalSearchNeighborhoodOperators prototype) |
static com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators | getDefaultInstance () |
static com.google.protobuf.Parser< LocalSearchNeighborhoodOperators > | parser () |
Protected Member Functions | |
java.lang.Object | newInstance (UnusedPrivateParameter unused) |
com.google.protobuf.GeneratedMessageV3.FieldAccessorTable | internalGetFieldAccessorTable () |
Builder | newBuilderForType (com.google.protobuf.GeneratedMessageV3.BuilderParent parent) |
Local search neighborhood operators used to build a solutions neighborhood. Next ID: 35
Protobuf type operations_research.RoutingSearchParameters.LocalSearchNeighborhoodOperators
Definition at line 1396 of file RoutingSearchParameters.java.
boolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.equals | ( | final java.lang.Object | obj | ) |
Definition at line 2995 of file RoutingSearchParameters.java.
|
static |
Definition at line 7248 of file RoutingSearchParameters.java.
com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getDefaultInstanceForType | ( | ) |
Definition at line 7284 of file RoutingSearchParameters.java.
|
static |
Definition at line 1450 of file RoutingSearchParameters.java.
com.google.protobuf.Parser< LocalSearchNeighborhoodOperators > com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getParserForType | ( | ) |
Definition at line 7279 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getSerializedSize | ( | ) |
Definition at line 2848 of file RoutingSearchParameters.java.
com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseCross | ( | ) |
Operator which cross exchanges the starting chains of 2 paths, including exchanging the whole paths. First and last nodes are not moved. Possible neighbors for the paths 1 -> 2 -> 3 -> 4 -> 5 and 6 -> 7 -> 8 (where (1, 5) and (6, 8) are first and last nodes of the paths and can therefore not be moved): 1 -> [7] -> 3 -> 4 -> 5 6 -> [2] -> 8 1 -> [7] -> 4 -> 5 6 -> [2 -> 3] -> 8 1 -> [7] -> 5 6 -> [2 -> 3 -> 4] -> 8
.operations_research.OptionalBoolean use_cross = 5;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 1845 of file RoutingSearchParameters.java.
com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseCrossExchange | ( | ) |
Not implemented yet. TODO(b/68128619): Implement.
.operations_research.OptionalBoolean use_cross_exchange = 6;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 1871 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseCrossExchangeValue | ( | ) |
Not implemented yet. TODO(b/68128619): Implement.
.operations_research.OptionalBoolean use_cross_exchange = 6;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 1860 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseCrossValue | ( | ) |
Operator which cross exchanges the starting chains of 2 paths, including exchanging the whole paths. First and last nodes are not moved. Possible neighbors for the paths 1 -> 2 -> 3 -> 4 -> 5 and 6 -> 7 -> 8 (where (1, 5) and (6, 8) are first and last nodes of the paths and can therefore not be moved): 1 -> [7] -> 3 -> 4 -> 5 6 -> [2] -> 8 1 -> [7] -> 4 -> 5 6 -> [2 -> 3] -> 8 1 -> [7] -> 5 6 -> [2 -> 3 -> 4] -> 8
.operations_research.OptionalBoolean use_cross = 5;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 1826 of file RoutingSearchParameters.java.
com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseExchange | ( | ) |
Operator which exchanges the positions of two nodes. Possible neighbors for the path 1 -> 2 -> 3 -> 4 -> 5 (where (1, 5) are first and last nodes of the path and can therefore not be moved): 1 -> [3] -> [2] -> 4 -> 5 1 -> [4] -> 3 -> [2] -> 5 1 -> 2 -> [4] -> [3] -> 5
.operations_research.OptionalBoolean use_exchange = 4;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 1737 of file RoutingSearchParameters.java.
com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseExchangePair | ( | ) |
Operator which exchanges the positions of two pair of nodes. Pairs correspond to the pickup and delivery pairs defined in the routing model. Possible neighbor for the paths 1 -> A -> B -> 2 -> 3 and 4 -> C -> D -> 5 (where (1, 3) and (4, 5) are first and last nodes of the paths and can therefore not be moved, and (A, B) and (C,D) are pairs of nodes): 1 -> [C] -> [D] -> 2 -> 3, 4 -> [A] -> [B] -> 5
.operations_research.OptionalBoolean use_exchange_pair = 22;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 1775 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseExchangePairValue | ( | ) |
Operator which exchanges the positions of two pair of nodes. Pairs correspond to the pickup and delivery pairs defined in the routing model. Possible neighbor for the paths 1 -> A -> B -> 2 -> 3 and 4 -> C -> D -> 5 (where (1, 3) and (4, 5) are first and last nodes of the paths and can therefore not be moved, and (A, B) and (C,D) are pairs of nodes): 1 -> [C] -> [D] -> 2 -> 3, 4 -> [A] -> [B] -> 5
.operations_research.OptionalBoolean use_exchange_pair = 22;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 1758 of file RoutingSearchParameters.java.
com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseExchangeSubtrip | ( | ) |
Operator which exchanges subtrips associated to two pairs of nodes, see use_relocate_subtrip for a definition of subtrips.
.operations_research.OptionalBoolean use_exchange_subtrip = 26;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 1803 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseExchangeSubtripValue | ( | ) |
Operator which exchanges subtrips associated to two pairs of nodes, see use_relocate_subtrip for a definition of subtrips.
.operations_research.OptionalBoolean use_exchange_subtrip = 26;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 1791 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseExchangeValue | ( | ) |
Operator which exchanges the positions of two nodes. Possible neighbors for the path 1 -> 2 -> 3 -> 4 -> 5 (where (1, 5) are first and last nodes of the path and can therefore not be moved): 1 -> [3] -> [2] -> 4 -> 5 1 -> [4] -> 3 -> [2] -> 5 1 -> 2 -> [4] -> [3] -> 5
.operations_research.OptionalBoolean use_exchange = 4;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 1720 of file RoutingSearchParameters.java.
com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseExtendedSwapActive | ( | ) |
Operator which makes an inactive node active and an active one inactive. It is similar to SwapActiveOperator excepts that it tries to insert the inactive node in all possible positions instead of just the position of the node made inactive. Possible neighbors for the path 1 -> 2 -> 3 -> 4 with 5 inactive (where 1 and 4 are first and last nodes of the path) are: 1 -> [5] -> 3 -> 4 with 2 inactive 1 -> 3 -> [5] -> 4 with 2 inactive 1 -> [5] -> 2 -> 4 with 3 inactive 1 -> 2 -> [5] -> 4 with 3 inactive
.operations_research.OptionalBoolean use_extended_swap_active = 15;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2303 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseExtendedSwapActiveValue | ( | ) |
Operator which makes an inactive node active and an active one inactive. It is similar to SwapActiveOperator excepts that it tries to insert the inactive node in all possible positions instead of just the position of the node made inactive. Possible neighbors for the path 1 -> 2 -> 3 -> 4 with 5 inactive (where 1 and 4 are first and last nodes of the path) are: 1 -> [5] -> 3 -> 4 with 2 inactive 1 -> 3 -> [5] -> 4 with 2 inactive 1 -> [5] -> 2 -> 4 with 3 inactive 1 -> 2 -> [5] -> 4 with 3 inactive
.operations_research.OptionalBoolean use_extended_swap_active = 15;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2283 of file RoutingSearchParameters.java.
com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseFullPathLns | ( | ) |
Operator which relaxes one entire path and all inactive nodes.
.operations_research.OptionalBoolean use_full_path_lns = 17;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2451 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseFullPathLnsValue | ( | ) |
Operator which relaxes one entire path and all inactive nodes.
.operations_research.OptionalBoolean use_full_path_lns = 17;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2440 of file RoutingSearchParameters.java.
com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseGlobalCheapestInsertionCloseNodesLns | ( | ) |
The following operator makes a node and its heuristic_close_nodes_lns_num_nodes closest neighbors unperformed along with each of their corresponding performed pickup/delivery pairs, and then reinserts them using the GlobalCheapestInsertion heuristic.
.operations_research.OptionalBoolean use_global_cheapest_insertion_close_nodes_lns = 31;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2695 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseGlobalCheapestInsertionCloseNodesLnsValue | ( | ) |
The following operator makes a node and its heuristic_close_nodes_lns_num_nodes closest neighbors unperformed along with each of their corresponding performed pickup/delivery pairs, and then reinserts them using the GlobalCheapestInsertion heuristic.
.operations_research.OptionalBoolean use_global_cheapest_insertion_close_nodes_lns = 31;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2681 of file RoutingSearchParameters.java.
com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseGlobalCheapestInsertionExpensiveChainLns | ( | ) |
This operator finds heuristic_expensive_chain_lns_num_arcs_to_consider most expensive arcs on a route, makes the nodes in between pairs of these expensive arcs unperformed, and reinserts them using the GlobalCheapestInsertion heuristic.
.operations_research.OptionalBoolean use_global_cheapest_insertion_expensive_chain_lns = 29;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2635 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseGlobalCheapestInsertionExpensiveChainLnsValue | ( | ) |
This operator finds heuristic_expensive_chain_lns_num_arcs_to_consider most expensive arcs on a route, makes the nodes in between pairs of these expensive arcs unperformed, and reinserts them using the GlobalCheapestInsertion heuristic.
.operations_research.OptionalBoolean use_global_cheapest_insertion_expensive_chain_lns = 29;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2621 of file RoutingSearchParameters.java.
com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseGlobalCheapestInsertionPathLns | ( | ) |
--- LNS-like large neighborhood search operators using heuristics --- Operator which makes all nodes on a route unperformed, and reinserts them using the GlobalCheapestInsertion heuristic.
.operations_research.OptionalBoolean use_global_cheapest_insertion_path_lns = 27;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2547 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseGlobalCheapestInsertionPathLnsValue | ( | ) |
--- LNS-like large neighborhood search operators using heuristics --- Operator which makes all nodes on a route unperformed, and reinserts them using the GlobalCheapestInsertion heuristic.
.operations_research.OptionalBoolean use_global_cheapest_insertion_path_lns = 27;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2534 of file RoutingSearchParameters.java.
com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseInactiveLns | ( | ) |
Operator which relaxes all inactive nodes and one sub-chain of six consecutive arcs. That way the path can be improved by inserting inactive nodes or swapping arcs.
.operations_research.OptionalBoolean use_inactive_lns = 19;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2517 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseInactiveLnsValue | ( | ) |
Operator which relaxes all inactive nodes and one sub-chain of six consecutive arcs. That way the path can be improved by inserting inactive nodes or swapping arcs.
.operations_research.OptionalBoolean use_inactive_lns = 19;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2504 of file RoutingSearchParameters.java.
com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseLightRelocatePair | ( | ) |
Operator which moves a pair of pickup and delivery nodes after another pair. Possible neighbors for paths 1 -> A -> B -> 2, 3 -> C -> D -> 4 (where (1, 2) and (3, 4) are first and last nodes of paths and can therefore not be moved, and (A, B) and (C, D) are pair of nodes): 1 -> 2, 3 -> C -> [A] -> D -> [B] -> 4 1 -> A -> [C] -> B -> [D] -> 2, 3 -> 4
.operations_research.OptionalBoolean use_light_relocate_pair = 24;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 1579 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseLightRelocatePairValue | ( | ) |
Operator which moves a pair of pickup and delivery nodes after another pair. Possible neighbors for paths 1 -> A -> B -> 2, 3 -> C -> D -> 4 (where (1, 2) and (3, 4) are first and last nodes of paths and can therefore not be moved, and (A, B) and (C, D) are pair of nodes): 1 -> 2, 3 -> C -> [A] -> D -> [B] -> 4 1 -> A -> [C] -> B -> [D] -> 2, 3 -> 4
.operations_research.OptionalBoolean use_light_relocate_pair = 24;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 1562 of file RoutingSearchParameters.java.
com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseLinKernighan | ( | ) |
Lin-Kernighan operator. While the accumulated local gain is positive, performs a 2-OPT or a 3-OPT move followed by a series of 2-OPT moves. Returns a neighbor for which the global gain is positive.
.operations_research.OptionalBoolean use_lin_kernighan = 9;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2037 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseLinKernighanValue | ( | ) |
Lin-Kernighan operator. While the accumulated local gain is positive, performs a 2-OPT or a 3-OPT move followed by a series of 2-OPT moves. Returns a neighbor for which the global gain is positive.
.operations_research.OptionalBoolean use_lin_kernighan = 9;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2023 of file RoutingSearchParameters.java.
com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseLocalCheapestInsertionCloseNodesLns | ( | ) |
Same as above, but insertion positions for nodes are determined by the LocalCheapestInsertion heuristic.
.operations_research.OptionalBoolean use_local_cheapest_insertion_close_nodes_lns = 32;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2723 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseLocalCheapestInsertionCloseNodesLnsValue | ( | ) |
Same as above, but insertion positions for nodes are determined by the LocalCheapestInsertion heuristic.
.operations_research.OptionalBoolean use_local_cheapest_insertion_close_nodes_lns = 32;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2711 of file RoutingSearchParameters.java.
com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseLocalCheapestInsertionExpensiveChainLns | ( | ) |
Same as above but using LocalCheapestInsertion as a heuristic for insertion.
.operations_research.OptionalBoolean use_local_cheapest_insertion_expensive_chain_lns = 30;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2663 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseLocalCheapestInsertionExpensiveChainLnsValue | ( | ) |
Same as above but using LocalCheapestInsertion as a heuristic for insertion.
.operations_research.OptionalBoolean use_local_cheapest_insertion_expensive_chain_lns = 30;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2651 of file RoutingSearchParameters.java.
com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseLocalCheapestInsertionPathLns | ( | ) |
Same as above but using LocalCheapestInsertion as a heuristic.
.operations_research.OptionalBoolean use_local_cheapest_insertion_path_lns = 28;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2573 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseLocalCheapestInsertionPathLnsValue | ( | ) |
Same as above but using LocalCheapestInsertion as a heuristic.
.operations_research.OptionalBoolean use_local_cheapest_insertion_path_lns = 28;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2562 of file RoutingSearchParameters.java.
com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseMakeActive | ( | ) |
--- Operators on inactive nodes --- Operator which inserts an inactive node into a path. Possible neighbors for the path 1 -> 2 -> 3 -> 4 with 5 inactive (where 1 and 4 are first and last nodes of the path) are: 1 -> [5] -> 2 -> 3 -> 4 1 -> 2 -> [5] -> 3 -> 4 1 -> 2 -> 3 -> [5] -> 4
.operations_research.OptionalBoolean use_make_active = 11;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2111 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseMakeActiveValue | ( | ) |
--- Operators on inactive nodes --- Operator which inserts an inactive node into a path. Possible neighbors for the path 1 -> 2 -> 3 -> 4 with 5 inactive (where 1 and 4 are first and last nodes of the path) are: 1 -> [5] -> 2 -> 3 -> 4 1 -> 2 -> [5] -> 3 -> 4 1 -> 2 -> 3 -> [5] -> 4
.operations_research.OptionalBoolean use_make_active = 11;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2094 of file RoutingSearchParameters.java.
com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseMakeChainInactive | ( | ) |
Operator which makes a "chain" of path nodes inactive. Possible neighbors for the path 1 -> 2 -> 3 -> 4 (where 1 and 4 are first and last nodes of the path) are: 1 -> 3 -> 4 with 2 inactive 1 -> 2 -> 4 with 3 inactive 1 -> 4 with 2 and 3 inactive
.operations_research.OptionalBoolean use_make_chain_inactive = 13;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2225 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseMakeChainInactiveValue | ( | ) |
Operator which makes a "chain" of path nodes inactive. Possible neighbors for the path 1 -> 2 -> 3 -> 4 (where 1 and 4 are first and last nodes of the path) are: 1 -> 3 -> 4 with 2 inactive 1 -> 2 -> 4 with 3 inactive 1 -> 4 with 2 and 3 inactive
.operations_research.OptionalBoolean use_make_chain_inactive = 13;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2209 of file RoutingSearchParameters.java.
com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseMakeInactive | ( | ) |
Operator which makes path nodes inactive. Possible neighbors for the path 1 -> 2 -> 3 -> 4 (where 1 and 4 are first and last nodes of the path) are: 1 -> 3 -> 4 with 2 inactive 1 -> 2 -> 4 with 3 inactive
.operations_research.OptionalBoolean use_make_inactive = 12;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2189 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseMakeInactiveValue | ( | ) |
Operator which makes path nodes inactive. Possible neighbors for the path 1 -> 2 -> 3 -> 4 (where 1 and 4 are first and last nodes of the path) are: 1 -> 3 -> 4 with 2 inactive 1 -> 2 -> 4 with 3 inactive
.operations_research.OptionalBoolean use_make_inactive = 12;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2174 of file RoutingSearchParameters.java.
com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseNodePairSwapActive | ( | ) |
Operator which makes an inactive node active and an active pair of nodes inactive OR makes an inactive pair of nodes active and an active node inactive. Possible neighbors for the path 1 -> 2 -> 3 -> 4 with 5 inactive (where 1 and 4 are first and last nodes of the path and (2,3) is a pair of nodes) are: 1 -> [5] -> 4 with (2,3) inactive Possible neighbors for the path 1 -> 2 -> 3 with (4,5) inactive (where 1 and 3 are first and last nodes of the path and (4,5) is a pair of nodes) are: 1 -> [4] -> [5] -> 3 with 2 inactive
.operations_research.OptionalBoolean use_node_pair_swap_active = 20;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2385 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseNodePairSwapActiveValue | ( | ) |
Operator which makes an inactive node active and an active pair of nodes inactive OR makes an inactive pair of nodes active and an active node inactive. Possible neighbors for the path 1 -> 2 -> 3 -> 4 with 5 inactive (where 1 and 4 are first and last nodes of the path and (2,3) is a pair of nodes) are: 1 -> [5] -> 4 with (2,3) inactive Possible neighbors for the path 1 -> 2 -> 3 with (4,5) inactive (where 1 and 3 are first and last nodes of the path and (4,5) is a pair of nodes) are: 1 -> [4] -> [5] -> 3 with 2 inactive
.operations_research.OptionalBoolean use_node_pair_swap_active = 20;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2364 of file RoutingSearchParameters.java.
com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseOrOpt | ( | ) |
Operator which moves sub-chains of a path of length 1, 2 and 3 to another position in the same path. When the length of the sub-chain is 1, the operator simply moves a node to another position. Possible neighbors for the path 1 -> 2 -> 3 -> 4 -> 5, for a sub-chain length of 2 (where (1, 5) are first and last nodes of the path and can therefore not be moved): 1 -> 4 -> [2 -> 3] -> 5 1 -> [3 -> 4] -> 2 -> 5 The OR_OPT operator is a limited version of 3-Opt (breaks 3 arcs on a path).
.operations_research.OptionalBoolean use_or_opt = 8;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2005 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseOrOptValue | ( | ) |
Operator which moves sub-chains of a path of length 1, 2 and 3 to another position in the same path. When the length of the sub-chain is 1, the operator simply moves a node to another position. Possible neighbors for the path 1 -> 2 -> 3 -> 4 -> 5, for a sub-chain length of 2 (where (1, 5) are first and last nodes of the path and can therefore not be moved): 1 -> 4 -> [2 -> 3] -> 5 1 -> [3 -> 4] -> 2 -> 5 The OR_OPT operator is a limited version of 3-Opt (breaks 3 arcs on a path).
.operations_research.OptionalBoolean use_or_opt = 8;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 1984 of file RoutingSearchParameters.java.
com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUsePathLns | ( | ) |
--- Large neighborhood search operators --- Operator which relaxes two sub-chains of three consecutive arcs each. Each sub-chain is defined by a start node and the next three arcs. Those six arcs are relaxed to build a new neighbor. PATH_LNS explores all possible pairs of starting nodes and so defines n^2 neighbors, n being the number of nodes. Note that the two sub-chains can be part of the same path; they even may overlap.
.operations_research.OptionalBoolean use_path_lns = 16;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2425 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUsePathLnsValue | ( | ) |
--- Large neighborhood search operators --- Operator which relaxes two sub-chains of three consecutive arcs each. Each sub-chain is defined by a start node and the next three arcs. Those six arcs are relaxed to build a new neighbor. PATH_LNS explores all possible pairs of starting nodes and so defines n^2 neighbors, n being the number of nodes. Note that the two sub-chains can be part of the same path; they even may overlap.
.operations_research.OptionalBoolean use_path_lns = 16;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2407 of file RoutingSearchParameters.java.
com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseRelocate | ( | ) |
--- Inter-route operators --- Operator which moves a single node to another position. Possible neighbors for the path 1 -> 2 -> 3 -> 4 -> 5 (where (1, 5) are first and last nodes of the path and can therefore not be moved): 1 -> 3 -> [2] -> 4 -> 5 1 -> 3 -> 4 -> [2] -> 5 1 -> 2 -> 4 -> [3] -> 5 1 -> [4] -> 2 -> 3 -> 5
.operations_research.OptionalBoolean use_relocate = 1;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 1499 of file RoutingSearchParameters.java.
com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseRelocateAndMakeActive | ( | ) |
Operator which relocates a node while making an inactive one active. As of 3/2017, the operator is limited to two kinds of moves: - Relocating a node and replacing it by an inactive node. Possible neighbor for path 1 -> 5, 2 -> 3 -> 6 and 4 inactive (where 1,2 and 5,6 are first and last nodes of paths) is: 1 -> 3 -> 5, 2 -> 4 -> 6. - Relocating a node and inserting an inactive node next to it. Possible neighbor for path 1 -> 5, 2 -> 3 -> 6 and 4 inactive (where 1,2 and 5,6 are first and last nodes of paths) is: 1 -> 4 -> 3 -> 5, 2 -> 6.
.operations_research.OptionalBoolean use_relocate_and_make_active = 21;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2155 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseRelocateAndMakeActiveValue | ( | ) |
Operator which relocates a node while making an inactive one active. As of 3/2017, the operator is limited to two kinds of moves: - Relocating a node and replacing it by an inactive node. Possible neighbor for path 1 -> 5, 2 -> 3 -> 6 and 4 inactive (where 1,2 and 5,6 are first and last nodes of paths) is: 1 -> 3 -> 5, 2 -> 4 -> 6. - Relocating a node and inserting an inactive node next to it. Possible neighbor for path 1 -> 5, 2 -> 3 -> 6 and 4 inactive (where 1,2 and 5,6 are first and last nodes of paths) is: 1 -> 4 -> 3 -> 5, 2 -> 6.
.operations_research.OptionalBoolean use_relocate_and_make_active = 21;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2135 of file RoutingSearchParameters.java.
com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseRelocateExpensiveChain | ( | ) |
Operator which detects the relocate_expensive_chain_num_arcs_to_consider most expensive arcs on a path, and moves the chain resulting from cutting pairs of arcs among these to another position. Possible neighbors for paths 1 -> 2 (empty) and 3 -> A ------> B --> C -----> D -> 4 (where A -> B and C -> D are the 2 most expensive arcs, and the chain resulting from breaking them is B -> C): 1 -> [B -> C] -> 2 3 -> A -> D -> 4 1 -> 2 3 -> [B -> C] -> A -> D -> 4 1 -> 2 3 -> A -> D -> [B -> C] -> 4
.operations_research.OptionalBoolean use_relocate_expensive_chain = 23;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 1915 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseRelocateExpensiveChainValue | ( | ) |
Operator which detects the relocate_expensive_chain_num_arcs_to_consider most expensive arcs on a path, and moves the chain resulting from cutting pairs of arcs among these to another position. Possible neighbors for paths 1 -> 2 (empty) and 3 -> A ------> B --> C -----> D -> 4 (where A -> B and C -> D are the 2 most expensive arcs, and the chain resulting from breaking them is B -> C): 1 -> [B -> C] -> 2 3 -> A -> D -> 4 1 -> 2 3 -> [B -> C] -> A -> D -> 4 1 -> 2 3 -> A -> D -> [B -> C] -> 4
.operations_research.OptionalBoolean use_relocate_expensive_chain = 23;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 1895 of file RoutingSearchParameters.java.
com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseRelocateNeighbors | ( | ) |
Relocate neighborhood which moves chains of neighbors. The operator starts by relocating a node n after a node m, then continues moving nodes which were after n as long as the "cost" added is less than the "cost" of the arc (m, n). If the new chain doesn't respect the domain of next variables, it will try reordering the nodes until it finds a valid path. Possible neighbors for path 1 -> A -> B -> C -> D -> E -> 2 (where (1, 2) are first and last nodes of the path and can therefore not be moved, A must be performed before B, and A, D and E are located at the same place): 1 -> A -> C -> [B] -> D -> E -> 2 1 -> A -> C -> D -> [B] -> E -> 2 1 -> A -> C -> D -> E -> [B] -> 2 1 -> A -> B -> D -> [C] -> E -> 2 1 -> A -> B -> D -> E -> [C] -> 2 1 -> A -> [D] -> [E] -> B -> C -> 2 1 -> A -> B -> [D] -> [E] -> C -> 2 1 -> A -> [E] -> B -> C -> D -> 2 1 -> A -> B -> [E] -> C -> D -> 2 1 -> A -> B -> C -> [E] -> D -> 2 This operator is extremely useful to move chains of nodes which are located at the same place (for instance nodes part of a same stop).
.operations_research.OptionalBoolean use_relocate_neighbors = 3;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 1647 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseRelocateNeighborsValue | ( | ) |
Relocate neighborhood which moves chains of neighbors. The operator starts by relocating a node n after a node m, then continues moving nodes which were after n as long as the "cost" added is less than the "cost" of the arc (m, n). If the new chain doesn't respect the domain of next variables, it will try reordering the nodes until it finds a valid path. Possible neighbors for path 1 -> A -> B -> C -> D -> E -> 2 (where (1, 2) are first and last nodes of the path and can therefore not be moved, A must be performed before B, and A, D and E are located at the same place): 1 -> A -> C -> [B] -> D -> E -> 2 1 -> A -> C -> D -> [B] -> E -> 2 1 -> A -> C -> D -> E -> [B] -> 2 1 -> A -> B -> D -> [C] -> E -> 2 1 -> A -> B -> D -> E -> [C] -> 2 1 -> A -> [D] -> [E] -> B -> C -> 2 1 -> A -> B -> [D] -> [E] -> C -> 2 1 -> A -> [E] -> B -> C -> D -> 2 1 -> A -> B -> [E] -> C -> D -> 2 1 -> A -> B -> C -> [E] -> D -> 2 This operator is extremely useful to move chains of nodes which are located at the same place (for instance nodes part of a same stop).
.operations_research.OptionalBoolean use_relocate_neighbors = 3;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 1615 of file RoutingSearchParameters.java.
com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseRelocatePair | ( | ) |
Operator which moves a pair of pickup and delivery nodes to another position where the first node of the pair must be before the second node on the same path. Compared to the light_relocate_pair operator, tries all possible positions of insertion of a pair (not only after another pair). Possible neighbors for the path 1 -> A -> B -> 2 -> 3 (where (1, 3) are first and last nodes of the path and can therefore not be moved, and (A, B) is a pair of nodes): 1 -> [A] -> 2 -> [B] -> 3 1 -> 2 -> [A] -> [B] -> 3
.operations_research.OptionalBoolean use_relocate_pair = 2;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 1541 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseRelocatePairValue | ( | ) |
Operator which moves a pair of pickup and delivery nodes to another position where the first node of the pair must be before the second node on the same path. Compared to the light_relocate_pair operator, tries all possible positions of insertion of a pair (not only after another pair). Possible neighbors for the path 1 -> A -> B -> 2 -> 3 (where (1, 3) are first and last nodes of the path and can therefore not be moved, and (A, B) is a pair of nodes): 1 -> [A] -> 2 -> [B] -> 3 1 -> 2 -> [A] -> [B] -> 3
.operations_research.OptionalBoolean use_relocate_pair = 2;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 1522 of file RoutingSearchParameters.java.
com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseRelocatePathGlobalCheapestInsertionInsertUnperformed | ( | ) |
The following operator relocates an entire route to an empty path and then tries to insert the unperformed nodes using the global cheapest insertion heuristic.
.operations_research.OptionalBoolean use_relocate_path_global_cheapest_insertion_insert_unperformed = 33;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2603 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseRelocatePathGlobalCheapestInsertionInsertUnperformedValue | ( | ) |
The following operator relocates an entire route to an empty path and then tries to insert the unperformed nodes using the global cheapest insertion heuristic.
.operations_research.OptionalBoolean use_relocate_path_global_cheapest_insertion_insert_unperformed = 33;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2590 of file RoutingSearchParameters.java.
com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseRelocateSubtrip | ( | ) |
Relocate neighborhood that moves subpaths all pickup and delivery pairs have both pickup and delivery inside the subpath or both outside the subpath. For instance, for given paths: 0 -> A -> B -> A' -> B' -> 5 -> 6 -> 8 7 -> 9 Pairs (A,A') and (B,B') are interleaved, so the expected neighbors are: 0 -> 5 -> A -> B -> A' -> B' -> 6 -> 8 7 -> 9 0 -> 5 -> 6 -> A -> B -> A' -> B' -> 8 7 -> 9 0 -> 5 -> 6 -> 8 7 -> A -> B -> A' -> B' -> 9
.operations_research.OptionalBoolean use_relocate_subtrip = 25;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 1699 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseRelocateSubtripValue | ( | ) |
Relocate neighborhood that moves subpaths all pickup and delivery pairs have both pickup and delivery inside the subpath or both outside the subpath. For instance, for given paths: 0 -> A -> B -> A' -> B' -> 5 -> 6 -> 8 7 -> 9 Pairs (A,A') and (B,B') are interleaved, so the expected neighbors are: 0 -> 5 -> A -> B -> A' -> B' -> 6 -> 8 7 -> 9 0 -> 5 -> 6 -> A -> B -> A' -> B' -> 8 7 -> 9 0 -> 5 -> 6 -> 8 7 -> A -> B -> A' -> B' -> 9
.operations_research.OptionalBoolean use_relocate_subtrip = 25;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 1675 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseRelocateValue | ( | ) |
--- Inter-route operators --- Operator which moves a single node to another position. Possible neighbors for the path 1 -> 2 -> 3 -> 4 -> 5 (where (1, 5) are first and last nodes of the path and can therefore not be moved): 1 -> 3 -> [2] -> 4 -> 5 1 -> 3 -> 4 -> [2] -> 5 1 -> 2 -> 4 -> [3] -> 5 1 -> [4] -> 2 -> 3 -> 5
.operations_research.OptionalBoolean use_relocate = 1;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 1480 of file RoutingSearchParameters.java.
com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseShortestPathSwapActive | ( | ) |
Swaps active nodes from node alternatives in sequence. Considers chains of nodes with alternatives, builds a DAG from the chain, each "layer" of the DAG being composed of the set of alternatives of the node at a given rank in the chain, fully connected to the next layer. A neighbor is built from the shortest path starting from the node before the chain (source), through the DAG to the node following the chain.
.operations_research.OptionalBoolean use_shortest_path_swap_active = 34;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2339 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseShortestPathSwapActiveValue | ( | ) |
Swaps active nodes from node alternatives in sequence. Considers chains of nodes with alternatives, builds a DAG from the chain, each "layer" of the DAG being composed of the set of alternatives of the node at a given rank in the chain, fully connected to the next layer. A neighbor is built from the shortest path starting from the node before the chain (source), through the DAG to the node following the chain.
.operations_research.OptionalBoolean use_shortest_path_swap_active = 34;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2323 of file RoutingSearchParameters.java.
com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseSwapActive | ( | ) |
Operator which replaces an active node by an inactive one. Possible neighbors for the path 1 -> 2 -> 3 -> 4 with 5 inactive (where 1 and 4 are first and last nodes of the path) are: 1 -> [5] -> 3 -> 4 with 2 inactive 1 -> 2 -> [5] -> 4 with 3 inactive
.operations_research.OptionalBoolean use_swap_active = 14;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2259 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseSwapActiveValue | ( | ) |
Operator which replaces an active node by an inactive one. Possible neighbors for the path 1 -> 2 -> 3 -> 4 with 5 inactive (where 1 and 4 are first and last nodes of the path) are: 1 -> [5] -> 3 -> 4 with 2 inactive 1 -> 2 -> [5] -> 4 with 3 inactive
.operations_research.OptionalBoolean use_swap_active = 14;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2244 of file RoutingSearchParameters.java.
com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseTspLns | ( | ) |
TSP-base LNS. Randomly merges consecutive nodes until n "meta"-nodes remain and solves the corresponding TSP. This defines an "unlimited" neighborhood which must be stopped by search limits. To force diversification, the operator iteratively forces each node to serve as base of a meta-node.
.operations_research.OptionalBoolean use_tsp_lns = 18;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2487 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseTspLnsValue | ( | ) |
TSP-base LNS. Randomly merges consecutive nodes until n "meta"-nodes remain and solves the corresponding TSP. This defines an "unlimited" neighborhood which must be stopped by search limits. To force diversification, the operator iteratively forces each node to serve as base of a meta-node.
.operations_research.OptionalBoolean use_tsp_lns = 18;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2471 of file RoutingSearchParameters.java.
com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseTspOpt | ( | ) |
Sliding TSP operator. Uses an exact dynamic programming algorithm to solve the TSP corresponding to path sub-chains. For a subchain 1 -> 2 -> 3 -> 4 -> 5 -> 6, solves the TSP on nodes A, 2, 3, 4, 5, where A is a merger of nodes 1 and 6 such that cost(A,i) = cost(1,i) and cost(i,A) = cost(i,6).
.operations_research.OptionalBoolean use_tsp_opt = 10;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2073 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseTspOptValue | ( | ) |
Sliding TSP operator. Uses an exact dynamic programming algorithm to solve the TSP corresponding to path sub-chains. For a subchain 1 -> 2 -> 3 -> 4 -> 5 -> 6, solves the TSP on nodes A, 2, 3, 4, 5, where A is a merger of nodes 1 and 6 such that cost(A,i) = cost(1,i) and cost(i,A) = cost(i,6).
.operations_research.OptionalBoolean use_tsp_opt = 10;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2057 of file RoutingSearchParameters.java.
com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseTwoOpt | ( | ) |
--- Intra-route operators --- Operator which reverses a subchain of a path. It is called TwoOpt because it breaks two arcs on the path; resulting paths are called two-optimal. Possible neighbors for the path 1 -> 2 -> 3 -> 4 -> 5 (where (1, 5) are first and last nodes of the path and can therefore not be moved): 1 -> [3 -> 2] -> 4 -> 5 1 -> [4 -> 3 -> 2] -> 5 1 -> 2 -> [4 -> 3] -> 5
.operations_research.OptionalBoolean use_two_opt = 7;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 1959 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseTwoOptValue | ( | ) |
--- Intra-route operators --- Operator which reverses a subchain of a path. It is called TwoOpt because it breaks two arcs on the path; resulting paths are called two-optimal. Possible neighbors for the path 1 -> 2 -> 3 -> 4 -> 5 (where (1, 5) are first and last nodes of the path and can therefore not be moved): 1 -> [3 -> 2] -> 4 -> 5 1 -> [4 -> 3 -> 2] -> 5 1 -> 2 -> [4 -> 3] -> 5
.operations_research.OptionalBoolean use_two_opt = 7;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 1939 of file RoutingSearchParameters.java.
int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.hashCode | ( | ) |
Definition at line 3043 of file RoutingSearchParameters.java.
|
protected |
Definition at line 1456 of file RoutingSearchParameters.java.
final boolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.isInitialized | ( | ) |
Definition at line 2730 of file RoutingSearchParameters.java.
|
static |
Definition at line 3196 of file RoutingSearchParameters.java.
|
static |
Definition at line 3199 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.newBuilderForType | ( | ) |
Definition at line 3195 of file RoutingSearchParameters.java.
|
protected |
Definition at line 3209 of file RoutingSearchParameters.java.
|
protected |
Definition at line 1444 of file RoutingSearchParameters.java.
|
static |
Definition at line 3167 of file RoutingSearchParameters.java.
|
static |
Definition at line 3173 of file RoutingSearchParameters.java.
|
static |
Definition at line 3144 of file RoutingSearchParameters.java.
|
static |
Definition at line 3148 of file RoutingSearchParameters.java.
|
static |
Definition at line 3133 of file RoutingSearchParameters.java.
|
static |
Definition at line 3138 of file RoutingSearchParameters.java.
|
static |
Definition at line 3180 of file RoutingSearchParameters.java.
|
static |
Definition at line 3186 of file RoutingSearchParameters.java.
|
static |
Definition at line 3154 of file RoutingSearchParameters.java.
|
static |
Definition at line 3159 of file RoutingSearchParameters.java.
|
static |
Definition at line 3122 of file RoutingSearchParameters.java.
|
static |
Definition at line 3127 of file RoutingSearchParameters.java.
|
static |
Definition at line 7274 of file RoutingSearchParameters.java.
Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.toBuilder | ( | ) |
Definition at line 3203 of file RoutingSearchParameters.java.
void com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.writeTo | ( | com.google.protobuf.CodedOutputStream | output | ) | throws java.io.IOException |
Definition at line 2740 of file RoutingSearchParameters.java.
|
static |
Definition at line 1850 of file RoutingSearchParameters.java.
|
static |
Definition at line 1808 of file RoutingSearchParameters.java.
|
static |
Definition at line 1704 of file RoutingSearchParameters.java.
|
static |
Definition at line 1742 of file RoutingSearchParameters.java.
|
static |
Definition at line 1780 of file RoutingSearchParameters.java.
|
static |
Definition at line 2264 of file RoutingSearchParameters.java.
|
static |
Definition at line 2430 of file RoutingSearchParameters.java.
|
static |
Definition at line 2668 of file RoutingSearchParameters.java.
|
static |
Definition at line 2608 of file RoutingSearchParameters.java.
|
static |
Definition at line 2522 of file RoutingSearchParameters.java.
|
static |
Definition at line 2492 of file RoutingSearchParameters.java.
|
static |
Definition at line 1546 of file RoutingSearchParameters.java.
|
static |
Definition at line 2010 of file RoutingSearchParameters.java.
|
static |
Definition at line 2700 of file RoutingSearchParameters.java.
|
static |
Definition at line 2640 of file RoutingSearchParameters.java.
|
static |
Definition at line 2552 of file RoutingSearchParameters.java.
|
static |
Definition at line 2078 of file RoutingSearchParameters.java.
|
static |
Definition at line 2194 of file RoutingSearchParameters.java.
|
static |
Definition at line 2160 of file RoutingSearchParameters.java.
|
static |
Definition at line 2344 of file RoutingSearchParameters.java.
|
static |
Definition at line 1964 of file RoutingSearchParameters.java.
|
static |
Definition at line 2390 of file RoutingSearchParameters.java.
|
static |
Definition at line 2116 of file RoutingSearchParameters.java.
|
static |
Definition at line 1876 of file RoutingSearchParameters.java.
|
static |
Definition at line 1462 of file RoutingSearchParameters.java.
|
static |
Definition at line 1584 of file RoutingSearchParameters.java.
|
static |
Definition at line 1504 of file RoutingSearchParameters.java.
|
static |
Definition at line 2578 of file RoutingSearchParameters.java.
|
static |
Definition at line 1652 of file RoutingSearchParameters.java.
|
static |
Definition at line 2308 of file RoutingSearchParameters.java.
|
static |
Definition at line 2230 of file RoutingSearchParameters.java.
|
static |
Definition at line 2456 of file RoutingSearchParameters.java.
|
static |
Definition at line 2042 of file RoutingSearchParameters.java.
|
static |
Definition at line 1920 of file RoutingSearchParameters.java.