We investigate the computational complexity of finding an element of a permutation group~$H\subseteq S_n$ with a minimal distance to a given~$\pi\in S_n$, for different metrics on~$S_n$. We assume that~$H$ is given by a set of generators, such that the problem cannot be solved in polynomial time by exhaustive enumeration. For ... more >>>