A new mathematical-programming framework for facility-layout design

INFORMS Journal on Computing

Volumn 18, Issue 1, 2006, Pages 111-118

  Anjos, Miguel F ^a   Vannelli, Anthony ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Facility layout; Floor planning; Global optimization; Nonlinear programming

Indexed keywords

EID: 33645565595     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1040.0103     Document Type: Article

References (27)

1. Anjos, M. F. 2001. New convex relaxations for the maximum cut and VLSI layout problems. Ph.D. thesis, Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada.
2. Anjos, M. F., A. Vannelli. 2002. An attractor-repeller approach to floorplanning. Math. Methods Oper. Res. 56 3-27.
3. Anstreicher, K., N. Brixius, J.-P. Goux, J. Linderoth. 2002. Solving large quadratic assignment problems on computational grids. Math. Programming Ser. B 91 563-588.
4. Armour, G., E. Buffa. 1963. A heuristic algorithm and simulation approach to relative location of facilities. Management Sci. 9 294-309.
5. Balas, E. 1998. Disjunctive programming: Properties of the convex hull of feasible points. Discrete Appl. Math. 89 3-44.
6. Brooke, A., D. Kendrick, A. Meeraus. 1992. GAMS - A User's Guide, Release 2.25. The Scientific Press, South San Francisco, CA.
7. Ceria, S., J. Soares. 1999. Convex programming for disjunctive convex optimization. Math. Programming Ser. A 86 595-614.
8. Drezner, Z. 1980. DISCON: A new method for the layout problem. Oper. Res. 28 1375-1384.
9. Ferris, M. C., J. S. Pang. 1997. Engineering and economic applications of complementarity problems. SIAM Rev. 39 669-713.
10. Fletcher, R., S. Leyffer. 2002. Numerical experience with solving MPECs as NLPs. Technical report NA\210, University of Dundee, Dundee, Scotland.
11. Foulds, L. 1991. Graph Theory Applications. Springer Verlag, New York.
12. Huntley, C., D. Brown. 1991. A parallel heuristic for quadratic assignment problems. Comput. Oper. Res. 18 275-289.
13. Luo, Z.-Q., J.-S. Pang, D. Ralph. 1996. Mathematical Programs with Equilibrium Constraints. Cambridge University Press, Cambridge, UK.
14. Mavridou, T., P. Pardalos. 1997. Simulated annealing and genetic algorithms for the facility layout problem: A survey. Comput. Optim. Appl. 7 111-126.
15. Meller, R., K.-Y. Gau. 1996. The facility layout problem: Recent and emerging trends and perspectives. J. Manufacturing Systems 15 351-366.
16. Meller, R., V. Narayanan, P. Vance. 1998. Optimal facility layout design. Oper. Res. Lett. 23 117-127.
17. Montreuil, B. 1991. A modelling framework for integrating layout design and flow network design. J. White, I. Pence, eds. Progress in Material Handling and Logistics, Vol. 2. Springer-Verlag, Heidelberg, Germany, 95-116.
18. Murtagh, B., M. Saunders. 1978. Large-scale linearly constrained optimization. Math. Programming 14 41-72.
19. Murtagh, B., M. Saunders. 1982. A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints. Math. Programming Stud. 16 84-117.
20. Murtagh, B., M. Saunders. 1987. MINOS 5.1 User's Guide. Technical Report SOL 83-20R, Department of Operations Research, Stanford University, Stanford, CA.
21. Nesterov, Y., A. Nemirovskii. 1994. Interior-Point Polynomial Algorithms in Convex Programming. SIAM, Philadelphia, PA.
22. Pardalos, P., H. Wolkowicz, eds. 1994. Quadratic Assignment and Related Problems. American Mathematical Society, Providence, RI.
23. Scriabin, M., R. Vergin. 1975. Comparison of computer algorithms and visual based methods for plant layout. Management Sci. 22 172-181.
24. Sherali, H., B. Fraticelli, R. Meller. 2003. Enhanced model formulations for optimal facility layout. Oper. Res. 51 629-644.
25. Tate, D., A. Smith. 1995. Unequal-area facility layout by genetic search. IIE Trans. 27 465-172.
26. van Camp, D., M. Carter, A. Vannelli. 1991. A nonlinear optimization approach for solving facility layout problems. Eur. J. Oper. Res. 57 174-189.
27. Wright, S. 1997. Primal-Dual Interior-Point Methods. SIAM, Philadelphia, PA.