C++ Reference: routing_search
Note: This documentation is automatically generated.
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\u003eThis documentation details classes used in C++ for routing search within the constraint solver.\u003c/p\u003e\n"],["\u003cp\u003eIt focuses on filtered heuristics and decision builders for optimizing routes.\u003c/p\u003e\n"],["\u003cp\u003eClasses provided include implementations for various route construction strategies like Cheapest Addition, Christofides, and Savings.\u003c/p\u003e\n"],["\u003cp\u003eDevelopers can use these classes to customize and improve the search for optimal solutions in routing problems.\u003c/p\u003e\n"]]],["The provided C++ routing_search reference documents various classes for optimization and constraint solving. Key actions involve using heuristics like `CheapestAddition`, `Christofides`, and `Savings` for filtering. Other classes include `IntVarFilteredDecisionBuilder` and `RoutingFilteredHeuristic` for decision-making and general routing. `SweepArranger` manages sweep operations, while `VehicleTypeCurator` deals with vehicle type management. These classes provide tools for refining routing solutions in the constraint solver context.\n"],null,["# routing_search\n\nC++ Reference: routing_search\n=============================\n\n\nNote: This documentation is automatically generated.\n\n| Classes ------- ||\n|-----------------------------------------------------------------------------------------------------------------------------------|---|\n| [CheapestAdditionFilteredHeuristic](/optimization/reference/constraint_solver/routing_search/CheapestAdditionFilteredHeuristic) |\n| [CheapestInsertionFilteredHeuristic](/optimization/reference/constraint_solver/routing_search/CheapestInsertionFilteredHeuristic) |\n| [ChristofidesFilteredHeuristic](/optimization/reference/constraint_solver/routing_search/ChristofidesFilteredHeuristic) |\n| [IntVarFilteredDecisionBuilder](/optimization/reference/constraint_solver/routing_search/IntVarFilteredDecisionBuilder) |\n| [IntVarFilteredHeuristic](/optimization/reference/constraint_solver/routing_search/IntVarFilteredHeuristic) |\n| [ParallelSavingsFilteredHeuristic](/optimization/reference/constraint_solver/routing_search/ParallelSavingsFilteredHeuristic) |\n| [RoutingFilteredHeuristic](/optimization/reference/constraint_solver/routing_search/RoutingFilteredHeuristic) |\n| [SavingsFilteredHeuristic](/optimization/reference/constraint_solver/routing_search/SavingsFilteredHeuristic) |\n| [SequentialSavingsFilteredHeuristic](/optimization/reference/constraint_solver/routing_search/SequentialSavingsFilteredHeuristic) |\n| [SweepArranger](/optimization/reference/constraint_solver/routing_search/SweepArranger) |\n| [VehicleTypeCurator](/optimization/reference/constraint_solver/routing_search/VehicleTypeCurator) |"]]