Optional linear arrangement of circuit components
Advances in VLSI and Computer Systems
A parallel algorithm for the quadratic assignment problem
Proceedings of the 1989 ACM/IEEE conference on Supercomputing
A generator of test quadratic assignment problems with known optimal solution
USSR Computational Mathematics and Mathematical Physics
Lower bounds for the quadratic assignment problem via triangle decompositions
Mathematical Programming: Series A and B
A survey of graph layout problems
ACM Computing Surveys (CSUR)
Quadratic assignment problem: evaluation of exact and heuristic algorithms
Quadratic assignment problem: evaluation of exact and heuristic algorithms
Paper: Robust taboo search for the quadratic assignment problem
Parallel Computing
The deterministic product location problem under a pick-by-order policy
Discrete Applied Mathematics
| Hi-index | 0.00 |
In this paper, we deal with the single-row equidistant facility layout problem (SREFLP), which asks to find a one-to-one assignment of n facilities to n locations equally spaced along a straight line so as to minimize the sum of the products of the flows and distances between facilities. We develop a branch-and-bound algorithm for solving this problem. The lower bound is computed first by performing transformation of the flow matrix and then applying the well-known Gilmore---Lawler bounding technique. The algorithm also incorporates a dominance test which allows to drastically reduce redundancy in the search process. The test is based on the use of a tabu search procedure designed to solve the SREFLP. We provide computational results for problem instances of size up to 35 facilities. For a number of instances, the optimal value of the objective function appeared to be smaller than the best value reported in the literature.