[[["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."],[[["\u003cp\u003eThe RoutingPathNeighborhoodGenerator is a Large Neighborhood Search (LNS) operator used within the Constraint Programming (CP) solver.\u003c/p\u003e\n"],["\u003cp\u003eIt focuses on randomly relaxing small sequences of arcs within the paths or routes defined in the circuit or routes constraints of a routing problem.\u003c/p\u003e\n"],["\u003cp\u003eThis generator helps to explore the solution space by creating variations of an initial solution, enabling the solver to potentially find better solutions.\u003c/p\u003e\n"]]],["The `RoutingPathNeighborhoodGenerator` class in C++ relaxes small, randomly selected arc sequences within the paths of circuit or route constraints. The core method, `Generate`, takes an initial solution, difficulty level, and a random number generator as input and returns a `Neighborhood`. The constructor `RoutingPathNeighborhoodGenerator` requires a `NeighborhoodGeneratorHelper` pointer and a name. This class is part of an LNS (Large Neighborhood Search) approach for routing optimization.\n"],null,[]]
