A neural network approach to facility layout problems

Abstract A near-optimum parallel algorithm for solving facility layout problems is presented in this paper where the problem is NP-complete. The facility layout problem is one of the most fundamental quadratic assignment problems in Operations Research. The goal of the problem is to locate N facilities on an N-square (location) array so as to minimize the total cost. The proposed system is composed of N × N neurons based on an artificial two-dimensional maximum neural network for an N-facility layout problem. Our algorithm has given improved solutions for several benchmark problems over the best existing algorithms.

[1]  T. L. Ward,et al.  Solving Quadratic Assignment Problems by ‘Simulated Annealing’ , 1987 .

[2]  Yoshiyasu Takefuji,et al.  Neural network parallel computing , 1992, The Kluwer international series in engineering and computer science.

[3]  F. S. Hillier,et al.  Quantitative Tools for Plant Layout Analysis , 1963 .

[4]  Elwood S. Buffa,et al.  A Heuristic Algorithm and Simulation Approach to Relative Location of Facilities , 1963 .

[5]  P. Gilmore.  Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem , 1962 .

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

[7]  A. Alfa,et al.  Experimental analysis of simulated annealing based algorithms for the layout problem , 1992 .

[8]  Sunderesh S. Heragu,et al.  Recent models and techniques for solving the layout problem , 1992 .

[9]  Teofilo F. Gonzalez,et al.  P-Complete Approximation Problems , 1976, J. ACM.

[10]  H. Sherali,et al.  Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem , 1980 .

[11]  E. Lawler.  The Quadratic Assignment Problem , 1963 .

[12]  Jadranka Skorin-Kapov,et al.  Tabu Search Applied to the Quadratic Assignment Problem , 1990, INFORMS J. Comput..

[13]  A. N. Elshafei,et al.  An exact branch‐and‐bound procedure for the quadratic‐assignment problem , 1979 .

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

[15]  Tarek M. Khalil,et al.  Facilities relative allocation technique (FRAT) , 1973 .

[16]  Andrew Kusiak,et al.  The facility layout problem , 1987 .

[17]  F. Hillier,et al.  Quadratic Assignment Problem Algorithms and the Location of Indivisible Facilities , 1966 .

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

[19]  Roger C. Vergin,et al.  A Cluster-Analytic Approach to Facility Layout , 1985 .