A heuristic algorithm for the quadratic assignment formulation to the plant layout problem

Boaz Golany, Meir J. Rosenblatt, Meir J. Rosenblatt

Research output: Contribution to journalArticlepeer-review

Abstract

A heuristic algorithm for solving the quadratic assignment formulation to the plant layout problem is presented. The algorithm involves deriving an initial assignment of departments to sites (a construction phase) and then, possibly, improving the solution through exchange between pairs of departments. A ‘classical’ numerical example is used to demonstrate the effectiveness, costwise and in terms of computational effort, of the algorithm. Finally, a set of examples previously used by various authors is assembled and solved in the Appendix. Results are compared to optimal solution values and to the average solution of another known heuristic. These examples could serve as a sample set for testing the effectiveness of other approaches to this problem.

Original languageEnglish
Pages (from-to)293-308
Number of pages16
JournalInternational Journal of Production Research
Volume27
Issue number2
DOIs
StatePublished - Feb 1989

ASJC Scopus subject areas

  • Strategy and Management
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering

Fingerprint

Dive into the research topics of 'A heuristic algorithm for the quadratic assignment formulation to the plant layout problem'. Together they form a unique fingerprint.

Cite this