Optimizing permutations often involves minimizing the number of swaps required to achieve a desired arrangement. Developing efficient algorithms for this task is crucial in various applications, such as scheduling and sequencing problems. One promising approach is to leverage techniques from combina