Optimal two-dimensional layout of industrial facilities

Layout is an important aspect of the design of industrial plants. In this paper a mathematical model is presented for the design of efficient and generic industrial layouts where a simultaneous solution of the block and detailed layout problem is considered. The optimal plant layout is obtained based on the minimization of the connectivity cost. Connectivity can describe simple pipe connections, guided vehicles or conveyors amongst others. Different topological characteristics are considered such as different equipment orientations, distance restrictions, non-overlapping constraints, different equipment connectivity inputs and outputs, irregular equipment shapes and space availability over a two-dimensional continuous area. In operational terms, production together with operational sections are modelled as well as safety and operability restrictions. A Mixed-Integer Linear Problem (MILP) is developed where binary variables are introduced to characterize topological choices and continuous variables describe the distances and locations involved. To conclude, the applicability of the proposed formulation is illustrated via a set of representative examples.

[1]  Gary L. Hogg,et al.  A review of graph theory application to the facilities layout problem , 1987 .

[2]  Michael C. Georgiadis,et al.  A general mathematical programming approach for process plant layout , 1999 .

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

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

[5]  Russell D. Meller,et al.  The facility layout problem: Recent and emerging trends and perspectives , 1996 .

[6]  Munirpallam A. Venkataramanan,et al.  Genetic search and the dynamic facility layout problem , 1994, Comput. Oper. Res..

[7]  Wen-Chyuan Chiang,et al.  An improved tabu search heuristic for solving facility layout design problems , 1996 .

[8]  René Bañares-Alcántara,et al.  Optimisation of process plant layout using genetic algorithms , 1998 .

[9]  Fariborz Y. Partovi,et al.  Integrating the analytic hierarchy process andgraph theory to model facilities layout , 1998, Ann. Oper. Res..

[10]  Atsushi Suzuki,et al.  An evolutionary method of arranging the plot plan for process plant layout. , 1991 .

[11]  Lazaros G. Papageorgiou,et al.  Continuous-Domain Mathematical Models for Optimal Process Plant Layout , 1998 .

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

[13]  Felix T.S. Chan,et al.  A genetic algorithm for facility layout problems , 1998 .

[14]  M. Oral,et al.  REFORMULATING QUADRATIC ASSIGNMENT PROBLEMS FOR EFFICIENT OPTIMIZATION , 1993 .

[15]  Leon F. McGinnis,et al.  Facility Layout and Location: An Analytical Approach , 1991 .

[16]  Srinivasan Jayakumar.  Chemical plant layout via graph partitioning , 1992 .

[17]  J. W. Giffin,et al.  The Vertex Splitting Algorithm for facilities layout , 1997 .

[18]  A. R. Ciric,et al.  An MINLP Approach for Safe Process Plant Layout , 1996 .

[19]  Yavuz A. Bozer,et al.  A new simulated annealing algorithm for the facility layout problem , 1996 .

[20]  Yeong-Dae Kim,et al.  Graph theoretic heuristics for unequal-sized facility layout problems , 1995 .

[21]  Catherine M. Harmonosky,et al.  A multi-factor plant layout methodology , 1992 .

[22]  Horst W. Hamacher,et al.  Integer programming approaches tofacilities layout models with forbidden areas , 1998 .

[23]  Way Kuo,et al.  THREE DIMENSIONAL PALLETIZATION OF MIXED BOX SIZES , 1993 .

[24]  Vincenzo Cena,et al.  A heuristic for the compact location of process components , 1977 .

[25]  E. Shayan,et al.  Facilities layout design by genetic algorithms , 1998 .

[26]  Gerald L. Thompson,et al.  A hybrid heuristic for the facilities layout problem , 1991, Comput. Oper. Res..

[27]  T. A. Lacksonen.  Preprocessing for static and dynamic facility layout problems , 1997 .

[28]  A. D. Raoot,et al.  A ‘fuzzy’ approach to facilities lay-out planning , 1991 .

[29]  Alice E. Smith,et al.  A genetic approach to the quadratic assignment problem , 1995, Comput. Oper. Res..

[30]  K. Y. Tam,et al.  A simulated annealing algorithm for allocating space to manufacturing cells , 1992 .

[31]  Benoit Montreuil,et al.  A Modelling Framework for Integrating Layout Design and flow Network Design , 1991 .

[32]  Timothy L. Urban.  Solution procedures for the dynamic facility layout problem , 1998, Ann. Oper. Res..

[33]  Jadranka Skorin-Kapov,et al.  Extensions of a tabu search adaptation to the quadratic assignment problem , 1994, Comput. Oper. Res..

[34]  Jean-Marie Flaus,et al.  Optimal Facility Layout - A Generic Approach to Process Plants , 2000 .

[35]  G. Reklaitis,et al.  Chemical plant layout via graph partitioning-1. Single level , 1994 .

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

[37]  Allan S. Carrie,et al.  A design technique for the layout of multi-product flowlines , 1986 .

[38]  Michael C. Georgiadis,et al.  Optimal Layout Design in Multipurpose Batch Plants , 1997 .

[39]  Yeong-Dae Kim,et al.  A branch and bound algorithm for locating input and output points of departments on the block layout , 1999, J. Oper. Res. Soc..

[40]  Gintaras V. Reklaitis,et al.  Chemical plant layout via graph partitioning—II. Multiple levels , 1996 .