메뉴 건너뛰기




Volumn 136, Issue , 2008, Pages 61-76

An efficient hyperheuristic for strip-packing problems

Author keywords

Hill climbing; Hyperheuristic; Low level heuristic; Strip packing problems

Indexed keywords


EID: 45949092127     PISSN: 1860949X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-540-79438-7_3     Document Type: Article
Times cited : (17)

References (21)
  • 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, 814-837 (2006)
    • (2006) European Journal of Operational Research , vol.172 , pp. 814-837
    • Bortfeldt, A.1
  • 6
    • 4544259186 scopus 로고    scopus 로고
    • A new placement heuristic for the orthogonal stock-cutting problem
    • Burke, E., Kendall, G., Whitwell, G.: A new placement heuristic for the orthogonal stock-cutting problem. Operations Research 52, 697-707 (2004)
    • (2004) Operations Research , vol.52 , pp. 697-707
    • Burke, E.1    Kendall, G.2    Whitwell, G.3
  • 7
    • 40649124732 scopus 로고    scopus 로고
    • Metaheuristic enhancements of the bestfit heuristic for the orthogonal stock cutting problem. Technical report, Univ. of Nottingham
    • No. NOTTCS-TR-2006-3
    • Burke, E., Kendall, G., Whitwell, G.: Metaheuristic enhancements of the bestfit heuristic for the orthogonal stock cutting problem. Technical report, Univ. of Nottingham, Computer Science Technical Report No. NOTTCS-TR-2006-3 (2006)
    • (2006) Computer Science Technical Report
    • Burke, E.1    Kendall, G.2    Whitwell, G.3
  • 8
    • 0020797485 scopus 로고
    • The bottom left binApacking heuristic: An efficient implementation
    • Chazelle, B.: The bottom left binApacking heuristic: an efficient implementation. IEEE Transactions on Computers 32, 697-707 (1983)
    • (1983) IEEE Transactions on Computers , vol.32 , pp. 697-707
    • Chazelle, B.1
  • 9
    • 84901458708 scopus 로고    scopus 로고
    • Cowling, P., Kendall, G., Han, L.: An investigation of a hyperheuristic genetic algorithm applied to a trainer scheduling problem. In: Congress on Evolutionary Computation, CEC 2002, pp. 1185-1190 (2002)
    • Cowling, P., Kendall, G., Han, L.: An investigation of a hyperheuristic genetic algorithm applied to a trainer scheduling problem. In: Congress on Evolutionary Computation, CEC 2002, pp. 1185-1190 (2002)
  • 10
    • 84944317424 scopus 로고    scopus 로고
    • Cowling, P., Kendall, G., Soubeiga, E.: Hyperheuristics: A robust optimisation method applied to nurse scheduling. In: Guervós, J.J.M., Adamidis, P.A., Beyer, H.-G., Fernández-Villacañas, J.-L., Schwefel, H.-P. (eds.) PPSN 2002. LNCS, 2439, pp. 7-11. Springer, Heidelberg (2002)
    • Cowling, P., Kendall, G., Soubeiga, E.: Hyperheuristics: A robust optimisation method applied to nurse scheduling. In: Guervós, J.J.M., Adamidis, P.A., Beyer, H.-G., Fernández-Villacañas, J.-L., Schwefel, H.-P. (eds.) PPSN 2002. LNCS, vol. 2439, pp. 7-11. Springer, Heidelberg (2002)
  • 12
    • 0035200786 scopus 로고    scopus 로고
    • An empirical investigation on metaheuristic and heuristic algorithms for a 2d packing problem
    • Hopper, E., Turton, B.C.H.: An empirical investigation on metaheuristic and heuristic algorithms for a 2d packing problem. European Journal of Operational Research 128, 34-57 (2001)
    • (2001) European Journal of Operational Research , vol.128 , pp. 34-57
    • Hopper, E.1    Turton, B.C.H.2
  • 14
    • 0000586245 scopus 로고
    • Performance bounds for level oriented two-dimensional packing algorithms
    • Coffmann Jr., E., Garey, D., Tarjan, R.: Performance bounds for level oriented two-dimensional packing algorithms. SIAM Journal on Computing 9(1), 808-826 (1980)
    • (1980) SIAM Journal on Computing , vol.9 , Issue.1 , pp. 808-826
    • Coffmann Jr., E.1    Garey, D.2    Tarjan, R.3
  • 17
    • 29344435523 scopus 로고    scopus 로고
    • Bubble search: A simple heuristic for improving priority-based greedy algorithms
    • Lesh, N., Mitzenmacher, M.: Bubble search: A simple heuristic for improving priority-based greedy algorithms. Information Processing Letters 97, 161-169 (2006)
    • (2006) Information Processing Letters , vol.97 , pp. 161-169
    • Lesh, N.1    Mitzenmacher, M.2
  • 21
    • 29144523010 scopus 로고    scopus 로고
    • A new heuristic recursive algorithm for the strip rectangular packing problem
    • Zhang, D., Kang, Y., Deng, A.: A new heuristic recursive algorithm for the strip rectangular packing problem. Computers and Operations Research 33, 2209-2217 (2006)
    • (2006) Computers and Operations Research , vol.33 , pp. 2209-2217
    • Zhang, D.1    Kang, Y.2    Deng, A.3


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