Skip to main content
Log in

Simulated Annealing and Genetic Algorithms for the Facility Layout Problem: A Survey

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

The facility layout problem (FLP) has many practical applications and is known to be NP-hard. During recent decades exact and heuristic approaches have been proposed in the literature to solve FLPs. In this paper we review the most recent developments regardingsimulated annealing and genetic algorithms for solvingfacility layout problems approximately.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. C.R. Aragon, D.S. Johnson, L.A. McGeoch, and C. Shevon, "Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning", Operations Research, 39, 3, 1991, pp. 378–406.

    Google Scholar 

  2. G.C. Armour, and E.S. Buffa, "A Heuristic Algorithm and Simulation Approach to Relative Location of Facilities", Management Science, 9, 1963, pp. 294–309.

    Google Scholar 

  3. P. Banerjee, and Y. Zhou, "Facilities Layout Design Optimization with Single Loop Material Flow Path Configuration", International Journal of Production Research, 33, 1995, pp. 183–203.

    Google Scholar 

  4. P. Banerjee, Y. Zhou, and B. Montreuil, "Genetically Induced Optimization of Facilities Layout Design", Technical Report TR-92-18, Dept. of Mechanical Engineering, University of Illinois, Chicago, 1992.

    Google Scholar 

  5. R. Battiti and G. Tecchiolli, "Parallel Biased Search for Combinatorial Optimization: Genetic Algorithms and TABU", Microprocessors and Microsystems, 16, 1992, pp. 351–367.

    Google Scholar 

  6. M.S. Bazaraa, "Computerized Layout Design: A Branch and Bound Approach", AIIE Transactions, 7, 1985, pp. 432–438.

    Google Scholar 

  7. M.S. Bazaraa, and M.D. Sherali, "Benders' Partitioning Scheme Applied to a New Formulation of the Quadratic Assignment Problem", Naval Research Logistics Quarterly, 27, 1, 1980, pp. 29–41.

    Google Scholar 

  8. Y.A. Bozer, R.D. Meller, and S.J. Erlebacher, "An Improvement-type Layout Algorithm for Multiple Floor Facilities", Management Science, 40, 1994, pp. 918–932.

    Google Scholar 

  9. R.E. Burkard, and T. Bonniger, "A Heuristic for Quadratic Boolean Program with Applications to Quadratic Assignment Problems", European Journal of Operational Research, 13, 1983, pp. 374–386.

    Google Scholar 

  10. R.E. Burkard, and F. Rendl, "A Thermodynamically Motivated Simulation Procedure for Combinatorial Optimization Problems", European Journal of Operational Research, 17, 1984, pp. 169–174.

    Google Scholar 

  11. D.T. Connolly, "An Improved Annealing Sceme for the QAP", European Journal of Operational Research, 46, 1990, pp. 93–100.

    Google Scholar 

  12. L. Davis, "Job Shop Scheduling with Genetic Algorithms", Proceedings of an International Conference on Genetic Algorithms and their Applications, Pittsburgh, PA, 1985, pp. 136–140.

  13. C.A. Floudas, and P.M. Pardalos (eds.), State of the Art in Global Optimization, Kluwer Academic Publishers, 1996.

  14. R.L. Francis, L.F. McGinnis, and J.A. White, Facility Layout and Location: An Analytical Approach, Prentice-Hall, Englewood Cliffs, NJ, 1992.

    Google Scholar 

  15. A. Ferreira, and P.M. Pardalos (eds.), Solving Combinatorial and Optimization Problems in Parallel, Springer-Verlag, 1996.

  16. D.E. Goldberg, Genetic Algorithms In Search, Optimization, and Machine Learning, Addison-Wesley,1989.

  17. B.L. Golden, and C.C. Skiscim, "Using Simulated Annealing to Solve Routing and Location Problems", Naval Research Logistics Quarterly, 33, 1986, pp. 261–279.

    Google Scholar 

  18. J.J. Grefenstette, "Optimization of Control Parameters for Genetic Algorithms", IEEE Transactions on Systems, Man, and Cybernetics, 16, 1986, pp. 122–128.

    Google Scholar 

  19. J.J. Grefenstette, R. Gopal, B.J. Rosmaita, and D. Van Gucht, "Genetic Algorithms for the Traveling Salesperson Problem", Proceedings of an International Conference on Genetic Algorithms and their Applications, Pittsburgh, PA, 1985, pp. 160–168.

  20. M.M.D. Hassan, G.L. Hogg, and D.R. Smith, "SHAPE: A Construction Algorithm for Area Placement Evaluation", International Journal of Production Research, 24, 1986, pp. 1283–1295.

    Google Scholar 

  21. S.S. Heragu, and A.S. Alfa, "Experimental Analysis of Simulated Annealing based Algorithms for the Layout Problem", European Journal of Operational Research, 57, 1992, pp. 190–202.

    Google Scholar 

  22. S.S. Heragu, and A. Kusiak, "Efficient Models for the Facility Layout Problem", European Journal of Operational Research, 53, 1991, pp. 1–13.

    Google Scholar 

  23. J.H. Holland,Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, MI, 1975.

    Google Scholar 

  24. R. Horst, and P.M. Pardalos, Handbook of Global Optimization, Kluwer Academic Publishers, 1995.

  25. R. Horst, P.M. Pardalos, and N.V. Thoai, Introduction to Global Optimization, Kluwer Academic Publishers, 1995.

  26. C.L. Huntley, and D.E. Brown, "A Parallel Heuristic for Quadratic Assignment Problem", Computers and OR, 18, 1991, pp. 275–289.

    Google Scholar 

  27. S. Jajodia, I. Minis, G. Harhalakis, and J.M. Proth, "CLASS: Computerized Layout Solutions using Simulated Annealing", International Journal of Production Research, 30, 1, 1992, pp. 95–108.

    Google Scholar 

  28. P. Jog, J.Y. Suh and D. Van Gucht, "Parallel Genetic Algorithms Applied to the Traveling Salesman Problem", SIAM Journal of Optimization, 1, 1991, pp. 515–529.

    Google Scholar 

  29. D.S. Johnson, C.R. Aragon, L.A. McGeoch, and C. Shevon, "Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning", Operations Research, 37, 6, 1989, pp. 865–892.

    Google Scholar 

  30. B.K. Kaku, and G.L. Thompson, "An Exact Algorithm for the General Quadratic Assignment Problem", European Journal of Operational Research, 23, 1986, pp. 382–390.

    Google Scholar 

  31. S. Kirkpatrick, C.D. Gelatt, and M.P. Vecchi, "Optimization by Simulated Annealing", Science, 220, 1983, pp. 671–680.

    Google Scholar 

  32. S. Koakutsu, and H. Hirata, "Genetic Simulated Annealing for Floorplan Design", Chiba University, Japan, 1992.

    Google Scholar 

  33. T.C. Koopmans, and M. Beckmann, "Assignment Problems and the Location of Economic Activities", Econometrica 25, 1, 1957, pp. 53–76.

    Google Scholar 

  34. P. Kouvelis, and W.-C. Chiang, "A Simulated Annealing Procedure for Single Row Layout Problems in Flexible Manufacturing Systems", International Journal of Production Research, 30, 4, 1992, pp. 717–732.

    Google Scholar 

  35. P. Kouvelis, W.-C. Chiang, and J. Fitzsimmons, "Simulated Annealing for Machine Layout Problems in the Presence of Zoning Constraints", European Journal of Operational Research, 57, 1992, pp. 203–223.

    Google Scholar 

  36. A. Kusiak, and S.S. Heragu, "The Facility Layout Problem", European Journal of Operational Research, 29, 1987, pp. 229–251.

    Google Scholar 

  37. P.J.M. Van Laarhoven, and E.H.L. Aarts, Simulated Annealing, Theory and Applications, D. Reidel Publishing Co., 1987.

  38. P.S. Laursen, "Simulated Annealing for the QAP-Optimal Tradeoff Between Simulation Time and Solution Quality", European Journal of Operational Research, 69, 1993, pp. 238–243.

    Google Scholar 

  39. E.L. Lawler, "The Quadratic Assignment Problem", Management Science, 9,4, 1963, pp. 586–599.

    Google Scholar 

  40. Y. Li, "Heuristic and Exact Algorithms for the Quadratic Assignment Problem", Ph.D Thesis, The Pennsylvania State University, Dept. of Computer Science, 1992.

  41. W.G. Macready, A.G. Siapas, and S. A. Kauffman, "Criticality and Parallelism in Combinatorial Optimization", Science, 271, 1996, pp. 56–59.

    Google Scholar 

  42. R.D. Meller, and Y.A. Bozer, "A new Simulated Annealing Algorithm for the Facility Layout Problem", Technical Report 91-29, Department of Industrial and Operations Engineering, The University of Michigan, 1991.

  43. R.D. Meller, and K.-Y. Gau, "The Facility Layout Problem: A Review of Recent and Emerging Research", Auburn University, Auburn, AL, 1995.

    Google Scholar 

  44. N. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller, and E. Teller, "Equation of State Calculations by Fast Computing Machines", Journal of Chemical Physics, 21, 1953, pp. 1087–1092.

    Google Scholar 

  45. P.B. Mirchandani, and R.L. Francis (eds.), Discrete Location Theory, Wiley-Interscience Series in Discrete Mathematics and Optimization, 1990.

  46. B. Montreuil, "A Modeling Framework for Integrating Layout Design and Flow Network Design", Proceedings of the MHI/CICMHE Material Handling Research Colloquium, Hebron KY, 1990, (to appear in IIE Transactions).

  47. H. Muhlenbein, "Parallel Genetic Algorithms, Population Genetics and Combinatorial Optimization", Lecture Notes in Computer Science, 565, 1989, pp. 398–406.

    Google Scholar 

  48. H. Muhlenbein, M. Schomisch and J. Born, "The Parallel Genetic Algorithm as Function Optimizer", Proceedings on an International Conference on Genetic Algorithms, 1991.

  49. C.E. Nugent, T.E. Vollmann, and J. Ruml, "An Experimental Comparison of Techniques for the Assignment of Facilities to Locations", Operations Research, 16, 1968, pp. 150–173.

    Google Scholar 

  50. P.M. Pardalos, Y. Li, and K. A. Murthy, "Computational Experience with Parallel Algorithms for Solving the Quadratic Assignment Problem", Computer Science and Operations Research: New Developments in their Interface, O. Balci et al. (eds.), Pergamon Press, 1992, pp. 267–278.

  51. P.M. Pardalos, and G. Guisewite, "Parallel Computing in Nonconvex Programming", Annals of Operations Research, 43, 1993, pp. 87–107.

    Google Scholar 

  52. P.M. Pardalos, A.T. Phillips, and J.B. Rosen, Topics in Parallel Computing in Mathematical Programming, Science Press, 1992.

  53. P. M. Pardalos, L.S. Pitsoulis, and M.G.C. Resende, "A Parallel GRASP Implementation for the Quadratic Assignment Problem", Solving Irregular Problems in Parallel: State of the Art, A. Ferreira and J. Rolim (eds.), Kluwer Academic Publishers, 1995, pp. 111–128.

  54. P. M. Pardalos, L.S. Pitsoulis, T.D. Mavridou, and M.G.C. Resende, "Parallel Search for Combinatorial Optimization: Genetic Algorithms, Simulated Annealing, Tabu Search and GRASP", Lecture Notes in Computer Science, 980, Springer-Verlag, 1995, pp. 317–331.

    Google Scholar 

  55. P.M. Pardalos, M.G.C. Resende, and K.G. Ramakrishnan (eds.), Parallel Processing of Discrete Optimization Problems, DIMACS Series, 22, American Mathematical Society, 1995.

  56. P.M. Pardalos, F. Rentl, and H. Wolkowicz, "The Quadratic Assignment Problem: A Survey and Recent Developments", Quadratic Assignment and Related Problems, P.M. Pardalos, and H. Wolkowicz (eds.), DIMACS Series on Discrete Mathematics and Theoretical Computer Science, 16, American Mathematical Society, 1994, pp. 1–42.

  57. W.H. Press, B.P. Flannery, S.A. Teukolsky, and W.T. Vetterling, Numerical Recipes: The Art of Scientific Computing, Cambridge University Press, New York, 1986.

    Google Scholar 

  58. J.D. Schaffer, R.A. Caruana, L.J. Eshelman, and R. Das, "A Study of Control Parameters Affecting Online Performance of Genetic Algorithms for Function Optimization", Proceedings on the Third International Conference on Genetic Algorithms, Morgan Kaufmann, Los Altos, CA, 1989, pp. 51–60.

  59. R. Sharpe, and B.S. Maksjo, "Facility Layout Optimization Using the Metropolis Algorithm", Environment and Planning B: Planning and Design, 12, 1985, pp. 443–453.

    Google Scholar 

  60. R. Sharpe, B.S. Maksjo, J.R. Mitchell, and J.R. Crawford, "An Interactive Model for the Layout of Buildings", Applied Mathematical Modeling, 9, 3, 1985, pp. 207–214.

    Google Scholar 

  61. A. Souilah, "Simulated Annealing for Manufacturing Systems Layout Design", European Journal of Operational Research, 82, 1995, pp. 592–614.

    Google Scholar 

  62. G. Suresh, and S. Sahu, "Multiobjective Facility Layout Using Simulated Annealing", International Journal of Production Economics, 32, 1993, 239–254.

    Google Scholar 

  63. K.Y. Tam, "Genetic Algorithms, Function Optimization and Facility Layout Design", European Journal of Operational Research, 63, 1992, pp. 322–346.

    Google Scholar 

  64. K.Y. Tam, "A Simulated Annealing Algorithm for Allocating Space to Manufacturing Cells", International Journal of Production Research, 30, 1, 1992, pp. 63–87.

    Google Scholar 

  65. D.M. Tate, and A.E. Smith, "Unequal-Area Facility Layout by Genetic Search", IIE Transactions, 27, 1995, pp. 465–472.

    Google Scholar 

  66. M.B. Teitz, and P. Bart, "Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph", Operations Research, 16, 1968, pp. 955–961.

    Google Scholar 

  67. J.A. Tompkins, and J.A. White, Facilities Planning, Wiley, New York, 1984.

    Google Scholar 

  68. X. Tong, "SECOT: A Sequential Construction Technique for Facility Design", Doctoral Dissertation, University of Pittsburgh, 1991.

  69. D.J. Van Camp, M.W. Carter, and A. Vannelli, "A Nonlinear Optimization Approach for Solving Facility Layout Problems", European Journal of Operational Research 57, 1991, pp. 174–189.

    Google Scholar 

  70. M.R. Wilhelm, and T.L. Ward, "Solving Quadratic Assignment Problems by Simulated Annealing", IIE Transactions, 19, 1987, pp. 107–119.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mavridou, T.D., Pardalos, P.M. Simulated Annealing and Genetic Algorithms for the Facility Layout Problem: A Survey. Computational Optimization and Applications 7, 111–126 (1997). https://doi.org/10.1023/A:1008623913524

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008623913524

Navigation