A computational study and survey of methods for the single-row facility layout problem
- 737 Downloads
The single-row facility layout problem (SRFLP) is an NP-hard combinatorial optimization problem that is concerned with the arrangement of n departments of given lengths on a line so as to minimize the weighted sum of the distances between department pairs. (SRFLP) is the one-dimensional version of the facility layout problem that seeks to arrange rectangular departments so as to minimize the overall interaction cost. This paper compares the different modelling approaches for (SRFLP) and applies a recent SDP approach for general quadratic ordering problems from Hungerländer and Rendl to (SRFLP). In particular, we report optimal solutions for several (SRFLP) instances from the literature with up to 42 departments that remained unsolved so far. Secondly we significantly reduce the best known gaps and running times for large instances with up to 110 departments.
KeywordsSingle-row facility layout Space allocation Semidefinite optimization Combinatorial optimization
We thank three anonymous referees for their constructive comments and suggestions for improvement leading to the present version of the paper.
- 4.Amaral, A.R.S., Letchford, A.N.: A polyhedral approach to the single row facility layout problem (2011, in preparation). Preprint available from http://www.optimization-online.org/DB_FILE/2008/03/1931.pdf
- 6.Anjos, M.F., Lasserre, J. (eds.): Handbook of Semidefinite, Conic and Polynomial Optimization International Series in Operations Research & Management Science. Springer, Berlin (2011, to appear) Google Scholar
- 7.Anjos, M.F., Liers, F.: Global Approaches for facility layout and vlsi floorplanning. In: Anjos, M.F., Lasserre, J.B. (eds.): Handbook of Semidefinite, Cone and Polynomial Optimization: Theory, Algorithms, Software and Applications (2012, to appear) Google Scholar
- 12.Buchheim, C., Wiegele, A., Zheng, L.: Exact algorithms for the quadratic linear ordering problem. INFORMS J. Comput. 168–177 (2009) Google Scholar
- 13.Chimani, M., Hungerländer, P., Jünger, M., Mutzel, P.: An SDP approach to multi-level crossing minimization. In: Proceedings of Algorithm Engineering & Experiments [ALENEX’2011] (2011) Google Scholar
- 25.Hiriart-Urruty, J.-B., Lemarechal, C.: Convex Analysis and Minimization Algorithms (vols. 1 and 2). Springer, Berlin (1993) Google Scholar
- 26.Hungerländer, P.: Exact approaches to ordering problems. Ph.D. thesis, Alpen-Adria Universität Klagenfurt (2011) Google Scholar
- 27.Hungerländer, P., Rendl, F.: Semidefinite relaxations of ordering problems. Math. Program., Ser. B (2011, accepted). Preprint available at http://www.optimization-online.org/DB_HTML/2010/08/2696.html
- 31.Love, R.F., Wong, J.Y.: On solving a one-dimensional space allocation problem with integer programming. INFOR, Inf. Syst. Oper. Res. 14, 139–143 (1967) Google Scholar
- 41.Wolkowicz, H., Saigal, R., Vandenberghe, L. (eds.): Handbook of Semidefinite Programming. Kluwer Academic, Boston (2000) Google Scholar