Computers and Operations Research
P-Complete Approximation Problems
Journal of the ACM (JACM)
Parallel ant colonies for the quadratic assignment problem
Future Generation Computer Systems - Special issue on bio-impaired solutions to parallel processing problems
Toward Self-Integrating Software Applications for Supply Chain Management
Information Systems Frontiers
The Ant System Applied to the Quadratic Assignment Problem
IEEE Transactions on Knowledge and Data Engineering
Adaptive memories for the Quadratic Assignment Problems
Adaptive memories for the Quadratic Assignment Problems
A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows
INFORMS Journal on Computing
A tabu search algorithm for the quadratic assignment problem
Computational Optimization and Applications
A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
Computers and Operations Research
Paper: Robust taboo search for the quadratic assignment problem
Parallel Computing
| Hi-index | 0.00 |
QAP is a famous $\mathcal{NP}-$Hard [1] combinatorial optimization problem. Many theoretical and real-life problems could be modeled as it. VNS is a recent metaheuristic and shows good performance in dealing with QAP [2]. In this paper, a new concept distance called permutation distance is proposed and exploited in detail. With permutation distance ready, we combine the hamming distance with it and propose a group of new neighborhood structures in QAP for VNS. Numerical tests running on the standard benchmark library QAPLIB [3] show that this approach would dramatically improve the performance of VNS for QAP. It surpasses some famous metaheuristics and belongs to the most efficient metaheuristics for QAP.