Optimization-based supersymmetry model of permutations groups

Abstract

This paper presents the super symmetry model of permutations groups. It is inspired by super symmetry, in which theoretical physicists postulate the existence of super partners for each fundamental particle of the standard model. Under these same ideas and analyzes on the structures of permutations, one-one correspondence (or entanglements) was found in the set of permutations. In this work is proposed exploit the benefits of symmetry to split the search space of combinatorial optimization problems on permutations. Therefore, a strategy exploration landscape objective function was developed based on the entanglement, which is simultaneously evaluate related permutations. The experimental results indicate that this approach provides improved computational time brute-force search and higher quality solutions on genetic algorithms is achieved.