Stay organized with collections
Save and categorize content based on your preferences.
C++ Reference: class PairExchangeOperator
Note: This documentation is automatically generated.
Operator which exchanges the position of two pairs; for both pairs the first
node of the pair must be before the second node on the same path.
Possible neighbors for the paths 1 -> A -> B -> 2 -> 3 and 4 -> C -> D -> 5
(where (1, 3) and (4, 5) are first and last nodes of the paths and can
therefore not be moved, and (A, B) and (C,D) are pairs of nodes):
1 -> [C] -> [D] -> 2 -> 3, 4 -> [A] -> [B] -> 5
[[["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 PairExchangeOperator is used to exchange the positions of two pairs of nodes in a route, where the first node of each pair must precede the second node on the same path."],["This operator is applicable in routing problems for creating new solutions by swapping node pairs within routes."],["The operator is initialized with path variables, secondary variables (if any), a function to determine empty path start classes, and index pairs defining the node pairs to be exchanged."],["It provides methods like `MakeNeighbor` to generate a neighboring solution, `DebugString` for debugging information, and a constructor/destructor for object management."]]],[]]
