A Simple Genetic Algorithm using Sequential Constructive Crossover for the Quadratic Assignment Problem

摘要

Since crossover operator plays a vital role in genetic algorithms (GAs), several crossover operators have been proposed for the travelling salesman problem, which are then modified for the quadratic assignment problem (QAP). In this paper, we modify the sequential constructive crossover (SCX) operator for a simple GA to find heuristic solution to the QAP. Efficiency of the proposed GA using SCX is tested on some benchmark QAPLIB instances and then compared with GAs using other existing crossover operators.