Abstract
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.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Amaral ARS (2006) On the exact solution of a facility layout problem. Eur J Oper Res 173: 508–518
Anstreicher KM (2003) Recent advances in the solution of quadratic assignment problems. Math Program 97: 27–42
Battiti R, Tecchiolli G (1994) The reactive tabu search. ORSA J Comput 6: 126–140
Bhasker J, Sahni S (1987) Optimal linear arrangement of circuit components. J VLSI Comput Syst 2: 87–109
Burkard RE, Rendl F (1984) A thermodynamically motivated simulation procedure for combinatorial optimization problems. Eur J Oper Res 17: 169–174
Chakrapani J, Skorin-Kapov J (1994) A constructive method for improving lower bounds for a class of quadratic assignment problems. Oper Res 42: 837–845
Christofides N, Benavent E (1989) An exact algorithm for the quadratic assignment problem on a tree. Oper Res 37: 760–768
Chung FRK (1988) Labelings of graphs. In: Beineke LW, Wilson RJ (eds) Selected topics in graph theory, vol 3. Academic Press, San Diego, pp 151–168
Díaz J, Petit J, Serna M (2002) A survey of graph layout problems. ACM Comput Surv 34: 313–356
Drezner Z (2006) Finding a cluster of points and the grey pattern quadratic assignment problem. OR Spectrum 28: 417–436
Gilmore PC (1962) Optimal and suboptimal algorithms for the quadratic assignment problem. J SIAM 10: 305–313
Glover F (1989) Tabu search—part I. ORSA J Comput 1: 190–206
Karisch SE, Rendl F (1995) Lower bounds for the quadratic assignment problem via triangle decompositions. Math Program 71: 137–151
Karp RM, Held M (1967) Finite-state processes and dynamic programming. SIAM J Appl Math 15: 693–718
Koopmans TC, Beckmann M (1957) Assignment problems and the location of economic activities. Econometrica 25: 53–76
Kouvelis P, Chiang W, Yu G (1995) Optimal algorithms for row layout problems in automated manufacturing systems. IIE Trans 27: 99–104
Lawler EL (1963) The quadratic assignment problem. Manage Sci 9: 586–599
Loiola EM, de Abreu NMM, Boaventura-Netto PO, Hahn P, Querido T (2007) A survey for the quadratic assignment problem. Eur J Oper Res 176: 657–690
Nugent CE, Vollmann TE, Ruml J (1968) An experimental comparison of techniques for the assignment of facilities to locations. Oper Res 16: 150–173
Obata T (1979) Quadratic assignment problem: evaluation of exact and heuristic algorithms. Dissertation, Rensselaer Polytechnic Institute, Troy, NY
Öncan T, Altınel İK (2008) Exact solution procedures for the balanced unidirectional cyclic layout problem. Eur J Oper Res 189: 609–623
Palubeckis GS (1988) A generator of test quadratic assignment problems with known optimal solution. USSR Comp Math Math Phys 28:97–98 [Translated from: Zh Vychisl Mat Mat Fiz 28:1740–1743]
Palubeckis G (1997) The use of special graphs for obtaining lower bounds in the geometric quadratic assignment problem. Informatica 8: 377–400
Palubeckis G (2006) Iterated tabu search for the unconstrained binary quadratic optimization problem. Informatica 17: 279–296
Palubeckis G (2007) Iterated tabu search for the maximum diversity problem. Appl Math Comput 189: 371–383
Pardalos PM, Crouse JV (1989) A parallel algorithm for the quadratic assignment problem. In: Proceedings of the 1989 ACM/IEEE Conference on Supercomputing, pp 351–360. ACM Press, New York
Picard J-C, Queyranne M (1981) On the one-dimensional space allocation problem. Oper Res 29: 371–391
Sarker BR (1989) The amoebic matrix and one-dimensional machine location problems. Dissertation, Department of Industrial Engineering, Texas A&M University, College Station, TX
Sarker BR, Wilhelm WE, Hogg GL (1998) One-dimensional machine location problems in a multi-product flowline with equidistant locations. Eur J Oper Res 105: 401–426
Skorin-Kapov J (1990) Tabu search applied to the quadratic assignment problem. ORSA J Comput 2: 33–45
Taillard E (1991) Robust taboo search for the quadratic assignment problem. Parallel Comput 17: 443–455
Taillard ÉD (1995) Comparison of iterative searches for the quadratic assignment problem. Location Sci 3: 87–105
Wang S, Sarker BR (2002) Locating cells with bottleneck machines in cellular manufacturing systems. Int J Prod Res 40: 403–424
Yu J, Sarker BR (2003) Directional decomposition heuristic for a linear machine-cell location problem. Eur J Oper Res 149: 142–184
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Palubeckis, G. A branch-and-bound algorithm for the single-row equidistant facility layout problem. OR Spectrum 34, 1–21 (2012). https://doi.org/10.1007/s00291-010-0204-5
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00291-010-0204-5