Applying Permutation Distance in VNS for QAP
نویسندگان
چکیده
In this paper, a new concept distance called permutation distance is proposed and exploited in detail. We combine it with the hamming distance and propose a group of new neighborhood structures in VNS for QAP. Numerical tests running on the standard benchmark library QAPLIB show that this approach would dramatically improve the performance of VNS for QAP.
منابع مشابه
Adaptive Memories for the Quadratic Assignment Problem
The paper proposes, compares and analyses different memory-based meta-heuristics for the quadratic assignment problem (QAP). Two of these methods (FANT and GDH) are new while two others (HAS-QAP and GTSH) are among the best for structured QAP instances. These methods are based on ant systems and genetic algorithms and they are presented under a unified general scheme, called adaptive memory pro...
متن کاملA QAP Solver with CUDA GPU Computing Architecture A Two Page Description of the Application Submitted for GECCO 2009 Competition : GPUs for Genetic and Evolutionary Computation
This application solves the quadratic assignment problem (QAP) [1]. In QAP, we are given l locations and l facilities and the task is to assign the facilities to the locations to minimize the cost. We chose QAP for the following reasons: First, problem sizes of QAPs in real life problems are relatively small compared with other problems in permutation domains such as the traveling salesman prob...
متن کاملBounds for the Quadratic Assignment Problems Using Continuous Optimization Techniques
The quadratic assignment problem (denoted QAP), in the trace formulation over the permutation matrices, is min X2 tr(AXB + C)X t : Several recent lower bounds for QAP are discussed. These bounds are obtained by applying continuous optimization techniques to approximations of this combinatorial optimization problem, as well as by exploiting the special matrix structure of the problem. In particu...
متن کاملOn View Consistency in Multi-Server Distributed Virtual Environments Supplementary Material
where μ(Pi,Pj) = ∑ ck∈Pi,cl∈Pj σ(ck, cl). We now transform this simplified VCtoS problem into the quadratic assignment (QAP) problem, which is known to be NP-hard [SG76], as follows. Given n facilities denoted by set NF , n locations denoted by set NL, a flow matrix A, where each entry Aij represents the flow of materials moving from facility i to facility j, and a distance matrix D, where each...
متن کاملThe Quadratic Assignment Problem with a Monotone Anti-Monge and a Symmetric Toeplitz Matrix: Easy and Hard Cases
This paper investigates a restricted version of the Quadratic Assignment Problem (QAP), where one of the coefficient matrices is an Anti-Monge matrix with non-decreasing rows and columns and the other coefficient matrix is a symmetric Toeplitz matrix. This restricted version is called the Anti-Monge–Toeplitz QAP. There are three well-known combinatorial problems that can be modeled via the Anti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005