RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder (com.google.ortools:ortools-java 9.10.4067 API)

java.lang.Object
- com.google.protobuf.AbstractMessageLite.Builder
- - com.google.protobuf.AbstractMessage.Builder<BuilderT>
  - - com.google.protobuf.GeneratedMessage.Builder<RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder>
    - - com.google.ortools.constraintsolver.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder

All Implemented Interfaces:

RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder, com.google.protobuf.Message.Builder, com.google.protobuf.MessageLite.Builder, com.google.protobuf.MessageLiteOrBuilder, com.google.protobuf.MessageOrBuilder, java.lang.Cloneable

Enclosing class:

RoutingSearchParameters.LocalSearchNeighborhoodOperators
```
public static final class RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder
extends com.google.protobuf.GeneratedMessage.Builder<RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder>
implements RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder
```
```
 Local search neighborhood operators used to build a solutions neighborhood.
 Next ID: 35
 
```
Protobuf type operations_research.RoutingSearchParameters.LocalSearchNeighborhoodOperators

Method Summary

All Methods Static Methods Instance Methods Concrete Methods
Modifier and Type	Method and Description
`RoutingSearchParameters.LocalSearchNeighborhoodOperators`	`build()`
`RoutingSearchParameters.LocalSearchNeighborhoodOperators`	`buildPartial()`
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`clear()`
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`clearUseCross()` Operator which cross exchanges the starting chains of 2 paths, including exchanging the whole paths.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`clearUseCrossExchange()` Not implemented yet.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`clearUseExchange()` Operator which exchanges the positions of two nodes.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`clearUseExchangePair()` Operator which exchanges the positions of two pair of nodes.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`clearUseExchangeSubtrip()` Operator which exchanges subtrips associated to two pairs of nodes, see use_relocate_subtrip for a definition of subtrips.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`clearUseExtendedSwapActive()` Operator which makes an inactive node active and an active one inactive.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`clearUseFullPathLns()` Operator which relaxes one entire path and all inactive nodes.
`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.
`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.
`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.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`clearUseInactiveLns()` Operator which relaxes all inactive nodes and one sub-chain of six consecutive arcs.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`clearUseLightRelocatePair()` Operator which moves a pair of pickup and delivery nodes after another pair.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`clearUseLinKernighan()` Lin-Kernighan operator.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`clearUseLocalCheapestInsertionCloseNodesLns()` Same as above, but insertion positions for nodes are determined by the LocalCheapestInsertion heuristic.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`clearUseLocalCheapestInsertionExpensiveChainLns()` Same as above but using LocalCheapestInsertion as a heuristic for insertion.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`clearUseLocalCheapestInsertionPathLns()` Same as above but using LocalCheapestInsertion as a heuristic.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`clearUseMakeActive()` --- Operators on inactive nodes --- Operator which inserts an inactive node into a path.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`clearUseMakeChainInactive()` Operator which makes a "chain" of path nodes inactive.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`clearUseMakeInactive()` Operator which makes path nodes inactive.
`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.
`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.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`clearUsePathLns()` --- Large neighborhood search operators --- Operator which relaxes two sub-chains of three consecutive arcs each.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`clearUseRelocate()` --- Inter-route operators --- Operator which moves a single node to another position.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`clearUseRelocateAndMakeActive()` Operator which relocates a node while making an inactive one active.
`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.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`clearUseRelocateNeighbors()` Relocate neighborhood which moves chains of neighbors.
`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.
`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.
`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.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`clearUseShortestPathSwapActive()` Swaps active nodes from node alternatives in sequence.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`clearUseSwapActive()` Operator which replaces an active node by an inactive one.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`clearUseTspLns()` TSP-base LNS.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`clearUseTspOpt()` Sliding TSP operator.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`clearUseTwoOpt()` --- Intra-route operators --- Operator which reverses a subchain of a path.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators`	`getDefaultInstanceForType()`
`static com.google.protobuf.Descriptors.Descriptor`	`getDescriptor()`
`com.google.protobuf.Descriptors.Descriptor`	`getDescriptorForType()`
`OptionalBoolean`	`getUseCross()` Operator which cross exchanges the starting chains of 2 paths, including exchanging the whole paths.
`OptionalBoolean`	`getUseCrossExchange()` Not implemented yet.
`int`	`getUseCrossExchangeValue()` Not implemented yet.
`int`	`getUseCrossValue()` Operator which cross exchanges the starting chains of 2 paths, including exchanging the whole paths.
`OptionalBoolean`	`getUseExchange()` Operator which exchanges the positions of two nodes.
`OptionalBoolean`	`getUseExchangePair()` Operator which exchanges the positions of two pair of nodes.
`int`	`getUseExchangePairValue()` Operator which exchanges the positions of two pair of nodes.
`OptionalBoolean`	`getUseExchangeSubtrip()` Operator which exchanges subtrips associated to two pairs of nodes, see use_relocate_subtrip for a definition of subtrips.
`int`	`getUseExchangeSubtripValue()` Operator which exchanges subtrips associated to two pairs of nodes, see use_relocate_subtrip for a definition of subtrips.
`int`	`getUseExchangeValue()` Operator which exchanges the positions of two nodes.
`OptionalBoolean`	`getUseExtendedSwapActive()` Operator which makes an inactive node active and an active one inactive.
`int`	`getUseExtendedSwapActiveValue()` Operator which makes an inactive node active and an active one inactive.
`OptionalBoolean`	`getUseFullPathLns()` Operator which relaxes one entire path and all inactive nodes.
`int`	`getUseFullPathLnsValue()` Operator which relaxes one entire path and all inactive nodes.
`OptionalBoolean`	`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.
`int`	`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.
`OptionalBoolean`	`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.
`int`	`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.
`OptionalBoolean`	`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.
`int`	`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.
`OptionalBoolean`	`getUseInactiveLns()` Operator which relaxes all inactive nodes and one sub-chain of six consecutive arcs.
`int`	`getUseInactiveLnsValue()` Operator which relaxes all inactive nodes and one sub-chain of six consecutive arcs.
`OptionalBoolean`	`getUseLightRelocatePair()` Operator which moves a pair of pickup and delivery nodes after another pair.
`int`	`getUseLightRelocatePairValue()` Operator which moves a pair of pickup and delivery nodes after another pair.
`OptionalBoolean`	`getUseLinKernighan()` Lin-Kernighan operator.
`int`	`getUseLinKernighanValue()` Lin-Kernighan operator.
`OptionalBoolean`	`getUseLocalCheapestInsertionCloseNodesLns()` Same as above, but insertion positions for nodes are determined by the LocalCheapestInsertion heuristic.
`int`	`getUseLocalCheapestInsertionCloseNodesLnsValue()` Same as above, but insertion positions for nodes are determined by the LocalCheapestInsertion heuristic.
`OptionalBoolean`	`getUseLocalCheapestInsertionExpensiveChainLns()` Same as above but using LocalCheapestInsertion as a heuristic for insertion.
`int`	`getUseLocalCheapestInsertionExpensiveChainLnsValue()` Same as above but using LocalCheapestInsertion as a heuristic for insertion.
`OptionalBoolean`	`getUseLocalCheapestInsertionPathLns()` Same as above but using LocalCheapestInsertion as a heuristic.
`int`	`getUseLocalCheapestInsertionPathLnsValue()` Same as above but using LocalCheapestInsertion as a heuristic.
`OptionalBoolean`	`getUseMakeActive()` --- Operators on inactive nodes --- Operator which inserts an inactive node into a path.
`int`	`getUseMakeActiveValue()` --- Operators on inactive nodes --- Operator which inserts an inactive node into a path.
`OptionalBoolean`	`getUseMakeChainInactive()` Operator which makes a "chain" of path nodes inactive.
`int`	`getUseMakeChainInactiveValue()` Operator which makes a "chain" of path nodes inactive.
`OptionalBoolean`	`getUseMakeInactive()` Operator which makes path nodes inactive.
`int`	`getUseMakeInactiveValue()` Operator which makes path nodes inactive.
`OptionalBoolean`	`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.
`int`	`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.
`OptionalBoolean`	`getUseOrOpt()` Operator which moves sub-chains of a path of length 1, 2 and 3 to another position in the same path.
`int`	`getUseOrOptValue()` Operator which moves sub-chains of a path of length 1, 2 and 3 to another position in the same path.
`OptionalBoolean`	`getUsePathLns()` --- Large neighborhood search operators --- Operator which relaxes two sub-chains of three consecutive arcs each.
`int`	`getUsePathLnsValue()` --- Large neighborhood search operators --- Operator which relaxes two sub-chains of three consecutive arcs each.
`OptionalBoolean`	`getUseRelocate()` --- Inter-route operators --- Operator which moves a single node to another position.
`OptionalBoolean`	`getUseRelocateAndMakeActive()` Operator which relocates a node while making an inactive one active.
`int`	`getUseRelocateAndMakeActiveValue()` Operator which relocates a node while making an inactive one active.
`OptionalBoolean`	`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.
`int`	`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.
`OptionalBoolean`	`getUseRelocateNeighbors()` Relocate neighborhood which moves chains of neighbors.
`int`	`getUseRelocateNeighborsValue()` Relocate neighborhood which moves chains of neighbors.
`OptionalBoolean`	`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.
`int`	`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.
`OptionalBoolean`	`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.
`int`	`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.
`OptionalBoolean`	`getUseRelocateSubtrip()` Relocate neighborhood that moves subpaths all pickup and delivery pairs have both pickup and delivery inside the subpath or both outside the subpath.
`int`	`getUseRelocateSubtripValue()` Relocate neighborhood that moves subpaths all pickup and delivery pairs have both pickup and delivery inside the subpath or both outside the subpath.
`int`	`getUseRelocateValue()` --- Inter-route operators --- Operator which moves a single node to another position.
`OptionalBoolean`	`getUseShortestPathSwapActive()` Swaps active nodes from node alternatives in sequence.
`int`	`getUseShortestPathSwapActiveValue()` Swaps active nodes from node alternatives in sequence.
`OptionalBoolean`	`getUseSwapActive()` Operator which replaces an active node by an inactive one.
`int`	`getUseSwapActiveValue()` Operator which replaces an active node by an inactive one.
`OptionalBoolean`	`getUseTspLns()` TSP-base LNS.
`int`	`getUseTspLnsValue()` TSP-base LNS.
`OptionalBoolean`	`getUseTspOpt()` Sliding TSP operator.
`int`	`getUseTspOptValue()` Sliding TSP operator.
`OptionalBoolean`	`getUseTwoOpt()` --- Intra-route operators --- Operator which reverses a subchain of a path.
`int`	`getUseTwoOptValue()` --- Intra-route operators --- Operator which reverses a subchain of a path.
`protected com.google.protobuf.GeneratedMessage.FieldAccessorTable`	`internalGetFieldAccessorTable()`
`boolean`	`isInitialized()`
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`mergeFrom(com.google.protobuf.CodedInputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry)`
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`mergeFrom(com.google.protobuf.Message other)`
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`mergeFrom(RoutingSearchParameters.LocalSearchNeighborhoodOperators other)`
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseCross(OptionalBoolean value)` Operator which cross exchanges the starting chains of 2 paths, including exchanging the whole paths.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseCrossExchange(OptionalBoolean value)` Not implemented yet.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseCrossExchangeValue(int value)` Not implemented yet.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseCrossValue(int value)` Operator which cross exchanges the starting chains of 2 paths, including exchanging the whole paths.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseExchange(OptionalBoolean value)` Operator which exchanges the positions of two nodes.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseExchangePair(OptionalBoolean value)` Operator which exchanges the positions of two pair of nodes.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseExchangePairValue(int value)` Operator which exchanges the positions of two pair of nodes.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseExchangeSubtrip(OptionalBoolean value)` Operator which exchanges subtrips associated to two pairs of nodes, see use_relocate_subtrip for a definition of subtrips.
`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.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseExchangeValue(int value)` Operator which exchanges the positions of two nodes.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseExtendedSwapActive(OptionalBoolean value)` Operator which makes an inactive node active and an active one inactive.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseExtendedSwapActiveValue(int value)` Operator which makes an inactive node active and an active one inactive.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseFullPathLns(OptionalBoolean value)` Operator which relaxes one entire path and all inactive nodes.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseFullPathLnsValue(int value)` Operator which relaxes one entire path and all inactive nodes.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseGlobalCheapestInsertionCloseNodesLns(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.
`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.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseGlobalCheapestInsertionExpensiveChainLns(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.
`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.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseGlobalCheapestInsertionPathLns(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.
`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.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseInactiveLns(OptionalBoolean value)` Operator which relaxes all inactive nodes and one sub-chain of six consecutive arcs.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseInactiveLnsValue(int value)` Operator which relaxes all inactive nodes and one sub-chain of six consecutive arcs.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseLightRelocatePair(OptionalBoolean value)` Operator which moves a pair of pickup and delivery nodes after another pair.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseLightRelocatePairValue(int value)` Operator which moves a pair of pickup and delivery nodes after another pair.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseLinKernighan(OptionalBoolean value)` Lin-Kernighan operator.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseLinKernighanValue(int value)` Lin-Kernighan operator.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseLocalCheapestInsertionCloseNodesLns(OptionalBoolean value)` Same as above, but insertion positions for nodes are determined by the LocalCheapestInsertion heuristic.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseLocalCheapestInsertionCloseNodesLnsValue(int value)` Same as above, but insertion positions for nodes are determined by the LocalCheapestInsertion heuristic.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseLocalCheapestInsertionExpensiveChainLns(OptionalBoolean value)` Same as above but using LocalCheapestInsertion as a heuristic for insertion.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseLocalCheapestInsertionExpensiveChainLnsValue(int value)` Same as above but using LocalCheapestInsertion as a heuristic for insertion.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseLocalCheapestInsertionPathLns(OptionalBoolean value)` Same as above but using LocalCheapestInsertion as a heuristic.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseLocalCheapestInsertionPathLnsValue(int value)` Same as above but using LocalCheapestInsertion as a heuristic.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseMakeActive(OptionalBoolean value)` --- Operators on inactive nodes --- Operator which inserts an inactive node into a path.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseMakeActiveValue(int value)` --- Operators on inactive nodes --- Operator which inserts an inactive node into a path.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseMakeChainInactive(OptionalBoolean value)` Operator which makes a "chain" of path nodes inactive.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseMakeChainInactiveValue(int value)` Operator which makes a "chain" of path nodes inactive.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseMakeInactive(OptionalBoolean value)` Operator which makes path nodes inactive.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseMakeInactiveValue(int value)` Operator which makes path nodes inactive.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseNodePairSwapActive(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.
`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.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseOrOpt(OptionalBoolean value)` Operator which moves sub-chains of a path of length 1, 2 and 3 to another position in the same path.
`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.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUsePathLns(OptionalBoolean value)` --- Large neighborhood search operators --- Operator which relaxes two sub-chains of three consecutive arcs each.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUsePathLnsValue(int value)` --- Large neighborhood search operators --- Operator which relaxes two sub-chains of three consecutive arcs each.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseRelocate(OptionalBoolean value)` --- Inter-route operators --- Operator which moves a single node to another position.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseRelocateAndMakeActive(OptionalBoolean value)` Operator which relocates a node while making an inactive one active.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseRelocateAndMakeActiveValue(int value)` Operator which relocates a node while making an inactive one active.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseRelocateExpensiveChain(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.
`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.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseRelocateNeighbors(OptionalBoolean value)` Relocate neighborhood which moves chains of neighbors.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseRelocateNeighborsValue(int value)` Relocate neighborhood which moves chains of neighbors.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseRelocatePair(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.
`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.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseRelocatePathGlobalCheapestInsertionInsertUnperformed(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.
`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.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseRelocateSubtrip(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.
`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.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseRelocateValue(int value)` --- Inter-route operators --- Operator which moves a single node to another position.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseShortestPathSwapActive(OptionalBoolean value)` Swaps active nodes from node alternatives in sequence.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseShortestPathSwapActiveValue(int value)` Swaps active nodes from node alternatives in sequence.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseSwapActive(OptionalBoolean value)` Operator which replaces an active node by an inactive one.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseSwapActiveValue(int value)` Operator which replaces an active node by an inactive one.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseTspLns(OptionalBoolean value)` TSP-base LNS.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseTspLnsValue(int value)` TSP-base LNS.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseTspOpt(OptionalBoolean value)` Sliding TSP operator.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseTspOptValue(int value)` Sliding TSP operator.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseTwoOpt(OptionalBoolean value)` --- Intra-route operators --- Operator which reverses a subchain of a path.
`RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder`	`setUseTwoOptValue(int value)` --- Intra-route operators --- Operator which reverses a subchain of a path.

Methods inherited from class com.google.protobuf.GeneratedMessage.Builder
addRepeatedField, clearField, clearOneof, clone, getAllFields, getField, getFieldBuilder, getOneofFieldDescriptor, getParentForChildren, getRepeatedField, getRepeatedFieldBuilder, getRepeatedFieldCount, getUnknownFields, getUnknownFieldSetBuilder, hasField, hasOneof, internalGetMapField, internalGetMapFieldReflection, internalGetMutableMapField, internalGetMutableMapFieldReflection, isClean, markClean, mergeUnknownFields, mergeUnknownLengthDelimitedField, mergeUnknownVarintField, newBuilderForField, onBuilt, onChanged, parseUnknownField, setField, setRepeatedField, setUnknownFields, setUnknownFieldSetBuilder, setUnknownFieldsProto3

Methods inherited from class com.google.protobuf.AbstractMessage.Builder
findInitializationErrors, getInitializationErrorString, internalMergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, newUninitializedMessageException, toString

Methods inherited from class com.google.protobuf.AbstractMessageLite.Builder
addAll, addAll, mergeDelimitedFrom, mergeDelimitedFrom, newUninitializedMessageException

Methods inherited from class java.lang.Object
equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Methods inherited from interface com.google.protobuf.MessageOrBuilder
findInitializationErrors, getAllFields, getField, getInitializationErrorString, getOneofFieldDescriptor, getRepeatedField, getRepeatedFieldCount, getUnknownFields, hasField, hasOneof

Methods inherited from interface com.google.protobuf.Message.Builder
mergeDelimitedFrom, mergeDelimitedFrom

Method Detail

getDescriptor

public static final com.google.protobuf.Descriptors.Descriptor getDescriptor()

internalGetFieldAccessorTable
```
protected com.google.protobuf.GeneratedMessage.FieldAccessorTable internalGetFieldAccessorTable()
```
Specified by:

internalGetFieldAccessorTable in class com.google.protobuf.GeneratedMessage.Builder<RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder>

clear
```
public RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder clear()
```
Specified by:

clear in interface com.google.protobuf.Message.Builder

Specified by:

clear in interface com.google.protobuf.MessageLite.Builder

Overrides:

clear in class com.google.protobuf.GeneratedMessage.Builder<RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder>

getDescriptorForType
```
public com.google.protobuf.Descriptors.Descriptor getDescriptorForType()
```
Specified by:

getDescriptorForType in interface com.google.protobuf.Message.Builder

Specified by:

getDescriptorForType in interface com.google.protobuf.MessageOrBuilder

Overrides:

getDescriptorForType in class com.google.protobuf.GeneratedMessage.Builder<RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder>

getDefaultInstanceForType
```
public RoutingSearchParameters.LocalSearchNeighborhoodOperators getDefaultInstanceForType()
```
Specified by:

getDefaultInstanceForType in interface com.google.protobuf.MessageLiteOrBuilder

Specified by:

getDefaultInstanceForType in interface com.google.protobuf.MessageOrBuilder

build
```
public RoutingSearchParameters.LocalSearchNeighborhoodOperators build()
```
Specified by:

build in interface com.google.protobuf.Message.Builder

Specified by:

build in interface com.google.protobuf.MessageLite.Builder

buildPartial
```
public RoutingSearchParameters.LocalSearchNeighborhoodOperators buildPartial()
```
Specified by:

buildPartial in interface com.google.protobuf.Message.Builder

Specified by:

buildPartial in interface com.google.protobuf.MessageLite.Builder

mergeFrom
```
public RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder mergeFrom(com.google.protobuf.Message other)
```
Specified by:

mergeFrom in interface com.google.protobuf.Message.Builder

Overrides:

mergeFrom in class com.google.protobuf.AbstractMessage.Builder<RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder>

mergeFrom

public RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder mergeFrom(RoutingSearchParameters.LocalSearchNeighborhoodOperators other)

isInitialized
```
public final boolean isInitialized()
```
Specified by:

isInitialized in interface com.google.protobuf.MessageLiteOrBuilder

Overrides:

isInitialized in class com.google.protobuf.GeneratedMessage.Builder<RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder>

mergeFrom

public RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder mergeFrom(com.google.protobuf.CodedInputStream input,
                                                                                  com.google.protobuf.ExtensionRegistryLite extensionRegistry)
                                                                           throws java.io.IOException

Specified by:: mergeFrom in interface com.google.protobuf.Message.Builder
Specified by:: mergeFrom in interface com.google.protobuf.MessageLite.Builder
Overrides:: mergeFrom in class com.google.protobuf.AbstractMessage.Builder<RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder>
Throws:: java.io.IOException

getUseRelocateValue

public int 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;

Specified by:: getUseRelocateValue in interface RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder
Returns:: The enum numeric value on the wire for useRelocate.

setUseRelocateValue

public 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;

Parameters:: value - The enum numeric value on the wire for useRelocate to set.
Returns:: This builder for chaining.

getUseRelocate

public OptionalBoolean 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;

Specified by:: getUseRelocate in interface RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder
Returns:: The useRelocate.

setUseRelocate

public RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder setUseRelocate(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;

Parameters:: value - The useRelocate to set.
Returns:: This builder for chaining.

clearUseRelocate

public 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;

Returns:: This builder for chaining.

getUseRelocatePairValue

public int 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;

Specified by:: getUseRelocatePairValue in interface RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder
Returns:: The enum numeric value on the wire for useRelocatePair.

setUseRelocatePairValue

public 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;

Parameters:: value - The enum numeric value on the wire for useRelocatePair to set.
Returns:: This builder for chaining.

getUseRelocatePair

public OptionalBoolean 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;

Specified by:: getUseRelocatePair in interface RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder
Returns:: The useRelocatePair.

setUseRelocatePair

public RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder setUseRelocatePair(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;

Parameters:: value - The useRelocatePair to set.
Returns:: This builder for chaining.

clearUseRelocatePair

public 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;

Returns:: This builder for chaining.

getUseLightRelocatePairValue

public int 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;

Specified by:: getUseLightRelocatePairValue in interface RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder
Returns:: The enum numeric value on the wire for useLightRelocatePair.

setUseLightRelocatePairValue

public 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;

Parameters:: value - The enum numeric value on the wire for useLightRelocatePair to set.
Returns:: This builder for chaining.

getUseLightRelocatePair

public OptionalBoolean 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;

Specified by:: getUseLightRelocatePair in interface RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder
Returns:: The useLightRelocatePair.

setUseLightRelocatePair

public RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder setUseLightRelocatePair(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;

Parameters:: value - The useLightRelocatePair to set.
Returns:: This builder for chaining.

clearUseLightRelocatePair

public 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;

Returns:: This builder for chaining.

getUseRelocateNeighborsValue

public int 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;

Specified by:: getUseRelocateNeighborsValue in interface RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder
Returns:: The enum numeric value on the wire for useRelocateNeighbors.

setUseRelocateNeighborsValue

public 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;

Parameters:: value - The enum numeric value on the wire for useRelocateNeighbors to set.
Returns:: This builder for chaining.

getUseRelocateNeighbors

public OptionalBoolean 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;

Specified by:: getUseRelocateNeighbors in interface RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder
Returns:: The useRelocateNeighbors.

setUseRelocateNeighbors

public RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder setUseRelocateNeighbors(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;

Parameters:: value - The useRelocateNeighbors to set.
Returns:: This builder for chaining.

clearUseRelocateNeighbors

public 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;

Returns:: This builder for chaining.

getUseRelocateSubtripValue

public int 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;

Specified by:: getUseRelocateSubtripValue in interface RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder
Returns:: The enum numeric value on the wire for useRelocateSubtrip.

setUseRelocateSubtripValue

public 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;

Parameters:: value - The enum numeric value on the wire for useRelocateSubtrip to set.
Returns:: This builder for chaining.

getUseRelocateSubtrip

public OptionalBoolean 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;

Specified by:: getUseRelocateSubtrip in interface RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder
Returns:: The useRelocateSubtrip.

setUseRelocateSubtrip

public RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder setUseRelocateSubtrip(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;

Parameters:: value - The useRelocateSubtrip to set.
Returns:: This builder for chaining.

clearUseRelocateSubtrip

public 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;

Returns:: This builder for chaining.

getUseExchangeValue

public int 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;

Specified by:: getUseExchangeValue in interface RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder
Returns:: The enum numeric value on the wire for useExchange.

setUseExchangeValue

public 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;

Parameters:: value - The enum numeric value on the wire for useExchange to set.
Returns:: This builder for chaining.

getUseExchange

public OptionalBoolean 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;

Specified by:: getUseExchange in interface RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder
Returns:: The useExchange.

setUseExchange

public RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder setUseExchange(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;

Parameters:: value - The useExchange to set.
Returns:: This builder for chaining.

clearUseExchange

public 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;

Returns:: This builder for chaining.

getUseExchangePairValue

public int 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;

Specified by:: getUseExchangePairValue in interface RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder
Returns:: The enum numeric value on the wire for useExchangePair.

setUseExchangePairValue

public 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;

Parameters:: value - The enum numeric value on the wire for useExchangePair to set.
Returns:: This builder for chaining.

getUseExchangePair

public OptionalBoolean 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;

Specified by:: getUseExchangePair in interface RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder
Returns:: The useExchangePair.

setUseExchangePair

public RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder setUseExchangePair(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;

Parameters:: value - The useExchangePair to set.
Returns:: This builder for chaining.

clearUseExchangePair

public 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;

Returns:: This builder for chaining.

getUseExchangeSubtripValue
```
public int 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;
Specified by:

getUseExchangeSubtripValue in interface RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder

Returns:

The enum numeric value on the wire for useExchangeSubtrip.

setUseExchangeSubtripValue

public 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;

Parameters:: value - The enum numeric value on the wire for useExchangeSubtrip to set.
Returns:: This builder for chaining.

getUseExchangeSubtrip
```
public OptionalBoolean 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;
Specified by:

getUseExchangeSubtrip in interface RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder

Returns:

The useExchangeSubtrip.

setUseExchangeSubtrip

public RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder setUseExchangeSubtrip(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;

Parameters:: value - The useExchangeSubtrip to set.
Returns:: This builder for chaining.

clearUseExchangeSubtrip

public 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;

Returns:: This builder for chaining.

getUseCrossValue

public int 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;

Specified by:: getUseCrossValue in interface RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder
Returns:: The enum numeric value on the wire for useCross.

setUseCrossValue

public 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;

Parameters:: value - The enum numeric value on the wire for useCross to set.
Returns:: This builder for chaining.

getUseCross

public OptionalBoolean 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;

Specified by:: getUseCross in interface RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder
Returns:: The useCross.

setUseCross

public RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder setUseCross(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;

Parameters:: value - The useCross to set.
Returns:: This builder for chaining.

clearUseCross

public 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;

Returns:: This builder for chaining.

getUseCrossExchangeValue
```
public int getUseCrossExchangeValue()
```
```
 Not implemented yet. TODO(b/68128619): Implement.
 
```
.operations_research.OptionalBoolean use_cross_exchange = 6;
Specified by:

getUseCrossExchangeValue in interface RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder

Returns:

The enum numeric value on the wire for useCrossExchange.

setUseCrossExchangeValue
```
public RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder setUseCrossExchangeValue(int value)
```
```
 Not implemented yet. TODO(b/68128619): Implement.
 
```
.operations_research.OptionalBoolean use_cross_exchange = 6;
Parameters:

value - The enum numeric value on the wire for useCrossExchange to set.

Returns:

This builder for chaining.

getUseCrossExchange
```
public OptionalBoolean getUseCrossExchange()
```
```
 Not implemented yet. TODO(b/68128619): Implement.
 
```
.operations_research.OptionalBoolean use_cross_exchange = 6;
Specified by:

getUseCrossExchange in interface RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder

Returns:

The useCrossExchange.

setUseCrossExchange

public RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder setUseCrossExchange(OptionalBoolean value)

 Not implemented yet. TODO(b/68128619): Implement.

.operations_research.OptionalBoolean use_cross_exchange = 6;

Parameters:: value - The useCrossExchange to set.
Returns:: This builder for chaining.

clearUseCrossExchange

public RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder clearUseCrossExchange()

 Not implemented yet. TODO(b/68128619): Implement.

.operations_research.OptionalBoolean use_cross_exchange = 6;

Returns:: This builder for chaining.

getUseRelocateExpensiveChainValue

public int 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;

Specified by:: getUseRelocateExpensiveChainValue in interface RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder
Returns:: The enum numeric value on the wire for useRelocateExpensiveChain.

setUseRelocateExpensiveChainValue

public 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;

Parameters:: value - The enum numeric value on the wire for useRelocateExpensiveChain to set.
Returns:: This builder for chaining.

getUseRelocateExpensiveChain

public OptionalBoolean 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;

Specified by:: getUseRelocateExpensiveChain in interface RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder
Returns:: The useRelocateExpensiveChain.

setUseRelocateExpensiveChain

public RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder setUseRelocateExpensiveChain(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;

Parameters:: value - The useRelocateExpensiveChain to set.
Returns:: This builder for chaining.

clearUseRelocateExpensiveChain

public 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;

Returns:: This builder for chaining.

getUseTwoOptValue

public int 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;

Specified by:: getUseTwoOptValue in interface RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder
Returns:: The enum numeric value on the wire for useTwoOpt.

setUseTwoOptValue

public 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;

Parameters:: value - The enum numeric value on the wire for useTwoOpt to set.
Returns:: This builder for chaining.

getUseTwoOpt

public OptionalBoolean 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;

Specified by:: getUseTwoOpt in interface RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder
Returns:: The useTwoOpt.

setUseTwoOpt

public RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder setUseTwoOpt(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;

Parameters:: value - The useTwoOpt to set.
Returns:: This builder for chaining.

clearUseTwoOpt

public 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;

Returns:: This builder for chaining.