Stay organized with collections
Save and categorize content based on your preferences.
C++ Reference: class RoutingFullPathNeighborhoodGenerator
Note: This documentation is automatically generated.
This routing based LNS generator aims are relaxing one full path, and make
some room on the other paths to absorb the nodes of the relaxed path.
In order to do so, it will relax the first and the last arc of each path in
the circuit or routes constraints. Then it will relax all arc literals in one
random path. Then it will relax random arcs in the remaining paths until it
reaches the given difficulty.
[[["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."],[],["The `RoutingFullPathNeighborhoodGenerator` class relaxes routes in a solution. It operates by relaxing the first and last arcs of each path and then relaxing all arcs in one random path. It continues by relaxing random arcs in other paths until a set difficulty level is met. The `Generate` method, taking an initial solution, difficulty, and random seed as arguments, returns a `Neighborhood`. The `RoutingFullPathNeighborhoodGenerator` constructor takes a `NeighborhoodGeneratorHelper` and a name.\n"]]
