Java Reference
Java Reference
Detailed Description
Local search neighborhood operators used to build a solutions neighborhood. Next ID: 31
Protobuf type
Definition at line 1338 of file RoutingSearchParameters.java.
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 | |
| .lang.Override java.lang.Object | newInstance (UnusedPrivateParameter unused) |
| .lang.Override com.google.protobuf.GeneratedMessageV3.FieldAccessorTable | internalGetFieldAccessorTable () |
| .lang.Override Builder | newBuilderForType (com.google.protobuf.GeneratedMessageV3.BuilderParent parent) |
Member Function Documentation
◆ equals()
|
inline |
Definition at line 3027 of file RoutingSearchParameters.java.
◆ getDefaultInstance()
|
inlinestatic |
Definition at line 6689 of file RoutingSearchParameters.java.
◆ getDefaultInstanceForType()
|
inline |
Definition at line 6714 of file RoutingSearchParameters.java.
◆ getDescriptor()
|
inlinestatic |
Definition at line 1610 of file RoutingSearchParameters.java.
◆ getParserForType()
|
inline |
Definition at line 6709 of file RoutingSearchParameters.java.
◆ getSerializedSize()
|
inline |
Definition at line 2896 of file RoutingSearchParameters.java.
◆ getUnknownFields()
|
inline |
Definition at line 1389 of file RoutingSearchParameters.java.
◆ getUseCross()
|
inline |
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;
- Returns
- The useCross.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2009 of file RoutingSearchParameters.java.
◆ getUseCrossExchange()
|
inline |
Not implemented yet. TODO(b/68128619): Implement.
.operations_research.OptionalBoolean use_cross_exchange = 6;
- Returns
- The useCrossExchange.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2036 of file RoutingSearchParameters.java.
◆ getUseCrossExchangeValue()
|
inline |
Not implemented yet. TODO(b/68128619): Implement.
.operations_research.OptionalBoolean use_cross_exchange = 6;
- Returns
- The enum numeric value on the wire for useCrossExchange.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2025 of file RoutingSearchParameters.java.
◆ getUseCrossValue()
|
inline |
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;
- Returns
- The enum numeric value on the wire for useCross.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 1990 of file RoutingSearchParameters.java.
◆ getUseExchange()
|
inline |
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;
- Returns
- The useExchange.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 1898 of file RoutingSearchParameters.java.
◆ getUseExchangePair()
|
inline |
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;
- Returns
- The useExchangePair.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 1937 of file RoutingSearchParameters.java.
◆ getUseExchangePairValue()
|
inline |
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;
- Returns
- The enum numeric value on the wire for useExchangePair.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 1920 of file RoutingSearchParameters.java.
◆ getUseExchangeSubtrip()
|
inline |
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;
- Returns
- The useExchangeSubtrip.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 1966 of file RoutingSearchParameters.java.
◆ getUseExchangeSubtripValue()
|
inline |
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;
- Returns
- The enum numeric value on the wire for useExchangeSubtrip.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 1954 of file RoutingSearchParameters.java.
◆ getUseExchangeValue()
|
inline |
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;
- Returns
- The enum numeric value on the wire for useExchange.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 1881 of file RoutingSearchParameters.java.
◆ getUseExtendedSwapActive()
|
inline |
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;
- Returns
- The useExtendedSwapActive.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2479 of file RoutingSearchParameters.java.
◆ getUseExtendedSwapActiveValue()
|
inline |
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;
- Returns
- The enum numeric value on the wire for useExtendedSwapActive.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2459 of file RoutingSearchParameters.java.
◆ getUseFullPathLns()
|
inline |
Operator which relaxes one entire path and all unactive nodes.
.operations_research.OptionalBoolean use_full_path_lns = 17;
- Returns
- The useFullPathLns.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2594 of file RoutingSearchParameters.java.
◆ getUseFullPathLnsValue()
|
inline |
Operator which relaxes one entire path and all unactive nodes.
.operations_research.OptionalBoolean use_full_path_lns = 17;
- Returns
- The enum numeric value on the wire for useFullPathLns.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2583 of file RoutingSearchParameters.java.
◆ getUseGlobalCheapestInsertionExpensiveChainLns()
|
inline |
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;
- Returns
- The useGlobalCheapestInsertionExpensiveChainLns.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2753 of file RoutingSearchParameters.java.
◆ getUseGlobalCheapestInsertionExpensiveChainLnsValue()
|
inline |
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;
- Returns
- The enum numeric value on the wire for useGlobalCheapestInsertionExpensiveChainLns.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2739 of file RoutingSearchParameters.java.
◆ getUseGlobalCheapestInsertionPathLns()
|
inline |
--- 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;
- Returns
- The useGlobalCheapestInsertionPathLns.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2693 of file RoutingSearchParameters.java.
◆ getUseGlobalCheapestInsertionPathLnsValue()
|
inline |
--- 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;
- Returns
- The enum numeric value on the wire for useGlobalCheapestInsertionPathLns.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2680 of file RoutingSearchParameters.java.
◆ getUseInactiveLns()
|
inline |
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 swaping arcs.
.operations_research.OptionalBoolean use_inactive_lns = 19;
- Returns
- The useInactiveLns.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2662 of file RoutingSearchParameters.java.
◆ getUseInactiveLnsValue()
|
inline |
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 swaping arcs.
.operations_research.OptionalBoolean use_inactive_lns = 19;
- Returns
- The enum numeric value on the wire for useInactiveLns.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2649 of file RoutingSearchParameters.java.
◆ getUseLightRelocatePair()
|
inline |
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;
- Returns
- The useLightRelocatePair.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 1741 of file RoutingSearchParameters.java.
◆ getUseLightRelocatePairValue()
|
inline |
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;
- Returns
- The enum numeric value on the wire for useLightRelocatePair.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 1724 of file RoutingSearchParameters.java.
◆ getUseLinKernighan()
|
inline |
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;
- Returns
- The useLinKernighan.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2206 of file RoutingSearchParameters.java.
◆ getUseLinKernighanValue()
|
inline |
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;
- Returns
- The enum numeric value on the wire for useLinKernighan.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2192 of file RoutingSearchParameters.java.
◆ getUseLocalCheapestInsertionExpensiveChainLns()
|
inline |
Same as above but using LocalCheapestInsertion as a heuristic for insertion.
.operations_research.OptionalBoolean use_local_cheapest_insertion_expensive_chain_lns = 30;
- Returns
- The useLocalCheapestInsertionExpensiveChainLns.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2782 of file RoutingSearchParameters.java.
◆ getUseLocalCheapestInsertionExpensiveChainLnsValue()
|
inline |
Same as above but using LocalCheapestInsertion as a heuristic for insertion.
.operations_research.OptionalBoolean use_local_cheapest_insertion_expensive_chain_lns = 30;
- Returns
- The enum numeric value on the wire for useLocalCheapestInsertionExpensiveChainLns.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2770 of file RoutingSearchParameters.java.
◆ getUseLocalCheapestInsertionPathLns()
|
inline |
Same as above but using LocalCheapestInsertion as a heuristic.
.operations_research.OptionalBoolean use_local_cheapest_insertion_path_lns = 28;
- Returns
- The useLocalCheapestInsertionPathLns.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2720 of file RoutingSearchParameters.java.
◆ getUseLocalCheapestInsertionPathLnsValue()
|
inline |
Same as above but using LocalCheapestInsertion as a heuristic.
.operations_research.OptionalBoolean use_local_cheapest_insertion_path_lns = 28;
- Returns
- The enum numeric value on the wire for useLocalCheapestInsertionPathLns.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2709 of file RoutingSearchParameters.java.
◆ getUseMakeActive()
|
inline |
--- 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;
- Returns
- The useMakeActive.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2282 of file RoutingSearchParameters.java.
◆ getUseMakeActiveValue()
|
inline |
--- 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;
- Returns
- The enum numeric value on the wire for useMakeActive.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2265 of file RoutingSearchParameters.java.
◆ getUseMakeChainInactive()
|
inline |
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;
- Returns
- The useMakeChainInactive.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2399 of file RoutingSearchParameters.java.
◆ getUseMakeChainInactiveValue()
|
inline |
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;
- Returns
- The enum numeric value on the wire for useMakeChainInactive.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2383 of file RoutingSearchParameters.java.
◆ getUseMakeInactive()
|
inline |
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;
- Returns
- The useMakeInactive.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2362 of file RoutingSearchParameters.java.
◆ getUseMakeInactiveValue()
|
inline |
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;
- Returns
- The enum numeric value on the wire for useMakeInactive.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2347 of file RoutingSearchParameters.java.
◆ getUseNodePairSwapActive()
|
inline |
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;
- Returns
- The useNodePairSwapActive.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2526 of file RoutingSearchParameters.java.
◆ getUseNodePairSwapActiveValue()
|
inline |
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;
- Returns
- The enum numeric value on the wire for useNodePairSwapActive.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2505 of file RoutingSearchParameters.java.
◆ getUseOrOpt()
|
inline |
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;
- Returns
- The useOrOpt.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2173 of file RoutingSearchParameters.java.
◆ getUseOrOptValue()
|
inline |
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;
- Returns
- The enum numeric value on the wire for useOrOpt.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2152 of file RoutingSearchParameters.java.
◆ getUsePathLns()
|
inline |
--- 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;
- Returns
- The usePathLns.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2567 of file RoutingSearchParameters.java.
◆ getUsePathLnsValue()
|
inline |
--- 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;
- Returns
- The enum numeric value on the wire for usePathLns.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2549 of file RoutingSearchParameters.java.
◆ getUseRelocate()
|
inline |
--- 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;
- Returns
- The useRelocate.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 1659 of file RoutingSearchParameters.java.
◆ getUseRelocateAndMakeActive()
|
inline |
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;
- Returns
- The useRelocateAndMakeActive.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2327 of file RoutingSearchParameters.java.
◆ getUseRelocateAndMakeActiveValue()
|
inline |
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;
- Returns
- The enum numeric value on the wire for useRelocateAndMakeActive.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2307 of file RoutingSearchParameters.java.
◆ getUseRelocateExpensiveChain()
|
inline |
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;
- Returns
- The useRelocateExpensiveChain.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2081 of file RoutingSearchParameters.java.
◆ getUseRelocateExpensiveChainValue()
|
inline |
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;
- Returns
- The enum numeric value on the wire for useRelocateExpensiveChain.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2061 of file RoutingSearchParameters.java.
◆ getUseRelocateNeighbors()
|
inline |
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 extremelly 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;
- Returns
- The useRelocateNeighbors.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 1810 of file RoutingSearchParameters.java.
◆ getUseRelocateNeighborsValue()
|
inline |
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 extremelly 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;
- Returns
- The enum numeric value on the wire for useRelocateNeighbors.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 1778 of file RoutingSearchParameters.java.
◆ getUseRelocatePair()
|
inline |
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;
- Returns
- The useRelocatePair.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 1702 of file RoutingSearchParameters.java.
◆ getUseRelocatePairValue()
|
inline |
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;
- Returns
- The enum numeric value on the wire for useRelocatePair.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 1683 of file RoutingSearchParameters.java.
◆ getUseRelocateSubtrip()
|
inline |
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;
- Returns
- The useRelocateSubtrip.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 1859 of file RoutingSearchParameters.java.
◆ getUseRelocateSubtripValue()
|
inline |
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;
- Returns
- The enum numeric value on the wire for useRelocateSubtrip.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 1837 of file RoutingSearchParameters.java.
◆ getUseRelocateValue()
|
inline |
--- 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;
- Returns
- The enum numeric value on the wire for useRelocate.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 1640 of file RoutingSearchParameters.java.
◆ getUseSwapActive()
|
inline |
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;
- Returns
- The useSwapActive.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2434 of file RoutingSearchParameters.java.
◆ getUseSwapActiveValue()
|
inline |
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;
- Returns
- The enum numeric value on the wire for useSwapActive.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2419 of file RoutingSearchParameters.java.
◆ getUseTspLns()
|
inline |
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;
- Returns
- The useTspLns.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2631 of file RoutingSearchParameters.java.
◆ getUseTspLnsValue()
|
inline |
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;
- Returns
- The enum numeric value on the wire for useTspLns.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2615 of file RoutingSearchParameters.java.
◆ getUseTspOpt()
|
inline |
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;
- Returns
- The useTspOpt.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2243 of file RoutingSearchParameters.java.
◆ getUseTspOptValue()
|
inline |
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;
- Returns
- The enum numeric value on the wire for useTspOpt.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2227 of file RoutingSearchParameters.java.
◆ getUseTwoOpt()
|
inline |
--- Intra-route operators --- Operator which reverves a sub-chain 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;
- Returns
- The useTwoOpt.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2126 of file RoutingSearchParameters.java.
◆ getUseTwoOptValue()
|
inline |
--- Intra-route operators --- Operator which reverves a sub-chain 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;
- Returns
- The enum numeric value on the wire for useTwoOpt.
Implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 2106 of file RoutingSearchParameters.java.
◆ hashCode()
|
inline |
Definition at line 3071 of file RoutingSearchParameters.java.
◆ internalGetFieldAccessorTable()
|
inlineprotected |
Definition at line 1616 of file RoutingSearchParameters.java.
◆ isInitialized()
|
inline |
Definition at line 2790 of file RoutingSearchParameters.java.
◆ newBuilder() [1/2]
|
inlinestatic |
Definition at line 3214 of file RoutingSearchParameters.java.
◆ newBuilder() [2/2]
|
inlinestatic |
Definition at line 3217 of file RoutingSearchParameters.java.
◆ newBuilderForType() [1/2]
|
inline |
Definition at line 3213 of file RoutingSearchParameters.java.
◆ newBuilderForType() [2/2]
|
inlineprotected |
Definition at line 3227 of file RoutingSearchParameters.java.
◆ newInstance()
|
inlineprotected |
Definition at line 1382 of file RoutingSearchParameters.java.
◆ parseDelimitedFrom() [1/2]
|
inlinestatic |
Definition at line 3186 of file RoutingSearchParameters.java.
◆ parseDelimitedFrom() [2/2]
|
inlinestatic |
Definition at line 3191 of file RoutingSearchParameters.java.
◆ parseFrom() [1/10]
|
inlinestatic |
Definition at line 3164 of file RoutingSearchParameters.java.
◆ parseFrom() [2/10]
|
inlinestatic |
Definition at line 3168 of file RoutingSearchParameters.java.
◆ parseFrom() [3/10]
|
inlinestatic |
Definition at line 3153 of file RoutingSearchParameters.java.
◆ parseFrom() [4/10]
|
inlinestatic |
Definition at line 3158 of file RoutingSearchParameters.java.
◆ parseFrom() [5/10]
|
inlinestatic |
Definition at line 3198 of file RoutingSearchParameters.java.
◆ parseFrom() [6/10]
|
inlinestatic |
Definition at line 3204 of file RoutingSearchParameters.java.
◆ parseFrom() [7/10]
|
inlinestatic |
Definition at line 3174 of file RoutingSearchParameters.java.
◆ parseFrom() [8/10]
|
inlinestatic |
Definition at line 3179 of file RoutingSearchParameters.java.
◆ parseFrom() [9/10]
|
inlinestatic |
Definition at line 3142 of file RoutingSearchParameters.java.
◆ parseFrom() [10/10]
|
inlinestatic |
Definition at line 3147 of file RoutingSearchParameters.java.
◆ parser()
|
inlinestatic |
Definition at line 6704 of file RoutingSearchParameters.java.
◆ toBuilder()
|
inline |
Definition at line 3221 of file RoutingSearchParameters.java.
◆ writeTo()
|
inline |
Definition at line 2800 of file RoutingSearchParameters.java.
Member Data Documentation
◆ USE_CROSS_EXCHANGE_FIELD_NUMBER
|
static |
Definition at line 2015 of file RoutingSearchParameters.java.
◆ USE_CROSS_FIELD_NUMBER
|
static |
Definition at line 1972 of file RoutingSearchParameters.java.
◆ USE_EXCHANGE_FIELD_NUMBER
|
static |
Definition at line 1865 of file RoutingSearchParameters.java.
◆ USE_EXCHANGE_PAIR_FIELD_NUMBER
|
static |
Definition at line 1904 of file RoutingSearchParameters.java.
◆ USE_EXCHANGE_SUBTRIP_FIELD_NUMBER
|
static |
Definition at line 1943 of file RoutingSearchParameters.java.
◆ USE_EXTENDED_SWAP_ACTIVE_FIELD_NUMBER
|
static |
Definition at line 2440 of file RoutingSearchParameters.java.
◆ USE_FULL_PATH_LNS_FIELD_NUMBER
|
static |
Definition at line 2573 of file RoutingSearchParameters.java.
◆ USE_GLOBAL_CHEAPEST_INSERTION_EXPENSIVE_CHAIN_LNS_FIELD_NUMBER
|
static |
Definition at line 2726 of file RoutingSearchParameters.java.
◆ USE_GLOBAL_CHEAPEST_INSERTION_PATH_LNS_FIELD_NUMBER
|
static |
Definition at line 2668 of file RoutingSearchParameters.java.
◆ USE_INACTIVE_LNS_FIELD_NUMBER
|
static |
Definition at line 2637 of file RoutingSearchParameters.java.
◆ USE_LIGHT_RELOCATE_PAIR_FIELD_NUMBER
|
static |
Definition at line 1708 of file RoutingSearchParameters.java.
◆ USE_LIN_KERNIGHAN_FIELD_NUMBER
|
static |
Definition at line 2179 of file RoutingSearchParameters.java.
◆ USE_LOCAL_CHEAPEST_INSERTION_EXPENSIVE_CHAIN_LNS_FIELD_NUMBER
|
static |
Definition at line 2759 of file RoutingSearchParameters.java.
◆ USE_LOCAL_CHEAPEST_INSERTION_PATH_LNS_FIELD_NUMBER
|
static |
Definition at line 2699 of file RoutingSearchParameters.java.
◆ USE_MAKE_ACTIVE_FIELD_NUMBER
|
static |
Definition at line 2249 of file RoutingSearchParameters.java.
◆ USE_MAKE_CHAIN_INACTIVE_FIELD_NUMBER
|
static |
Definition at line 2368 of file RoutingSearchParameters.java.
◆ USE_MAKE_INACTIVE_FIELD_NUMBER
|
static |
Definition at line 2333 of file RoutingSearchParameters.java.
◆ USE_NODE_PAIR_SWAP_ACTIVE_FIELD_NUMBER
|
static |
Definition at line 2485 of file RoutingSearchParameters.java.
◆ USE_OR_OPT_FIELD_NUMBER
|
static |
Definition at line 2132 of file RoutingSearchParameters.java.
◆ USE_PATH_LNS_FIELD_NUMBER
|
static |
Definition at line 2532 of file RoutingSearchParameters.java.
◆ USE_RELOCATE_AND_MAKE_ACTIVE_FIELD_NUMBER
|
static |
Definition at line 2288 of file RoutingSearchParameters.java.
◆ USE_RELOCATE_EXPENSIVE_CHAIN_FIELD_NUMBER
|
static |
Definition at line 2042 of file RoutingSearchParameters.java.
◆ USE_RELOCATE_FIELD_NUMBER
|
static |
Definition at line 1622 of file RoutingSearchParameters.java.
◆ USE_RELOCATE_NEIGHBORS_FIELD_NUMBER
|
static |
Definition at line 1747 of file RoutingSearchParameters.java.
◆ USE_RELOCATE_PAIR_FIELD_NUMBER
|
static |
Definition at line 1665 of file RoutingSearchParameters.java.
◆ USE_RELOCATE_SUBTRIP_FIELD_NUMBER
|
static |
Definition at line 1816 of file RoutingSearchParameters.java.
◆ USE_SWAP_ACTIVE_FIELD_NUMBER
|
static |
Definition at line 2405 of file RoutingSearchParameters.java.
◆ USE_TSP_LNS_FIELD_NUMBER
|
static |
Definition at line 2600 of file RoutingSearchParameters.java.
◆ USE_TSP_OPT_FIELD_NUMBER
|
static |
Definition at line 2212 of file RoutingSearchParameters.java.
◆ USE_TWO_OPT_FIELD_NUMBER
|
static |
Definition at line 2087 of file RoutingSearchParameters.java.
The documentation for this class was generated from the following file: