When workflow congestion is prevalent, minimizing total expected material handling time is more appropriate than minimizing a distanced-based objective in manufacturing facility layout design. We present a model labeled Full Assignment Problem with Congestion (FAPC), which simultaneously optimizes the layout and flow routing. FAPC is a generalization of the Quadratic Assignment Problem (QAP), a...

The sequencing of placement and the configuration of the feeder is among the main problems involved in printed circuit board (PCB) assembly optimization. In some machine architectures, the latter problem can be formulated as the well known NP-hard quadratic assignment problem (QAP). In this study, a search is made among those metaheuristics that have recently found widespread application in ord...

Du sequentiel au parallele: la recherche aborescente a la programmation quadra-tique en variables 0 et 1, 1987. Th ese d'Etat. 33] , A parallel branch and bound algorithm for the quadratic assignment problem, Discrete A GRASP FOR QAP 21 4. Concluding remarks. In this paper, we discussed aspects of a GRASP implementation for solving the QAP. The algorithm was tested on a broad range of test prob...

The production of commercial DNA microarrays is based on a light-directed chemical synthesis driven by a set of masks or micromirror arrays. Because of the natural properties of light and the ever shrinking feature sizes, the arrangement of the probes on the chip and the order in which their nucleotides are synthesized play an important role on the quality of the final product. We propose a new...

The quadratic assignment problem (QAP) belongs to the hard core of N P-hard optimization problems. After almost forty years of research only relatively small instances can be solved to optimality. The reason is that the quality of the lower bounds available for exact methods is not suucient. Recently, lower bounds based on decomposition were proposed for the so called rectilinear QAP that prove...

The facility layout problem (FLP) is a very important class of NP-hard problems in operations research that deals with the optimal assignment facilities to minimize transportation costs. quadratic (QAP) can model FLP effectively. One FLPs hospital aims place comprehensive clinics, laboratories, and radiology units within predefined boundaries way minimizes cost movement patients healthcare pers...

This paper should be of interest to the combinatorial optimization community and especially to those interested in the Quadratic Assignment Problem (QAP). The QAP has application in the assignment of facilities to locations (to minimize the cost of intrafacility transportation), the placement of electronic components (to minimize the length of interconnecting wire), the placement of blades in a...

This paper deals with several combinatorial optimization problems. The most challenging such problem is the quadratic assignment problem. It is considered in both two dimensions (QAP) and in three dimensions (Q3AP) and in the context of communication engineering. Semidefinite relaxations are used to derive lower bounds for the optimum while heuristics are applied to either find upper bounds or ...

Since 2004, the Computational Optimization and Applications (COAP) editorial board has selected a paper from the preceding year’s COAP publications for the “Best Paper Award.” The award competition among papers published in 2008 culminated in a tie between two papers. This article concerns the award winning work of Peter Hahn, Bum-Jin Kim, Monique Guignard-Spielberg and Yi-Rong Zhu at the Unive...