C++ Reference: class CheapestInsertionFilteredHeuristic
Note: This documentation is automatically generated.
| Method | |
|---|---|
CheapestInsertionFilteredHeuristic | Arguments: Takes ownership of evaluator. |
~CheapestInsertionFilteredHeuristic | |
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\u003eCheapestInsertionFilteredHeuristic is a C++ class within the OR-Tools library used for routing optimization.\u003c/p\u003e\n"],["\u003cp\u003eIt utilizes a user-defined evaluator function to assess insertion costs and a penalty evaluator for infeasible insertions, along with a filter manager for local search enhancements.\u003c/p\u003e\n"],["\u003cp\u003eThis heuristic aims to build a solution by iteratively inserting nodes based on the cheapest insertion cost, subject to the filtering criteria and penalty considerations.\u003c/p\u003e\n"]]],["The `CheapestInsertionFilteredHeuristic` class in C++ is documented, highlighting its constructor and destructor. The constructor takes a `RoutingModel*`, an evaluator function, a penalty evaluator function, and a `LocalSearchFilterManager*`. It takes ownership of the provided evaluator. The destructor `~CheapestInsertionFilteredHeuristic` is also listed, but it has no specific details in this document. The class uses functions to evaluate and implement a filtered cheapest insertion method.\n"],null,["# CheapestInsertionFilteredHeuristic\n\nC++ Reference: class CheapestInsertionFilteredHeuristic\n=======================================================\n\n\nNote: This documentation is automatically generated.\n\n| Method ||\n|---------------------------------------------------------------------------------------------------------------------------------------|----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| [`CheapestInsertionFilteredHeuristic`](https://github.com/google/or-tools/blob/v9.4/ortools/constraint_solver/routing_search.h#L308) | \u003cbr /\u003e Arguments: ` RoutingModel* model, std::function\u003cint64_t(int64_t, int64_t, int64_t)\u003e evaluator, std::function\u003cint64_t(int64_t)\u003e penalty_evaluator, LocalSearchFilterManager* filter_manager` Takes ownership of evaluator. |\n| [`~CheapestInsertionFilteredHeuristic`](https://github.com/google/or-tools/blob/v9.4/ortools/constraint_solver/routing_search.h#L313) | \u003cbr /\u003e |"]]