메뉴 건너뛰기




Volumn 22, Issue 4-5, 2009, Pages 823-827

A revision of recent approaches for two-dimensional strip-packing problems

Author keywords

Constrained problems; Heuristic search; Metaheuristics; Optimization; Strip packing

Indexed keywords

HEURISTIC ALGORITHMS; OPTIMIZATION;

EID: 67349157662     PISSN: 09521976     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.engappai.2008.10.025     Document Type: Article
Times cited : (44)

References (19)
  • 3
    • 33645882933 scopus 로고    scopus 로고
    • A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
    • Bortfeldt A. A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces. European Journal of Operational Research 172 (2006) 814-837
    • (2006) European Journal of Operational Research , vol.172 , pp. 814-837
    • Bortfeldt, A.1
  • 4
    • 67349133724 scopus 로고    scopus 로고
    • Bortfeldt, A., Gehring, H., 2006. New large benchmarks for the two-dimensional strip-packing problem with rectangular pieces. In: IEEE Proceedings of the Thirty Ninth Hawaii International Conference on Systems Sciences, p. 30.2.
    • Bortfeldt, A., Gehring, H., 2006. New large benchmarks for the two-dimensional strip-packing problem with rectangular pieces. In: IEEE Proceedings of the Thirty Ninth Hawaii International Conference on Systems Sciences, p. 30.2.
  • 5
    • 4544259186 scopus 로고    scopus 로고
    • A new placement heuristic for the orthogonal stock-cutting problem
    • Burke E., Kendall G., and Whitwell G. A new placement heuristic for the orthogonal stock-cutting problem. Operations Research 52 (2004) 697-707
    • (2004) Operations Research , vol.52 , pp. 697-707
    • Burke, E.1    Kendall, G.2    Whitwell, G.3
  • 6
    • 40649124732 scopus 로고    scopus 로고
    • Metaheuristic enhancements of the best-fit heuristic for the orthe orthogonal stock-cutting problem
    • Technical Report, University of Nottingham, NOTTCS-TR-2006-3
    • Burke, E., Kendall, G., Whitwell, G., 2006. Metaheuristic enhancements of the best-fit heuristic for the orthe orthogonal stock-cutting problem. Technical Report, University of Nottingham, NOTTCS-TR-2006-3.
    • (2006)
    • Burke, E.1    Kendall, G.2    Whitwell, G.3
  • 7
    • 0020797485 scopus 로고
    • The bottom left bin packing heuristic: an efficient implementation
    • Chazelle B. The bottom left bin packing heuristic: an efficient implementation. IEEE Transactions on Computers 32 (1983) 697-707
    • (1983) IEEE Transactions on Computers , vol.32 , pp. 697-707
    • Chazelle, B.1
  • 8
    • 0000586245 scopus 로고
    • Performance bounds for level oriented two-dimensional packing algorithms
    • Coffmann Jr. E., Garey D., and Tarjan R. Performance bounds for level oriented two-dimensional packing algorithms. SIAM Journal on Computing 9 1 (1980) 808-826
    • (1980) SIAM Journal on Computing , vol.9 , Issue.1 , pp. 808-826
    • Coffmann Jr., E.1    Garey, D.2    Tarjan, R.3
  • 10
    • 0035200786 scopus 로고    scopus 로고
    • An empirical investigation on metaheuristic and heuristic algorithms for a 2d packing problem
    • Hopper E., and Turton B.C.H. An empirical investigation on metaheuristic and heuristic algorithms for a 2d packing problem. European Journal of Operational Research 128 (2001) 34-57
    • (2001) European Journal of Operational Research , vol.128 , pp. 34-57
    • Hopper, E.1    Turton, B.C.H.2
  • 12
    • 29344435523 scopus 로고    scopus 로고
    • Bubble search: a simple heuristic for improving priority-based greedy algorithms
    • Lesh N., and Mitzenmacher M. Bubble search: a simple heuristic for improving priority-based greedy algorithms. Information Processing Letters 97 (2006) 161-169
    • (2006) Information Processing Letters , vol.97 , pp. 161-169
    • Lesh, N.1    Mitzenmacher, M.2
  • 18
    • 33747066453 scopus 로고    scopus 로고
    • Hybrid genetic algorithm and simulated annealing for two-dimensional non-guillotine rectangular packing problems
    • Soke A., and Bingul Z. Hybrid genetic algorithm and simulated annealing for two-dimensional non-guillotine rectangular packing problems. Engineering Applications of Artificial Intelligence 19 (2006) 557-567
    • (2006) Engineering Applications of Artificial Intelligence , vol.19 , pp. 557-567
    • Soke, A.1    Bingul, Z.2
  • 19
    • 29144523010 scopus 로고    scopus 로고
    • A new heuristic recursive algorithm for the strip rectangular packing problem
    • Zhang D., Kang Y., and Deng A. A new heuristic recursive algorithm for the strip rectangular packing problem. Computers and Operations Research 33 (2006) 2209-2217
    • (2006) Computers and Operations Research , vol.33 , pp. 2209-2217
    • Zhang, D.1    Kang, Y.2    Deng, A.3


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