Provably near-optimal solutions for very large single-row facility layout problems

Optimization Methods and Software

Volumn 24, Issue 4-5, 2009, Pages 805-817

  Anjos, Miguel F ^a   Yen, Ginger ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b IMSManagement Consulting   (Canada)

Author keywords

Combinatorial optimization; Global optimization; Semidefinite optimization; Single row facility layout; Space allocation

Indexed keywords

CUTTING PLANES; FACILITY LAYOUT; FACILITY LAYOUT PROBLEMS; FEASIBLE SET; GLOBAL LOWER BOUNDS; GLOBAL OPTIMIZATION PROBLEMS; HIGH QUALITY; LINEAR CONSTRAINTS; MATRIX; NEAR-OPTIMAL SOLUTIONS; ONE-DIMENSIONAL; OPTIMAL LAYOUT; OPTIMAL SOLUTIONS; QUADRATIC FORMULATION; SDP RELAXATION; SEMI-DEFINITE PROGRAMMING; SEMIDEFINITE OPTIMIZATION; SINGLE-ROW FACILITY LAYOUT; SPACE ALLOCATION; TOTAL COSTS;

COMBINATORIAL OPTIMIZATION; CONTROL THEORY; GLOBAL OPTIMIZATION; OPTIMAL SYSTEMS; PLANT LAYOUT;

SET THEORY;

EID: 68949107323     PISSN: 10556788     EISSN: 10294937     Source Type: Journal    
DOI: 10.1080/10556780902917735     Document Type: Article

References (37)

1. A.R.S. Amaral, On the exact solution of a facility layout problem, Eur. J. Oper. Res. 173(2) (2006), pp. 508-518.
2. A.R.S. Amaral, On the exact solution of a facility layout problem, Discrete Appl. Math. 157(1) (2009), pp. 183-190.
3. A.R.S. Amaral An exact approach for the one-dimensional facility layout problem, Oper. Res., 56 (2008), pp. 1026-1033.
4. A.R.S. Amaral and A.N. Letchford, A polyhedral approach to the single-row facility layout problem, Tech. Rep., Department of Management Science, Lancaster University, March, 2008.
5. M.F. Anjos, Semidefinite optimization approaches for satisfiability and maximum-satisfiability problems, J. Satisfiability Boolean Model. Comput. 1(1) (2005), pp. 1-47.
6. M.F. Anjos and A.Vannelli, Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes, INFORMS J. Comput. 20(4) (2008), pp. 611-617.
7. M.F. Anjos and H.Wolkowicz, Semidefinite programming for discrete optimization and matrix completion problems, Discrete Appl. Math. 123(1-2) (2002), pp. 513-577.
8. M.F. Anjos, A. Kennings, and A. Vannelli, A semidefinite optimization approach for the single-row layout problem with unequal dimensions, Discrete Optim. 2(2) (2005), pp. 113-122.
9. B. Borchers, CSDP, a C library for semidefinite programming, Optim. Methods Softw. 11/12(1-4) (1999), pp. 613-623.
10. E. Çela, The Quadratic Assignment Problem, Vol. 1, Combinatorial Optimization, Kluwer Academic Publishers, Dordrecht, 1998.
11. A.G. de Alvarenga, F.J. Negreiros-Gomes, and M. Mestria, Metaheuristic methods for a class of the facility layout problem, J. Intell. Manuf. 11 (2000), pp. 421-430.
12. E. de Klerk, Aspects of Semidefinite Programming, Vol. 65, Applied Optimization, Kluwer Academic Publishers, Dordrecht, 2002.
13. M.M. Deza and M. Laurent, Geometry of Cuts and Metrics, Vol. 15, Algorithms and Combinatorics, Springer-Verlag, Berlin, 1997.
14. K.M. Hall, An r-dimensional quadratic placement algorithm, Manage. Sci. 17 (1970), pp. 219-229.
15. C. Helmberg, Available at http://www-user.tu-chemnitz.de/̃helmberg/ semidef.html.
16. C. Helmberg and K.C. Kiwiel, A spectral bundle method with bounds, Math. Program. 93(2, Ser. A) (2002), pp. 173-194.
17. C. Helmberg and F. Rendl, A spectral bundle method for semidefinite programming, SIAM J. Optim. 10(3) (2000), pp. 673-696, (electronic).
18. S.S. Heragu, Facilities Design 2nd ed., iUniverse, Bloomington, IN, 2006.
19. S.S. Heragu and A.S. Alfa, Experimental analysis of simulated annealing based algorithms for the layout problem, Eur. J. Oper. Res. 57(2) (1992), pp. 190-202.
20. S.S. Heragu and A. Kusiak, Machine layout problem in flexible manufacturing systems, Oper. Res. 36(2) (1988), pp. 258-268.
21. S.S. Heragu and A. Kusiak, Efficient models for the facility layout problem, Eur. J. Oper. Res. 53 (1991), pp. 1-13.
22. R.M. Karp and M. Held, Finite-state processes and dynamic programming, SIAM J. Appl. Math. 15 (1967), pp. 693-718.
23. K.R. Kumar, G.C. Hadjinicola, and T. Lin, A heuristic procedure for the single-row facility layout problem, Eur. J. Oper. Res. 87(1) (1995), pp. 65-73.
24. M. Laurent and F. Rendl, Semidefinite programming and integer programming, in Handbook on Discrete Optimization, K. Aardal, G. Nemhauser, and R.Weismantel, eds., Elsevier, Amsterdam, 2005, pp. 393-514.
25. W. Liu and A. Vannelli, Generating lower bounds for the linear arrangement problem, Discrete Appl. Math. 59(2) (1995), pp. 137-151.
26. R.F. Love and J.Y.Wong, On solving a one-dimensional space allocation problem with integer programming, INFOR 14(2) (1976), pp. 139-143.
27. R.D. Meller, W. Chen, and H.D. Sherali, Applying the sequence-pair representation to optimal facility layout designs, Oper. Res. Lett. 35(5) (2007), pp. 651-659.
28. H. Murata, K. Fujiyoshi, S. Nakatake, and Y. Kajitani, VLSI module placement based on rectangle-packing by the sequence-pair, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 15(12) (1996), pp. 1518-1524.
29. J.-C. Picard and M. Queyranne, On the one-dimensional space allocation problem, Oper. Res. 29(2) (1981), pp. 371-391.
30. D. Romero and A. Sánchez-Flores, Methods for the one-dimensional space allocation problem, Comput. Oper. Res. 17(5) (1990), pp. 465-473.
31. D.M. Simmons, One-dimensional space allocation: An ordering algorithm, Oper. Res. 17 (1969), pp. 812-826.
32. D.M. Simmons, A further note on one-dimensional space allocation, Oper. Res. 19 (1971), p. 249.
33. J.K. Suryanarayanan, B.L. Golden, and Q.Wang, A new heuristic for the linear placement problem, Comput. Oper. Res. 18(3) (1991), pp. 255-262.
34. R. Whaley, A. Petitet, and J. Dongarra, Automated empirical optimizations of software and the ATLAS project, Parallel Comput. 27(1-2) (2001), pp. 3-35.
35. H. Wolkowicz, R. Saigal, and L. Vandenberghe, eds., Handbook of Semidefinite Programming, Kluwer Academic Publishers, Boston, MA, 2000.
36. W. Xie and N.V. Sahinidis, A branch-and-bound algorithm for the continuous facility layout problem, Comput. Chem. Eng. 32 (2008), pp. 1016-1028.
37. G.Yen, Cutting-plane separation strategies for semidefinite programming models to solve single-row facility layout problems, Master's thesis, University of Waterloo, 2008.