Stay organized with collections
Save and categorize content based on your preferences.
C++ Reference: class SchedulingNeighborhoodGenerator
This documentation is automatically generated.
Only make sense for scheduling problem. This select a random set of interval
of the problem according to the difficulty. Then, for each no_overlap
constraints, it adds strict relation order between the non-relaxed intervals.
[[["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 `SchedulingNeighborhoodGenerator` is specifically designed for scheduling problems and uses problem difficulty to select intervals randomly."],["It focuses on 'no_overlap' constraints, establishing strict order relations between intervals not selected for relaxation."],["Currently, it does not handle cumulative constraints, but future development aims to address this limitation."],["It includes the methods `Generate` and `SchedulingNeighborhoodGenerator` to generate neighborhood solutions."]]],["The `SchedulingNeighborhoodGenerator` class, relevant only for scheduling problems, selects a random set of intervals based on difficulty. For each 'no_overlap' constraint, it establishes strict order relations between the non-relaxed intervals. The `Generate` method creates a `Neighborhood` using an initial solution, a difficulty parameter, and a random number generator. The `SchedulingNeighborhoodGenerator` constructor requires a `NeighborhoodGeneratorHelper` and a name. A future enhancement is mentioned, related to handling 'cumulative' constraints.\n"]]
