메뉴 건너뛰기
Central European Journal of Operations Research
Volumn 20, Issue 2, 2012, Pages 337-354
A heuristic for solving large bin packing problems in two and three dimensions
Author keywords

Bin packing; Heuristics; SBSBPP; Single bin size bin packing problem; Single stock size cutting stock problem; SSSCSP
Indexed keywords

EID: 84859425232     PISSN: 1435246X     EISSN: 16139178     Source Type: Journal    
DOI: 10.1007/s10100-010-0184-1     Document Type: Article
Times cited : (25)
References (29)
  • 1
    • 0020166427 scopus 로고
    • Packing rectangular pieces-a heuristic approach
    • Bengtsson B-E (1982) Packing rectangular pieces-a heuristic approach. Comput J 25: 353-357.
    • (1982) Comput J , vol.25 , pp. 353-357
    • Bengtsson, B.-E.1
  • 2
    • 0023344708 scopus 로고
    • Two dimensional finite bin packing algorithms
    • Berkey JO, Wang PY (1987) Two dimensional finite bin packing algorithms. J Oper Res Soc 38: 423-429.
    • (1987) J Oper Res Soc , vol.38 , pp. 423-429
    • Berkey, J.O.1    Wang, P.Y.2
  • 3
    • 0001392213 scopus 로고
    • Issues in the development of approaches to container loading
    • Bischoff EE, Ratcliff MSW (1995) Issues in the development of approaches to container loading. Omega 23: 377-390.
    • (1995) Omega , vol.23 , pp. 377-390
    • Bischoff, E.E.1    Ratcliff, M.S.W.2
  • 4
    • 0009448217 scopus 로고    scopus 로고
    • Eine Heuristik für multiple containerladeprobleme
    • Bortfeldt A (2000) Eine Heuristik für multiple containerladeprobleme. OR Spectr 22: 239-261.
    • (2000) OR Spectr , vol.22 , pp. 239-261
    • Bortfeldt, A.1
  • 6
    • 84859435666 scopus 로고    scopus 로고
    • Vortrag in der Forschungswerkstatt der Fakultät Wirtschaftswiss. der FernUniversität in Hagen, März 2007. S
    • Bortfeldt A (2007) Verfahren für das eindimensionale Bin Packing Problem. Vortrag in der Forschungswerkstatt der Fakultät Wirtschaftswiss. der FernUniversität in Hagen, März 2007. S. http://www. fernuni-hagen. de/WINF.
    • (2007) Verfahren für das eindimensionale Bin Packing Problem
    • Bortfeldt, A.1
  • 8
    • 61349094010 scopus 로고    scopus 로고
    • Extreme point-based Heuristics for three-dimensional bin packing
    • Crainic TG, Perboli G, Tadei R (2008) Extreme point-based Heuristics for three-dimensional bin packing. INFORMS J Comput 20: 368-384.
    • (2008) INFORMS J Comput , vol.20 , pp. 368-384
    • Crainic, T.G.1    Perboli, G.2    Tadei, R.3
  • 10
    • 84929667247 scopus 로고    scopus 로고
    • A greedy search for the tree-dimensional bin packing problem: the packing stability case
    • de Castro Silva JL, Soma NY, Maculan N (2003) A greedy search for the tree-dimensional bin packing problem: the packing stability case. Int Trans Oper Res 10: 141-153.
    • (2003) Int Trans Oper Res , vol.10 , pp. 141-153
    • de Castro, S.J.L.1    Soma, N.Y.2    Maculan, N.3
  • 11
    • 84867921201 scopus 로고    scopus 로고
    • A lower bound for the non-oriented two-dimensional bin packing problem
    • Dell'Amico M, Martello S, Vigo D (2002) A lower bound for the non-oriented two-dimensional bin packing problem. Discrete Appl Math 118: 13-24.
    • (2002) Discrete Appl Math , vol.118 , pp. 13-24
    • Dell'Amico, M.1    Martello, S.2    Vigo, D.3
  • 12
    • 0040163617 scopus 로고
    • A search based heuristic for the two-dimensional bin-packing problem
    • El Bouri A, Popplewell N, Balakrishnan S, Alfa A (1994) A search based heuristic for the two-dimensional bin-packing problem. INFOR 32: 265-274.
    • (1994) Infor , vol.32 , pp. 265-274
    • El Bouri, A.1    Popplewell, N.2    Balakrishnan, S.3    Alfa, A.4
  • 13
    • 1342311555 scopus 로고    scopus 로고
    • A bottleneck assignment approach to the multiple container loading problem
    • Eley M (2003) A bottleneck assignment approach to the multiple container loading problem. OR Spectr 25: 45-60.
    • (2003) OR Spectr , vol.25 , pp. 45-60
    • Eley, M.1
  • 14
    • 3843072027 scopus 로고    scopus 로고
    • Guided local search for the three-dimensional bin-packing problem
    • Faroe O, Pisinger D, Zachariasen M (2003) Guided local search for the three-dimensional bin-packing problem. INFORMS J Comput 15: 267-283.
    • (2003) INFORMS J Comput , vol.15 , pp. 267-283
    • Faroe, O.1    Pisinger, D.2    Zachariasen, M.3
  • 16
    • 0001444530 scopus 로고
    • An integer-programming based heuristic approach to the three-dimensional packing problem
    • Ivancic N, Mathur K, Mohanty BB (1989) An integer-programming based heuristic approach to the three-dimensional packing problem. J Manuf Oper Manag 2: 268-298.
    • (1989) J Manuf Oper Manag , vol.2 , pp. 268-298
    • Ivancic, N.1    Mathur, K.2    Mohanty, B.B.3
  • 17
    • 0009429839 scopus 로고    scopus 로고
    • Neighborhood search algorithm for the guillotine non-oriented two-dimensional bin packing problem
    • S. Voss, S. Martello, I. H. Osman, and C. Roucairol (Eds.), Boston: Kluwer Academic Publishers
    • Lodi A, Martello S, Vigo D (1998) Neighborhood search algorithm for the guillotine non-oriented two-dimensional bin packing problem. In: Voss S, Martello S, Osman IH, Roucairol C (eds) Meta-heuristics: advances and trends in local search paradigms for optimisation. Kluwer Academic Publishers, Boston, pp 125-139.
    • (1998) Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimisation , pp. 125-139
    • Lodi, A.1    Martello, S.2    Vigo, D.3
  • 18
    • 0001595376 scopus 로고    scopus 로고
    • Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems
    • Lodi A, Martello S, Vigo D (1999a) Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems. INFORMS J Comput 11: 345-357.
    • (1999) INFORMS J Comput , vol.11 , pp. 345-357
    • Lodi, A.1    Martello, S.2    Vigo, D.3
  • 19
    • 0032709505 scopus 로고    scopus 로고
    • Approximation algorithms for the oriented two-dimensional bin packing problem
    • Lodi A, Martello S, Vigo D (1999b) Approximation algorithms for the oriented two-dimensional bin packing problem. Eur J Oper Res 112: 158-166.
    • (1999) Eur J Oper Res , vol.112 , pp. 158-166
    • Lodi, A.1    Martello, S.2    Vigo, D.3
  • 20
    • 0036722384 scopus 로고    scopus 로고
    • Heuristic algorithms for the three-dimensional bin packing problem
    • Lodi A, Martello S, Vigo D (2002) Heuristic algorithms for the three-dimensional bin packing problem. Eur J Oper Res 141: 410-420.
    • (2002) Eur J Oper Res , vol.141 , pp. 410-420
    • Lodi, A.1    Martello, S.2    Vigo, D.3
  • 21
    • 4444250725 scopus 로고    scopus 로고
    • TSpack: a unified tabu search code for multi-dimensional bin packing problems
    • Lodi A, Martello S, Vigo D (2004) TSpack: a unified tabu search code for multi-dimensional bin packing problems. Ann Oper Res 131: 203-213.
    • (2004) Ann Oper Res , vol.131 , pp. 203-213
    • Lodi, A.1    Martello, S.2    Vigo, D.3
  • 22
    • 0034156490 scopus 로고    scopus 로고
    • The three-dimensional bin packing problem
    • Martello S, Pisinger D, Vigo D (2000) The three-dimensional bin packing problem. Oper Res 48: 256-267.
    • (2000) Oper Res , vol.48 , pp. 256-267
    • Martello, S.1    Pisinger, D.2    Vigo, D.3
  • 23
    • 0032023068 scopus 로고    scopus 로고
    • Exact solution of the two-dimensional finite bin packing problem
    • Martello S, Vigo D (1998) Exact solution of the two-dimensional finite bin packing problem. Manage Sci 44: 388-399.
    • (1998) Manage Sci , vol.44 , pp. 388-399
    • Martello, S.1    Vigo, D.2
  • 24
    • 24644467819 scopus 로고    scopus 로고
    • A GRASP approach to the container-loading problem
    • Moura A, Oliveira JF (2005) A GRASP approach to the container-loading problem. IEEE Intell Syst 20: 50-57.
    • (2005) IEEE Intell Syst , vol.20 , pp. 50-57
    • Moura, A.1    Oliveira, J.F.2
  • 25
    • 10044285409 scopus 로고    scopus 로고
    • Heuristics for large strip packing problems with guillotine patterns: an empirical study
    • Kluwer Academic Publishers B. V
    • Mumford-Valenzuela CL, Vick J, Wang PY (2003) Heuristics for large strip packing problems with guillotine patterns: an empirical study. In: Metaheuristics: computer-decision making. Kluwer Academic Publishers B. V., pp 510-522.
    • (2003) Metaheuristics: Computer-decision making , pp. 510-522
    • Mumford-Valenzuela, C.L.1    Vick, J.2    Wang, P.Y.3
  • 26
    • 0036722393 scopus 로고    scopus 로고
    • Heuristics for the container loading problem
    • Pisinger D (2002) Heuristics for the container loading problem. Eur J Oper Res 141: 143-153.
    • (2002) Eur J Oper Res , vol.141 , pp. 143-153
    • Pisinger, D.1
  • 27
    • 54449098516 scopus 로고    scopus 로고
    • Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem
    • Pisinger D, Sigurd M (2007) Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem. INFORMS J Comput 19: 36-51.
    • (2007) INFORMS J Comput , vol.19 , pp. 36-51
    • Pisinger, D.1    Sigurd, M.2
  • 29
    • 34447100387 scopus 로고    scopus 로고
    • An improved typology of cutting and packing problems
    • Wäscher G, Haußner H, Schumann H (2007) An improved typology of cutting and packing problems. Eur J Oper Res 183: 1109-1130.
    • (2007) Eur J Oper Res , vol.183 , pp. 1109-1130
    • Wäscher, G.1    Haußner, H.2    Schumann, H.3

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.