Solving bi-objective quadratic assignment problem with squirrel search algorithm

The simplest model of multi-objective quadratic assignment problems, bi-objective quadratic assignment problem, is discussed in this paper. Weighted sum method is used in order to change the multi-objectives model into single-objective model. An algorithm inspired from the foraging strategy and gliding mechanism called squirrel search algorithm is proposed to solve this problem. The squirrel search algorithm parameters, such as number of iterations, number of flying squirrels and control parameter, predator presence probability, are observed by managing computational experiment to solve bi-objective quadratic assignment problem. The computational results show that general parameters, number of iteration and flying squirrels, affect the performance of the algorithm in solving this problem. Moreover, probability of predator presence which is as control parameter in this algorithm can bring better result when using smaller value of probability.