Skip to main content
Log in

Metaheuristic methods for a class of the facility layout problem

  • Published:
Journal of Intelligent Manufacturing Aims and scope Submit manuscript

Abstract

This paper treats of a facility layout problem in the manufacturing systems. Considering the combinatorial nature of the problem, a metaheuristic approach, based on Simulated Annealing and Tabu Search, is proposed to it. Computational results show that this procedure seems to be a good alternative to treat this problem.

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

  • Bazaraa, M. S. (1975) Computerized layout design: A branch and bound approach. AIIE Transactions, 7(4), 432–438.

    Google Scholar 

  • Beghin-Picavet, M. and Hansen, P. (1982) Deux problèmes d'affectation non linéaires. RAIRO Recherche Operationelle, 16(3), 263–276.

    Google Scholar 

  • Cerny, V. (1985) Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm. Journal of Optimization Theory and Applications, 45, 41–51.

    Google Scholar 

  • Foulds, L. R. and Robinson. D. F. (1976) A strategy for solving the plant layout problem. Operations Research Quarterly, 27(4), 845–855.

    Google Scholar 

  • Heragu, S. S. and Alfa, A. S. (1992) Experimental analysis of simulated annealing based algorithms for the layout problem. European Journal of Operational Research, 57, 190–202.

    Google Scholar 

  • Heragu, S. S. and Kusiak, A. (1988) Machine layout problem in flexible manufacturing systems. Operations Research, 36(2), 258–268.

    Google Scholar 

  • Heragu, S. S. and Kusiak, A. (1991) Efficient models for the facility layout problem. European Journal of Operational Research, 53, 1–13.

    Google Scholar 

  • Kaufman, L. and Broeckx, F. (1978) An algorithm for the quadratic assignment problem using benders' decomposition. European Journal of Operational Research, 2, 204–211.

    Google Scholar 

  • Kirkpatrick, S., Gelatt, C. D., Jr., and Vecchi, M. P. (1983) Optimization by simulated annealing. Science, 220, 671–680.

    Google Scholar 

  • Koopmans, T. C. and Beckmann, M. (1957) Assignment problems and the location of economic activities. Econometrica, 25(1), 53–76.

    Google Scholar 

  • Kusiak, A. (1990) Intelligent Manufacturing System, Prentince-Hall, Iowa.

    Google Scholar 

  • Kusiak, A. and Heragu, S. S. (1987) The facility layout problem. European Journal of Operational Research, 29, 229–251.

    Google Scholar 

  • Lawler, E. L. (1963) The quadratic assignment problem. Management Science, 9(4), 586–599.

    Google Scholar 

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

    Google Scholar 

  • Picard, J. and Queyranne, M. (1981) On the one-dimensional space allocation problem. Operations Research, 29(2), 371–391.

    Google Scholar 

  • Simmons, D. M. (1969) One-dimensional space allocation: An ordering algorithm. Operations Research, 17, 812–826.

    Google Scholar 

  • Tam, K. Y. (1992) Genetic algorithms, function optimization, and facility layout design. European Journal of Operational Research, 63, 322–346.

    Google Scholar 

  • Werra, D. and Hertz, A. (1989) Tabu Search Techniques; A tutorial and an Application to Neural Networks. OR Spektrum, 11, 131–141.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gomes de Alvarenga, A., Negreiros-Gomes, F.J. & Mestria, M. Metaheuristic methods for a class of the facility layout problem. Journal of Intelligent Manufacturing 11, 421–430 (2000). https://doi.org/10.1023/A:1008982420344

Download citation

  • Issue Date:

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

Navigation