OptionalBoolean |
RoutingSearchParameters.Builder.getUseCp() |
If true, use the CP solver to find a solution.
|
OptionalBoolean |
RoutingSearchParameters.getUseCp() |
If true, use the CP solver to find a solution.
|
OptionalBoolean |
RoutingSearchParametersOrBuilder.getUseCp() |
If true, use the CP solver to find a solution.
|
OptionalBoolean |
RoutingSearchParameters.Builder.getUseCpSat() |
If true, use the CP-SAT solver to find a solution.
|
OptionalBoolean |
RoutingSearchParameters.getUseCpSat() |
If true, use the CP-SAT solver to find a solution.
|
OptionalBoolean |
RoutingSearchParametersOrBuilder.getUseCpSat() |
If true, use the CP-SAT solver to find a solution.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseCross() |
Operator which cross exchanges the starting chains of 2 paths, including
exchanging the whole paths.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseCross() |
Operator which cross exchanges the starting chains of 2 paths, including
exchanging the whole paths.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseCross() |
Operator which cross exchanges the starting chains of 2 paths, including
exchanging the whole paths.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseCrossExchange() |
Not implemented yet.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseCrossExchange() |
Not implemented yet.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseCrossExchange() |
Not implemented yet.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseExchange() |
Operator which exchanges the positions of two nodes.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseExchange() |
Operator which exchanges the positions of two nodes.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseExchange() |
Operator which exchanges the positions of two nodes.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseExchangePair() |
Operator which exchanges the positions of two pair of nodes.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseExchangePair() |
Operator which exchanges the positions of two pair of nodes.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseExchangePair() |
Operator which exchanges the positions of two pair of nodes.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseExchangeSubtrip() |
Operator which exchanges subtrips associated to two pairs of nodes,
see use_relocate_subtrip for a definition of subtrips.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseExchangeSubtrip() |
Operator which exchanges subtrips associated to two pairs of nodes,
see use_relocate_subtrip for a definition of subtrips.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseExchangeSubtrip() |
Operator which exchanges subtrips associated to two pairs of nodes,
see use_relocate_subtrip for a definition of subtrips.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseExtendedSwapActive() |
Operator which makes an inactive node active and an active one inactive.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseExtendedSwapActive() |
Operator which makes an inactive node active and an active one inactive.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseExtendedSwapActive() |
Operator which makes an inactive node active and an active one inactive.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseFullPathLns() |
Operator which relaxes one entire path and all inactive nodes.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseFullPathLns() |
Operator which relaxes one entire path and all inactive nodes.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseFullPathLns() |
Operator which relaxes one entire path and all inactive nodes.
|
OptionalBoolean |
RoutingSearchParameters.Builder.getUseGeneralizedCpSat() |
If true, use the CP-SAT solver to find a solution on generalized routing
model.
|
OptionalBoolean |
RoutingSearchParameters.getUseGeneralizedCpSat() |
If true, use the CP-SAT solver to find a solution on generalized routing
model.
|
OptionalBoolean |
RoutingSearchParametersOrBuilder.getUseGeneralizedCpSat() |
If true, use the CP-SAT solver to find a solution on generalized routing
model.
|
OptionalBoolean |
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.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseGlobalCheapestInsertionCloseNodesLns() |
The following operator makes a node and its
heuristic_close_nodes_lns_num_nodes closest neighbors unperformed along
with each of their corresponding performed pickup/delivery pairs, and
then reinserts them using the GlobalCheapestInsertion heuristic.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.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.
|
OptionalBoolean |
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.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseGlobalCheapestInsertionExpensiveChainLns() |
This operator finds heuristic_expensive_chain_lns_num_arcs_to_consider
most expensive arcs on a route, makes the nodes in between pairs of these
expensive arcs unperformed, and reinserts them using the
GlobalCheapestInsertion heuristic.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.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.
|
OptionalBoolean |
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.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseGlobalCheapestInsertionPathLns() |
--- LNS-like large neighborhood search operators using heuristics ---
Operator which makes all nodes on a route unperformed, and reinserts them
using the GlobalCheapestInsertion heuristic.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.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.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseInactiveLns() |
Operator which relaxes all inactive nodes and one sub-chain of six
consecutive arcs.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseInactiveLns() |
Operator which relaxes all inactive nodes and one sub-chain of six
consecutive arcs.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseInactiveLns() |
Operator which relaxes all inactive nodes and one sub-chain of six
consecutive arcs.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseLightRelocatePair() |
Operator which moves a pair of pickup and delivery nodes after another
pair.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseLightRelocatePair() |
Operator which moves a pair of pickup and delivery nodes after another
pair.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseLightRelocatePair() |
Operator which moves a pair of pickup and delivery nodes after another
pair.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseLinKernighan() |
Lin-Kernighan operator.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseLinKernighan() |
Lin-Kernighan operator.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseLinKernighan() |
Lin-Kernighan operator.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseLocalCheapestInsertionCloseNodesLns() |
Same as above, but insertion positions for nodes are determined by the
LocalCheapestInsertion heuristic.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseLocalCheapestInsertionCloseNodesLns() |
Same as above, but insertion positions for nodes are determined by the
LocalCheapestInsertion heuristic.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseLocalCheapestInsertionCloseNodesLns() |
Same as above, but insertion positions for nodes are determined by the
LocalCheapestInsertion heuristic.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseLocalCheapestInsertionExpensiveChainLns() |
Same as above but using LocalCheapestInsertion as a heuristic for
insertion.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseLocalCheapestInsertionExpensiveChainLns() |
Same as above but using LocalCheapestInsertion as a heuristic for
insertion.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseLocalCheapestInsertionExpensiveChainLns() |
Same as above but using LocalCheapestInsertion as a heuristic for
insertion.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseLocalCheapestInsertionPathLns() |
Same as above but using LocalCheapestInsertion as a heuristic.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseLocalCheapestInsertionPathLns() |
Same as above but using LocalCheapestInsertion as a heuristic.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseLocalCheapestInsertionPathLns() |
Same as above but using LocalCheapestInsertion as a heuristic.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseMakeActive() |
--- Operators on inactive nodes ---
Operator which inserts an inactive node into a path.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseMakeActive() |
--- Operators on inactive nodes ---
Operator which inserts an inactive node into a path.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseMakeActive() |
--- Operators on inactive nodes ---
Operator which inserts an inactive node into a path.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseMakeChainInactive() |
Operator which makes a "chain" of path nodes inactive.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseMakeChainInactive() |
Operator which makes a "chain" of path nodes inactive.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseMakeChainInactive() |
Operator which makes a "chain" of path nodes inactive.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseMakeInactive() |
Operator which makes path nodes inactive.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseMakeInactive() |
Operator which makes path nodes inactive.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseMakeInactive() |
Operator which makes path nodes inactive.
|
OptionalBoolean |
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.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseNodePairSwapActive() |
Operator which makes an inactive node active and an active pair of nodes
inactive OR makes an inactive pair of nodes active and an active node
inactive.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.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.
|
OptionalBoolean |
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.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseOrOpt() |
Operator which moves sub-chains of a path of length 1, 2 and 3 to another
position in the same path.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseOrOpt() |
Operator which moves sub-chains of a path of length 1, 2 and 3 to another
position in the same path.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUsePathLns() |
--- Large neighborhood search operators ---
Operator which relaxes two sub-chains of three consecutive arcs each.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUsePathLns() |
--- Large neighborhood search operators ---
Operator which relaxes two sub-chains of three consecutive arcs each.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUsePathLns() |
--- Large neighborhood search operators ---
Operator which relaxes two sub-chains of three consecutive arcs each.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseRelocate() |
--- Inter-route operators ---
Operator which moves a single node to another position.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseRelocate() |
--- Inter-route operators ---
Operator which moves a single node to another position.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseRelocate() |
--- Inter-route operators ---
Operator which moves a single node to another position.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseRelocateAndMakeActive() |
Operator which relocates a node while making an inactive one active.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseRelocateAndMakeActive() |
Operator which relocates a node while making an inactive one active.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseRelocateAndMakeActive() |
Operator which relocates a node while making an inactive one active.
|
OptionalBoolean |
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.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseRelocateExpensiveChain() |
Operator which detects the relocate_expensive_chain_num_arcs_to_consider
most expensive arcs on a path, and moves the chain resulting from cutting
pairs of arcs among these to another position.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.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.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseRelocateNeighbors() |
Relocate neighborhood which moves chains of neighbors.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseRelocateNeighbors() |
Relocate neighborhood which moves chains of neighbors.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseRelocateNeighbors() |
Relocate neighborhood which moves chains of neighbors.
|
OptionalBoolean |
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.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseRelocatePair() |
Operator which moves a pair of pickup and delivery nodes to another
position where the first node of the pair must be before the second node
on the same path.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.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.
|
OptionalBoolean |
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.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseRelocatePathGlobalCheapestInsertionInsertUnperformed() |
The following operator relocates an entire route to an empty path and
then tries to insert the unperformed nodes using the global cheapest
insertion heuristic.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.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.
|
OptionalBoolean |
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.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseRelocateSubtrip() |
Relocate neighborhood that moves subpaths all pickup and delivery
pairs have both pickup and delivery inside the subpath or both outside
the subpath.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseRelocateSubtrip() |
Relocate neighborhood that moves subpaths all pickup and delivery
pairs have both pickup and delivery inside the subpath or both outside
the subpath.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseShortestPathSwapActive() |
Swaps active nodes from node alternatives in sequence.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseShortestPathSwapActive() |
Swaps active nodes from node alternatives in sequence.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseShortestPathSwapActive() |
Swaps active nodes from node alternatives in sequence.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseSwapActive() |
Operator which replaces an active node by an inactive one.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseSwapActive() |
Operator which replaces an active node by an inactive one.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseSwapActive() |
Operator which replaces an active node by an inactive one.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseTspLns() |
TSP-base LNS.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseTspLns() |
TSP-base LNS.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseTspLns() |
TSP-base LNS.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseTspOpt() |
Sliding TSP operator.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseTspOpt() |
Sliding TSP operator.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseTspOpt() |
Sliding TSP operator.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseTwoOpt() |
--- Intra-route operators ---
Operator which reverses a subchain of a path.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseTwoOpt() |
--- Intra-route operators ---
Operator which reverses a subchain of a path.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseTwoOpt() |
--- Intra-route operators ---
Operator which reverses a subchain of a path.
|