An example of the quadratic assignment problem (QAP) is the facility location problem, in which n facilities are assigned, at minimum cost, to n sites. Between each pair of facilities, there is a ...

This is a preview. Log in through your library . Abstract The quadratic assignment problem (QAP) is arguably one of the hardest NP-hard discrete optimization problems. Problems of dimension greater ...

Abstract: The Quadratic assignment problem (QAP), referring to finding an optimal assignment between two sets of interrelated objects, is a fundamental problem in combinatorial optimization. It is ...

Abstract: The aim of this paper is to present a Hybrid Chicken Swarm Optimization algorithm (HCSO) with the parallel computing technique to solve quadratic assignment problem by integrating the GRASP ...