경영과학 (Korean Management Science Review)

한국경영과학회 (The Korean Operations Research and Management Science Society)
권호 표지

타부서치를 이용한 2차원 직사각 적재문제에 관한 연구

Applying a Tabu Search Approach for Solving the Two-Dimensional Bin Packing Problem

  • 발행 : 2005.05.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

The 2DBPP(Two-Dimensional Bin Packing Problem) is a problem of packing each item into a bin so that no two items overlap and the number of required bins is minimized under the set of rectangular items which may not be rotated and an unlimited number of identical .rectangular bins. The 2DBPP is strongly NP-hard and finds many practical applications in industry. In this paper we discuss a tabu search approach which includes tabu list, intensifying and diversification Strategies. The HNFDH(Hybrid Next Fit Decreasing Height) algorithm is used as an internal algorithm. We find that use of the proper parameter and function such as maximum number of tabu list and space utilization function yields a good solution in a reduced time. We present a tabu search algorithm and its performance through extensive computational experiments.

키워드

참고문헌

  1. 김여근, 윤보식, 이상복, 메타휴리스틱, 영지문화사, 2000
  2. Andrea Lodi, Silvano Martello and Daniele Vigo, 'Approximation Algorithms for the Oriented Two-Dimensional Bin Packing Problem,' European Journal of Operational Research, Vol.112(1999), pp.158-166 https://doi.org/10.1016/S0377-2217(97)00388-3
  3. Berkey, J.O. and P.Y. Wang, 'Two Dimensional Finite Bin Packing Algorithms,' Journal of the Operational Research Society, Vol.38(1987), pp.423-429 https://doi.org/10.1057/jors.1987.70
  4. Blazewicz, J., P. Hawrylak and R. Walko-wiak, 'Using a Tabu Search Approach for Solving the Two-Dimensional Irregular Cutting Problem,' Annals of Operations Research, Vol.41(1993), pp.313-327 https://doi.org/10.1007/BF02022998
  5. Burke, E. and G. Kendall, 'Applying Simulated Annealing and the No Fit Polygon to the Nesting Problem,' In Proceedings of the World Manufacturing Congress, Durham, UK, (1999), pp.27-30
  6. Dowsland, K., 'Some Experiments with Simulated Annealing Techniques for Packing Problems,' Operational Research, Vol. 68(1993), pp.389-399 https://doi.org/10.1016/0377-2217(93)90195-S
  7. Dowsland, K.A. and W.B. Dowsland, 'Packing Problems,' European Journal of Operations Research, Vol.56(1992), pp.2-14 https://doi.org/10.1016/0377-2217(92)90288-K
  8. Dowsland, K.A. and W.B. Dowsland, 'Solution Approaches to Irregular Nesting Problems,' European Journal of Operations Research, Vol.84(1995), pp.506-521 https://doi.org/10.1016/0377-2217(95)00019-M
  9. Dowsland, W.B., 'Two and Three Dimensional Packing Problems and Solution Methods,' New Zealand Journal of Operational Research, Vol.13(1985), pp.1-18
  10. Dyckhoff, H., 'A Typology of Cutting and Packing Problems,' European Journal of Operational Research, Vol.44(1990), pp.145-159 https://doi.org/10.1016/0377-2217(90)90350-K
  11. Fowler, R.J., M.S. Paterson and S.L. Tatimoto, 'Optimal Packing and Covering in the Plane are NP-Complete,' Information Processing Letters, Vol.12(1981), pp. 133-137 https://doi.org/10.1016/0020-0190(81)90111-3
  12. Frenk, J.B. and G.G. Galambos, 'Hybrid Next-fit Algorithm for the Two Dimensional Rectangle Bin-Packing Problem,' Computing, Vol.39(1987), pp.201-217 https://doi.org/10.1007/BF02309555
  13. Gilmore, P.C. and R.E. Gomory, 'A Linear Programming Approach to the Cutting-Stock Problem Part I,' Operational Research, Vol.9(1961), pp.724-746
  14. Gilmore, P.C. and R.E. Gomory, 'A Linear Programming Approach to the Cutting Stock Problem Part II,' Operational Research, Vol.11(1963), pp.863-888 https://doi.org/10.1287/opre.11.6.863
  15. Gilmore, P.C. and R.E. Gomory, 'Multi Stage Cutting Stock Problems of Two and More Dimensions,' Operational Research, Vol.13(1965), pp.94-112 https://doi.org/10.1287/opre.13.1.94
  16. Glover, F., 'Tabu Search,' ORSA Journal on Computing, No.3(1989), pp.190-206
  17. Glover, F. and M. Laguna, Tabu Search, Kluwer Academic Publishers, 1997
  18. Golden, B., 'Approaches to the Cutting Stock Problem,' AIIE Transactions, Vol.8 (1976), pp.265-274
  19. Hinxman, A.I., 'The Trim Loss and Assortment Problems,' European Journal of Operational Research, Vol.5(1980), pp.8-18 https://doi.org/10.1016/0377-2217(80)90068-5
  20. Hopper, E. and B.C.H. Turton, 'A Genetic Algorithm for a 2D Industrial Packing Problem,' Computers in Engineering, Vol.37 (1999), pp.375-378
  21. Hopper, E. and B.C.H. Turton, 'An Empirical Investigation of Meta-heuristic and Heuristic Algorithms for a 2D Packing Problem,' European Journal of Operational Research, Vol.128, No.1(2000), pp.34-57
  22. Jacobs, S., 'On Genetic Algorithms for the Packing of Polygons,' European Journal of Operational Research, Vol.88(1996), pp. 165-181 https://doi.org/10.1016/0377-2217(94)00166-9
  23. Kampke, T., 'Simulated Annealing :Use of a New Tool in Bin-Packing,' Annals of Operations Research, Vol.16(1988), pp.327-332 https://doi.org/10.1007/BF02283751
  24. Liu, D. and H. Teng, 'An Improved BL-Algorithm for Genetic Algorithm of the Orthogonal Packing of Rectangles,' European Journal of Operational Research, Vol.112(1999), pp.413-419 https://doi.org/10.1016/S0377-2217(97)00437-2
  25. Rayward-Smith, V.J. and M.T. Shing, 'Bin Packing,' Bulletin of the Institute of Mathematics and Its Applications, Vol.19(1983), pp.142-146
  26. Rolland, E., H. Pirkul and F. Glover, 'Tabu Search for Graph Partitioning,' Annals of Operations Research, Vol.63(1996), pp.290-232
  27. Smith, D., 'Bin-Packing with Adaptive Search,' In Grefenstette (ed), Proceedings of an International Conference on Genetic Algorithms and their Applications, Lawrence Erlbaum, (1985), pp.202-206
  28. Whelan, P.F. and B.G. Batchelor, 'Automated Packing Systems : Review of Industrial Implementations,' SPIE, Machine Vision Architectures, Integration and Applications 2064, (1993), pp.358-369