Stay organized with collections
Save and categorize content based on your preferences.
C++ Reference: class RoutingFilteredHeuristic
Note: This documentation is automatically generated.
Filter-based heuristic dedicated to routing.
| Method |
BuildSolutionFromRoutes | Return type: const Assignment* Arguments:
const std::function<int64_t(int64_t)>& next_accessor Builds a solution starting from the routes formed by the next accessor.
|
GetEndChainStart | Return type: int Arguments: int vehicle Returns the start of the end chain of vehicle,
|
GetStartChainEnd | Return type: int Arguments: int vehicle Returns the end of the start chain of vehicle,
|
MakeDisjunctionNodesUnperformed | Return type: void Arguments: int64_t node Make nodes in the same disjunction as 'node' unperformed. 'node' is a
variable index corresponding to a node.
|
MakePartiallyPerformedPairsUnperformed | Return type: void Make all partially performed pickup and delivery pairs unperformed. A
pair is partially unperformed if one element of the pair has one of its
alternatives performed in the solution and the other has no alternatives
in the solution or none performed.
|
MakeUnassignedNodesUnperformed | Return type: void Make all unassigned nodes unperformed.
|
model | Return type: RoutingModel* |
RoutingFilteredHeuristic | Arguments: RoutingModel* model,
LocalSearchFilterManager* filter_manager,
bool omit_secondary_vars = true |
~RoutingFilteredHeuristic | |
Except as otherwise noted, the content of this page is licensed under the Creative Commons Attribution 4.0 License, and code samples are licensed under the Apache 2.0 License. For details, see the Google Developers Site Policies. Java is a registered trademark of Oracle and/or its affiliates.
Last updated 2024-08-06 UTC.
[null,null,["Last updated 2024-08-06 UTC."],[],["The `RoutingFilteredHeuristic` class manages routing solutions. Key actions include: building solutions from routes using a next accessor (`BuildSolutionFromRoutes`); retrieving the start and end of vehicle chains (`GetStartChainEnd`, `GetEndChainStart`); and manipulating node performance status. Specific node actions include making nodes in a disjunction unperformed, unperforming partially performed pickup/delivery pairs, and unassigning unperformed nodes (`MakeDisjunctionNodesUnperformed`, `MakePartiallyPerformedPairsUnperformed`, `MakeUnassignedNodesUnperformed`). The class also stores a `RoutingModel` and a `LocalSearchFilterManager`.\n"],null,[]]
