A multi-parent genetic algorithm for the quadratic assignment problem

Instead of using traditional (two-parent) crossover operator, multi-parent crossover operator is used in genetic algorithms to improve solution quality for many numerical optimization problems. However, very few literatures are available on multi-parent crossover operator for combinatorial optimization problems, especially, quadratic assignment problem (QAP). This paper proposes a multi-parent extension of the sequential constructive crossover (MPSCX), which is a generalization of the traditional sequential constructive crossover (SCX), for the QAP. Then a multi-parent genetic algorithm (MPGA) using MPSCX is developed. Experimental results on ten QAPLIB instances show that our MPGA significantly improves GA using SCX by up to 1.75 % in average assignment cost with maximum of 2.79 % away from the best known solution value. Finally, the efficiency of our MPGA is compared against MPGA using an existing multi-parent crossover for the problem. Experimental results show that our MPGA is better. © 2015, Operational Research Society of India.