| Package | Description |
|---|---|
| com.google.ortools.constraintsolver | |
| com.google.ortools.linearsolver | |
| com.google.ortools.util |
| Modifier and Type | Method and Description |
|---|---|
OptionalBoolean |
RoutingSearchParametersOrBuilder.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 |
RoutingSearchParameters.Builder.getUseCp()
If true, use the CP solver to find a solution.
|
OptionalBoolean |
RoutingSearchParametersOrBuilder.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 |
RoutingSearchParameters.Builder.getUseCpSat()
If true, use the CP-SAT solver to find a solution.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.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.LocalSearchNeighborhoodOperators.Builder.getUseCross()
Operator which cross exchanges the starting chains of 2 paths, including
exchanging the whole paths.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseCrossExchange()
Not implemented yet.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseCrossExchange()
Not implemented yet.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseCrossExchange()
Not implemented yet.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseExchange()
Operator which exchanges the positions of two nodes.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseExchange()
Operator which exchanges the positions of two nodes.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseExchange()
Operator which exchanges the positions of two nodes.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseExchangeAndMakeActive()
Operator which exchanges two nodes and inserts an inactive node.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseExchangeAndMakeActive()
Operator which exchanges two nodes and inserts an inactive node.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseExchangeAndMakeActive()
Operator which exchanges two nodes and inserts an inactive node.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.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.LocalSearchNeighborhoodOperators.Builder.getUseExchangePair()
Operator which exchanges the positions of two pair of nodes.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseExchangePathStartEndsAndMakeActive()
Operator which exchanges the first and last nodes of two paths and makes
a node active.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseExchangePathStartEndsAndMakeActive()
Operator which exchanges the first and last nodes of two paths and makes
a node active.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseExchangePathStartEndsAndMakeActive()
Operator which exchanges the first and last nodes of two paths and makes
a node active.
|
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.getUseExchangeSubtrip()
Operator which exchanges subtrips associated to two pairs of nodes,
see use_relocate_subtrip for a definition of subtrips.
|
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.LocalSearchNeighborhoodOperatorsOrBuilder.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.LocalSearchNeighborhoodOperators.Builder.getUseExtendedSwapActive()
Operator which makes an inactive node active and an active one inactive.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.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.LocalSearchNeighborhoodOperators.Builder.getUseFullPathLns()
Operator which relaxes one entire path and all inactive nodes.
|
OptionalBoolean |
RoutingSearchParametersOrBuilder.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 |
RoutingSearchParameters.Builder.getUseGeneralizedCpSat()
If true, use the CP-SAT solver to find a solution on generalized routing
model.
|
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.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.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.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.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.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.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.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.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.LocalSearchNeighborhoodOperators.Builder.getUseInactiveLns()
Operator which relaxes all inactive nodes and one sub-chain of six
consecutive arcs.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.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.LocalSearchNeighborhoodOperators.Builder.getUseLightRelocatePair()
Operator which moves a pair of pickup and delivery nodes after another
pair.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseLinKernighan()
Lin-Kernighan operator.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseLinKernighan()
Lin-Kernighan operator.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseLinKernighan()
Lin-Kernighan operator.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.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.LocalSearchNeighborhoodOperators.Builder.getUseLocalCheapestInsertionCloseNodesLns()
Same as above, but insertion positions for nodes are determined by the
LocalCheapestInsertion heuristic.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.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.LocalSearchNeighborhoodOperators.Builder.getUseLocalCheapestInsertionExpensiveChainLns()
Same as above but using LocalCheapestInsertion as a heuristic for
insertion.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.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.LocalSearchNeighborhoodOperators.Builder.getUseLocalCheapestInsertionPathLns()
Same as above but using LocalCheapestInsertion as a heuristic.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.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.LocalSearchNeighborhoodOperators.Builder.getUseMakeActive()
--- Operators on inactive nodes ---
Operator which inserts an inactive node into a path.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.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.LocalSearchNeighborhoodOperators.Builder.getUseMakeChainInactive()
Operator which makes a "chain" of path nodes inactive.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseMakeInactive()
Operator which makes path nodes inactive.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseMakeInactive()
Operator which makes path nodes inactive.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseMakeInactive()
Operator which makes path nodes 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.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.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.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.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.LocalSearchNeighborhoodOperatorsOrBuilder.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.LocalSearchNeighborhoodOperators.Builder.getUsePathLns()
--- Large neighborhood search operators ---
Operator which relaxes two sub-chains of three consecutive arcs each.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.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.LocalSearchNeighborhoodOperators.Builder.getUseRelocate()
--- Inter-route operators ---
Operator which moves a single node to another position.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.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.LocalSearchNeighborhoodOperators.Builder.getUseRelocateAndMakeActive()
Operator which relocates a node while making an inactive one active.
|
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.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.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.getUseRelocateNeighbors()
Relocate neighborhood which moves chains of neighbors.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseRelocateNeighbors()
Relocate neighborhood which moves chains of neighbors.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseRelocateNeighbors()
Relocate neighborhood which moves chains of neighbors.
|
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.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.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.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.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.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.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.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.getUseShortestPathSwapActive()
Swaps active nodes from node alternatives in sequence.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseShortestPathSwapActive()
Swaps active nodes from node alternatives in sequence.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseShortestPathSwapActive()
Swaps active nodes from node alternatives in sequence.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseShortestPathTwoOpt()
Similar to use_two_opt but returns the shortest path on the DAG of node
alternatives of the reversed chain (cf. use_shortest_path_swap_active).
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseShortestPathTwoOpt()
Similar to use_two_opt but returns the shortest path on the DAG of node
alternatives of the reversed chain (cf. use_shortest_path_swap_active).
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseShortestPathTwoOpt()
Similar to use_two_opt but returns the shortest path on the DAG of node
alternatives of the reversed chain (cf. use_shortest_path_swap_active).
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.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.LocalSearchNeighborhoodOperators.Builder.getUseSwapActive()
Operator which replaces an active node by an inactive one.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseSwapActiveChain()
Operator which replaces a chain of active nodes by an inactive one.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseSwapActiveChain()
Operator which replaces a chain of active nodes by an inactive one.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseSwapActiveChain()
Operator which replaces a chain of active nodes by an inactive one.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseTspLns()
TSP-base LNS.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseTspLns()
TSP-base LNS.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseTspLns()
TSP-base LNS.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseTspOpt()
Sliding TSP operator.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseTspOpt()
Sliding TSP operator.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseTspOpt()
Sliding TSP operator.
|
OptionalBoolean |
RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.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.LocalSearchNeighborhoodOperators.Builder.getUseTwoOpt()
--- Intra-route operators ---
Operator which reverses a subchain of a path.
|
| Modifier and Type | Method and Description |
|---|---|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.setUseCp(OptionalBoolean value)
If true, use the CP solver to find a solution.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.setUseCpSat(OptionalBoolean value)
If true, use the CP-SAT solver to find a solution.
|
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseCross(OptionalBoolean value)
Operator which cross exchanges the starting chains of 2 paths, including
exchanging the whole paths.
|
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseCrossExchange(OptionalBoolean value)
Not implemented yet.
|
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseExchange(OptionalBoolean value)
Operator which exchanges the positions of two nodes.
|
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseExchangeAndMakeActive(OptionalBoolean value)
Operator which exchanges two nodes and inserts an inactive node.
|
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseExchangePair(OptionalBoolean value)
Operator which exchanges the positions of two pair of nodes.
|
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseExchangePathStartEndsAndMakeActive(OptionalBoolean value)
Operator which exchanges the first and last nodes of two paths and makes
a node active.
|
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder |
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 |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseExtendedSwapActive(OptionalBoolean value)
Operator which makes an inactive node active and an active one inactive.
|
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseFullPathLns(OptionalBoolean value)
Operator which relaxes one entire path and all inactive nodes.
|
RoutingSearchParameters.Builder |
RoutingSearchParameters.Builder.setUseGeneralizedCpSat(OptionalBoolean value)
If true, use the CP-SAT solver to find a solution on generalized routing
model.
|
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder |
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 |
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 |
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 |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseInactiveLns(OptionalBoolean value)
Operator which relaxes all inactive nodes and one sub-chain of six
consecutive arcs.
|
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseLightRelocatePair(OptionalBoolean value)
Operator which moves a pair of pickup and delivery nodes after another
pair.
|
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseLinKernighan(OptionalBoolean value)
Lin-Kernighan operator.
|
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseLocalCheapestInsertionCloseNodesLns(OptionalBoolean value)
Same as above, but insertion positions for nodes are determined by the
LocalCheapestInsertion heuristic.
|
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseLocalCheapestInsertionExpensiveChainLns(OptionalBoolean value)
Same as above but using LocalCheapestInsertion as a heuristic for
insertion.
|
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseLocalCheapestInsertionPathLns(OptionalBoolean value)
Same as above but using LocalCheapestInsertion as a heuristic.
|
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseMakeActive(OptionalBoolean value)
--- Operators on inactive nodes ---
Operator which inserts an inactive node into a path.
|
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseMakeChainInactive(OptionalBoolean value)
Operator which makes a "chain" of path nodes inactive.
|
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseMakeInactive(OptionalBoolean value)
Operator which makes path nodes inactive.
|
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder |
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 |
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 |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUsePathLns(OptionalBoolean value)
--- Large neighborhood search operators ---
Operator which relaxes two sub-chains of three consecutive arcs each.
|
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseRelocate(OptionalBoolean value)
--- Inter-route operators ---
Operator which moves a single node to another position.
|
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseRelocateAndMakeActive(OptionalBoolean value)
Operator which relocates a node while making an inactive one active.
|
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder |
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 |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseRelocateNeighbors(OptionalBoolean value)
Relocate neighborhood which moves chains of neighbors.
|
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder |
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 |
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 |
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 |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseShortestPathSwapActive(OptionalBoolean value)
Swaps active nodes from node alternatives in sequence.
|
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseShortestPathTwoOpt(OptionalBoolean value)
Similar to use_two_opt but returns the shortest path on the DAG of node
alternatives of the reversed chain (cf. use_shortest_path_swap_active).
|
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseSwapActive(OptionalBoolean value)
Operator which replaces an active node by an inactive one.
|
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseSwapActiveChain(OptionalBoolean value)
Operator which replaces a chain of active nodes by an inactive one.
|
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseTspLns(OptionalBoolean value)
TSP-base LNS.
|
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseTspOpt(OptionalBoolean value)
Sliding TSP operator.
|
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder |
RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseTwoOpt(OptionalBoolean value)
--- Intra-route operators ---
Operator which reverses a subchain of a path.
|
| Modifier and Type | Method and Description |
|---|---|
OptionalBoolean |
MPSolverCommonParametersOrBuilder.getPresolve()
Gurobi and SCIP enable presolve by default.
|
OptionalBoolean |
MPSolverCommonParameters.getPresolve()
Gurobi and SCIP enable presolve by default.
|
OptionalBoolean |
MPSolverCommonParameters.Builder.getPresolve()
Gurobi and SCIP enable presolve by default.
|
OptionalBoolean |
MPSolverCommonParametersOrBuilder.getScaling()
Enable automatic scaling of matrix coefficients and objective.
|
OptionalBoolean |
MPSolverCommonParameters.getScaling()
Enable automatic scaling of matrix coefficients and objective.
|
OptionalBoolean |
MPSolverCommonParameters.Builder.getScaling()
Enable automatic scaling of matrix coefficients and objective.
|
| Modifier and Type | Method and Description |
|---|---|
MPSolverCommonParameters.Builder |
MPSolverCommonParameters.Builder.setPresolve(OptionalBoolean value)
Gurobi and SCIP enable presolve by default.
|
MPSolverCommonParameters.Builder |
MPSolverCommonParameters.Builder.setScaling(OptionalBoolean value)
Enable automatic scaling of matrix coefficients and objective.
|
| Modifier and Type | Method and Description |
|---|---|
static OptionalBoolean |
OptionalBoolean.forNumber(int value) |
static OptionalBoolean |
OptionalBoolean.valueOf(com.google.protobuf.Descriptors.EnumValueDescriptor desc) |
static OptionalBoolean |
OptionalBoolean.valueOf(int value)
Deprecated.
Use
forNumber(int) instead. |
static OptionalBoolean |
OptionalBoolean.valueOf(java.lang.String name)
Returns the enum constant of this type with the specified name.
|
static OptionalBoolean[] |
OptionalBoolean.values()
Returns an array containing the constants of this enum type, in
the order they are declared.
|
| Modifier and Type | Method and Description |
|---|---|
static com.google.protobuf.Internal.EnumLiteMap<OptionalBoolean> |
OptionalBoolean.internalGetValueMap() |
Copyright © 2025. All rights reserved.