메뉴 건너뛰기




Volumn 229, Issue 1, 2013, Pages 1-20

Constraints in container loading-A state-of-the-art review

Author keywords

Constraints; Container loading; Cutting; Exact algorithms; Heuristics; Packing

Indexed keywords

CONTAINERS; CUTTING; HEURISTIC ALGORITHMS; OPERATIONS RESEARCH; PACKING; SUPPLY CHAINS;

EID: 84876412999     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2012.12.006     Document Type: Article
Times cited : (314)

References (169)
  • 1
    • 0031144758 scopus 로고    scopus 로고
    • Interactive ILP procedures for stacking optimization for the 3D palletization problem
    • G. Abdou, and J. Arghavani Interactive ILP procedures for stacking optimization for the 3D palletization problem International Journal of Production Research 35 1997 1287 1304
    • (1997) International Journal of Production Research , vol.35 , pp. 1287-1304
    • Abdou, G.1    Arghavani, J.2
  • 2
    • 0033132183 scopus 로고    scopus 로고
    • 3D random stacking of weakly heterogeneous palletization problems
    • G. Abdou, and M. Elmasry 3D random stacking of weakly heterogeneous palletization problems International Journal of Production Research 37 1999 1505 1524
    • (1999) International Journal of Production Research , vol.37 , pp. 1505-1524
    • Abdou, G.1    Elmasry, M.2
  • 3
    • 84952511820 scopus 로고
    • A systematic approach for the three-dimensional palletization problem
    • G. Abdou, and M. Yang A systematic approach for the three-dimensional palletization problem International Journal of Production Research 32 1994 2381 2394
    • (1994) International Journal of Production Research , vol.32 , pp. 2381-2394
    • Abdou, G.1    Yang, M.2
  • 6
    • 77951295361 scopus 로고    scopus 로고
    • Multi-dimensional bin packing problems with guillotine constraints
    • R.R. Amossen, and D. Pisinger Multi-dimensional bin packing problems with guillotine constraints Computers & Operations Research 37 2010 1999 2006
    • (2010) Computers & Operations Research , vol.37 , pp. 1999-2006
    • Amossen, R.R.1    Pisinger, D.2
  • 7
    • 3543120530 scopus 로고    scopus 로고
    • An overview of AND/OR-graph approaches to cutting and packing problems
    • E.A. Mukhacheva, Ufa State Aviation Technical University Ufa
    • M. Arenales, and R. Morabito An overview of AND/OR-graph approaches to cutting and packing problems E.A. Mukhacheva, Decision Making under Conditions of Uncertainty (Cutting-Packing Problems) 1997 Ufa State Aviation Technical University Ufa 207 224
    • (1997) Decision Making under Conditions of Uncertainty (Cutting-Packing Problems) , pp. 207-224
    • Arenales, M.1    Morabito, R.2
  • 9
    • 33646371708 scopus 로고    scopus 로고
    • The distributor's three-dimensional pallet packing problem: A human intelligence-based heuristic approach
    • E. Baltacioglu, J.T. Moore, and R.R. Hill Jr. The distributor's three-dimensional pallet packing problem: a human intelligence-based heuristic approach International Journal of Operational Research 1 2006 249 266
    • (2006) International Journal of Operational Research , vol.1 , pp. 249-266
    • Baltacioglu, E.1    Moore, J.T.2    Hill, Jr.R.R.3
  • 12
    • 36448976929 scopus 로고    scopus 로고
    • Minimizing the object dimensions in circle and sphere packing problems
    • E.G. Birgin, and F.N.C. Sobral Minimizing the object dimensions in circle and sphere packing problems Computers & Operations Research 35 2008 2357 2375
    • (2008) Computers & Operations Research , vol.35 , pp. 2357-2375
    • Birgin, E.G.1    Sobral, F.N.C.2
  • 13
  • 14
    • 25144495747 scopus 로고    scopus 로고
    • Three-dimensional packing of items with limited load bearing strength
    • E.E. Bischoff Three-dimensional packing of items with limited load bearing strength European Journal of Operational Research 168 2006 952 966
    • (2006) European Journal of Operational Research , vol.168 , pp. 952-966
    • Bischoff, E.E.1
  • 16
    • 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
  • 19
    • 84855560615 scopus 로고    scopus 로고
    • A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints
    • (DOI: 10.1016/j.cor.2011.11.008)
    • Bortfeldt, A. (2011): A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints. Computers and Operations Research, available online (DOI: 10.1016/j.cor.2011.11.008).
    • (2011) Computers and Operations Research
    • Bortfeldt, A.1
  • 21
    • 84876412444 scopus 로고    scopus 로고
    • Zur Behandlung von Restriktionen bei der Stauraumoptimierung am Beispiel eines genetischen Algorithmus für das Containerbeladeproblem
    • H. Kopfer, C. Bierwirth, Springer Berlin
    • A. Bortfeldt, and H. Gehring Zur Behandlung von Restriktionen bei der Stauraumoptimierung am Beispiel eines genetischen Algorithmus für das Containerbeladeproblem H. Kopfer, C. Bierwirth, Logistik Management-Intelligente I + K Technologien 1999 Springer Berlin 83 100
    • (1999) Logistik Management-Intelligente i + K Technologien , pp. 83-100
    • Bortfeldt, A.1    Gehring, H.2
  • 23
    • 34447264991 scopus 로고    scopus 로고
    • A heuristic for the three-dimensional strip packing problem
    • A. Bortfeldt, and D. Mack A heuristic for the three-dimensional strip packing problem European Journal of Operational Research 183 2007 1267 1279
    • (2007) European Journal of Operational Research , vol.183 , pp. 1267-1279
    • Bortfeldt, A.1    Mack, D.2
  • 24
    • 0038555386 scopus 로고    scopus 로고
    • A parallel Tabu Search algorithm for solving the container loading problem
    • A. Bortfeldt, H. Gehring, and D. Mack A parallel Tabu Search algorithm for solving the container loading problem Parallel Computing 29 2003 641 662
    • (2003) Parallel Computing , vol.29 , pp. 641-662
    • Bortfeldt, A.1    Gehring, H.2    Mack, D.3
  • 25
    • 2642538506 scopus 로고    scopus 로고
    • New lower bounds for the three-dimensional finite bin packing problem
    • M.A. Boschetti New lower bounds for the three-dimensional finite bin packing problem Discrete Applied Mathematics 140 2004 241 258
    • (2004) Discrete Applied Mathematics , vol.140 , pp. 241-258
    • Boschetti, M.A.1
  • 26
    • 25144495201 scopus 로고    scopus 로고
    • A general purpose algorithm for three-dimensional packing
    • L. Brunetta, and P. Gregoire A general purpose algorithm for three-dimensional packing INFORMS Journal on Computing 17 2005 328 338
    • (2005) INFORMS Journal on Computing , vol.17 , pp. 328-338
    • Brunetta, L.1    Gregoire, P.2
  • 27
    • 84857560528 scopus 로고    scopus 로고
    • Automating the packing heuristic design process with genetic programming
    • doi:10.1162/EVCO-a-00044
    • E.K. Burke, M.R. Hyde, G. Kendall, and J. Woodward Automating the packing heuristic design process with genetic programming Evolutionary Computation 2011 doi:10.1162/EVCO-a-00044
    • (2011) Evolutionary Computation
    • Burke, E.K.1    Hyde, M.R.2    Kendall, G.3    Woodward, J.4
  • 29
    • 84888289577 scopus 로고    scopus 로고
    • Local search for a multi-drop multi-container loading problem
    • 10.1007/s10732-011-9162-6
    • S. Ceschia, and A. Schaerf Local search for a multi-drop multi-container loading problem Journal of Heuristics 2011 10.1007/s10732-011-9162-6
    • (2011) Journal of Heuristics
    • Ceschia, S.1    Schaerf, A.2
  • 32
    • 79960487155 scopus 로고    scopus 로고
    • A heuristic for the multiple container loading cost minimization problem
    • K.G. Mehrotra, Springer Berlin, Heidelberg
    • C.H. Che, W. Huang, A. Lim, and W. Zhu A heuristic for the multiple container loading cost minimization problem K.G. Mehrotra, Lecture Notes on Artificial Intelligence, 6704/2011 2011 Springer Berlin, Heidelberg 276 285
    • (2011) Lecture Notes on Artificial Intelligence, 6704/2011 , pp. 276-285
    • Che, C.H.1    Huang, W.2    Lim, A.3    Zhu, W.4
  • 34
    • 1842506486 scopus 로고    scopus 로고
    • A container packing support system for determining and visualising container packing patterns
    • C.-F. Chien, and J.-F. Deng A container packing support system for determining and visualising container packing patterns Decision Support Systems 37 2004 23 34
    • (2004) Decision Support Systems , vol.37 , pp. 23-34
    • Chien, C.-F.1    Deng, J.-F.2
  • 35
    • 0032183875 scopus 로고    scopus 로고
    • A recursive computational procedure for container loading
    • C.-F. Chien, and W.-T. Wu A recursive computational procedure for container loading Computers & Industrial Engineering 35 1998 319 322
    • (1998) Computers & Industrial Engineering , vol.35 , pp. 319-322
    • Chien, C.-F.1    Wu, W.-T.2
  • 36
    • 0032599527 scopus 로고    scopus 로고
    • A framework of modularized heuristics for determining the container loading patterns
    • C.-F. Chien, and W.-T. Wu A framework of modularized heuristics for determining the container loading patterns Computers & Industrial Engineering 37 1999 339 342
    • (1999) Computers & Industrial Engineering , vol.37 , pp. 339-342
    • Chien, C.-F.1    Wu, W.-T.2
  • 37
    • 60549114165 scopus 로고    scopus 로고
    • An efficient computational procedure for determining the container-loading pattern
    • C.-F. Chien, C.-Y. Lee, Y.-C. Huang, and W.-T. Wu An efficient computational procedure for determining the container-loading pattern Computers & Industrial Engineering 56 2009 965 978
    • (2009) Computers & Industrial Engineering , vol.56 , pp. 965-978
    • Chien, C.-F.1    Lee, C.-Y.2    Huang, Y.-C.3    Wu, W.-T.4
  • 41
    • 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
  • 44
    • 77951126527 scopus 로고    scopus 로고
    • A particular approach for the three-dimensional packing problem with additional constraints
    • A. de Almeida, and M.B. Figueiredo A particular approach for the three-dimensional packing problem with additional constraints Computers & Operations Research 37 2010 1968 1976
    • (2010) Computers & Operations Research , vol.37 , pp. 1968-1976
    • De Almeida, A.1    Figueiredo, M.B.2
  • 45
    • 37349016250 scopus 로고    scopus 로고
    • A multi-start random constructive heuristic for the container loading problem
    • O.C.B. de Araujo, and V.A. Armentano A multi-start random constructive heuristic for the container loading problem Pesquisa Operacional 27 2007 311 331
    • (2007) Pesquisa Operacional , vol.27 , pp. 311-331
    • De Araujo, O.C.B.1    Armentano, V.A.2
  • 47
    • 79958165522 scopus 로고    scopus 로고
    • Algorithms for 3D guillotine cutting problems: Unbounded knapsack, cutting stock and strip packing
    • T.A. de Queiroz, F.K. Miyazawa, Y. Wakabayashi, and E.C. Xavier Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing Computers & Operations Research 39 2011 200 212
    • (2011) Computers & Operations Research , vol.39 , pp. 200-212
    • De Queiroz, T.A.1    Miyazawa, F.K.2    Wakabayashi, Y.3    Xavier, E.C.4
  • 48
    • 25144468941 scopus 로고    scopus 로고
    • Erratum to "the three-dimensional bin packing problem: Robot-packable and orthogonal variants of packing problems"
    • 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 2005 735 736
    • (2005) Operations Research , vol.53 , pp. 735-736
    • Den Boef, E.1    Korst, J.2    Martello, S.3    Pisinger, D.4    Vigo, D.5
  • 49
    • 77952939073 scopus 로고    scopus 로고
    • A hybrid simulated annealing algorithm for solving multi-objective container-loading problems
    • Z.T. Dereli, and G.S. Das A hybrid simulated annealing algorithm for solving multi-objective container-loading problems Applied Artificial Intelligence 24 2010 463 486
    • (2010) Applied Artificial Intelligence , vol.24 , pp. 463-486
    • Dereli, Z.T.1    Das, G.S.2
  • 50
    • 0026206767 scopus 로고
    • Three-dimensional packing-solution approaches and heuristic development
    • W.B. Dowsland Three-dimensional packing-solution approaches and heuristic development International Journal of Production Research 29 1991 1673 1685
    • (1991) International Journal of Production Research , vol.29 , pp. 1673-1685
    • Dowsland, W.B.1
  • 51
    • 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
  • 55
    • 0036722385 scopus 로고    scopus 로고
    • Solving container loading problems by block arrangements
    • M. Eley Solving container loading problems by block arrangements European Journal of Operational Research 141 2002 393 409
    • (2002) European Journal of Operational Research , vol.141 , pp. 393-409
    • Eley, M.1
  • 56
    • 1342311555 scopus 로고    scopus 로고
    • A bottleneck assignment approach to the multiple container loading problem
    • M. Eley A bottleneck assignment approach to the multiple container loading problem Operations Research Spectrum 25 2003 45 60
    • (2003) Operations Research Spectrum , vol.25 , pp. 45-60
    • Eley, M.1
  • 58
    • 0034675401 scopus 로고    scopus 로고
    • A global optimization algorithm for the three-dimensional packing problem
    • L. Faina A global optimization algorithm for the three-dimensional packing problem European Journal of Operational Research 126 2000 340 354
    • (2000) European Journal of Operational Research , vol.126 , pp. 340-354
    • Faina, L.1
  • 59
    • 77952017448 scopus 로고    scopus 로고
    • A tree-search algorithm for solving the container loading problem
    • T. Fanslau, and A. Bortfeldt A tree-search algorithm for solving the container loading problem INFORMS Journal on Computing 22 2010 222 235
    • (2010) INFORMS Journal on Computing , vol.22 , pp. 222-235
    • Fanslau, T.1    Bortfeldt, A.2
  • 60
    • 3843072027 scopus 로고    scopus 로고
    • Guided local search for the three-dimensional bin-packing problem
    • O. Faroe, D. Pisinger, and M. Zachariasen Guided local search for the three-dimensional bin-packing problem INFORMS Journal on Computing 15 2003 267 283
    • (2003) INFORMS Journal on Computing , vol.15 , pp. 267-283
    • Faroe, O.1    Pisinger, D.2    Zachariasen, M.3
  • 61
    • 84949235652 scopus 로고    scopus 로고
    • A new exact algorithm for general orthogonal d-dimensional knapsack problem
    • R. Burkard, G. Woeginger, Springer Berlin, Heidelberg
    • S.P. Fekete, and J. Schepers A new exact algorithm for general orthogonal d-dimensional knapsack problem R. Burkard, G. Woeginger, Lecture Notes in Computer Science, 1284/1997 1997 Springer Berlin, Heidelberg 144 156
    • (1997) Lecture Notes in Computer Science, 1284/1997 , pp. 144-156
    • Fekete, S.P.1    Schepers, J.2
  • 62
    • 38549109642 scopus 로고    scopus 로고
    • An exact algorithm for higher-dimensional orthogonal packing
    • S.P. Fekete, J. Schepers, and J.C. van der Veen An exact algorithm for higher-dimensional orthogonal packing Operations Research 55 2007 569 587
    • (2007) Operations Research , vol.55 , pp. 569-587
    • Fekete, S.P.1    Schepers, J.2    Van Der Veen, J.C.3
  • 63
  • 69
    • 33746588314 scopus 로고    scopus 로고
    • A tabu search algorithm for a routing and container loading problem
    • M. Gendreau, M. Iori, G. Laporte, and S. Martello A tabu search algorithm for a routing and container loading problem Transportation Science 40 2006 342 350
    • (2006) Transportation Science , vol.40 , pp. 342-350
    • Gendreau, M.1    Iori, M.2    Laporte, G.3    Martello, S.4
  • 70
    • 0026853551 scopus 로고
    • A method for solving container packing for a single size of box
    • J.A. George A method for solving container packing for a single size of box Journal of the Operational Research Society 43 1992 307 312
    • (1992) Journal of the Operational Research Society , vol.43 , pp. 307-312
    • George, J.A.1
  • 72
    • 0344656681 scopus 로고
    • Zur Effektivität von Gradientenverfahren für Zuschnittprobleme
    • E. Girlich, and A.G. Tarnowski Zur Effektivität von Gradientenverfahren für Zuschnittprobleme Operations Research Spectrum 16 1994 211 221
    • (1994) Operations Research Spectrum , vol.16 , pp. 211-221
    • Girlich, E.1    Tarnowski, A.G.2
  • 73
    • 79958154822 scopus 로고    scopus 로고
    • A parallel multi-population biased random-key genetic algorithm for a container loading problem
    • J.F. Gonçalves, and M.G.C. Resende A parallel multi-population biased random-key genetic algorithm for a container loading problem Computers & Operations Research 39 2012 179 190
    • (2012) Computers & Operations Research , vol.39 , pp. 179-190
    • Gonçalves, J.F.1    Resende, M.G.C.2
  • 76
    • 77955303713 scopus 로고    scopus 로고
    • A caving degree based flake arrangement approach for the container loading problem
    • K. He, and W. Huang A caving degree based flake arrangement approach for the container loading problem Computers & Industrial Engineering 59 2010 344 351
    • (2010) Computers & Industrial Engineering , vol.59 , pp. 344-351
    • He, K.1    Huang, W.2
  • 77
    • 77949566430 scopus 로고    scopus 로고
    • Solving the single-container loading problem by a fast heuristic method
    • K. He, and W. Huang Solving the single-container loading problem by a fast heuristic method Optimization Methods and Software 25 2010 263 277
    • (2010) Optimization Methods and Software , vol.25 , pp. 263-277
    • He, K.1    Huang, W.2
  • 78
    • 78049440669 scopus 로고    scopus 로고
    • An efficient placement heuristic for three-dimensional rectangular packing
    • K. He, and W. Huang An efficient placement heuristic for three-dimensional rectangular packing Computers & Operations Research 38 2011 227 233
    • (2011) Computers & Operations Research , vol.38 , pp. 227-233
    • He, K.1    Huang, W.2
  • 81
    • 0942269534 scopus 로고    scopus 로고
    • Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study
    • M. Hifi Exact algorithms for unconstrained three-dimensional cutting problems: a comparative study Computers & Operations Research 31 2004 657 674
    • (2004) Computers & Operations Research , vol.31 , pp. 657-674
    • Hifi, M.1
  • 82
    • 77954924631 scopus 로고    scopus 로고
    • A linear programming approach for the three-dimensional bin packing problem
    • M. Hifi, I. Kacem, S. Nègre, and L. Wu A linear programming approach for the three-dimensional bin packing problem Electronic Notes in Discrete Mathematics 36 2010 993 1000
    • (2010) Electronic Notes in Discrete Mathematics , vol.36 , pp. 993-1000
    • Hifi, M.1    Kacem, I.2    Nègre, S.3    Wu, L.4
  • 83
    • 0020177911 scopus 로고
    • A combined approach to the pallet loading problem
    • T.J. Hodgson A combined approach to the pallet loading problem IIE Transactions 14 1982 175 182
    • (1982) IIE Transactions , vol.14 , pp. 175-182
    • Hodgson, T.J.1
  • 84
    • 84883040588 scopus 로고    scopus 로고
    • New lower bounds for the three-dimensional orthogonal bin packing problem
    • University of Toronto
    • C.-H. Hsu, and C.-S. Liao New lower bounds for the three-dimensional orthogonal bin packing problem 23rd Canadian Conference on Computational Geometry 2011 University of Toronto
    • (2011) 23rd Canadian Conference on Computational Geometry
    • Hsu, C.-H.1    Liao, C.-S.2
  • 85
    • 38049029275 scopus 로고    scopus 로고
    • An efficient algorithm for solving the container loading problem
    • B. Chen, M. Paterson, G. Zhang, Springer Berlin, Heidelberg
    • W. Huang, and K. He An efficient algorithm for solving the container loading problem B. Chen, M. Paterson, G. Zhang, ESCAPE 2007. Lecture Notes in Computer Science 2007 Springer Berlin, Heidelberg 396 407
    • (2007) ESCAPE 2007. Lecture Notes in Computer Science , pp. 396-407
    • Huang, W.1    He, K.2
  • 86
    • 56549122165 scopus 로고    scopus 로고
    • A caving degree approach for the single container loading problem
    • W. Huang, and K. He A caving degree approach for the single container loading problem European Journal of Operational Research 196 2009 93 101
    • (2009) European Journal of Operational Research , vol.196 , pp. 93-101
    • Huang, W.1    He, K.2
  • 87
    • 52049093045 scopus 로고    scopus 로고
    • A new heuristic algorithm for cuboids packing with no orientation constraints
    • W. Huang, and K. He A new heuristic algorithm for cuboids packing with no orientation constraints Computers & Operations Research 36 2009 425 432
    • (2009) Computers & Operations Research , vol.36 , pp. 425-432
    • Huang, W.1    He, K.2
  • 88
    • 77956965595 scopus 로고    scopus 로고
    • Routing problems with loading constraints
    • M. Iori, and S. Martello Routing problems with loading constraints Top 18 2010 4 27
    • (2010) Top , vol.18 , pp. 4-27
    • Iori, M.1    Martello, S.2
  • 92
    • 4444347188 scopus 로고    scopus 로고
    • An efficient approach for the three-dimensional container packing problem with practical constraints
    • Z. Jin, K. Ohno, and J. Du An efficient approach for the three-dimensional container packing problem with practical constraints Asia-Pacific Journal of Operational Research 21 2004 279 295
    • (2004) Asia-Pacific Journal of Operational Research , vol.21 , pp. 279-295
    • Jin, Z.1    Ohno, K.2    Du, J.3
  • 93
    • 84866057120 scopus 로고    scopus 로고
    • MIP-based approaches for the container loading problem with multi-drop constraints
    • 10.1007/s10479-011-0942-z
    • L. Junqueira, R. Morabito, and D.S. Yamashita MIP-based approaches for the container loading problem with multi-drop constraints Annals of Operations Research 2011 10.1007/s10479-011-0942-z
    • (2011) Annals of Operations Research
    • Junqueira, L.1    Morabito, R.2    Yamashita, D.S.3
  • 94
    • 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
  • 95
    • 79251576810 scopus 로고    scopus 로고
    • Three dimensional cutting problem: An integer programming approach
    • B. Kahraman Three dimensional cutting problem: an integer programming approach Mathematical and Computational Applications 16 2011 105 112
    • (2011) Mathematical and Computational Applications , vol.16 , pp. 105-112
    • Kahraman, B.1
  • 96
    • 71749087106 scopus 로고    scopus 로고
    • Heuristics with a new block strategy for the single and multiple container loading problems
    • M.-K. Kang, C.-S. Jang, and K.-S. Yoon Heuristics with a new block strategy for the single and multiple container loading problems Journal of the Operational Research Society 61 2010 95 107
    • (2010) Journal of the Operational Research Society , vol.61 , pp. 95-107
    • Kang, M.-K.1    Jang, C.-S.2    Yoon, K.-S.3
  • 97
    • 77952987708 scopus 로고    scopus 로고
    • Nested vs. joint optimization of vehicle routing problems with three-dimensional loading constraints
    • G. Koloch, and B. Kaminski Nested vs. joint optimization of vehicle routing problems with three-dimensional loading constraints Engineering Letters 18 2010 193 198
    • (2010) Engineering Letters , vol.18 , pp. 193-198
    • Koloch, G.1    Kaminski, B.2
  • 99
    • 0347181544 scopus 로고    scopus 로고
    • Container packing in a multi-customer delivering operation
    • K.K. Lai, J. Xue, and B. Xu Container packing in a multi-customer delivering operation Computers & Industrial Engineering 35 1998 323 326
    • (1998) Computers & Industrial Engineering , vol.35 , pp. 323-326
    • Lai, K.K.1    Xue, J.2    Xu, B.3
  • 101
    • 38249009313 scopus 로고
    • Heuristic algorithms for on-line packing in three dimensions
    • K. Li, and K.H. Cheng Heuristic algorithms for on-line packing in three dimensions Journal of Algorithm 13 1992 589 605
    • (1992) Journal of Algorithm , vol.13 , pp. 589-605
    • Li, K.1    Cheng, K.H.2
  • 105
    • 0142184299 scopus 로고    scopus 로고
    • A multi-faced buildup algorithm for three-dimensional packing problems
    • A. Lim, B. Rodrigues, and Y. Wang A multi-faced buildup algorithm for three-dimensional packing problems Omega 31 2003 471 481
    • (2003) Omega , vol.31 , pp. 471-481
    • Lim, A.1    Rodrigues, B.2    Wang, Y.3
  • 107
  • 108
    • 33746215642 scopus 로고    scopus 로고
    • A study of optimal system for multiple-constraint multiple-container packing problems
    • 2006
    • Lin, J.-L.; Chang, C.-H.; Yang, J.-Y.; 2006. A study of optimal system for multiple-constraint multiple-container packing problems. In: IEA/AIE 2006, pp. 1200-1210.
    • (2006) IEA/AIE , pp. 1200-1210
    • Lin, J.-L.1    Chang, C.-H.2    Yang, J.-Y.3
  • 109
    • 0036722395 scopus 로고    scopus 로고
    • An n-tet graph approach for non-guillotine packings of n-dimensional boxes into an n-container
    • L. Lins, S. Lins, and R. Morabito An n-tet graph approach for non-guillotine packings of n-dimensional boxes into an n-container European Journal of Operational Research 141 2002 421 439
    • (2002) European Journal of Operational Research , vol.141 , pp. 421-439
    • Lins, L.1    Lins, S.2    Morabito, R.3
  • 116
    • 4444250725 scopus 로고    scopus 로고
    • TSPACK: A unified tabu search code for multi-dimensional bin packing problems
    • A. Lodi, S. Martello, and D. Vigo TSPACK: A unified tabu search code for multi-dimensional bin packing problems Annals of Operations Research 131 2004 203 213
    • (2004) Annals of Operations Research , vol.131 , pp. 203-213
    • Lodi, A.1    Martello, S.2    Vigo, D.3
  • 118
    • 84859425232 scopus 로고    scopus 로고
    • A heuristic for solving large bin packing problems in two and three dimensions
    • 10.1007/s10100-010-0184-1
    • D. Mack, and A. Bortfeldt A heuristic for solving large bin packing problems in two and three dimensions Central European Journal of Operations Research 2010 10.1007/s10100-010-0184-1
    • (2010) Central European Journal of Operations Research
    • Mack, D.1    Bortfeldt, A.2
  • 122
    • 33947711857 scopus 로고    scopus 로고
    • Algorithm 864: General and robot-packable variants of the three-dimensional bin packing problem
    • (article 7)
    • Martello, S.; Pisinger, D.; Vigo, D.; den Boef, E.; Korst, J.; 2007. Algorithm 864: general and robot-packable variants of the three-dimensional bin packing problem. ACM Transactions on Mathematical Software, 33 (1) (article 7).
    • (2007) ACM Transactions on Mathematical Software , vol.33 , Issue.1
    • Martello, S.1    Pisinger, D.2    Vigo, D.3    Den Boef, E.4    Korst, J.5
  • 123
    • 0001360171 scopus 로고    scopus 로고
    • An algorithm for the three-dimensional packing problem with asymptotic performance analysis
    • F.K. Miyazawa, and Y. Wakabayashi An algorithm for the three-dimensional packing problem with asymptotic performance analysis Algorithmica 18 1997 122 144
    • (1997) Algorithmica , vol.18 , pp. 122-144
    • Miyazawa, F.K.1    Wakabayashi, Y.2
  • 124
    • 0033296774 scopus 로고    scopus 로고
    • Approximation algorithms for the orthogonal z-oriented three-dimensional packing
    • F.K. Miyazawa, and Y. Wakabayashi Approximation algorithms for the orthogonal z-oriented three-dimensional packing SIAM Journal on Computing 29 1999 1008 1029
    • (1999) SIAM Journal on Computing , vol.29 , pp. 1008-1029
    • Miyazawa, F.K.1    Wakabayashi, Y.2
  • 128
    • 0028409030 scopus 로고
    • Value considerations in three-dimensional packing-a heuristic procedure using the fractional knapsack problem
    • B.B. Mohanty, K. Mathur, and N.J. Ivancic Value considerations in three-dimensional packing-a heuristic procedure using the fractional knapsack problem European Journal of Operational Research 74 1994 143 151
    • (1994) European Journal of Operational Research , vol.74 , pp. 143-151
    • Mohanty, B.B.1    Mathur, K.2    Ivancic, N.J.3
  • 130
    • 24644467819 scopus 로고    scopus 로고
    • A GRASP approach to the container-loading problem
    • A. Moura, and J.F. Oliveira A GRASP approach to the container-loading problem IEEE Intelligent Systems 2005 50 57
    • (2005) IEEE Intelligent Systems , pp. 50-57
    • Moura, A.1    Oliveira, J.F.2
  • 131
    • 77349100608 scopus 로고    scopus 로고
    • An integrated approach to the vehicle routing and container loading problems
    • A. Moura, and J.F. Oliveira An integrated approach to the vehicle routing and container loading problems Operations Research Spectrum 31 2009 775 800
    • (2009) Operations Research Spectrum , vol.31 , pp. 775-800
    • Moura, A.1    Oliveira, J.F.2
  • 132
    • 1642631695 scopus 로고    scopus 로고
    • Decomposition method of two-and-three-dimensional rectangular bin packing
    • E.A. Mukhacheva, Ufa State Aviation Technical University Ufa
    • E.A. Mukhacheva, and I.I. Shehtman Decomposition method of two-and-three-dimensional rectangular bin packing E.A. Mukhacheva, Decision Making under Conditions of Uncertainty (Cutting-Packing Problems) 1997 Ufa State Aviation Technical University Ufa 155 171
    • (1997) Decision Making under Conditions of Uncertainty (Cutting-Packing Problems) , pp. 155-171
    • Mukhacheva, E.A.1    Shehtman, I.I.2
  • 139
    • 0343206475 scopus 로고
    • An efficient algorithm for container loading
    • M.-C. Portmann An efficient algorithm for container loading Methods of Operations Research 64 1990 563 572
    • (1990) Methods of Operations Research , vol.64 , pp. 563-572
    • Portmann, M.-C.1
  • 141
    • 54749156426 scopus 로고    scopus 로고
    • Doctoral Dissertation. European Business Management School, University of Wales Swansea, Singleton Park, UK
    • Ratcliff, M.S.W.; 1996. Aspects of Container Loading. Doctoral Dissertation. European Business Management School, University of Wales Swansea, Singleton Park, UK.
    • (1996) Aspects of Container Loading
    • Ratcliff, M.S.W.1
  • 143
    • 84857537363 scopus 로고    scopus 로고
    • A tree search method for the container loading problem with shipment priority
    • J. Ren, Y. Tian, and T. Sawaragi A tree search method for the container loading problem with shipment priority European Journal of Operational Research 214 2011 526 535
    • (2011) European Journal of Operational Research , vol.214 , pp. 526-535
    • Ren, J.1    Tian, Y.2    Sawaragi, T.3
  • 144
    • 84876411373 scopus 로고    scopus 로고
    • A priority-considering approach for the multiple-container loading problem
    • J. Ren, Y. Tian, and T. Sawaragi A priority-considering approach for the multiple-container loading problem International Journal of Metaheuristics 1 4 2011 298 316
    • (2011) International Journal of Metaheuristics , vol.1 , Issue.4 , pp. 298-316
    • Ren, J.1    Tian, Y.2    Sawaragi, T.3
  • 146
    • 0009442754 scopus 로고
    • Algorithms for the container loading problem
    • W. Gaul, A. Bachem, W. Habenicht, Springer Berlin, Heidelberg
    • G. Scheithauer Algorithms for the container loading problem W. Gaul, A. Bachem, W. Habenicht, Operations Research Proceedings 1991 1992 Springer Berlin, Heidelberg 445 452
    • (1992) Operations Research Proceedings 1991 , pp. 445-452
    • Scheithauer, G.1
  • 147
  • 148
    • 84876420319 scopus 로고    scopus 로고
    • A heuristic approach for solving the multi-pallet packing problem
    • E.A. Mukhacheva, Ufa State Aviation Technical University Ufa
    • G. Scheithauer, and J. Terno A heuristic approach for solving the multi-pallet packing problem E.A. Mukhacheva, Decision Making under Conditions of Uncertainty (Cutting-Packing Problems) 1997 Ufa State Aviation Technical University Ufa 140 154
    • (1997) Decision Making under Conditions of Uncertainty (Cutting-Packing Problems) , pp. 140-154
    • Scheithauer, G.1    Terno, J.2
  • 149
    • 34447099471 scopus 로고    scopus 로고
    • A 3D-BPP approach for optimising stowage plans and terminal productivity
    • A. Sciomachen, and E. Tanfani A 3D-BPP approach for optimising stowage plans and terminal productivity European Journal of Operational Research 183 2007 1433 1446
    • (2007) European Journal of Operational Research , vol.183 , pp. 1433-1446
    • Sciomachen, A.1    Tanfani, E.2
  • 150
    • 84876415863 scopus 로고    scopus 로고
    • Modeling of practical requirements of the distributers packing problem
    • P. Kleinschmidt, Springer Heidelberg
    • U. Sommerweiß Modeling of practical requirements of the distributers packing problem P. Kleinschmidt, Operations Research Proceedings 1995 1996 Springer Heidelberg 427 432
    • (1996) Operations Research Proceedings 1995 , pp. 427-432
    • Sommerweiß, U.1
  • 151
    • 84875653446 scopus 로고    scopus 로고
    • Packing congruent hyperspheres into a hypersphere
    • 10.1007/s10898-011-9716-z
    • Y. Stoyan, and G. Yaskov Packing congruent hyperspheres into a hypersphere Journal of Global Optimization 2011 10.1007/s10898-011-9716-z
    • (2011) Journal of Global Optimization
    • Stoyan, Y.1    Yaskov, G.2
  • 153
    • 9744246875 scopus 로고    scopus 로고
    • Global optimization approach to unequal sphere packing problems in 3D
    • A. Sutou, and Y. Dai Global optimization approach to unequal sphere packing problems in 3D Journal of Optimization Theory and Applications 114 2002 671 694
    • (2002) Journal of Optimization Theory and Applications , vol.114 , pp. 671-694
    • Sutou, A.1    Dai, Y.2
  • 158
    • 0027633083 scopus 로고
    • Three dimensional palletization of mixed box sizes
    • R.D. Tsai, E.L. Malstrom, and W. Kuo Three dimensional palletization of mixed box sizes IIE Transactions 25 1993 64 75
    • (1993) IIE Transactions , vol.25 , pp. 64-75
    • Tsai, R.D.1    Malstrom, E.L.2    Kuo, W.3
  • 160
    • 0000707585 scopus 로고    scopus 로고
    • Packing of unequal spheres and automated radiosurgical treatment planning
    • J. Wang Packing of unequal spheres and automated radiosurgical treatment planning Journal of Combinatorial Optimization 3 1999 453 463
    • (1999) Journal of Combinatorial Optimization , vol.3 , pp. 453-463
    • Wang, J.1
  • 161
    • 36849029806 scopus 로고    scopus 로고
    • Layer-layout-based heuristics for loading homogeneous items into a single container
    • Z.-J. Wang, and K.-W. Li Layer-layout-based heuristics for loading homogeneous items into a single container Journal of Zhejiang University-Science A 8 2007 1944 1952
    • (2007) Journal of Zhejiang University-Science A , vol.8 , pp. 1944-1952
    • Wang, Z.-J.1    Li, K.-W.2
  • 162
    • 43149112777 scopus 로고    scopus 로고
    • A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach
    • Z. Wang, K.W. Li, and J.K. Levy A heuristic for the container loading problem: a tertiary-tree-based dynamic space decomposition approach European Journal of Operational Research 191 2008 86 99
    • (2008) European Journal of Operational Research , vol.191 , pp. 86-99
    • Wang, Z.1    Li, K.W.2    Levy, J.K.3
  • 163
    • 78049308519 scopus 로고    scopus 로고
    • Two natural heuristics for 3D packing with practical loading constraints
    • B.-T. Zhang, M.A. Orgun, Springer Berlin, Heidelberg
    • L. Wang, S. Guo, S. Chen, W. Zhu, and A. Lim Two natural heuristics for 3D packing with practical loading constraints B.-T. Zhang, M.A. Orgun, Lecture Notes on Artificial Intelligence, 6230/2010 2010 Springer Berlin, Heidelberg 256 267
    • (2010) Lecture Notes on Artificial Intelligence, 6230/2010 , pp. 256-267
    • Wang, L.1    Guo, S.2    Chen, S.3    Zhu, W.4    Lim, A.5
  • 165
    • 77956738817 scopus 로고    scopus 로고
    • A problem formulation for optimal mixed-sized box packing
    • L. Puigjaner, A. Espuna, Elsevier Barcelona
    • J. Westerlund, L.G. Papageorgiou, and T. Westerlund A problem formulation for optimal mixed-sized box packing L. Puigjaner, A. Espuna, Computer Aided Chemical Engineering 2005 Elsevier Barcelona 913 918
    • (2005) Computer Aided Chemical Engineering , pp. 913-918
    • Westerlund, J.1    Papageorgiou, L.G.2    Westerlund, T.3
  • 167
    • 84876418314 scopus 로고    scopus 로고
    • Applying genetic algorithm and neural networks to the container loading problem
    • J.M. Yeh, Y.C. Lin, and S.H. Yu Applying genetic algorithm and neural networks to the container loading problem Journal of Information & Optimization Sciences 24 2003 423 443
    • (2003) Journal of Information & Optimization Sciences , vol.24 , pp. 423-443
    • Yeh, J.M.1    Lin, Y.C.2    Yu, S.H.3
  • 168


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