A heuristic algorithm to solve the large size facility layout problem to treat the unequal size departments

摘要

The facility layout problem can be formulated as a combinatorial optimization problem to minimize the total cost owing to material flow. It is impossible to apply optimal method to the problem because of calculation time. Then, sub-optimal method (CARD-SA) using Simulated Annealing for optimization was proposed. However, it Is quite difficult to apply CARD-SA to the large size problem like the number of department is over 100. For this reason, we improve the CARD-SA to increase the number of department and to extend the variety of the department shape. Computational experiments suggest that this algorithm is quite effective.