[[["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 RoutingRandomNeighborhoodGenerator is a Large Neighborhood Search (LNS) generator used within the or-tools/sat library for constraint programming.\u003c/p\u003e\n"],["\u003cp\u003eIt works by randomly relaxing arcs (connections between nodes) within paths or routes of a given problem's constraints to explore different solutions.\u003c/p\u003e\n"],["\u003cp\u003eUsers can utilize the \u003ccode\u003eGenerate\u003c/code\u003e method, providing an initial solution and difficulty level, to create a neighborhood of solutions for further exploration.\u003c/p\u003e\n"]]],["The `RoutingRandomNeighborhoodGenerator` class in C++ is designed for relaxing random arcs within circuit or route constraints. It features two methods: `Generate`, which creates a `Neighborhood` based on an initial solution, difficulty, and a random number generator, and `RoutingRandomNeighborhoodGenerator`, which is likely a constructor accepting a `NeighborhoodGeneratorHelper` and a name. The core function is generating neighborhoods by randomly selecting arcs for relaxation.\n"],null,[]]
