Proceedings of the Korean Operations and Management Science Society Conference (한국경영과학회:학술대회논문집)
- 1996.04a
- /
- Pages.465-468
- /
- 1996
A space partitioning method embedded in a simulated annealing algorithm for facility layout problems with shape constraints
- Kim, Jae-Gon (Department of Industrial Engineering, KAIST) ;
- Kim, Yeong-Dae (Department of Industrial Engineering, KAIST)
- Published : 1996.04.01
Abstract
We deal with facility layout problems with shape constraints. A simulated annealing algorithm is developed for the problems. In the algorithm, a solution is encoded as a matrix that has information about relative locations of the facilities in the floor. A block layout is constructed by partitioning the floor into a set of rectangular blocks according to the information while satisfying areas of facilities. In this paper, three methods are suggested for the partitioning procedure and they are employed in the simulated annealing algorithm. Results of computational experiments show that the proposed algorithm performs better than existing algorithms, especially for problems with tight shape constraints.
Keywords