 |
Google OR-Tools v9.9
a fast and portable software suite for combinatorial optimization
|
|
Google OR-Tools v9.9
a fast and portable software suite for combinatorial optimization
|
Static Public Member Functions | |
| static final com.google.protobuf.Descriptors.Descriptor | getDescriptor () |
Protected Member Functions | |
| com.google.protobuf.GeneratedMessageV3.FieldAccessorTable | internalGetFieldAccessorTable () |
Local search neighborhood operators used to build a solutions neighborhood. Next ID: 35
Protobuf type operations_research.RoutingSearchParameters.LocalSearchNeighborhoodOperators
Definition at line 3222 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.addRepeatedField | ( | com.google.protobuf.Descriptors.FieldDescriptor | field, |
| java.lang.Object | value ) |
Definition at line 3457 of file RoutingSearchParameters.java.
| com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.build | ( | ) |
Definition at line 3303 of file RoutingSearchParameters.java.
| com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.buildPartial | ( | ) |
Definition at line 3312 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.clear | ( | ) |
Definition at line 3250 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.clearField | ( | com.google.protobuf.Descriptors.FieldDescriptor | field | ) |
Definition at line 3441 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.clearOneof | ( | com.google.protobuf.Descriptors.OneofDescriptor | oneof | ) |
Definition at line 3446 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.clearUseCross | ( | ) |
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;
Definition at line 4825 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.clearUseCrossExchange | ( | ) |
Not implemented yet. TODO(b/68128619): Implement.
.operations_research.OptionalBoolean use_cross_exchange = 6;
Definition at line 4898 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.clearUseExchange | ( | ) |
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;
Definition at line 4531 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.clearUseExchangePair | ( | ) |
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;
Definition at line 4634 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.clearUseExchangeSubtrip | ( | ) |
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;
Definition at line 4712 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.clearUseExtendedSwapActive | ( | ) |
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;
Definition at line 6066 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.clearUseFullPathLns | ( | ) |
Operator which relaxes one entire path and all inactive nodes.
.operations_research.OptionalBoolean use_full_path_lns = 17;
Definition at line 6468 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.clearUseGlobalCheapestInsertionCloseNodesLns | ( | ) |
The following operator makes a node and its heuristic_close_nodes_lns_num_nodes closest neighbors unperformed along with each of their corresponding performed pickup/delivery pairs, and then reinserts them using the GlobalCheapestInsertion heuristic.
.operations_research.OptionalBoolean use_global_cheapest_insertion_close_nodes_lns = 31;
Definition at line 7142 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.clearUseGlobalCheapestInsertionExpensiveChainLns | ( | ) |
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;
Definition at line 6976 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.clearUseGlobalCheapestInsertionPathLns | ( | ) |
--- 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;
Definition at line 6732 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.clearUseInactiveLns | ( | ) |
Operator which relaxes all inactive nodes and one sub-chain of six consecutive arcs. That way the path can be improved by inserting inactive nodes or swapping arcs.
.operations_research.OptionalBoolean use_inactive_lns = 19;
Definition at line 6649 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.clearUseLightRelocatePair | ( | ) |
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;
Definition at line 4112 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.clearUseLinKernighan | ( | ) |
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;
Definition at line 5345 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.clearUseLocalCheapestInsertionCloseNodesLns | ( | ) |
Same as above, but insertion positions for nodes are determined by the LocalCheapestInsertion heuristic.
.operations_research.OptionalBoolean use_local_cheapest_insertion_close_nodes_lns = 32;
Definition at line 7220 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.clearUseLocalCheapestInsertionExpensiveChainLns | ( | ) |
Same as above but using LocalCheapestInsertion as a heuristic for insertion.
.operations_research.OptionalBoolean use_local_cheapest_insertion_expensive_chain_lns = 30;
Definition at line 7054 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.clearUseLocalCheapestInsertionPathLns | ( | ) |
Same as above but using LocalCheapestInsertion as a heuristic.
.operations_research.OptionalBoolean use_local_cheapest_insertion_path_lns = 28;
Definition at line 6805 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.clearUseMakeActive | ( | ) |
--- 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;
Definition at line 5546 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.clearUseMakeChainInactive | ( | ) |
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;
Definition at line 5855 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.clearUseMakeInactive | ( | ) |
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;
Definition at line 5757 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.clearUseNodePairSwapActive | ( | ) |
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;
Definition at line 6287 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.clearUseOrOpt | ( | ) |
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;
Definition at line 5257 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.clearUsePathLns | ( | ) |
--- 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;
Definition at line 6395 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.clearUseRelocate | ( | ) |
--- 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;
Definition at line 3896 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.clearUseRelocateAndMakeActive | ( | ) |
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;
Definition at line 5664 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.clearUseRelocateExpensiveChain | ( | ) |
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;
Definition at line 5016 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.clearUseRelocateNeighbors | ( | ) |
Relocate neighborhood which moves chains of neighbors. The operator starts by relocating a node n after a node m, then continues moving nodes which were after n as long as the "cost" added is less than the "cost" of the arc (m, n). If the new chain doesn't respect the domain of next variables, it will try reordering the nodes until it finds a valid path. Possible neighbors for path 1 -> A -> B -> C -> D -> E -> 2 (where (1, 2) are first and last nodes of the path and can therefore not be moved, A must be performed before B, and A, D and E are located at the same place): 1 -> A -> C -> [B] -> D -> E -> 2 1 -> A -> C -> D -> [B] -> E -> 2 1 -> A -> C -> D -> E -> [B] -> 2 1 -> A -> B -> D -> [C] -> E -> 2 1 -> A -> B -> D -> E -> [C] -> 2 1 -> A -> [D] -> [E] -> B -> C -> 2 1 -> A -> B -> [D] -> [E] -> C -> 2 1 -> A -> [E] -> B -> C -> D -> 2 1 -> A -> B -> [E] -> C -> D -> 2 1 -> A -> B -> C -> [E] -> D -> 2 This operator is extremely useful to move chains of nodes which are located at the same place (for instance nodes part of a same stop).
.operations_research.OptionalBoolean use_relocate_neighbors = 3;
Definition at line 4290 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.clearUseRelocatePair | ( | ) |
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;
Definition at line 4009 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.clearUseRelocatePathGlobalCheapestInsertionInsertUnperformed | ( | ) |
The following operator relocates an entire route to an empty path and then tries to insert the unperformed nodes using the global cheapest insertion heuristic.
.operations_research.OptionalBoolean use_relocate_path_global_cheapest_insertion_insert_unperformed = 33;
Definition at line 6888 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.clearUseRelocateSubtrip | ( | ) |
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;
Definition at line 4428 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.clearUseShortestPathSwapActive | ( | ) |
Swaps active nodes from node alternatives in sequence. Considers chains of nodes with alternatives, builds a DAG from the chain, each "layer" of the DAG being composed of the set of alternatives of the node at a given rank in the chain, fully connected to the next layer. A neighbor is built from the shortest path starting from the node before the chain (source), through the DAG to the node following the chain.
.operations_research.OptionalBoolean use_shortest_path_swap_active = 34;
Definition at line 6164 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.clearUseSwapActive | ( | ) |
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;
Definition at line 5948 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.clearUseTspLns | ( | ) |
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;
Definition at line 6566 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.clearUseTspOpt | ( | ) |
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;
Definition at line 5443 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.clearUseTwoOpt | ( | ) |
--- Intra-route operators --- Operator which reverses a subchain of a path. It is called TwoOpt because it breaks two arcs on the path; resulting paths are called two-optimal. Possible neighbors for the path 1 -> 2 -> 3 -> 4 -> 5 (where (1, 5) are first and last nodes of the path and can therefore not be moved): 1 -> [3 -> 2] -> 4 -> 5 1 -> [4 -> 3 -> 2] -> 5 1 -> 2 -> [4 -> 3] -> 5
.operations_research.OptionalBoolean use_two_opt = 7;
Definition at line 5134 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.clone | ( | ) |
Definition at line 3431 of file RoutingSearchParameters.java.
| com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getDefaultInstanceForType | ( | ) |
Definition at line 3298 of file RoutingSearchParameters.java.
|
static |
Definition at line 3227 of file RoutingSearchParameters.java.
| com.google.protobuf.Descriptors.Descriptor com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getDescriptorForType | ( | ) |
Definition at line 3293 of file RoutingSearchParameters.java.
| com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseCross | ( | ) |
Operator which cross exchanges the starting chains of 2 paths, including exchanging the whole paths. First and last nodes are not moved. Possible neighbors for the paths 1 -> 2 -> 3 -> 4 -> 5 and 6 -> 7 -> 8 (where (1, 5) and (6, 8) are first and last nodes of the paths and can therefore not be moved): 1 -> [7] -> 3 -> 4 -> 5 6 -> [2] -> 8 1 -> [7] -> 4 -> 5 6 -> [2 -> 3] -> 8 1 -> [7] -> 5 6 -> [2 -> 3 -> 4] -> 8
.operations_research.OptionalBoolean use_cross = 5;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 4779 of file RoutingSearchParameters.java.
| com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseCrossExchange | ( | ) |
Not implemented yet. TODO(b/68128619): Implement.
.operations_research.OptionalBoolean use_cross_exchange = 6;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 4868 of file RoutingSearchParameters.java.
| int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseCrossExchangeValue | ( | ) |
Not implemented yet. TODO(b/68128619): Implement.
.operations_research.OptionalBoolean use_cross_exchange = 6;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 4841 of file RoutingSearchParameters.java.
| int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseCrossValue | ( | ) |
Operator which cross exchanges the starting chains of 2 paths, including exchanging the whole paths. First and last nodes are not moved. Possible neighbors for the paths 1 -> 2 -> 3 -> 4 -> 5 and 6 -> 7 -> 8 (where (1, 5) and (6, 8) are first and last nodes of the paths and can therefore not be moved): 1 -> [7] -> 3 -> 4 -> 5 6 -> [2] -> 8 1 -> [7] -> 4 -> 5 6 -> [2 -> 3] -> 8 1 -> [7] -> 5 6 -> [2 -> 3 -> 4] -> 8
.operations_research.OptionalBoolean use_cross = 5;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 4736 of file RoutingSearchParameters.java.
| com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseExchange | ( | ) |
Operator which exchanges the positions of two nodes. Possible neighbors for the path 1 -> 2 -> 3 -> 4 -> 5 (where (1, 5) are first and last nodes of the path and can therefore not be moved): 1 -> [3] -> [2] -> 4 -> 5 1 -> [4] -> 3 -> [2] -> 5 1 -> 2 -> [4] -> [3] -> 5
.operations_research.OptionalBoolean use_exchange = 4;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 4489 of file RoutingSearchParameters.java.
| com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseExchangePair | ( | ) |
Operator which exchanges the positions of two pair of nodes. Pairs correspond to the pickup and delivery pairs defined in the routing model. Possible neighbor for the paths 1 -> A -> B -> 2 -> 3 and 4 -> C -> D -> 5 (where (1, 3) and (4, 5) are first and last nodes of the paths and can therefore not be moved, and (A, B) and (C,D) are pairs of nodes): 1 -> [C] -> [D] -> 2 -> 3, 4 -> [A] -> [B] -> 5
.operations_research.OptionalBoolean use_exchange_pair = 22;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 4592 of file RoutingSearchParameters.java.
| int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseExchangePairValue | ( | ) |
Operator which exchanges the positions of two pair of nodes. Pairs correspond to the pickup and delivery pairs defined in the routing model. Possible neighbor for the paths 1 -> A -> B -> 2 -> 3 and 4 -> C -> D -> 5 (where (1, 3) and (4, 5) are first and last nodes of the paths and can therefore not be moved, and (A, B) and (C,D) are pairs of nodes): 1 -> [C] -> [D] -> 2 -> 3, 4 -> [A] -> [B] -> 5
.operations_research.OptionalBoolean use_exchange_pair = 22;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 4553 of file RoutingSearchParameters.java.
| com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseExchangeSubtrip | ( | ) |
Operator which exchanges subtrips associated to two pairs of nodes, see use_relocate_subtrip for a definition of subtrips.
.operations_research.OptionalBoolean use_exchange_subtrip = 26;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 4680 of file RoutingSearchParameters.java.
| int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseExchangeSubtripValue | ( | ) |
Operator which exchanges subtrips associated to two pairs of nodes, see use_relocate_subtrip for a definition of subtrips.
.operations_research.OptionalBoolean use_exchange_subtrip = 26;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 4651 of file RoutingSearchParameters.java.
| int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseExchangeValue | ( | ) |
Operator which exchanges the positions of two nodes. Possible neighbors for the path 1 -> 2 -> 3 -> 4 -> 5 (where (1, 5) are first and last nodes of the path and can therefore not be moved): 1 -> [3] -> [2] -> 4 -> 5 1 -> [4] -> 3 -> [2] -> 5 1 -> 2 -> [4] -> [3] -> 5
.operations_research.OptionalBoolean use_exchange = 4;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 4450 of file RoutingSearchParameters.java.
| com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseExtendedSwapActive | ( | ) |
Operator which makes an inactive node active and an active one inactive. It is similar to SwapActiveOperator excepts that it tries to insert the inactive node in all possible positions instead of just the position of the node made inactive. Possible neighbors for the path 1 -> 2 -> 3 -> 4 with 5 inactive (where 1 and 4 are first and last nodes of the path) are: 1 -> [5] -> 3 -> 4 with 2 inactive 1 -> 3 -> [5] -> 4 with 2 inactive 1 -> [5] -> 2 -> 4 with 3 inactive 1 -> 2 -> [5] -> 4 with 3 inactive
.operations_research.OptionalBoolean use_extended_swap_active = 15;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 6018 of file RoutingSearchParameters.java.
| int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseExtendedSwapActiveValue | ( | ) |
Operator which makes an inactive node active and an active one inactive. It is similar to SwapActiveOperator excepts that it tries to insert the inactive node in all possible positions instead of just the position of the node made inactive. Possible neighbors for the path 1 -> 2 -> 3 -> 4 with 5 inactive (where 1 and 4 are first and last nodes of the path) are: 1 -> [5] -> 3 -> 4 with 2 inactive 1 -> 3 -> [5] -> 4 with 2 inactive 1 -> [5] -> 2 -> 4 with 3 inactive 1 -> 2 -> [5] -> 4 with 3 inactive
.operations_research.OptionalBoolean use_extended_swap_active = 15;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 5973 of file RoutingSearchParameters.java.
| com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseFullPathLns | ( | ) |
Operator which relaxes one entire path and all inactive nodes.
.operations_research.OptionalBoolean use_full_path_lns = 17;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 6438 of file RoutingSearchParameters.java.
| int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseFullPathLnsValue | ( | ) |
Operator which relaxes one entire path and all inactive nodes.
.operations_research.OptionalBoolean use_full_path_lns = 17;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 6411 of file RoutingSearchParameters.java.
| com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseGlobalCheapestInsertionCloseNodesLns | ( | ) |
The following operator makes a node and its heuristic_close_nodes_lns_num_nodes closest neighbors unperformed along with each of their corresponding performed pickup/delivery pairs, and then reinserts them using the GlobalCheapestInsertion heuristic.
.operations_research.OptionalBoolean use_global_cheapest_insertion_close_nodes_lns = 31;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 7106 of file RoutingSearchParameters.java.
| int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseGlobalCheapestInsertionCloseNodesLnsValue | ( | ) |
The following operator makes a node and its heuristic_close_nodes_lns_num_nodes closest neighbors unperformed along with each of their corresponding performed pickup/delivery pairs, and then reinserts them using the GlobalCheapestInsertion heuristic.
.operations_research.OptionalBoolean use_global_cheapest_insertion_close_nodes_lns = 31;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 7073 of file RoutingSearchParameters.java.
| com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseGlobalCheapestInsertionExpensiveChainLns | ( | ) |
This operator finds heuristic_expensive_chain_lns_num_arcs_to_consider most expensive arcs on a route, makes the nodes in between pairs of these expensive arcs unperformed, and reinserts them using the GlobalCheapestInsertion heuristic.
.operations_research.OptionalBoolean use_global_cheapest_insertion_expensive_chain_lns = 29;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 6940 of file RoutingSearchParameters.java.
| int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseGlobalCheapestInsertionExpensiveChainLnsValue | ( | ) |
This operator finds heuristic_expensive_chain_lns_num_arcs_to_consider most expensive arcs on a route, makes the nodes in between pairs of these expensive arcs unperformed, and reinserts them using the GlobalCheapestInsertion heuristic.
.operations_research.OptionalBoolean use_global_cheapest_insertion_expensive_chain_lns = 29;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 6907 of file RoutingSearchParameters.java.
| com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseGlobalCheapestInsertionPathLns | ( | ) |
--- LNS-like large neighborhood search operators using heuristics --- Operator which makes all nodes on a route unperformed, and reinserts them using the GlobalCheapestInsertion heuristic.
.operations_research.OptionalBoolean use_global_cheapest_insertion_path_lns = 27;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 6698 of file RoutingSearchParameters.java.
| int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseGlobalCheapestInsertionPathLnsValue | ( | ) |
--- LNS-like large neighborhood search operators using heuristics --- Operator which makes all nodes on a route unperformed, and reinserts them using the GlobalCheapestInsertion heuristic.
.operations_research.OptionalBoolean use_global_cheapest_insertion_path_lns = 27;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 6667 of file RoutingSearchParameters.java.
| com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseInactiveLns | ( | ) |
Operator which relaxes all inactive nodes and one sub-chain of six consecutive arcs. That way the path can be improved by inserting inactive nodes or swapping arcs.
.operations_research.OptionalBoolean use_inactive_lns = 19;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 6615 of file RoutingSearchParameters.java.
| int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseInactiveLnsValue | ( | ) |
Operator which relaxes all inactive nodes and one sub-chain of six consecutive arcs. That way the path can be improved by inserting inactive nodes or swapping arcs.
.operations_research.OptionalBoolean use_inactive_lns = 19;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 6584 of file RoutingSearchParameters.java.
| com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseLightRelocatePair | ( | ) |
Operator which moves a pair of pickup and delivery nodes after another pair. Possible neighbors for paths 1 -> A -> B -> 2, 3 -> C -> D -> 4 (where (1, 2) and (3, 4) are first and last nodes of paths and can therefore not be moved, and (A, B) and (C, D) are pair of nodes): 1 -> 2, 3 -> C -> [A] -> D -> [B] -> 4 1 -> A -> [C] -> B -> [D] -> 2, 3 -> 4
.operations_research.OptionalBoolean use_light_relocate_pair = 24;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 4070 of file RoutingSearchParameters.java.
| int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseLightRelocatePairValue | ( | ) |
Operator which moves a pair of pickup and delivery nodes after another pair. Possible neighbors for paths 1 -> A -> B -> 2, 3 -> C -> D -> 4 (where (1, 2) and (3, 4) are first and last nodes of paths and can therefore not be moved, and (A, B) and (C, D) are pair of nodes): 1 -> 2, 3 -> C -> [A] -> D -> [B] -> 4 1 -> A -> [C] -> B -> [D] -> 2, 3 -> 4
.operations_research.OptionalBoolean use_light_relocate_pair = 24;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 4031 of file RoutingSearchParameters.java.
| com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseLinKernighan | ( | ) |
Lin-Kernighan operator. While the accumulated local gain is positive, performs a 2-OPT or a 3-OPT move followed by a series of 2-OPT moves. Returns a neighbor for which the global gain is positive.
.operations_research.OptionalBoolean use_lin_kernighan = 9;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 5309 of file RoutingSearchParameters.java.
| int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseLinKernighanValue | ( | ) |
Lin-Kernighan operator. While the accumulated local gain is positive, performs a 2-OPT or a 3-OPT move followed by a series of 2-OPT moves. Returns a neighbor for which the global gain is positive.
.operations_research.OptionalBoolean use_lin_kernighan = 9;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 5276 of file RoutingSearchParameters.java.
| com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseLocalCheapestInsertionCloseNodesLns | ( | ) |
Same as above, but insertion positions for nodes are determined by the LocalCheapestInsertion heuristic.
.operations_research.OptionalBoolean use_local_cheapest_insertion_close_nodes_lns = 32;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 7188 of file RoutingSearchParameters.java.
| int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseLocalCheapestInsertionCloseNodesLnsValue | ( | ) |
Same as above, but insertion positions for nodes are determined by the LocalCheapestInsertion heuristic.
.operations_research.OptionalBoolean use_local_cheapest_insertion_close_nodes_lns = 32;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 7159 of file RoutingSearchParameters.java.
| com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseLocalCheapestInsertionExpensiveChainLns | ( | ) |
Same as above but using LocalCheapestInsertion as a heuristic for insertion.
.operations_research.OptionalBoolean use_local_cheapest_insertion_expensive_chain_lns = 30;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 7022 of file RoutingSearchParameters.java.
| int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseLocalCheapestInsertionExpensiveChainLnsValue | ( | ) |
Same as above but using LocalCheapestInsertion as a heuristic for insertion.
.operations_research.OptionalBoolean use_local_cheapest_insertion_expensive_chain_lns = 30;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 6993 of file RoutingSearchParameters.java.
| com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseLocalCheapestInsertionPathLns | ( | ) |
Same as above but using LocalCheapestInsertion as a heuristic.
.operations_research.OptionalBoolean use_local_cheapest_insertion_path_lns = 28;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 6775 of file RoutingSearchParameters.java.
| int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseLocalCheapestInsertionPathLnsValue | ( | ) |
Same as above but using LocalCheapestInsertion as a heuristic.
.operations_research.OptionalBoolean use_local_cheapest_insertion_path_lns = 28;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 6748 of file RoutingSearchParameters.java.
| com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseMakeActive | ( | ) |
--- Operators on inactive nodes --- Operator which inserts an inactive node into a path. Possible neighbors for the path 1 -> 2 -> 3 -> 4 with 5 inactive (where 1 and 4 are first and last nodes of the path) are: 1 -> [5] -> 2 -> 3 -> 4 1 -> 2 -> [5] -> 3 -> 4 1 -> 2 -> 3 -> [5] -> 4
.operations_research.OptionalBoolean use_make_active = 11;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 5504 of file RoutingSearchParameters.java.
| int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseMakeActiveValue | ( | ) |
--- Operators on inactive nodes --- Operator which inserts an inactive node into a path. Possible neighbors for the path 1 -> 2 -> 3 -> 4 with 5 inactive (where 1 and 4 are first and last nodes of the path) are: 1 -> [5] -> 2 -> 3 -> 4 1 -> 2 -> [5] -> 3 -> 4 1 -> 2 -> 3 -> [5] -> 4
.operations_research.OptionalBoolean use_make_active = 11;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 5465 of file RoutingSearchParameters.java.
| com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseMakeChainInactive | ( | ) |
Operator which makes a "chain" of path nodes inactive. Possible neighbors for the path 1 -> 2 -> 3 -> 4 (where 1 and 4 are first and last nodes of the path) are: 1 -> 3 -> 4 with 2 inactive 1 -> 2 -> 4 with 3 inactive 1 -> 4 with 2 and 3 inactive
.operations_research.OptionalBoolean use_make_chain_inactive = 13;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 5815 of file RoutingSearchParameters.java.
| int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseMakeChainInactiveValue | ( | ) |
Operator which makes a "chain" of path nodes inactive. Possible neighbors for the path 1 -> 2 -> 3 -> 4 (where 1 and 4 are first and last nodes of the path) are: 1 -> 3 -> 4 with 2 inactive 1 -> 2 -> 4 with 3 inactive 1 -> 4 with 2 and 3 inactive
.operations_research.OptionalBoolean use_make_chain_inactive = 13;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 5778 of file RoutingSearchParameters.java.
| com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseMakeInactive | ( | ) |
Operator which makes path nodes inactive. Possible neighbors for the path 1 -> 2 -> 3 -> 4 (where 1 and 4 are first and last nodes of the path) are: 1 -> 3 -> 4 with 2 inactive 1 -> 2 -> 4 with 3 inactive
.operations_research.OptionalBoolean use_make_inactive = 12;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 5719 of file RoutingSearchParameters.java.
| int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseMakeInactiveValue | ( | ) |
Operator which makes path nodes inactive. Possible neighbors for the path 1 -> 2 -> 3 -> 4 (where 1 and 4 are first and last nodes of the path) are: 1 -> 3 -> 4 with 2 inactive 1 -> 2 -> 4 with 3 inactive
.operations_research.OptionalBoolean use_make_inactive = 12;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 5684 of file RoutingSearchParameters.java.
| com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseNodePairSwapActive | ( | ) |
Operator which makes an inactive node active and an active pair of nodes inactive OR makes an inactive pair of nodes active and an active node inactive. Possible neighbors for the path 1 -> 2 -> 3 -> 4 with 5 inactive (where 1 and 4 are first and last nodes of the path and (2,3) is a pair of nodes) are: 1 -> [5] -> 4 with (2,3) inactive Possible neighbors for the path 1 -> 2 -> 3 with (4,5) inactive (where 1 and 3 are first and last nodes of the path and (4,5) is a pair of nodes) are: 1 -> [4] -> [5] -> 3 with 2 inactive
.operations_research.OptionalBoolean use_node_pair_swap_active = 20;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 6237 of file RoutingSearchParameters.java.
| int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseNodePairSwapActiveValue | ( | ) |
Operator which makes an inactive node active and an active pair of nodes inactive OR makes an inactive pair of nodes active and an active node inactive. Possible neighbors for the path 1 -> 2 -> 3 -> 4 with 5 inactive (where 1 and 4 are first and last nodes of the path and (2,3) is a pair of nodes) are: 1 -> [5] -> 4 with (2,3) inactive Possible neighbors for the path 1 -> 2 -> 3 with (4,5) inactive (where 1 and 3 are first and last nodes of the path and (4,5) is a pair of nodes) are: 1 -> [4] -> [5] -> 3 with 2 inactive
.operations_research.OptionalBoolean use_node_pair_swap_active = 20;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 6190 of file RoutingSearchParameters.java.
| com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseOrOpt | ( | ) |
Operator which moves sub-chains of a path of length 1, 2 and 3 to another position in the same path. When the length of the sub-chain is 1, the operator simply moves a node to another position. Possible neighbors for the path 1 -> 2 -> 3 -> 4 -> 5, for a sub-chain length of 2 (where (1, 5) are first and last nodes of the path and can therefore not be moved): 1 -> 4 -> [2 -> 3] -> 5 1 -> [3 -> 4] -> 2 -> 5 The OR_OPT operator is a limited version of 3-Opt (breaks 3 arcs on a path).
.operations_research.OptionalBoolean use_or_opt = 8;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 5207 of file RoutingSearchParameters.java.
| int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseOrOptValue | ( | ) |
Operator which moves sub-chains of a path of length 1, 2 and 3 to another position in the same path. When the length of the sub-chain is 1, the operator simply moves a node to another position. Possible neighbors for the path 1 -> 2 -> 3 -> 4 -> 5, for a sub-chain length of 2 (where (1, 5) are first and last nodes of the path and can therefore not be moved): 1 -> 4 -> [2 -> 3] -> 5 1 -> [3 -> 4] -> 2 -> 5 The OR_OPT operator is a limited version of 3-Opt (breaks 3 arcs on a path).
.operations_research.OptionalBoolean use_or_opt = 8;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 5160 of file RoutingSearchParameters.java.
| com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUsePathLns | ( | ) |
--- Large neighborhood search operators --- Operator which relaxes two sub-chains of three consecutive arcs each. Each sub-chain is defined by a start node and the next three arcs. Those six arcs are relaxed to build a new neighbor. PATH_LNS explores all possible pairs of starting nodes and so defines n^2 neighbors, n being the number of nodes. Note that the two sub-chains can be part of the same path; they even may overlap.
.operations_research.OptionalBoolean use_path_lns = 16;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 6351 of file RoutingSearchParameters.java.
| int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUsePathLnsValue | ( | ) |
--- Large neighborhood search operators --- Operator which relaxes two sub-chains of three consecutive arcs each. Each sub-chain is defined by a start node and the next three arcs. Those six arcs are relaxed to build a new neighbor. PATH_LNS explores all possible pairs of starting nodes and so defines n^2 neighbors, n being the number of nodes. Note that the two sub-chains can be part of the same path; they even may overlap.
.operations_research.OptionalBoolean use_path_lns = 16;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 6310 of file RoutingSearchParameters.java.
| com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseRelocate | ( | ) |
--- Inter-route operators --- Operator which moves a single node to another position. Possible neighbors for the path 1 -> 2 -> 3 -> 4 -> 5 (where (1, 5) are first and last nodes of the path and can therefore not be moved): 1 -> 3 -> [2] -> 4 -> 5 1 -> 3 -> 4 -> [2] -> 5 1 -> 2 -> 4 -> [3] -> 5 1 -> [4] -> 2 -> 3 -> 5
.operations_research.OptionalBoolean use_relocate = 1;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 3850 of file RoutingSearchParameters.java.
| com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseRelocateAndMakeActive | ( | ) |
Operator which relocates a node while making an inactive one active. As of 3/2017, the operator is limited to two kinds of moves: - Relocating a node and replacing it by an inactive node. Possible neighbor for path 1 -> 5, 2 -> 3 -> 6 and 4 inactive (where 1,2 and 5,6 are first and last nodes of paths) is: 1 -> 3 -> 5, 2 -> 4 -> 6. - Relocating a node and inserting an inactive node next to it. Possible neighbor for path 1 -> 5, 2 -> 3 -> 6 and 4 inactive (where 1,2 and 5,6 are first and last nodes of paths) is: 1 -> 4 -> 3 -> 5, 2 -> 6.
.operations_research.OptionalBoolean use_relocate_and_make_active = 21;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 5616 of file RoutingSearchParameters.java.
| int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseRelocateAndMakeActiveValue | ( | ) |
Operator which relocates a node while making an inactive one active. As of 3/2017, the operator is limited to two kinds of moves: - Relocating a node and replacing it by an inactive node. Possible neighbor for path 1 -> 5, 2 -> 3 -> 6 and 4 inactive (where 1,2 and 5,6 are first and last nodes of paths) is: 1 -> 3 -> 5, 2 -> 4 -> 6. - Relocating a node and inserting an inactive node next to it. Possible neighbor for path 1 -> 5, 2 -> 3 -> 6 and 4 inactive (where 1,2 and 5,6 are first and last nodes of paths) is: 1 -> 4 -> 3 -> 5, 2 -> 6.
.operations_research.OptionalBoolean use_relocate_and_make_active = 21;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 5571 of file RoutingSearchParameters.java.
| com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseRelocateExpensiveChain | ( | ) |
Operator which detects the relocate_expensive_chain_num_arcs_to_consider most expensive arcs on a path, and moves the chain resulting from cutting pairs of arcs among these to another position. Possible neighbors for paths 1 -> 2 (empty) and 3 -> A ------> B --> C -----> D -> 4 (where A -> B and C -> D are the 2 most expensive arcs, and the chain resulting from breaking them is B -> C): 1 -> [B -> C] -> 2 3 -> A -> D -> 4 1 -> 2 3 -> [B -> C] -> A -> D -> 4 1 -> 2 3 -> A -> D -> [B -> C] -> 4
.operations_research.OptionalBoolean use_relocate_expensive_chain = 23;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 4968 of file RoutingSearchParameters.java.
| int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseRelocateExpensiveChainValue | ( | ) |
Operator which detects the relocate_expensive_chain_num_arcs_to_consider most expensive arcs on a path, and moves the chain resulting from cutting pairs of arcs among these to another position. Possible neighbors for paths 1 -> 2 (empty) and 3 -> A ------> B --> C -----> D -> 4 (where A -> B and C -> D are the 2 most expensive arcs, and the chain resulting from breaking them is B -> C): 1 -> [B -> C] -> 2 3 -> A -> D -> 4 1 -> 2 3 -> [B -> C] -> A -> D -> 4 1 -> 2 3 -> A -> D -> [B -> C] -> 4
.operations_research.OptionalBoolean use_relocate_expensive_chain = 23;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 4923 of file RoutingSearchParameters.java.
| com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseRelocateNeighbors | ( | ) |
Relocate neighborhood which moves chains of neighbors. The operator starts by relocating a node n after a node m, then continues moving nodes which were after n as long as the "cost" added is less than the "cost" of the arc (m, n). If the new chain doesn't respect the domain of next variables, it will try reordering the nodes until it finds a valid path. Possible neighbors for path 1 -> A -> B -> C -> D -> E -> 2 (where (1, 2) are first and last nodes of the path and can therefore not be moved, A must be performed before B, and A, D and E are located at the same place): 1 -> A -> C -> [B] -> D -> E -> 2 1 -> A -> C -> D -> [B] -> E -> 2 1 -> A -> C -> D -> E -> [B] -> 2 1 -> A -> B -> D -> [C] -> E -> 2 1 -> A -> B -> D -> E -> [C] -> 2 1 -> A -> [D] -> [E] -> B -> C -> 2 1 -> A -> B -> [D] -> [E] -> C -> 2 1 -> A -> [E] -> B -> C -> D -> 2 1 -> A -> B -> [E] -> C -> D -> 2 1 -> A -> B -> C -> [E] -> D -> 2 This operator is extremely useful to move chains of nodes which are located at the same place (for instance nodes part of a same stop).
.operations_research.OptionalBoolean use_relocate_neighbors = 3;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 4218 of file RoutingSearchParameters.java.
| int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseRelocateNeighborsValue | ( | ) |
Relocate neighborhood which moves chains of neighbors. The operator starts by relocating a node n after a node m, then continues moving nodes which were after n as long as the "cost" added is less than the "cost" of the arc (m, n). If the new chain doesn't respect the domain of next variables, it will try reordering the nodes until it finds a valid path. Possible neighbors for path 1 -> A -> B -> C -> D -> E -> 2 (where (1, 2) are first and last nodes of the path and can therefore not be moved, A must be performed before B, and A, D and E are located at the same place): 1 -> A -> C -> [B] -> D -> E -> 2 1 -> A -> C -> D -> [B] -> E -> 2 1 -> A -> C -> D -> E -> [B] -> 2 1 -> A -> B -> D -> [C] -> E -> 2 1 -> A -> B -> D -> E -> [C] -> 2 1 -> A -> [D] -> [E] -> B -> C -> 2 1 -> A -> B -> [D] -> [E] -> C -> 2 1 -> A -> [E] -> B -> C -> D -> 2 1 -> A -> B -> [E] -> C -> D -> 2 1 -> A -> B -> C -> [E] -> D -> 2 This operator is extremely useful to move chains of nodes which are located at the same place (for instance nodes part of a same stop).
.operations_research.OptionalBoolean use_relocate_neighbors = 3;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 4149 of file RoutingSearchParameters.java.
| com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseRelocatePair | ( | ) |
Operator which moves a pair of pickup and delivery nodes to another position where the first node of the pair must be before the second node on the same path. Compared to the light_relocate_pair operator, tries all possible positions of insertion of a pair (not only after another pair). Possible neighbors for the path 1 -> A -> B -> 2 -> 3 (where (1, 3) are first and last nodes of the path and can therefore not be moved, and (A, B) is a pair of nodes): 1 -> [A] -> 2 -> [B] -> 3 1 -> 2 -> [A] -> [B] -> 3
.operations_research.OptionalBoolean use_relocate_pair = 2;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 3963 of file RoutingSearchParameters.java.
| int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseRelocatePairValue | ( | ) |
Operator which moves a pair of pickup and delivery nodes to another position where the first node of the pair must be before the second node on the same path. Compared to the light_relocate_pair operator, tries all possible positions of insertion of a pair (not only after another pair). Possible neighbors for the path 1 -> A -> B -> 2 -> 3 (where (1, 3) are first and last nodes of the path and can therefore not be moved, and (A, B) is a pair of nodes): 1 -> [A] -> 2 -> [B] -> 3 1 -> 2 -> [A] -> [B] -> 3
.operations_research.OptionalBoolean use_relocate_pair = 2;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 3920 of file RoutingSearchParameters.java.
| com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseRelocatePathGlobalCheapestInsertionInsertUnperformed | ( | ) |
The following operator relocates an entire route to an empty path and then tries to insert the unperformed nodes using the global cheapest insertion heuristic.
.operations_research.OptionalBoolean use_relocate_path_global_cheapest_insertion_insert_unperformed = 33;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 6854 of file RoutingSearchParameters.java.
| int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseRelocatePathGlobalCheapestInsertionInsertUnperformedValue | ( | ) |
The following operator relocates an entire route to an empty path and then tries to insert the unperformed nodes using the global cheapest insertion heuristic.
.operations_research.OptionalBoolean use_relocate_path_global_cheapest_insertion_insert_unperformed = 33;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 6823 of file RoutingSearchParameters.java.
| com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseRelocateSubtrip | ( | ) |
Relocate neighborhood that moves subpaths all pickup and delivery pairs have both pickup and delivery inside the subpath or both outside the subpath. For instance, for given paths: 0 -> A -> B -> A' -> B' -> 5 -> 6 -> 8 7 -> 9 Pairs (A,A') and (B,B') are interleaved, so the expected neighbors are: 0 -> 5 -> A -> B -> A' -> B' -> 6 -> 8 7 -> 9 0 -> 5 -> 6 -> A -> B -> A' -> B' -> 8 7 -> 9 0 -> 5 -> 6 -> 8 7 -> A -> B -> A' -> B' -> 9
.operations_research.OptionalBoolean use_relocate_subtrip = 25;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 4372 of file RoutingSearchParameters.java.
| int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseRelocateSubtripValue | ( | ) |
Relocate neighborhood that moves subpaths all pickup and delivery pairs have both pickup and delivery inside the subpath or both outside the subpath. For instance, for given paths: 0 -> A -> B -> A' -> B' -> 5 -> 6 -> 8 7 -> 9 Pairs (A,A') and (B,B') are interleaved, so the expected neighbors are: 0 -> 5 -> A -> B -> A' -> B' -> 6 -> 8 7 -> 9 0 -> 5 -> 6 -> A -> B -> A' -> B' -> 8 7 -> 9 0 -> 5 -> 6 -> 8 7 -> A -> B -> A' -> B' -> 9
.operations_research.OptionalBoolean use_relocate_subtrip = 25;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 4319 of file RoutingSearchParameters.java.
| int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseRelocateValue | ( | ) |
--- Inter-route operators --- Operator which moves a single node to another position. Possible neighbors for the path 1 -> 2 -> 3 -> 4 -> 5 (where (1, 5) are first and last nodes of the path and can therefore not be moved): 1 -> 3 -> [2] -> 4 -> 5 1 -> 3 -> 4 -> [2] -> 5 1 -> 2 -> 4 -> [3] -> 5 1 -> [4] -> 2 -> 3 -> 5
.operations_research.OptionalBoolean use_relocate = 1;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 3807 of file RoutingSearchParameters.java.
| com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseShortestPathSwapActive | ( | ) |
Swaps active nodes from node alternatives in sequence. Considers chains of nodes with alternatives, builds a DAG from the chain, each "layer" of the DAG being composed of the set of alternatives of the node at a given rank in the chain, fully connected to the next layer. A neighbor is built from the shortest path starting from the node before the chain (source), through the DAG to the node following the chain.
.operations_research.OptionalBoolean use_shortest_path_swap_active = 34;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 6124 of file RoutingSearchParameters.java.
| int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseShortestPathSwapActiveValue | ( | ) |
Swaps active nodes from node alternatives in sequence. Considers chains of nodes with alternatives, builds a DAG from the chain, each "layer" of the DAG being composed of the set of alternatives of the node at a given rank in the chain, fully connected to the next layer. A neighbor is built from the shortest path starting from the node before the chain (source), through the DAG to the node following the chain.
.operations_research.OptionalBoolean use_shortest_path_swap_active = 34;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 6087 of file RoutingSearchParameters.java.
| com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseSwapActive | ( | ) |
Operator which replaces an active node by an inactive one. Possible neighbors for the path 1 -> 2 -> 3 -> 4 with 5 inactive (where 1 and 4 are first and last nodes of the path) are: 1 -> [5] -> 3 -> 4 with 2 inactive 1 -> 2 -> [5] -> 4 with 3 inactive
.operations_research.OptionalBoolean use_swap_active = 14;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 5910 of file RoutingSearchParameters.java.
| int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseSwapActiveValue | ( | ) |
Operator which replaces an active node by an inactive one. Possible neighbors for the path 1 -> 2 -> 3 -> 4 with 5 inactive (where 1 and 4 are first and last nodes of the path) are: 1 -> [5] -> 3 -> 4 with 2 inactive 1 -> 2 -> [5] -> 4 with 3 inactive
.operations_research.OptionalBoolean use_swap_active = 14;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 5875 of file RoutingSearchParameters.java.
| com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseTspLns | ( | ) |
TSP-base LNS. Randomly merges consecutive nodes until n "meta"-nodes remain and solves the corresponding TSP. This defines an "unlimited" neighborhood which must be stopped by search limits. To force diversification, the operator iteratively forces each node to serve as base of a meta-node.
.operations_research.OptionalBoolean use_tsp_lns = 18;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 6526 of file RoutingSearchParameters.java.
| int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseTspLnsValue | ( | ) |
TSP-base LNS. Randomly merges consecutive nodes until n "meta"-nodes remain and solves the corresponding TSP. This defines an "unlimited" neighborhood which must be stopped by search limits. To force diversification, the operator iteratively forces each node to serve as base of a meta-node.
.operations_research.OptionalBoolean use_tsp_lns = 18;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 6489 of file RoutingSearchParameters.java.
| com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseTspOpt | ( | ) |
Sliding TSP operator. Uses an exact dynamic programming algorithm to solve the TSP corresponding to path sub-chains. For a subchain 1 -> 2 -> 3 -> 4 -> 5 -> 6, solves the TSP on nodes A, 2, 3, 4, 5, where A is a merger of nodes 1 and 6 such that cost(A,i) = cost(1,i) and cost(i,A) = cost(i,6).
.operations_research.OptionalBoolean use_tsp_opt = 10;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 5403 of file RoutingSearchParameters.java.
| int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseTspOptValue | ( | ) |
Sliding TSP operator. Uses an exact dynamic programming algorithm to solve the TSP corresponding to path sub-chains. For a subchain 1 -> 2 -> 3 -> 4 -> 5 -> 6, solves the TSP on nodes A, 2, 3, 4, 5, where A is a merger of nodes 1 and 6 such that cost(A,i) = cost(1,i) and cost(i,A) = cost(i,6).
.operations_research.OptionalBoolean use_tsp_opt = 10;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 5366 of file RoutingSearchParameters.java.
| com.google.ortools.util.OptionalBoolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseTwoOpt | ( | ) |
--- Intra-route operators --- Operator which reverses a subchain of a path. It is called TwoOpt because it breaks two arcs on the path; resulting paths are called two-optimal. Possible neighbors for the path 1 -> 2 -> 3 -> 4 -> 5 (where (1, 5) are first and last nodes of the path and can therefore not be moved): 1 -> [3 -> 2] -> 4 -> 5 1 -> [4 -> 3 -> 2] -> 5 1 -> 2 -> [4 -> 3] -> 5
.operations_research.OptionalBoolean use_two_opt = 7;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 5086 of file RoutingSearchParameters.java.
| int com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseTwoOptValue | ( | ) |
--- Intra-route operators --- Operator which reverses a subchain of a path. It is called TwoOpt because it breaks two arcs on the path; resulting paths are called two-optimal. Possible neighbors for the path 1 -> 2 -> 3 -> 4 -> 5 (where (1, 5) are first and last nodes of the path and can therefore not be moved): 1 -> [3 -> 2] -> 4 -> 5 1 -> [4 -> 3 -> 2] -> 5 1 -> 2 -> [4 -> 3] -> 5
.operations_research.OptionalBoolean use_two_opt = 7;
Implements com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.
Definition at line 5041 of file RoutingSearchParameters.java.
|
protected |
Definition at line 3233 of file RoutingSearchParameters.java.
| final boolean com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.isInitialized | ( | ) |
Definition at line 3582 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.mergeFrom | ( | com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators | other | ) |
Definition at line 3472 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.mergeFrom | ( | com.google.protobuf.CodedInputStream | input, |
| com.google.protobuf.ExtensionRegistryLite | extensionRegistry ) throws java.io.IOException |
Definition at line 3587 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.mergeFrom | ( | com.google.protobuf.Message | other | ) |
Definition at line 3463 of file RoutingSearchParameters.java.
| final Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.mergeUnknownFields | ( | final com.google.protobuf.UnknownFieldSet | unknownFields | ) |
Definition at line 7233 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setField | ( | com.google.protobuf.Descriptors.FieldDescriptor | field, |
| java.lang.Object | value ) |
Definition at line 3435 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setRepeatedField | ( | com.google.protobuf.Descriptors.FieldDescriptor | field, |
| int | index, | ||
| java.lang.Object | value ) |
Definition at line 3451 of file RoutingSearchParameters.java.
| final Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUnknownFields | ( | final com.google.protobuf.UnknownFieldSet | unknownFields | ) |
Definition at line 7227 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseCross | ( | com.google.ortools.util.OptionalBoolean | value | ) |
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;
| value | The useCross to set. |
Definition at line 4800 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseCrossExchange | ( | com.google.ortools.util.OptionalBoolean | value | ) |
Not implemented yet. TODO(b/68128619): Implement.
.operations_research.OptionalBoolean use_cross_exchange = 6;
| value | The useCrossExchange to set. |
Definition at line 4881 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseCrossExchangeValue | ( | int | value | ) |
Not implemented yet. TODO(b/68128619): Implement.
.operations_research.OptionalBoolean use_cross_exchange = 6;
| value | The enum numeric value on the wire for useCrossExchange to set. |
Definition at line 4853 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseCrossValue | ( | int | value | ) |
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;
| value | The enum numeric value on the wire for useCross to set. |
Definition at line 4756 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseExchange | ( | com.google.ortools.util.OptionalBoolean | value | ) |
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;
| value | The useExchange to set. |
Definition at line 4508 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseExchangePair | ( | com.google.ortools.util.OptionalBoolean | value | ) |
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;
| value | The useExchangePair to set. |
Definition at line 4611 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseExchangePairValue | ( | int | value | ) |
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;
| value | The enum numeric value on the wire for useExchangePair to set. |
Definition at line 4571 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseExchangeSubtrip | ( | com.google.ortools.util.OptionalBoolean | value | ) |
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;
| value | The useExchangeSubtrip to set. |
Definition at line 4694 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseExchangeSubtripValue | ( | int | value | ) |
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;
| value | The enum numeric value on the wire for useExchangeSubtrip to set. |
Definition at line 4664 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseExchangeValue | ( | int | value | ) |
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;
| value | The enum numeric value on the wire for useExchange to set. |
Definition at line 4468 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseExtendedSwapActive | ( | com.google.ortools.util.OptionalBoolean | value | ) |
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;
| value | The useExtendedSwapActive to set. |
Definition at line 6040 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseExtendedSwapActiveValue | ( | int | value | ) |
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;
| value | The enum numeric value on the wire for useExtendedSwapActive to set. |
Definition at line 5994 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseFullPathLns | ( | com.google.ortools.util.OptionalBoolean | value | ) |
Operator which relaxes one entire path and all inactive nodes.
.operations_research.OptionalBoolean use_full_path_lns = 17;
| value | The useFullPathLns to set. |
Definition at line 6451 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseFullPathLnsValue | ( | int | value | ) |
Operator which relaxes one entire path and all inactive nodes.
.operations_research.OptionalBoolean use_full_path_lns = 17;
| value | The enum numeric value on the wire for useFullPathLns to set. |
Definition at line 6423 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseGlobalCheapestInsertionCloseNodesLns | ( | com.google.ortools.util.OptionalBoolean | value | ) |
The following operator makes a node and its heuristic_close_nodes_lns_num_nodes closest neighbors unperformed along with each of their corresponding performed pickup/delivery pairs, and then reinserts them using the GlobalCheapestInsertion heuristic.
.operations_research.OptionalBoolean use_global_cheapest_insertion_close_nodes_lns = 31;
| value | The useGlobalCheapestInsertionCloseNodesLns to set. |
Definition at line 7122 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseGlobalCheapestInsertionCloseNodesLnsValue | ( | int | value | ) |
The following operator makes a node and its heuristic_close_nodes_lns_num_nodes closest neighbors unperformed along with each of their corresponding performed pickup/delivery pairs, and then reinserts them using the GlobalCheapestInsertion heuristic.
.operations_research.OptionalBoolean use_global_cheapest_insertion_close_nodes_lns = 31;
| value | The enum numeric value on the wire for useGlobalCheapestInsertionCloseNodesLns to set. |
Definition at line 7088 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseGlobalCheapestInsertionExpensiveChainLns | ( | com.google.ortools.util.OptionalBoolean | value | ) |
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;
| value | The useGlobalCheapestInsertionExpensiveChainLns to set. |
Definition at line 6956 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseGlobalCheapestInsertionExpensiveChainLnsValue | ( | int | value | ) |
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;
| value | The enum numeric value on the wire for useGlobalCheapestInsertionExpensiveChainLns to set. |
Definition at line 6922 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseGlobalCheapestInsertionPathLns | ( | com.google.ortools.util.OptionalBoolean | value | ) |
--- 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;
| value | The useGlobalCheapestInsertionPathLns to set. |
Definition at line 6713 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseGlobalCheapestInsertionPathLnsValue | ( | int | value | ) |
--- 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;
| value | The enum numeric value on the wire for useGlobalCheapestInsertionPathLns to set. |
Definition at line 6681 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseInactiveLns | ( | com.google.ortools.util.OptionalBoolean | value | ) |
Operator which relaxes all inactive nodes and one sub-chain of six consecutive arcs. That way the path can be improved by inserting inactive nodes or swapping arcs.
.operations_research.OptionalBoolean use_inactive_lns = 19;
| value | The useInactiveLns to set. |
Definition at line 6630 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseInactiveLnsValue | ( | int | value | ) |
Operator which relaxes all inactive nodes and one sub-chain of six consecutive arcs. That way the path can be improved by inserting inactive nodes or swapping arcs.
.operations_research.OptionalBoolean use_inactive_lns = 19;
| value | The enum numeric value on the wire for useInactiveLns to set. |
Definition at line 6598 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseLightRelocatePair | ( | com.google.ortools.util.OptionalBoolean | value | ) |
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;
| value | The useLightRelocatePair to set. |
Definition at line 4089 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseLightRelocatePairValue | ( | int | value | ) |
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;
| value | The enum numeric value on the wire for useLightRelocatePair to set. |
Definition at line 4049 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseLinKernighan | ( | com.google.ortools.util.OptionalBoolean | value | ) |
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;
| value | The useLinKernighan to set. |
Definition at line 5325 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseLinKernighanValue | ( | int | value | ) |
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;
| value | The enum numeric value on the wire for useLinKernighan to set. |
Definition at line 5291 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseLocalCheapestInsertionCloseNodesLns | ( | com.google.ortools.util.OptionalBoolean | value | ) |
Same as above, but insertion positions for nodes are determined by the LocalCheapestInsertion heuristic.
.operations_research.OptionalBoolean use_local_cheapest_insertion_close_nodes_lns = 32;
| value | The useLocalCheapestInsertionCloseNodesLns to set. |
Definition at line 7202 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseLocalCheapestInsertionCloseNodesLnsValue | ( | int | value | ) |
Same as above, but insertion positions for nodes are determined by the LocalCheapestInsertion heuristic.
.operations_research.OptionalBoolean use_local_cheapest_insertion_close_nodes_lns = 32;
| value | The enum numeric value on the wire for useLocalCheapestInsertionCloseNodesLns to set. |
Definition at line 7172 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseLocalCheapestInsertionExpensiveChainLns | ( | com.google.ortools.util.OptionalBoolean | value | ) |
Same as above but using LocalCheapestInsertion as a heuristic for insertion.
.operations_research.OptionalBoolean use_local_cheapest_insertion_expensive_chain_lns = 30;
| value | The useLocalCheapestInsertionExpensiveChainLns to set. |
Definition at line 7036 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseLocalCheapestInsertionExpensiveChainLnsValue | ( | int | value | ) |
Same as above but using LocalCheapestInsertion as a heuristic for insertion.
.operations_research.OptionalBoolean use_local_cheapest_insertion_expensive_chain_lns = 30;
| value | The enum numeric value on the wire for useLocalCheapestInsertionExpensiveChainLns to set. |
Definition at line 7006 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseLocalCheapestInsertionPathLns | ( | com.google.ortools.util.OptionalBoolean | value | ) |
Same as above but using LocalCheapestInsertion as a heuristic.
.operations_research.OptionalBoolean use_local_cheapest_insertion_path_lns = 28;
| value | The useLocalCheapestInsertionPathLns to set. |
Definition at line 6788 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseLocalCheapestInsertionPathLnsValue | ( | int | value | ) |
Same as above but using LocalCheapestInsertion as a heuristic.
.operations_research.OptionalBoolean use_local_cheapest_insertion_path_lns = 28;
| value | The enum numeric value on the wire for useLocalCheapestInsertionPathLns to set. |
Definition at line 6760 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseMakeActive | ( | com.google.ortools.util.OptionalBoolean | value | ) |
--- 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;
| value | The useMakeActive to set. |
Definition at line 5523 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseMakeActiveValue | ( | int | value | ) |
--- 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;
| value | The enum numeric value on the wire for useMakeActive to set. |
Definition at line 5483 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseMakeChainInactive | ( | com.google.ortools.util.OptionalBoolean | value | ) |
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;
| value | The useMakeChainInactive to set. |
Definition at line 5833 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseMakeChainInactiveValue | ( | int | value | ) |
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;
| value | The enum numeric value on the wire for useMakeChainInactive to set. |
Definition at line 5795 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseMakeInactive | ( | com.google.ortools.util.OptionalBoolean | value | ) |
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;
| value | The useMakeInactive to set. |
Definition at line 5736 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseMakeInactiveValue | ( | int | value | ) |
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;
| value | The enum numeric value on the wire for useMakeInactive to set. |
Definition at line 5700 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseNodePairSwapActive | ( | com.google.ortools.util.OptionalBoolean | value | ) |
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;
| value | The useNodePairSwapActive to set. |
Definition at line 6260 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseNodePairSwapActiveValue | ( | int | value | ) |
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;
| value | The enum numeric value on the wire for useNodePairSwapActive to set. |
Definition at line 6212 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseOrOpt | ( | com.google.ortools.util.OptionalBoolean | value | ) |
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;
| value | The useOrOpt to set. |
Definition at line 5230 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseOrOptValue | ( | int | value | ) |
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;
| value | The enum numeric value on the wire for useOrOpt to set. |
Definition at line 5182 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUsePathLns | ( | com.google.ortools.util.OptionalBoolean | value | ) |
--- 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;
| value | The usePathLns to set. |
Definition at line 6371 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUsePathLnsValue | ( | int | value | ) |
--- 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;
| value | The enum numeric value on the wire for usePathLns to set. |
Definition at line 6329 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseRelocate | ( | com.google.ortools.util.OptionalBoolean | value | ) |
--- 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;
| value | The useRelocate to set. |
Definition at line 3871 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseRelocateAndMakeActive | ( | com.google.ortools.util.OptionalBoolean | value | ) |
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;
| value | The useRelocateAndMakeActive to set. |
Definition at line 5638 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseRelocateAndMakeActiveValue | ( | int | value | ) |
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;
| value | The enum numeric value on the wire for useRelocateAndMakeActive to set. |
Definition at line 5592 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseRelocateExpensiveChain | ( | com.google.ortools.util.OptionalBoolean | value | ) |
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;
| value | The useRelocateExpensiveChain to set. |
Definition at line 4990 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseRelocateExpensiveChainValue | ( | int | value | ) |
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;
| value | The enum numeric value on the wire for useRelocateExpensiveChain to set. |
Definition at line 4944 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseRelocateNeighbors | ( | com.google.ortools.util.OptionalBoolean | value | ) |
Relocate neighborhood which moves chains of neighbors. The operator starts by relocating a node n after a node m, then continues moving nodes which were after n as long as the "cost" added is less than the "cost" of the arc (m, n). If the new chain doesn't respect the domain of next variables, it will try reordering the nodes until it finds a valid path. Possible neighbors for path 1 -> A -> B -> C -> D -> E -> 2 (where (1, 2) are first and last nodes of the path and can therefore not be moved, A must be performed before B, and A, D and E are located at the same place): 1 -> A -> C -> [B] -> D -> E -> 2 1 -> A -> C -> D -> [B] -> E -> 2 1 -> A -> C -> D -> E -> [B] -> 2 1 -> A -> B -> D -> [C] -> E -> 2 1 -> A -> B -> D -> E -> [C] -> 2 1 -> A -> [D] -> [E] -> B -> C -> 2 1 -> A -> B -> [D] -> [E] -> C -> 2 1 -> A -> [E] -> B -> C -> D -> 2 1 -> A -> B -> [E] -> C -> D -> 2 1 -> A -> B -> C -> [E] -> D -> 2 This operator is extremely useful to move chains of nodes which are located at the same place (for instance nodes part of a same stop).
.operations_research.OptionalBoolean use_relocate_neighbors = 3;
| value | The useRelocateNeighbors to set. |
Definition at line 4252 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseRelocateNeighborsValue | ( | int | value | ) |
Relocate neighborhood which moves chains of neighbors. The operator starts by relocating a node n after a node m, then continues moving nodes which were after n as long as the "cost" added is less than the "cost" of the arc (m, n). If the new chain doesn't respect the domain of next variables, it will try reordering the nodes until it finds a valid path. Possible neighbors for path 1 -> A -> B -> C -> D -> E -> 2 (where (1, 2) are first and last nodes of the path and can therefore not be moved, A must be performed before B, and A, D and E are located at the same place): 1 -> A -> C -> [B] -> D -> E -> 2 1 -> A -> C -> D -> [B] -> E -> 2 1 -> A -> C -> D -> E -> [B] -> 2 1 -> A -> B -> D -> [C] -> E -> 2 1 -> A -> B -> D -> E -> [C] -> 2 1 -> A -> [D] -> [E] -> B -> C -> 2 1 -> A -> B -> [D] -> [E] -> C -> 2 1 -> A -> [E] -> B -> C -> D -> 2 1 -> A -> B -> [E] -> C -> D -> 2 1 -> A -> B -> C -> [E] -> D -> 2 This operator is extremely useful to move chains of nodes which are located at the same place (for instance nodes part of a same stop).
.operations_research.OptionalBoolean use_relocate_neighbors = 3;
| value | The enum numeric value on the wire for useRelocateNeighbors to set. |
Definition at line 4182 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseRelocatePair | ( | com.google.ortools.util.OptionalBoolean | value | ) |
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;
| value | The useRelocatePair to set. |
Definition at line 3984 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseRelocatePairValue | ( | int | value | ) |
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;
| value | The enum numeric value on the wire for useRelocatePair to set. |
Definition at line 3940 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseRelocatePathGlobalCheapestInsertionInsertUnperformed | ( | com.google.ortools.util.OptionalBoolean | value | ) |
The following operator relocates an entire route to an empty path and then tries to insert the unperformed nodes using the global cheapest insertion heuristic.
.operations_research.OptionalBoolean use_relocate_path_global_cheapest_insertion_insert_unperformed = 33;
| value | The useRelocatePathGlobalCheapestInsertionInsertUnperformed to set. |
Definition at line 6869 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseRelocatePathGlobalCheapestInsertionInsertUnperformedValue | ( | int | value | ) |
The following operator relocates an entire route to an empty path and then tries to insert the unperformed nodes using the global cheapest insertion heuristic.
.operations_research.OptionalBoolean use_relocate_path_global_cheapest_insertion_insert_unperformed = 33;
| value | The enum numeric value on the wire for useRelocatePathGlobalCheapestInsertionInsertUnperformed to set. |
Definition at line 6837 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseRelocateSubtrip | ( | com.google.ortools.util.OptionalBoolean | value | ) |
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;
| value | The useRelocateSubtrip to set. |
Definition at line 4398 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseRelocateSubtripValue | ( | int | value | ) |
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;
| value | The enum numeric value on the wire for useRelocateSubtrip to set. |
Definition at line 4344 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseRelocateValue | ( | int | value | ) |
--- 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;
| value | The enum numeric value on the wire for useRelocate to set. |
Definition at line 3827 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseShortestPathSwapActive | ( | com.google.ortools.util.OptionalBoolean | value | ) |
Swaps active nodes from node alternatives in sequence. Considers chains of nodes with alternatives, builds a DAG from the chain, each "layer" of the DAG being composed of the set of alternatives of the node at a given rank in the chain, fully connected to the next layer. A neighbor is built from the shortest path starting from the node before the chain (source), through the DAG to the node following the chain.
.operations_research.OptionalBoolean use_shortest_path_swap_active = 34;
| value | The useShortestPathSwapActive to set. |
Definition at line 6142 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseShortestPathSwapActiveValue | ( | int | value | ) |
Swaps active nodes from node alternatives in sequence. Considers chains of nodes with alternatives, builds a DAG from the chain, each "layer" of the DAG being composed of the set of alternatives of the node at a given rank in the chain, fully connected to the next layer. A neighbor is built from the shortest path starting from the node before the chain (source), through the DAG to the node following the chain.
.operations_research.OptionalBoolean use_shortest_path_swap_active = 34;
| value | The enum numeric value on the wire for useShortestPathSwapActive to set. |
Definition at line 6104 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseSwapActive | ( | com.google.ortools.util.OptionalBoolean | value | ) |
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;
| value | The useSwapActive to set. |
Definition at line 5927 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseSwapActiveValue | ( | int | value | ) |
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;
| value | The enum numeric value on the wire for useSwapActive to set. |
Definition at line 5891 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseTspLns | ( | com.google.ortools.util.OptionalBoolean | value | ) |
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;
| value | The useTspLns to set. |
Definition at line 6544 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseTspLnsValue | ( | int | value | ) |
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;
| value | The enum numeric value on the wire for useTspLns to set. |
Definition at line 6506 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseTspOpt | ( | com.google.ortools.util.OptionalBoolean | value | ) |
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;
| value | The useTspOpt to set. |
Definition at line 5421 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseTspOptValue | ( | int | value | ) |
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;
| value | The enum numeric value on the wire for useTspOpt to set. |
Definition at line 5383 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseTwoOpt | ( | com.google.ortools.util.OptionalBoolean | value | ) |
--- Intra-route operators --- Operator which reverses a subchain of a path. It is called TwoOpt because it breaks two arcs on the path; resulting paths are called two-optimal. Possible neighbors for the path 1 -> 2 -> 3 -> 4 -> 5 (where (1, 5) are first and last nodes of the path and can therefore not be moved): 1 -> [3 -> 2] -> 4 -> 5 1 -> [4 -> 3 -> 2] -> 5 1 -> 2 -> [4 -> 3] -> 5
.operations_research.OptionalBoolean use_two_opt = 7;
| value | The useTwoOpt to set. |
Definition at line 5108 of file RoutingSearchParameters.java.
| Builder com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseTwoOptValue | ( | int | value | ) |
--- Intra-route operators --- Operator which reverses a subchain of a path. It is called TwoOpt because it breaks two arcs on the path; resulting paths are called two-optimal. Possible neighbors for the path 1 -> 2 -> 3 -> 4 -> 5 (where (1, 5) are first and last nodes of the path and can therefore not be moved): 1 -> [3 -> 2] -> 4 -> 5 1 -> [4 -> 3 -> 2] -> 5 1 -> 2 -> [4 -> 3] -> 5
.operations_research.OptionalBoolean use_two_opt = 7;
| value | The enum numeric value on the wire for useTwoOpt to set. |
Definition at line 5062 of file RoutingSearchParameters.java.
1.10.0