Java Reference
Java Reference
Detailed Description
Local search neighborhood operators used to build a solutions neighborhood. Next ID: 31
Protobuf type
Definition at line 3240 of file RoutingSearchParameters.java.
Static Public Member Functions | |
| static final com.google.protobuf.Descriptors.Descriptor | getDescriptor () |
Protected Member Functions | |
| .lang.Override com.google.protobuf.GeneratedMessageV3.FieldAccessorTable | internalGetFieldAccessorTable () |
Member Function Documentation
◆ addRepeatedField()
|
inline |
Definition at line 3422 of file RoutingSearchParameters.java.
◆ build()
|
inline |
Definition at line 3350 of file RoutingSearchParameters.java.
◆ buildPartial()
|
inline |
Definition at line 3359 of file RoutingSearchParameters.java.
◆ clear()
|
inline |
Definition at line 3273 of file RoutingSearchParameters.java.
◆ clearField()
|
inline |
Definition at line 3406 of file RoutingSearchParameters.java.
◆ clearOneof()
|
inline |
Definition at line 3411 of file RoutingSearchParameters.java.
◆ clearUseCross()
|
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
- This builder for chaining.
Definition at line 4592 of file RoutingSearchParameters.java.
◆ clearUseCrossExchange()
|
inline |
Not implemented yet. TODO(b/68128619): Implement.
.operations_research.OptionalBoolean use_cross_exchange = 6;
- Returns
- This builder for chaining.
Definition at line 4666 of file RoutingSearchParameters.java.
◆ clearUseExchange()
|
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
- This builder for chaining.
Definition at line 4295 of file RoutingSearchParameters.java.
◆ clearUseExchangePair()
|
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
- This builder for chaining.
Definition at line 4399 of file RoutingSearchParameters.java.
◆ clearUseExchangeSubtrip()
|
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
- This builder for chaining.
Definition at line 4478 of file RoutingSearchParameters.java.
◆ clearUseExtendedSwapActive()
|
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
- This builder for chaining.
Definition at line 5845 of file RoutingSearchParameters.java.
◆ clearUseFullPathLns()
|
inline |
Operator which relaxes one entire path and all unactive nodes.
.operations_research.OptionalBoolean use_full_path_lns = 17;
- Returns
- This builder for chaining.
Definition at line 6152 of file RoutingSearchParameters.java.
◆ clearUseGlobalCheapestInsertionExpensiveChainLns()
|
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
- This builder for chaining.
Definition at line 6582 of file RoutingSearchParameters.java.
◆ clearUseGlobalCheapestInsertionPathLns()
|
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
- This builder for chaining.
Definition at line 6419 of file RoutingSearchParameters.java.
◆ clearUseInactiveLns()
|
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
- This builder for chaining.
Definition at line 6335 of file RoutingSearchParameters.java.
◆ clearUseLightRelocatePair()
|
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
- This builder for chaining.
Definition at line 3883 of file RoutingSearchParameters.java.
◆ clearUseLinKernighan()
|
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
- This builder for chaining.
Definition at line 5117 of file RoutingSearchParameters.java.
◆ clearUseLocalCheapestInsertionExpensiveChainLns()
|
inline |
Same as above but using LocalCheapestInsertion as a heuristic for insertion.
.operations_research.OptionalBoolean use_local_cheapest_insertion_expensive_chain_lns = 30;
- Returns
- This builder for chaining.
Definition at line 6661 of file RoutingSearchParameters.java.
◆ clearUseLocalCheapestInsertionPathLns()
|
inline |
Same as above but using LocalCheapestInsertion as a heuristic.
.operations_research.OptionalBoolean use_local_cheapest_insertion_path_lns = 28;
- Returns
- This builder for chaining.
Definition at line 6493 of file RoutingSearchParameters.java.
◆ clearUseMakeActive()
|
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
- This builder for chaining.
Definition at line 5320 of file RoutingSearchParameters.java.
◆ clearUseMakeChainInactive()
|
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
- This builder for chaining.
Definition at line 5632 of file RoutingSearchParameters.java.
◆ clearUseMakeInactive()
|
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
- This builder for chaining.
Definition at line 5533 of file RoutingSearchParameters.java.
◆ clearUseNodePairSwapActive()
|
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
- This builder for chaining.
Definition at line 5969 of file RoutingSearchParameters.java.
◆ clearUseOrOpt()
|
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
- This builder for chaining.
Definition at line 5028 of file RoutingSearchParameters.java.
◆ clearUsePathLns()
|
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
- This builder for chaining.
Definition at line 6078 of file RoutingSearchParameters.java.
◆ clearUseRelocate()
|
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
- This builder for chaining.
Definition at line 3665 of file RoutingSearchParameters.java.
◆ clearUseRelocateAndMakeActive()
|
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
- This builder for chaining.
Definition at line 5439 of file RoutingSearchParameters.java.
◆ clearUseRelocateExpensiveChain()
|
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
- This builder for chaining.
Definition at line 4785 of file RoutingSearchParameters.java.
◆ clearUseRelocateNeighbors()
|
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
- This builder for chaining.
Definition at line 4062 of file RoutingSearchParameters.java.
◆ clearUseRelocatePair()
|
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
- This builder for chaining.
Definition at line 3779 of file RoutingSearchParameters.java.
◆ clearUseRelocateSubtrip()
|
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
- This builder for chaining.
Definition at line 4191 of file RoutingSearchParameters.java.
◆ clearUseSwapActive()
|
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
- This builder for chaining.
Definition at line 5726 of file RoutingSearchParameters.java.
◆ clearUseTspLns()
|
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
- This builder for chaining.
Definition at line 6251 of file RoutingSearchParameters.java.
◆ clearUseTspOpt()
|
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
- This builder for chaining.
Definition at line 5216 of file RoutingSearchParameters.java.
◆ clearUseTwoOpt()
|
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
- This builder for chaining.
Definition at line 4904 of file RoutingSearchParameters.java.
◆ clone()
|
inline |
Definition at line 3396 of file RoutingSearchParameters.java.
◆ getDefaultInstanceForType()
|
inline |
Definition at line 3345 of file RoutingSearchParameters.java.
◆ getDescriptor()
|
inlinestatic |
Definition at line 3245 of file RoutingSearchParameters.java.
◆ getDescriptorForType()
|
inline |
Definition at line 3340 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 4545 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 4635 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 4608 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 4502 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 4252 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 4356 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 4317 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 4445 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 4416 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 4213 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 5796 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 5751 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 6121 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 6094 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 6545 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 6512 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 6384 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 6353 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 6300 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 6269 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 3840 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 3801 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 5080 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 5047 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 6628 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 6599 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 6462 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 6435 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 5277 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 5238 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 5591 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 5554 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 5494 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 5459 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 5918 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 5871 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 4977 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 4930 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 6033 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 5992 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 3618 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 5390 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 5345 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 4736 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 4691 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 3989 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 3920 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 3732 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 3689 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 4138 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 4089 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 3575 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 5687 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 5652 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 6210 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 6173 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 5175 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 5138 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 4855 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 4810 of file RoutingSearchParameters.java.
◆ internalGetFieldAccessorTable()
|
inlineprotected |
Definition at line 3251 of file RoutingSearchParameters.java.
◆ isInitialized()
|
inline |
Definition at line 3535 of file RoutingSearchParameters.java.
◆ mergeFrom() [1/3]
|
inline |
Definition at line 3437 of file RoutingSearchParameters.java.
◆ mergeFrom() [2/3]
|
inline |
Definition at line 3540 of file RoutingSearchParameters.java.
◆ mergeFrom() [3/3]
|
inline |
Definition at line 3428 of file RoutingSearchParameters.java.
◆ mergeUnknownFields()
|
inline |
Definition at line 6674 of file RoutingSearchParameters.java.
◆ setField()
|
inline |
Definition at line 3400 of file RoutingSearchParameters.java.
◆ setRepeatedField()
|
inline |
Definition at line 3416 of file RoutingSearchParameters.java.
◆ setUnknownFields()
|
inline |
Definition at line 6668 of file RoutingSearchParameters.java.
◆ setUseCross()
|
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;
- Parameters
-
value The useCross to set.
- Returns
- This builder for chaining.
Definition at line 4567 of file RoutingSearchParameters.java.
◆ setUseCrossExchange()
|
inline |
Not implemented yet. TODO(b/68128619): Implement.
.operations_research.OptionalBoolean use_cross_exchange = 6;
- Parameters
-
value The useCrossExchange to set.
- Returns
- This builder for chaining.
Definition at line 4649 of file RoutingSearchParameters.java.
◆ setUseCrossExchangeValue()
|
inline |
Not implemented yet. TODO(b/68128619): Implement.
.operations_research.OptionalBoolean use_cross_exchange = 6;
- Parameters
-
value The enum numeric value on the wire for useCrossExchange to set.
- Returns
- This builder for chaining.
Definition at line 4620 of file RoutingSearchParameters.java.
◆ setUseCrossValue()
|
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;
- Parameters
-
value The enum numeric value on the wire for useCross to set.
- Returns
- This builder for chaining.
Definition at line 4522 of file RoutingSearchParameters.java.
◆ setUseExchange()
|
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;
- Parameters
-
value The useExchange to set.
- Returns
- This builder for chaining.
Definition at line 4272 of file RoutingSearchParameters.java.
◆ setUseExchangePair()
|
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;
- Parameters
-
value The useExchangePair to set.
- Returns
- This builder for chaining.
Definition at line 4376 of file RoutingSearchParameters.java.
◆ setUseExchangePairValue()
|
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;
- Parameters
-
value The enum numeric value on the wire for useExchangePair to set.
- Returns
- This builder for chaining.
Definition at line 4335 of file RoutingSearchParameters.java.
◆ setUseExchangeSubtrip()
|
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;
- Parameters
-
value The useExchangeSubtrip to set.
- Returns
- This builder for chaining.
Definition at line 4460 of file RoutingSearchParameters.java.
◆ setUseExchangeSubtripValue()
|
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;
- Parameters
-
value The enum numeric value on the wire for useExchangeSubtrip to set.
- Returns
- This builder for chaining.
Definition at line 4429 of file RoutingSearchParameters.java.
◆ setUseExchangeValue()
|
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;
- Parameters
-
value The enum numeric value on the wire for useExchange to set.
- Returns
- This builder for chaining.
Definition at line 4231 of file RoutingSearchParameters.java.
◆ setUseExtendedSwapActive()
|
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;
- Parameters
-
value The useExtendedSwapActive to set.
- Returns
- This builder for chaining.
Definition at line 5819 of file RoutingSearchParameters.java.
◆ setUseExtendedSwapActiveValue()
|
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;
- Parameters
-
value The enum numeric value on the wire for useExtendedSwapActive to set.
- Returns
- This builder for chaining.
Definition at line 5772 of file RoutingSearchParameters.java.
◆ setUseFullPathLns()
|
inline |
Operator which relaxes one entire path and all unactive nodes.
.operations_research.OptionalBoolean use_full_path_lns = 17;
- Parameters
-
value The useFullPathLns to set.
- Returns
- This builder for chaining.
Definition at line 6135 of file RoutingSearchParameters.java.
◆ setUseFullPathLnsValue()
|
inline |
Operator which relaxes one entire path and all unactive nodes.
.operations_research.OptionalBoolean use_full_path_lns = 17;
- Parameters
-
value The enum numeric value on the wire for useFullPathLns to set.
- Returns
- This builder for chaining.
Definition at line 6106 of file RoutingSearchParameters.java.
◆ setUseGlobalCheapestInsertionExpensiveChainLns()
|
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;
- Parameters
-
value The useGlobalCheapestInsertionExpensiveChainLns to set.
- Returns
- This builder for chaining.
Definition at line 6562 of file RoutingSearchParameters.java.
◆ setUseGlobalCheapestInsertionExpensiveChainLnsValue()
|
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;
- Parameters
-
value The enum numeric value on the wire for useGlobalCheapestInsertionExpensiveChainLns to set.
- Returns
- This builder for chaining.
Definition at line 6527 of file RoutingSearchParameters.java.
◆ setUseGlobalCheapestInsertionPathLns()
|
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;
- Parameters
-
value The useGlobalCheapestInsertionPathLns to set.
- Returns
- This builder for chaining.
Definition at line 6400 of file RoutingSearchParameters.java.
◆ setUseGlobalCheapestInsertionPathLnsValue()
|
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;
- Parameters
-
value The enum numeric value on the wire for useGlobalCheapestInsertionPathLns to set.
- Returns
- This builder for chaining.
Definition at line 6367 of file RoutingSearchParameters.java.
◆ setUseInactiveLns()
|
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;
- Parameters
-
value The useInactiveLns to set.
- Returns
- This builder for chaining.
Definition at line 6316 of file RoutingSearchParameters.java.
◆ setUseInactiveLnsValue()
|
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;
- Parameters
-
value The enum numeric value on the wire for useInactiveLns to set.
- Returns
- This builder for chaining.
Definition at line 6283 of file RoutingSearchParameters.java.
◆ setUseLightRelocatePair()
|
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;
- Parameters
-
value The useLightRelocatePair to set.
- Returns
- This builder for chaining.
Definition at line 3860 of file RoutingSearchParameters.java.
◆ setUseLightRelocatePairValue()
|
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;
- Parameters
-
value The enum numeric value on the wire for useLightRelocatePair to set.
- Returns
- This builder for chaining.
Definition at line 3819 of file RoutingSearchParameters.java.
◆ setUseLinKernighan()
|
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;
- Parameters
-
value The useLinKernighan to set.
- Returns
- This builder for chaining.
Definition at line 5097 of file RoutingSearchParameters.java.
◆ setUseLinKernighanValue()
|
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;
- Parameters
-
value The enum numeric value on the wire for useLinKernighan to set.
- Returns
- This builder for chaining.
Definition at line 5062 of file RoutingSearchParameters.java.
◆ setUseLocalCheapestInsertionExpensiveChainLns()
|
inline |
Same as above but using LocalCheapestInsertion as a heuristic for insertion.
.operations_research.OptionalBoolean use_local_cheapest_insertion_expensive_chain_lns = 30;
- Parameters
-
value The useLocalCheapestInsertionExpensiveChainLns to set.
- Returns
- This builder for chaining.
Definition at line 6643 of file RoutingSearchParameters.java.
◆ setUseLocalCheapestInsertionExpensiveChainLnsValue()
|
inline |
Same as above but using LocalCheapestInsertion as a heuristic for insertion.
.operations_research.OptionalBoolean use_local_cheapest_insertion_expensive_chain_lns = 30;
- Parameters
-
value The enum numeric value on the wire for useLocalCheapestInsertionExpensiveChainLns to set.
- Returns
- This builder for chaining.
Definition at line 6612 of file RoutingSearchParameters.java.
◆ setUseLocalCheapestInsertionPathLns()
|
inline |
Same as above but using LocalCheapestInsertion as a heuristic.
.operations_research.OptionalBoolean use_local_cheapest_insertion_path_lns = 28;
- Parameters
-
value The useLocalCheapestInsertionPathLns to set.
- Returns
- This builder for chaining.
Definition at line 6476 of file RoutingSearchParameters.java.
◆ setUseLocalCheapestInsertionPathLnsValue()
|
inline |
Same as above but using LocalCheapestInsertion as a heuristic.
.operations_research.OptionalBoolean use_local_cheapest_insertion_path_lns = 28;
- Parameters
-
value The enum numeric value on the wire for useLocalCheapestInsertionPathLns to set.
- Returns
- This builder for chaining.
Definition at line 6447 of file RoutingSearchParameters.java.
◆ setUseMakeActive()
|
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;
- Parameters
-
value The useMakeActive to set.
- Returns
- This builder for chaining.
Definition at line 5297 of file RoutingSearchParameters.java.
◆ setUseMakeActiveValue()
|
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;
- Parameters
-
value The enum numeric value on the wire for useMakeActive to set.
- Returns
- This builder for chaining.
Definition at line 5256 of file RoutingSearchParameters.java.
◆ setUseMakeChainInactive()
|
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;
- Parameters
-
value The useMakeChainInactive to set.
- Returns
- This builder for chaining.
Definition at line 5610 of file RoutingSearchParameters.java.
◆ setUseMakeChainInactiveValue()
|
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;
- Parameters
-
value The enum numeric value on the wire for useMakeChainInactive to set.
- Returns
- This builder for chaining.
Definition at line 5571 of file RoutingSearchParameters.java.
◆ setUseMakeInactive()
|
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;
- Parameters
-
value The useMakeInactive to set.
- Returns
- This builder for chaining.
Definition at line 5512 of file RoutingSearchParameters.java.
◆ setUseMakeInactiveValue()
|
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;
- Parameters
-
value The enum numeric value on the wire for useMakeInactive to set.
- Returns
- This builder for chaining.
Definition at line 5475 of file RoutingSearchParameters.java.
◆ setUseNodePairSwapActive()
|
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;
- Parameters
-
value The useNodePairSwapActive to set.
- Returns
- This builder for chaining.
Definition at line 5942 of file RoutingSearchParameters.java.
◆ setUseNodePairSwapActiveValue()
|
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;
- Parameters
-
value The enum numeric value on the wire for useNodePairSwapActive to set.
- Returns
- This builder for chaining.
Definition at line 5893 of file RoutingSearchParameters.java.
◆ setUseOrOpt()
|
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;
- Parameters
-
value The useOrOpt to set.
- Returns
- This builder for chaining.
Definition at line 5001 of file RoutingSearchParameters.java.
◆ setUseOrOptValue()
|
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;
- Parameters
-
value The enum numeric value on the wire for useOrOpt to set.
- Returns
- This builder for chaining.
Definition at line 4952 of file RoutingSearchParameters.java.
◆ setUsePathLns()
|
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;
- Parameters
-
value The usePathLns to set.
- Returns
- This builder for chaining.
Definition at line 6054 of file RoutingSearchParameters.java.
◆ setUsePathLnsValue()
|
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;
- Parameters
-
value The enum numeric value on the wire for usePathLns to set.
- Returns
- This builder for chaining.
Definition at line 6011 of file RoutingSearchParameters.java.
◆ setUseRelocate()
|
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;
- Parameters
-
value The useRelocate to set.
- Returns
- This builder for chaining.
Definition at line 3640 of file RoutingSearchParameters.java.
◆ setUseRelocateAndMakeActive()
|
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;
- Parameters
-
value The useRelocateAndMakeActive to set.
- Returns
- This builder for chaining.
Definition at line 5413 of file RoutingSearchParameters.java.
◆ setUseRelocateAndMakeActiveValue()
|
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;
- Parameters
-
value The enum numeric value on the wire for useRelocateAndMakeActive to set.
- Returns
- This builder for chaining.
Definition at line 5366 of file RoutingSearchParameters.java.
◆ setUseRelocateExpensiveChain()
|
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;
- Parameters
-
value The useRelocateExpensiveChain to set.
- Returns
- This builder for chaining.
Definition at line 4759 of file RoutingSearchParameters.java.
◆ setUseRelocateExpensiveChainValue()
|
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;
- Parameters
-
value The enum numeric value on the wire for useRelocateExpensiveChain to set.
- Returns
- This builder for chaining.
Definition at line 4712 of file RoutingSearchParameters.java.
◆ setUseRelocateNeighbors()
|
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;
- Parameters
-
value The useRelocateNeighbors to set.
- Returns
- This builder for chaining.
Definition at line 4024 of file RoutingSearchParameters.java.
◆ setUseRelocateNeighborsValue()
|
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;
- Parameters
-
value The enum numeric value on the wire for useRelocateNeighbors to set.
- Returns
- This builder for chaining.
Definition at line 3953 of file RoutingSearchParameters.java.
◆ setUseRelocatePair()
|
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;
- Parameters
-
value The useRelocatePair to set.
- Returns
- This builder for chaining.
Definition at line 3754 of file RoutingSearchParameters.java.
◆ setUseRelocatePairValue()
|
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;
- Parameters
-
value The enum numeric value on the wire for useRelocatePair to set.
- Returns
- This builder for chaining.
Definition at line 3709 of file RoutingSearchParameters.java.
◆ setUseRelocateSubtrip()
|
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;
- Parameters
-
value The useRelocateSubtrip to set.
- Returns
- This builder for chaining.
Definition at line 4163 of file RoutingSearchParameters.java.
◆ setUseRelocateSubtripValue()
|
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;
- Parameters
-
value The enum numeric value on the wire for useRelocateSubtrip to set.
- Returns
- This builder for chaining.
Definition at line 4112 of file RoutingSearchParameters.java.
◆ setUseRelocateValue()
|
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;
- Parameters
-
value The enum numeric value on the wire for useRelocate to set.
- Returns
- This builder for chaining.
Definition at line 3595 of file RoutingSearchParameters.java.
◆ setUseSwapActive()
|
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;
- Parameters
-
value The useSwapActive to set.
- Returns
- This builder for chaining.
Definition at line 5705 of file RoutingSearchParameters.java.
◆ setUseSwapActiveValue()
|
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;
- Parameters
-
value The enum numeric value on the wire for useSwapActive to set.
- Returns
- This builder for chaining.
Definition at line 5668 of file RoutingSearchParameters.java.
◆ setUseTspLns()
|
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;
- Parameters
-
value The useTspLns to set.
- Returns
- This builder for chaining.
Definition at line 6229 of file RoutingSearchParameters.java.
◆ setUseTspLnsValue()
|
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;
- Parameters
-
value The enum numeric value on the wire for useTspLns to set.
- Returns
- This builder for chaining.
Definition at line 6190 of file RoutingSearchParameters.java.
◆ setUseTspOpt()
|
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;
- Parameters
-
value The useTspOpt to set.
- Returns
- This builder for chaining.
Definition at line 5194 of file RoutingSearchParameters.java.
◆ setUseTspOptValue()
|
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;
- Parameters
-
value The enum numeric value on the wire for useTspOpt to set.
- Returns
- This builder for chaining.
Definition at line 5155 of file RoutingSearchParameters.java.
◆ setUseTwoOpt()
|
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;
- Parameters
-
value The useTwoOpt to set.
- Returns
- This builder for chaining.
Definition at line 4878 of file RoutingSearchParameters.java.
◆ setUseTwoOptValue()
|
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;
- Parameters
-
value The enum numeric value on the wire for useTwoOpt to set.
- Returns
- This builder for chaining.
Definition at line 4831 of file RoutingSearchParameters.java.
The documentation for this class was generated from the following file: