Browse > Article

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

Lee Sang-Heon (국방대학교 운영분석학과)
Lee Jeong-Min (국방부)
Publication Information
Korean Management Science Review / v.22, no.1, 2005 , pp. 167-178 More about this Journal
Abstract
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.
Keywords
Two-Dimensional Bin Packing Problem; Tabu Search; Meta Heuristic; Cutting;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Dowsland, K.A. and W.B. Dowsland, 'Solution Approaches to Irregular Nesting Problems,' European Journal of Operations Research, Vol.84(1995), pp.506-521   DOI   ScienceOn
2 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
3 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   DOI   ScienceOn
4 Hinxman, A.I., 'The Trim Loss and Assortment Problems,' European Journal of Operational Research, Vol.5(1980), pp.8-18   DOI   ScienceOn
5 Jacobs, S., 'On Genetic Algorithms for the Packing of Polygons,' European Journal of Operational Research, Vol.88(1996), pp. 165-181   DOI   ScienceOn
6 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
7 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   DOI
8 Golden, B., 'Approaches to the Cutting Stock Problem,' AIIE Transactions, Vol.8 (1976), pp.265-274
9 Kampke, T., 'Simulated Annealing :Use of a New Tool in Bin-Packing,' Annals of Operations Research, Vol.16(1988), pp.327-332   DOI
10 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   DOI   ScienceOn
11 Glover, F. and M. Laguna, Tabu Search, Kluwer Academic Publishers, 1997
12 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
13 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
14 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   DOI   ScienceOn
15 Dowsland, K.A. and W.B. Dowsland, 'Packing Problems,' European Journal of Operations Research, Vol.56(1992), pp.2-14   DOI   ScienceOn
16 Dowsland, W.B., 'Two and Three Dimensional Packing Problems and Solution Methods,' New Zealand Journal of Operational Research, Vol.13(1985), pp.1-18
17 Dyckhoff, H., 'A Typology of Cutting and Packing Problems,' European Journal of Operational Research, Vol.44(1990), pp.145-159   DOI   ScienceOn
18 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
19 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
20 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   DOI   ScienceOn
21 Rolland, E., H. Pirkul and F. Glover, 'Tabu Search for Graph Partitioning,' Annals of Operations Research, Vol.63(1996), pp.290-232
22 Glover, F., 'Tabu Search,' ORSA Journal on Computing, No.3(1989), pp.190-206
23 김여근, 윤보식, 이상복, 메타휴리스틱, 영지문화사, 2000
24 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   DOI   ScienceOn
25 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
26 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   DOI   ScienceOn
27 Dowsland, K., 'Some Experiments with Simulated Annealing Techniques for Packing Problems,' Operational Research, Vol. 68(1993), pp.389-399   DOI   ScienceOn
28 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   DOI   ScienceOn