TY - JOUR
T1 - Development of a Layout Technique for Unequal Department Shapes and Areas
AU - Irohara, Takashi
AU - Yamamoto, Hiroyuki
AU - Saitoh, Aya
AU - Yoshimoto, Kazuho
PY - 1994
Y1 - 1994
N2 - This paper presents a technique to solve the facility layout problem with rectangular departments of unequal areas. This problem can be formulated as a combinatorial optimization problem to minimize the total cost owing to material flow between departments. It is, however, computationally timeconsuming to find optimal solutions for large problems, because they are highly combinatorial in nature. Furthermore, these problems exhibit many local minima. These properties make them suitable candidates for the application of simulated annealing, which is a stochastic optimization procedure. A suboptimal method is then developed, which is a new improvement-type technique based on simulated annealing. In this technique, a new algorithm for updating placement of departments is proposed. This algorithm enables the application of simulated annealing to solve the problems considered here. This technique also offers increased flexibility to the optimization process, making the solution much less dependent upon the initial layout. Numerical results are given to demonstrate the effectiveness of the presented technique.
AB - This paper presents a technique to solve the facility layout problem with rectangular departments of unequal areas. This problem can be formulated as a combinatorial optimization problem to minimize the total cost owing to material flow between departments. It is, however, computationally timeconsuming to find optimal solutions for large problems, because they are highly combinatorial in nature. Furthermore, these problems exhibit many local minima. These properties make them suitable candidates for the application of simulated annealing, which is a stochastic optimization procedure. A suboptimal method is then developed, which is a new improvement-type technique based on simulated annealing. In this technique, a new algorithm for updating placement of departments is proposed. This algorithm enables the application of simulated annealing to solve the problems considered here. This technique also offers increased flexibility to the optimization process, making the solution much less dependent upon the initial layout. Numerical results are given to demonstrate the effectiveness of the presented technique.
KW - CAD
KW - Layout Planning
KW - Operations of Updating Placement of Departments
KW - Optimization
KW - Production Engineering
KW - Simulated Annealing
UR - http://www.scopus.com/inward/record.url?scp=0028531454&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0028531454&partnerID=8YFLogxK
U2 - 10.1299/kikaic.60.3566
DO - 10.1299/kikaic.60.3566
M3 - Article
AN - SCOPUS:0028531454
SN - 0387-5024
VL - 60
SP - 3566
EP - 3571
JO - Transactions of the Japan Society of Mechanical Engineers Series C
JF - Transactions of the Japan Society of Mechanical Engineers Series C
IS - 578
ER -