![]() |
OR-Tools
8.1
|
Go to the source code of this file.
Classes | |
class | MakeRelocateNeighborsOperator |
Relocate neighborhood which moves chains of neighbors. More... | |
class | MakePairActiveOperator |
Pair-based neighborhood operators, designed to move nodes by pairs (pairs are static and given). More... | |
class | MakePairInactiveOperator |
Operator which makes pairs of active nodes inactive. More... | |
class | PairRelocateOperator |
Operator which moves a pair of nodes to another position where the first node of the pair must be before the second node on the same path. More... | |
class | LightPairRelocateOperator |
class | PairExchangeOperator |
Operator which exchanges the position of two pairs; for both pairs the first node of the pair must be before the second node on the same path. More... | |
class | PairExchangeRelocateOperator |
Operator which exchanges the paths of two pairs (path have to be different). More... | |
class | SwapIndexPairOperator |
Operator which iterates through each alternative of a set of pairs. More... | |
class | IndexPairSwapActiveOperator |
Operator which inserts inactive nodes into a path and makes a pair of active nodes inactive. More... | |
class | FilteredHeuristicLocalSearchOperator |
Class of operators using a RoutingFilteredHeuristic to insert unperformed nodes after changes have been made to the current solution. More... | |
class | FilteredHeuristicPathLNSOperator |
LNS-like operator based on a filtered first solution heuristic to rebuild the solution, after the destruction phase consisting of removing one route. More... | |
class | RelocatePathAndHeuristicInsertUnperformedOperator |
Heuristic-based local search operator which relocates an entire route to an empty vehicle of different vehicle class and then tries to insert unperformed nodes using the heuristic. More... | |
class | FilteredHeuristicExpensiveChainLNSOperator |
Similar to the heuristic path LNS above, but instead of removing one route entirely, the destruction phase consists of removing all nodes on an "expensive" chain from a route. More... | |
class | FilteredHeuristicCloseNodesLNSOperator |
Filtered heuristic LNS operator, where the destruction phase consists of removing a node and the 'num_close_nodes' nodes closest to it, along with each of their corresponding sibling pickup/deliveries that are performed. More... | |
class | RelocateExpensiveChain |
RelocateExpensiveChain. More... | |
class | PairNodeSwapActiveOperator< swap_first > |
Operator which inserts pairs of inactive nodes into a path and makes an active node inactive. More... | |
class | RelocateSubtrip |
Tries to move subtrips after an insertion node. More... | |
class | ExchangeSubtrip |
Namespaces | |
operations_research | |
The vehicle routing library lets one model and solve generic vehicle routing problems ranging from the Traveling Salesman Problem to more complex problems such as the Capacitated Vehicle Routing Problem with Time Windows. | |