메뉴 건너뛰기




Volumn 38, Issue 1, 2011, Pages 227-233

An efficient placement heuristic for three-dimensional rectangular packing

Author keywords

Container loading; Cutting and packing; Heuristic; Rectangular packing; Three dimension

Indexed keywords

COMPUTER SCIENCE; OPERATIONS RESEARCH;

EID: 78049440669     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2010.04.015     Document Type: Conference Paper
Times cited : (54)

References (17)
  • 2
    • 56549122165 scopus 로고    scopus 로고
    • A caving degree approach for the single container loading problem
    • W.Q. Huang, and K. He A caving degree approach for the single container loading problem European Journal of Operational Research 196 1 2009 93 101
    • (2009) European Journal of Operational Research , vol.196 , Issue.1 , pp. 93-101
    • Huang, W.Q.1    He, K.2
  • 9
    • 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 20 4 2005 50 57
    • (2005) IEEE Intelligent Systems , vol.20 , Issue.4 , pp. 50-57
    • Moura, A.1    Oliveira, J.F.2
  • 10
    • 0009459809 scopus 로고    scopus 로고
    • Applying tabu search to container loading problems
    • A. Bortfeldt, and H. Gehring Applying tabu search to container loading problems P. Kall, H.J. Lthi, Operations research proceedings 1998 Springer Zurich 533 538
    • (1998) Operations Research Proceedings , pp. 533-538
    • Bortfeldt, A.1    Gehring, H.2
  • 11
    • 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 5 2003 641 662
    • (2003) Parallel Computing , vol.29 , Issue.5 , pp. 641-662
    • Bortfeldt, A.1    Gehring, H.2    MacK, D.3
  • 12
    • 0036722385 scopus 로고    scopus 로고
    • Solving container loading problems by block arrangement
    • M. Eley Solving container loading problems by block arrangement European Journal of Operational Research 141 2002 393 409
    • (2002) European Journal of Operational Research , vol.141 , pp. 393-409
    • Eley, M.1
  • 14
    • 74249123981 scopus 로고    scopus 로고
    • Neighborhood structures for the container loading problem: A VNS implementation
    • F. Parreo, R. Alvarez-Valdes, J.F. Oliveira, and J.M. Tamarit Neighborhood structures for the container loading problem: a VNS implementation Journal of Heuristics 16 1 2010 1 22
    • (2010) Journal of Heuristics , vol.16 , Issue.1 , pp. 1-22
    • Parreo, F.1    Alvarez-Valdes, R.2    Oliveira, J.F.3    Tamarit, J.M.4
  • 15
    • 52049093045 scopus 로고    scopus 로고
    • A new heuristic algorithm for cuboids packing with no orientation constraints
    • W.Q. Huang, and K. He A new heuristic algorithm for cuboids packing with no orientation constraints Computers and Operations Research 36 2 2009 425 432
    • (2009) Computers and Operations Research , vol.36 , Issue.2 , pp. 425-432
    • Huang, W.Q.1    He, K.2
  • 17
    • 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


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