메뉴 건너뛰기




Volumn 218, Issue 19, 2012, Pages 9802-9818

The three-dimensional knapsack problem with balancing constraints

Author keywords

3D knapsack; Heuristic; Load balancing; MIP model

Indexed keywords

3D KNAPSACK; CENTER OF MASS; COMPUTATIONAL RESULTS; HEURISTIC; KNAPSACK PROBLEMS; LARGE SIZES; OPTIMAL SOLUTIONS; PACKING PROBLEMS; SMALL SIZE; SOLUTION QUALITY; UPPER AND LOWER BOUNDS; UPPER BOUND;

EID: 84860488507     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2012.03.052     Document Type: Article
Times cited : (42)

References (47)
  • 2
    • 28444483716 scopus 로고    scopus 로고
    • A heuristic procedure for the automated cargo vehicle loading problem: A case study
    • T.A. Ciriani, OR in Space and Air Springer
    • L. Colaneri, F. Della Croce, G. Perboli, and R. Tadei A heuristic procedure for the automated cargo vehicle loading problem: a case study T.A. Ciriani, OR in Space and Air OR in Space and Air 2003 Springer 27 42
    • (2003) OR in Space and Air , pp. 27-42
    • Colaneri, L.1    Della Croce, F.2    Perboli, G.3    Tadei, R.4
  • 3
    • 0001392213 scopus 로고
    • Issues in the development of approaches to container loading
    • E.E. Bischoff, and M.S.W. Ratcliff Issues in the development of approaches to container loading Omega 23 1995 377 390
    • (1995) Omega , vol.23 , pp. 377-390
    • Bischoff, E.E.1    Ratcliff, M.S.W.2
  • 7
    • 61349094010 scopus 로고    scopus 로고
    • Extreme point-based heuristics for three-dimensional bin packing
    • T.G. Crainic, G. Perboli, and R. Tadei Extreme point-based heuristics for three-dimensional bin packing INFORMS Journal on Computing 20 2008 368 384
    • (2008) INFORMS Journal on Computing , vol.20 , pp. 368-384
    • Crainic, T.G.1    Perboli, G.2    Tadei, R.3
  • 8
    • 79957605272 scopus 로고    scopus 로고
    • Three-dimensional container loading models with cargo stability and load bearing constraints
    • L. Junqueira, R. Morabito, and D.S. Yamashita Three-dimensional container loading models with cargo stability and load bearing constraints Computers & Operations Research 39 2012 74 85
    • (2012) Computers & Operations Research , vol.39 , pp. 74-85
    • Junqueira, L.1    Morabito, R.2    Yamashita, D.S.3
  • 9
    • 34447100387 scopus 로고    scopus 로고
    • An improved typology of cutting and packing problems
    • DOI 10.1016/j.ejor.2005.12.047, PII S037722170600292X
    • G. Wäscher, H. Haußner, and H. Schumann An improved typology of cutting and packing problems European Journal of Operational Research 183 2007 1109 1130 (Pubitemid 47030730)
    • (2007) European Journal of Operational Research , vol.183 , Issue.3 , pp. 1109-1130
    • Wascher, G.1    Haussner, H.2    Schumann, H.3
  • 12
    • 54449098516 scopus 로고    scopus 로고
    • Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem
    • D. Pisinger, and M. Sigurd Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem INFORMS Journal on Computing 19 2007 36 51
    • (2007) INFORMS Journal on Computing , vol.19 , pp. 36-51
    • Pisinger, D.1    Sigurd, M.2
  • 14
    • 0002662534 scopus 로고
    • Multistage cutting stock problems of two and more dimensions
    • P.C. Gilmore, and R.E. Gomory Multistage cutting stock problems of two and more dimensions Operations Research 13 1965 94 120
    • (1965) Operations Research , vol.13 , pp. 94-120
    • Gilmore, P.C.1    Gomory, R.E.2
  • 15
    • 34447105676 scopus 로고    scopus 로고
    • A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
    • DOI 10.1016/j.ejor.2005.11.060, PII S0377221706002943
    • R. Baldacci, and M.A. Boschetti A cutting plane approach for the two-dimensional orthogonal non-guillotine cutting problem European Journal of Operational Research 183 2007 1136 1149 (Pubitemid 47030732)
    • (2007) European Journal of Operational Research , vol.183 , Issue.3 , pp. 1136-1149
    • Baldacci, R.1    Boschetti, M.A.2
  • 16
    • 0021789009 scopus 로고
    • Exact two-dimensional non-guillotine cutting stock tree search procedure
    • J.E. Beasley An exact two-dimensional non-guillotine cutting stock tree search procedure Operations Research 33 1985 49 64 (Pubitemid 15475049)
    • (1985) Operations Research , vol.33 , Issue.1 , pp. 49-64
    • Beasley, J.E.1
  • 19
    • 0012575285 scopus 로고    scopus 로고
    • New classes of fast lower bounds for bin packing problems
    • S.P. Fekete, and J. Schepers New classes of lower bounds for bin packing problems Mathematical Programming 91 1 2001 11 31 (Pubitemid 33758904)
    • (2001) Mathematical Programming, Series B , vol.91 , Issue.1 , pp. 11-31
    • Fekete, S.P.1    Schepers, J.2
  • 20
    • 0034156490 scopus 로고    scopus 로고
    • The three-dimensional bin packing problem
    • S. Martello, D. Pisinger, and D. Vigo The three-dimensional bin packing problem Operations Research 48 2 2000 256 267
    • (2000) Operations Research , vol.48 , Issue.2 , pp. 256-267
    • Martello, S.1    Pisinger, D.2    Vigo, D.3
  • 21
    • 25144468941 scopus 로고    scopus 로고
    • Erratum: "The three-dimensional bin packing problem": Robot-packable and orthogonal variants of packing problems (Operations Research)
    • DOI 10.1287/opre.1050.0210
    • E. den Boef, J. Korst, S. Martello, D. Pisinger, and D. Vigo Erratum to the three-dimensional bin packing problem: robot-packable and orthogonal variants of packing problems Operations Research 53 4 2005 735 736 (Pubitemid 41344636)
    • (2005) Operations Research , vol.53 , Issue.4 , pp. 735-736
    • Den Boef, E.1    Korst, J.2    Martello, S.3    Pisinger, D.4    Vigo, D.5
  • 23
    • 0012965013 scopus 로고    scopus 로고
    • The dimensional family approach in (hyper) sphere packing: A typological study of new patterns, structures, and interdimensional functions
    • PII S0096300397000040
    • C. Musès The dimensional family approach in (hyper) sphere packing: a typological study of new patterns, structures, and interdimensional functions Applied Mathematics and Computations 88 1997 1 26 (Pubitemid 127683552)
    • (1997) Applied Mathematics and Computation , vol.88 , Issue.1 , pp. 1-26
    • Muses, C.1
  • 24
    • 84860464402 scopus 로고    scopus 로고
    • Recent advances in multi-dimensional packing and loading problems
    • C. Volosencu (Ed.) ISBN: 978-953-51-0480-3
    • T.G. Crainic, G. Perboli, R. Tadei, Recent advances in multi-dimensional packing and loading problems, in: C. Volosencu (Ed.), New Technologies-Trends, Innovations and Research, InTech, 2012, pp. 91-110, ISBN: 978-953-51-0480-3.
    • (2012) New Technologies-Trends, Innovations and Research, InTech , pp. 91-110
    • Crainic, T.G.1    Perboli, G.2    Tadei, R.3
  • 28
    • 84949235652 scopus 로고    scopus 로고
    • A new exact algorithm for general orthogonal d-dimensional knapsack problems
    • Algorithms - ESA'97
    • S.P. Fekete, J. Schepers, A new exact algorithm for general orthogonal d-dimensional knapsack problems, in: ESA '97, Springer Lecture Notes in Computer Science, vol. 1284, 1997, pp. 144-156. (Pubitemid 127119226)
    • (1997) Lecture Notes in Computer Science , Issue.1284 , pp. 144-156
    • Fekete, S.P.1    Schepers, J.2
  • 29
    • 4043106962 scopus 로고    scopus 로고
    • A combinatorial characterization of higher-dimensional orthogonal packing
    • S.P. Fekete, and J. Schepers A combinatorial characterization of higher-dimensional orthogonal packing Mathematics of Operations Research 29 2004 353 368
    • (2004) Mathematics of Operations Research , vol.29 , pp. 353-368
    • Fekete, S.P.1    Schepers, J.2
  • 31
    • 34447093729 scopus 로고    scopus 로고
    • A new exact method for the two-dimensional orthogonal packing problem
    • DOI 10.1016/j.ejor.2005.12.048, PII S0377221706002992
    • F. Clautiaux, J. Carlier, and A. Moukrim A new exact method for the two-dimensional orthogonal packing problem European Journal of Operational Research 183 2007 1196 1211 (Pubitemid 47030735)
    • (2007) European Journal of Operational Research , vol.183 , Issue.3 , pp. 1196-1211
    • Clautiaux, F.1    Carlier, J.2    Moukrim, A.3
  • 32
    • 70449523700 scopus 로고    scopus 로고
    • Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core
    • G. Mavrotas, J.R. Figueira, and K. Florios Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core Applied Mathematics and Computation 215 2009 2502 2514
    • (2009) Applied Mathematics and Computation , vol.215 , pp. 2502-2514
    • Mavrotas, G.1    Figueira, J.R.2    Florios, K.3
  • 33
    • 54449095900 scopus 로고    scopus 로고
    • Heuristic approaches for the two- and three-dimensional knapsack packing problem
    • J. Egeblad, and D. Pisinger Heuristic approaches for the two- and three-dimensional knapsack packing problem Computers & Operations Research 36 2009 1026 1049
    • (2009) Computers & Operations Research , vol.36 , pp. 1026-1049
    • Egeblad, J.1    Pisinger, D.2
  • 34
    • 28444467184 scopus 로고
    • A simulated annealing approach to 3-D packing with multiple constraints
    • Boeing Huntsville Al Center
    • R. Daughtrey, T. Fennel, D. Schwaab, A simulated annealing approach to 3-D packing with multiple constraints, Technical Report Cosmic Program MFS-287000, Boeing Huntsville Al Center, 1991.
    • (1991) Technical Report Cosmic Program MFS-287000
    • Daughtrey, R.1    Fennel, T.2    Schwaab, D.3
  • 35
    • 84860428356 scopus 로고    scopus 로고
    • Boeing Defence & Space Group, Cargo planning, analysis and configuration system
    • Boeing Defence & Space Group, Cargo planning, analysis and configuration system, Technical Report S 683-30014-1, Boeing, 1996.
    • (1996) Technical Report S 683-30014-1, Boeing
  • 36
    • 0345955625 scopus 로고    scopus 로고
    • Cargo analytical integration in space engineering: A three-dimensional packing model
    • T. Ciriani, S. Gliozzi, E.L. Johnson, R. Tadei, Macmillan
    • G. Fasano Cargo analytical integration in space engineering: a three-dimensional packing model T. Ciriani, S. Gliozzi, E.L. Johnson, R. Tadei, Operations Research in Industry 1999 Macmillan 232 246
    • (1999) Operations Research in Industry , pp. 232-246
    • Fasano, G.1
  • 37
    • 28444446436 scopus 로고    scopus 로고
    • A MIP approach for some practical packing problems: Balancing constraints and tetris-like items
    • G. Fasano A MIP approach for some practical packing problems: balancing constraints and tetris-like items 4OR: A Quarterly Journal of Operations Research 2 2 2004 161 174
    • (2004) 4OR: A Quarterly Journal of Operations Research , vol.2 , Issue.2 , pp. 161-174
    • Fasano, G.1
  • 39
    • 0021724792 scopus 로고
    • Aircraft load planning and the computer: Description and review
    • L.A. Martin Vega Aircraft load planning and the computer: description and review Computers and Industrial Engineering 4 1985 357 369
    • (1985) Computers and Industrial Engineering , vol.4 , pp. 357-369
    • Martin Vega, L.A.1
  • 40
    • 0021976278 scopus 로고
    • Improving utilization of air force cargo loading
    • D. Cochard, and K. Yost Improving utilization of air force cargo loading Interfaces 15 1985 53 68 (Pubitemid 15607320)
    • (1985) Interfaces , vol.15 , Issue.1 , pp. 53-68
    • Cochard Douglas, D.1    Yost Kirk, A.2
  • 42
    • 0032003302 scopus 로고    scopus 로고
    • An integer-programming-based heuristic for the balanced loading problem
    • PII S0167637797000448
    • K. Mathur An integer-programming-based heuristic for the balanced loading problem Operations Research Letters 22 1998 19 25 (Pubitemid 128406987)
    • (1998) Operations Research Letters , vol.22 , Issue.1 , pp. 19-25
    • Mathur, K.1
  • 43
    • 4544259186 scopus 로고    scopus 로고
    • A new placement heuristic for the orthogonal stock cutting problem
    • E.K. Burke, G. Kendall, and G. Whitwell A new placement heuristic for the orthogonal stock cutting problem Operations Research 52 2004 655 671
    • (2004) Operations Research , vol.52 , pp. 655-671
    • Burke, E.K.1    Kendall, G.2    Whitwell, G.3
  • 44
    • 68749119530 scopus 로고    scopus 로고
    • A simulated annealing enhancement of the best-fit heuristic for the orthogonal stock cutting problem
    • E.K. Burke, G. Kendall, and G. Whitwell A simulated annealing enhancement of the best-fit heuristic for the orthogonal stock cutting problem INFORMS Journal on Computing 21 2009 505 516
    • (2009) INFORMS Journal on Computing , vol.21 , pp. 505-516
    • Burke, E.K.1    Kendall, G.2    Whitwell, G.3
  • 45
    • 9744282784 scopus 로고    scopus 로고
    • The two-dimensional finite bin packing problem. Part II: New lower and upper bounds
    • M.A. Boschetti, and A. Mingozzi The two-dimensional finite bin packing problem. Part II: New lower and upper bounds 4OR 1 2003 135 147
    • (2003) 4OR , vol.1 , pp. 135-147
    • Boschetti, M.A.1    Mingozzi, A.2
  • 46
  • 47
    • 56449107505 scopus 로고
    • Or-library: Distributing test problems by electronic mail
    • J.E. Beasley Or-library: distributing test problems by electronic mail Journal of the Operational Research Society 41 1990 1069 1072 http://people.brunel.ac.uk/mastjjb/jeb/info.html
    • (1990) Journal of the Operational Research Society , vol.41 , pp. 1069-1072
    • Beasley, J.E.1


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