Stay organized with collections
Save and categorize content based on your preferences.
C++ Reference: class CheapestAdditionFilteredHeuristic
Note: This documentation is automatically generated.
Filtered-base decision builder based on the addition heuristic, extending
a path from its start node with the cheapest arc.
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."],[[["\u003cp\u003eThe \u003ccode\u003eCheapestAdditionFilteredHeuristic\u003c/code\u003e class in C++ is a decision builder for routing problems.\u003c/p\u003e\n"],["\u003cp\u003eIt extends paths by selecting the cheapest arc from the starting node, using a filtered approach.\u003c/p\u003e\n"],["\u003cp\u003eThis heuristic uses a \u003ccode\u003eLocalSearchFilterManager\u003c/code\u003e for filtering and is part of the OR-Tools constraint solver.\u003c/p\u003e\n"]]],["The `CheapestAdditionFilteredHeuristic` class in C++ is a filtered-base decision builder that uses an addition heuristic. It extends a path from its start by selecting the cheapest arc. Key methods include: `CheapestAdditionFilteredHeuristic`, which takes a `RoutingModel` and `LocalSearchFilterManager` as arguments. The `BuildSolutionInternal` method returns a boolean. The `~CheapestAdditionFilteredHeuristic` is the destructor.\n"],null,["# CheapestAdditionFilteredHeuristic\n\nC++ Reference: class CheapestAdditionFilteredHeuristic\n======================================================\n\n\nNote: This documentation is automatically generated.\nFiltered-base decision builder based on the addition heuristic, extending a path from its start node with the cheapest arc.\n\n| Method ||\n|--------------------------------------------------------------------------------------------------------------------------------------|------------------------------------------------------------------------------------------|\n| [`BuildSolutionInternal`](https://github.com/google/or-tools/blob/v9.4/ortools/constraint_solver/routing_search.h#L848) | Return type: `bool ` \u003cbr /\u003e |\n| [`CheapestAdditionFilteredHeuristic`](https://github.com/google/or-tools/blob/v9.4/ortools/constraint_solver/routing_search.h#L845) | \u003cbr /\u003e Arguments: `RoutingModel* model, LocalSearchFilterManager* filter_manager` \u003cbr /\u003e |\n| [`~CheapestAdditionFilteredHeuristic`](https://github.com/google/or-tools/blob/v9.4/ortools/constraint_solver/routing_search.h#L847) | \u003cbr /\u003e |"]]
