Comparison of three neighbor generation structures by Simulated annealing method to solve quadratic assignment problem

There are three neighbor generation structures such as swap, reversion, insertion, methods in the literature, for solving quadratic assignment linear programming problems. Swap is selecting two random positions in permutation encoding representation solution and swapping elements of these positions is the easiest and most widely used way of generating of neighbor solutions and reversion is selecting two random positions in permutation encoding representation solution and reversing the direction between two randomly chosen elements and insertion is Selecting two random positions in permutation encoding representation solution and with due attention to number of chosen elements, reversing the direction between two randomly chosen elements, these methods can be so deferent in finally result. We want to use these methods in one of algorithm like Simulated annealing (SA) and show it has deferent result with these methods.