Solution of the facilities layout problem by simulated annealing

Abstract The simulated annealing method (SAM) is a radically new and powerful approach to solving certain integer optimization problems. The paper describes its application to the facility layout problem (QAP) and shows how it can generally match or produce superior solutions to the best known values for classical benchmark problems. The technique is also suited to microcomputer solution using interactive graphics for practical layout problems.

[1]  M. Bazaraa,et al.  A branch-and-bound-based heuristic for solving the quadratic assignment problem , 1983 .

[2]  F. Rendl,et al.  A thermodynamically motivated simulation procedure for combinatorial optimization problems , 1984 .

[3]  Thomas E. Vollmann,et al.  An Experimental Comparison of Techniques for the Assignment of Facilities to Locations , 1968, Oper. Res..

[4]  Elwood S. Buffa,et al.  The Facilities Layout Problem in Perspective , 1966 .

[5]  R Sharpe,et al.  Facility Layout Optimization Using the Metropolis Algorithm , 1985 .

[6]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[7]  T. Koopmans,et al.  Assignment Problems and the Location of Economic Activities , 1957 .

[8]  R. Burkard,et al.  A heuristic for quadratic Boolean programs with applications to quadratic assignment problems , 1983 .

[9]  Leon Steinberg,et al.  The Backboard Wiring Problem: A Placement Algorithm , 1961 .

[10]  Robin Liggett,et al.  The Quadratic Assignment Problem: An Experimental Evaluation of Solution Strategies , 1981 .

[11]  L. R. Foulds Techniques for Facilities Layout: Deciding which Pairs of Activities Should be Adjacent , 1983 .

[12]  Roger C. Vergin,et al.  Comparison of Computer Algorithms and Visual Based Methods for Plant Layout , 1975 .

[13]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[14]  James M. Moore,et al.  Computer aided facilities design : An international survey , 1974 .

[15]  W. E. Wilhelm,et al.  A Perturbation Scheme to Improve Hillier's Solution to the Facilities Layout Problem , 1984 .

[16]  Charles H. Heider,et al.  An n-step, 2-variable search algorithm for the component placement problem , 1973 .