[[["Easy to understand","easyToUnderstand","thumb-up"],["Solved my problem","solvedMyProblem","thumb-up"],["Other","otherUp","thumb-up"]],[["Missing the information I need","missingTheInformationINeed","thumb-down"],["Too complicated / too many steps","tooComplicatedTooManySteps","thumb-down"],["Out of date","outOfDate","thumb-down"],["Samples / code issue","samplesCodeIssue","thumb-down"],["Other","otherDown","thumb-down"]],["Last updated 2024-08-06 UTC."],[[["CheapestInsertionFilteredHeuristic is a C++ class within the OR-Tools library used for routing optimization."],["It 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."],["This heuristic aims to build a solution by iteratively inserting nodes based on the cheapest insertion cost, subject to the filtering criteria and penalty considerations."]]],["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"]]
