Uses of Enum
com.google.ortools.util.OptionalBoolean
Packages that use OptionalBoolean
Package
Description
-
Uses of OptionalBoolean in com.google.ortools.constraintsolver
Methods in com.google.ortools.constraintsolver that return OptionalBooleanModifier and TypeMethodDescriptionRoutingSearchParameters.Builder.getUseCp()If true, use the CP solver to find a solution.RoutingSearchParameters.getUseCp()If true, use the CP solver to find a solution.RoutingSearchParametersOrBuilder.getUseCp()If true, use the CP solver to find a solution.RoutingSearchParameters.Builder.getUseCpSat()If true, use the CP-SAT solver to find a solution.RoutingSearchParameters.getUseCpSat()If true, use the CP-SAT solver to find a solution.RoutingSearchParametersOrBuilder.getUseCpSat()If true, use the CP-SAT solver to find a solution.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseCross()Operator which cross exchanges the starting chains of 2 paths, including exchanging the whole paths.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseCross()Operator which cross exchanges the starting chains of 2 paths, including exchanging the whole paths.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseCross()Operator which cross exchanges the starting chains of 2 paths, including exchanging the whole paths.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseCrossExchange()Not implemented yet.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseCrossExchange()Not implemented yet.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseCrossExchange()Not implemented yet.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseExchange()Operator which exchanges the positions of two nodes.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseExchange()Operator which exchanges the positions of two nodes.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseExchange()Operator which exchanges the positions of two nodes.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseExchangeAndMakeActive()Operator which exchanges two nodes and inserts an inactive node.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseExchangeAndMakeActive()Operator which exchanges two nodes and inserts an inactive node.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseExchangeAndMakeActive()Operator which exchanges two nodes and inserts an inactive node.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseExchangePair()Operator which exchanges the positions of two pair of nodes.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseExchangePair()Operator which exchanges the positions of two pair of nodes.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseExchangePair()Operator which exchanges the positions of two pair of nodes.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseExchangePathStartEndsAndMakeActive()Operator which exchanges the first and last nodes of two paths and makes a node active.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseExchangePathStartEndsAndMakeActive()Operator which exchanges the first and last nodes of two paths and makes a node active.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseExchangePathStartEndsAndMakeActive()Operator which exchanges the first and last nodes of two paths and makes a node active.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseExchangeSubtrip()Operator which exchanges subtrips associated to two pairs of nodes, see use_relocate_subtrip for a definition of subtrips.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseExchangeSubtrip()Operator which exchanges subtrips associated to two pairs of nodes, see use_relocate_subtrip for a definition of subtrips.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseExchangeSubtrip()Operator which exchanges subtrips associated to two pairs of nodes, see use_relocate_subtrip for a definition of subtrips.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseExtendedSwapActive()Operator which makes an inactive node active and an active one inactive.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseExtendedSwapActive()Operator which makes an inactive node active and an active one inactive.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseExtendedSwapActive()Operator which makes an inactive node active and an active one inactive.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseFullPathLns()Operator which relaxes one entire path and all inactive nodes.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseFullPathLns()Operator which relaxes one entire path and all inactive nodes.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseFullPathLns()Operator which relaxes one entire path and all inactive nodes.RoutingSearchParameters.Builder.getUseGeneralizedCpSat()If true, use the CP-SAT solver to find a solution on generalized routing model.RoutingSearchParameters.getUseGeneralizedCpSat()If true, use the CP-SAT solver to find a solution on generalized routing model.RoutingSearchParametersOrBuilder.getUseGeneralizedCpSat()If true, use the CP-SAT solver to find a solution on generalized routing model.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.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.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.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.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.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.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.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.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.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseInactiveLns()Operator which relaxes all inactive nodes and one sub-chain of six consecutive arcs.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseInactiveLns()Operator which relaxes all inactive nodes and one sub-chain of six consecutive arcs.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseInactiveLns()Operator which relaxes all inactive nodes and one sub-chain of six consecutive arcs.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseLightRelocatePair()Operator which moves a pair of pickup and delivery nodes after another pair.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseLightRelocatePair()Operator which moves a pair of pickup and delivery nodes after another pair.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseLightRelocatePair()Operator which moves a pair of pickup and delivery nodes after another pair.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseLinKernighan()Lin-Kernighan operator.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseLinKernighan()Lin-Kernighan operator.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseLinKernighan()Lin-Kernighan operator.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseLocalCheapestInsertionCloseNodesLns()Same as above, but insertion positions for nodes are determined by the LocalCheapestInsertion heuristic.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseLocalCheapestInsertionCloseNodesLns()Same as above, but insertion positions for nodes are determined by the LocalCheapestInsertion heuristic.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseLocalCheapestInsertionCloseNodesLns()Same as above, but insertion positions for nodes are determined by the LocalCheapestInsertion heuristic.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseLocalCheapestInsertionExpensiveChainLns()Same as above but using LocalCheapestInsertion as a heuristic for insertion.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseLocalCheapestInsertionExpensiveChainLns()Same as above but using LocalCheapestInsertion as a heuristic for insertion.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseLocalCheapestInsertionExpensiveChainLns()Same as above but using LocalCheapestInsertion as a heuristic for insertion.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseLocalCheapestInsertionPathLns()Same as above but using LocalCheapestInsertion as a heuristic.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseLocalCheapestInsertionPathLns()Same as above but using LocalCheapestInsertion as a heuristic.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseLocalCheapestInsertionPathLns()Same as above but using LocalCheapestInsertion as a heuristic.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseMakeActive()--- Operators on inactive nodes --- Operator which inserts an inactive node into a path.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseMakeActive()--- Operators on inactive nodes --- Operator which inserts an inactive node into a path.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseMakeActive()--- Operators on inactive nodes --- Operator which inserts an inactive node into a path.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseMakeChainInactive()Operator which makes a "chain" of path nodes inactive.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseMakeChainInactive()Operator which makes a "chain" of path nodes inactive.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseMakeChainInactive()Operator which makes a "chain" of path nodes inactive.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseMakeInactive()Operator which makes path nodes inactive.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseMakeInactive()Operator which makes path nodes inactive.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseMakeInactive()Operator which makes path nodes inactive.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.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.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.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.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseOrOpt()Operator which moves sub-chains of a path of length 1, 2 and 3 to another position in the same path.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseOrOpt()Operator which moves sub-chains of a path of length 1, 2 and 3 to another position in the same path.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUsePathLns()--- Large neighborhood search operators --- Operator which relaxes two sub-chains of three consecutive arcs each.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUsePathLns()--- Large neighborhood search operators --- Operator which relaxes two sub-chains of three consecutive arcs each.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUsePathLns()--- Large neighborhood search operators --- Operator which relaxes two sub-chains of three consecutive arcs each.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseRelocate()--- Inter-route operators --- Operator which moves a single node to another position.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseRelocate()--- Inter-route operators --- Operator which moves a single node to another position.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseRelocate()--- Inter-route operators --- Operator which moves a single node to another position.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseRelocateAndMakeActive()Operator which relocates a node while making an inactive one active.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseRelocateAndMakeActive()Operator which relocates a node while making an inactive one active.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseRelocateAndMakeActive()Operator which relocates a node while making an inactive one active.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.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.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.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseRelocateNeighbors()Relocate neighborhood which moves chains of neighbors.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseRelocateNeighbors()Relocate neighborhood which moves chains of neighbors.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseRelocateNeighbors()Relocate neighborhood which moves chains of neighbors.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.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.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.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.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.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.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.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.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.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseShortestPathSwapActive()Swaps active nodes from node alternatives in sequence.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseShortestPathSwapActive()Swaps active nodes from node alternatives in sequence.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseShortestPathSwapActive()Swaps active nodes from node alternatives in sequence.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).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).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).RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseSwapActive()Operator which replaces an active node by an inactive one.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseSwapActive()Operator which replaces an active node by an inactive one.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseSwapActive()Operator which replaces an active node by an inactive one.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseSwapActiveChain()Operator which replaces a chain of active nodes by an inactive one.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseSwapActiveChain()Operator which replaces a chain of active nodes by an inactive one.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseSwapActiveChain()Operator which replaces a chain of active nodes by an inactive one.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseTspLns()TSP-base LNS.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseTspLns()TSP-base LNS.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseTspLns()TSP-base LNS.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseTspOpt()Sliding TSP operator.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseTspOpt()Sliding TSP operator.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseTspOpt()Sliding TSP operator.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.getUseTwoOpt()--- Intra-route operators --- Operator which reverses a subchain of a path.RoutingSearchParameters.LocalSearchNeighborhoodOperators.getUseTwoOpt()--- Intra-route operators --- Operator which reverses a subchain of a path.RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder.getUseTwoOpt()--- Intra-route operators --- Operator which reverses a subchain of a path.Methods in com.google.ortools.constraintsolver with parameters of type OptionalBooleanModifier and TypeMethodDescriptionRoutingSearchParameters.Builder.setUseCp(OptionalBoolean value) If true, use the CP solver to find a solution.RoutingSearchParameters.Builder.setUseCpSat(OptionalBoolean value) If true, use the CP-SAT solver to find a solution.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.setUseExchange(OptionalBoolean value) Operator which exchanges the positions of two nodes.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseExchangeAndMakeActive(OptionalBoolean value) Operator which exchanges two nodes and inserts an inactive node.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseExchangePair(OptionalBoolean value) Operator which exchanges the positions of two pair of nodes.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.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.setUseExtendedSwapActive(OptionalBoolean 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.Builder.setUseGeneralizedCpSat(OptionalBoolean value) If true, use the CP-SAT solver to find a solution on generalized routing model.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.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.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.setUseInactiveLns(OptionalBoolean 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.setUseLinKernighan(OptionalBoolean 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.setUseLocalCheapestInsertionExpensiveChainLns(OptionalBoolean 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.setUseMakeActive(OptionalBoolean 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.setUseMakeInactive(OptionalBoolean 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.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.setUsePathLns(OptionalBoolean 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.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.setUseRelocateNeighbors(OptionalBoolean 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.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.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.setUseShortestPathSwapActive(OptionalBoolean value) Swaps active nodes from node alternatives in sequence.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.setUseSwapActive(OptionalBoolean value) Operator which replaces an active node by an inactive one.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseSwapActiveChain(OptionalBoolean value) Operator which replaces a chain of active nodes by an inactive one.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseTspLns(OptionalBoolean value) TSP-base LNS.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseTspOpt(OptionalBoolean value) Sliding TSP operator.RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder.setUseTwoOpt(OptionalBoolean value) --- Intra-route operators --- Operator which reverses a subchain of a path. -
Uses of OptionalBoolean in com.google.ortools.linearsolver
Methods in com.google.ortools.linearsolver that return OptionalBooleanModifier and TypeMethodDescriptionMPSolverCommonParameters.Builder.getPresolve()Gurobi and SCIP enable presolve by default.MPSolverCommonParameters.getPresolve()Gurobi and SCIP enable presolve by default.MPSolverCommonParametersOrBuilder.getPresolve()Gurobi and SCIP enable presolve by default.MPSolverCommonParameters.Builder.getScaling()Enable automatic scaling of matrix coefficients and objective.MPSolverCommonParameters.getScaling()Enable automatic scaling of matrix coefficients and objective.MPSolverCommonParametersOrBuilder.getScaling()Enable automatic scaling of matrix coefficients and objective.Methods in com.google.ortools.linearsolver with parameters of type OptionalBooleanModifier and TypeMethodDescriptionMPSolverCommonParameters.Builder.setPresolve(OptionalBoolean value) Gurobi and SCIP enable presolve by default.MPSolverCommonParameters.Builder.setScaling(OptionalBoolean value) Enable automatic scaling of matrix coefficients and objective. -
Uses of OptionalBoolean in com.google.ortools.util
Subclasses with type arguments of type OptionalBoolean in com.google.ortools.utilModifier and TypeClassDescriptionenumA "three-way" boolean: unspecified, false or true.Methods in com.google.ortools.util that return OptionalBooleanModifier and TypeMethodDescriptionstatic OptionalBooleanOptionalBoolean.forNumber(int value) static OptionalBooleanOptionalBoolean.valueOf(int value) Deprecated.static OptionalBooleanOptionalBoolean.valueOf(com.google.protobuf.Descriptors.EnumValueDescriptor desc) Returns the enum constant of this type with the specified name.static OptionalBooleanReturns 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.Methods in com.google.ortools.util that return types with arguments of type OptionalBooleanModifier and TypeMethodDescriptionstatic com.google.protobuf.Internal.EnumLiteMap<OptionalBoolean> OptionalBoolean.internalGetValueMap()