Industrial Engineering and Management Systems

  • 제8권1호
  • /
  • Pages.22-28
  • /
  • 2009
  • /
  • 1598-7248(pISSN)
  • /
  • 2234-6473(eISSN)
대한산업공학회 (Korean Institute of Industrial Engineers)
권호 표지

Efficient Algorithms for Solving Facility Layout Problem Using a New Neighborhood Generation Method Focusing on Adjacent Preference

  • 투고 : 2008.01.22
  • 심사 : 2008.09.14
  • 발행 : 2009.03.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

We consider facility layout problems, where mn facility units are assigned into mn cells. These cells are arranged into a rectangular pattern with m rows and n columns. In order to solve this cell type facility layout problem, many approximation algorithms with improved local search methods were studied because it was quite difficult to find exact optimum of such problem in case of large size problem. In this paper, new algorithms based on Simulated Annealing (SA) method with two neighborhood generation methods are proposed. The new neighborhood generation method adopts the exchanging operation of facility units in accordance with adjacent preference. For evaluating the performance of the neighborhood generation method, three algorithms, previous SA algorithm with random 2-opt neighborhood generation method, the SA-based algorithm with the new neighborhood generation method (SA1) and the SA-based algorithm with probabilistic selection of random 2-opt and the new neighborhood generation method (SA2), are developed and compared by experiment of solving same example problem. In case of numeric examples with problem type 1 (the optimum layout is given), SA1 algorithm could find excellent layout than other algorithms. However, in case of problem type 2 (random-prepared and optimum-unknown problem), SA2 was excellent more than other algorithms.

키워드

참고문헌

  1. Burkard, R. E. (1984), Quadratic Assignment Problems, European Journal of Operational Research, 15, 283-289 https://doi.org/10.1016/0377-2217(84)90093-6
  2. Dutta, K. N. and Sahu, S. (1982), A multi goal heuristic for facilities design problem: MUGHAL, International Journal of Production Research, 20(2),147-154 https://doi.org/10.1080/00207548208947756
  3. Fortenberry, J. C. and Cox, J. F.(1985), Multiple criteria approach to the facilities layout problem, International Journal of Production Research, 23(4), 773-782 https://doi.org/10.1080/00207548508904746
  4. Foulds, L. R. (1983), Techniques for Facilities Layout: Deciding Which Pairs of Activities Should Be Adjacent, Management Science, 29(12), 1414-1426 https://doi.org/10.1287/mnsc.29.12.1414
  5. Golany, B. and Rosenblatt, M. J. (1989), A Heuristic Algorithm for the Quadratic Assignment Formulation to the Plant Layout Problem, International Journal of Production Research, 27(2), 293-308 https://doi.org/10.1080/00207548908942548
  6. Harmonosky, C. M. and Tothero, G. K. (1992), A multifactor plant layout methodology, International Journal of Production Research, 30(8), 1773-1789 https://doi.org/10.1080/00207549208948121
  7. Houshayar, A. and White, B. (1993), Exact Optimal Solution for Facility Layout: Deciding Which Pairs of Locations Should Be Adjacent, Computers and Industrial Engineering, 29(2), 177-187 https://doi.org/10.1016/0360-8352(93)90006-J
  8. Kirkpatrick, S. et al. (1983), Optimization by Simulated Annealing Science, 220(4598), 671-680 https://doi.org/10.1126/science.220.4598.671
  9. Kon, T., Fukushi, T., Suzuki, A., and Yamamoto, H. (2006), Algorithm for solving facility layout problems by using simulated annealing, Proceedings of Japan Industrial Management Association 2006 fall meeting, 160-161(in Japanese)
  10. Koopmans, T. C. and Beckman, M. (1957), Assignment Problems and the Location of Economic Activities, Econometrica, 25, 53-76 https://doi.org/10.2307/1907742
  11. Lacksonen, T. A. and Enscore, E. E. Jr., (1993), Quadratic Assignment Algorithms for the Dynamic Layout Problem, International Journal of Production Research, 31(3), 503-517 https://doi.org/10.1080/00207549308956741
  12. Rosenblatt, M. J. (1979), The facilities layout problem: a multi-goal approach, International Journal of Production Research, 17(4), 323-332 https://doi.org/10.1080/00207547908919617
  13. Suzuki, A., Yamamoto, H., Nakamura, T., and Tsujimura, Y. (2004), Efficient Algorithms for Solving the Facility Layout Problem by using Symmetries, the proceeding of Eighth International Conference on Manufacturing and Management, 2, 601-608
  14. Suzuki, A., Yamamoto, H., and Nakamura, T. (2005), Solving Methods for Cellular Facility Layout Problems by using Evolutionary Algorithms, Journal of Society of Plant Engineers in Japan, 17(2), 51-59(in Japanese)
  15. Urban, T. L. (1987), A multiple criteria model for the facilities layout problem, International Journal of Production Research, 25(12), 1805-1812
  16. Yamamoto, H., A. Suzuki, T. Nakamura, (2004), A Branch and Bound Algorithm for Solving Facility Layout Problems Using Symmetries, Journal of Japan Industrial Management Association, 55(5), 293-301(in Japanese).