A discrete artificial bee colony algorithm for quadratic assignment problem

The quadratic assignment problem (QAP) is a well-known challenging combinational optimization problem that has received many researchers' attention with varied real-world and industrial applications areas. Using the framework of basic artificial bee colony algorithm, frequently used crossover and mutation operators, and combined with an effective local search method, this paper proposes a simple but effective discrete artificial bee colony (DABC) algorithm for solving quadratic assignment problems (QAPs). Typical QAP benchmark instances are selected from QAPLIB in order to conduct the simulation experiment where common performance metrics are used to evaluate the algorithm. The paper also investigates the influence factors of the algorithm's performance. The results show that the proposed algorithm is a quite effective and practical new approach for handling QAP problems.