{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:07:26Z","timestamp":1725516446401},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540794370"},{"type":"electronic","value":"9783540794387"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-79438-7_3","type":"book-chapter","created":{"date-parts":[[2008,8,11]],"date-time":"2008-08-11T13:20:59Z","timestamp":1218460859000},"page":"61-76","source":"Crossref","is-referenced-by-count":18,"title":["An Efficient Hyperheuristic for Strip-Packing Problems"],"prefix":"10.1007","author":[{"given":"Ignacio","family":"Araya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bertrand","family":"Neveu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mar\u00eda-Cristina","family":"Riff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Alvarez-Valdes, R., Parre $\\tilde{n}$ o, F., Tamarit, J.M.: Reactive grasp for the strip packing problem. In: Proceedings Metaheuristic Conference MIC (2005)"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1137\/0209064","volume":"9","author":"B.S. Baker","year":"1980","unstructured":"Baker, B.S., Coffman, E.G., Rivest, R.L.: Orthogonal packings in two dimensions. SIAM Journal on Computing\u00a09, 846\u2013855 (1980)","journal-title":"SIAM Journal on Computing"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1016\/j.ejor.2004.11.016","volume":"172","author":"A. Bortfeldt","year":"2006","unstructured":"Bortfeldt, A.: A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces. European Journal of Operational Research\u00a0172, 814\u2013837 (2006)","journal-title":"European Journal of Operational Research"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Bortfeldt, A., Gehring, H.: New large benchmarks for the two-dimensional strip packing problem with rectangular pieces. In: IEEE Proceedings of the 39 th Hawaii International Conference on Systems Sciences (2006)","DOI":"10.1109\/HICSS.2006.360"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/0-306-48056-5_16","volume":"16","author":"E. Burke","year":"2003","unstructured":"Burke, E., Kendall, G., Newall, J., Hart, E., Ross, P., Schulenburg, S.: Hyper-heuristics: an emerging direction in modern search technology. Handbook of Metaheuristics\u00a016, 457\u2013474 (2003)","journal-title":"Handbook of Metaheuristics"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1287\/opre.1040.0109","volume":"52","author":"E. Burke","year":"2004","unstructured":"Burke, E., Kendall, G., Whitwell, G.: A new placement heuristic for the orthogonal stock-cutting problem. Operations Research\u00a052, 697\u2013707 (2004)","journal-title":"Operations Research"},{"key":"3_CR7","unstructured":"Burke, E., Kendall, G., Whitwell, G.: Metaheuristic enhancements of the best-fit heuristic for the orthogonal stock cutting problem. Technical report, Univ. of Nottingham, Computer Science Technical Report No. NOTTCS-TR-2006-3 (2006)"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1109\/TC.1983.1676307","volume":"32","author":"B. Chazelle","year":"1983","unstructured":"Chazelle, B.: The bottom left bin packing heuristic: an efficient implementation. IEEE Transactions on Computers\u00a032, 697\u2013707 (1983)","journal-title":"IEEE Transactions on Computers"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"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\u20131190 (2002)","DOI":"10.1109\/CEC.2002.1004411"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/3-540-45712-7_82","volume-title":"Parallel Problem Solving from Nature - PPSN VII","author":"P. Cowling","year":"2002","unstructured":"Cowling, P., Kendall, G., Soubeiga, E.: Hyperheuristics: A robust optimisation method applied to nurse scheduling. In: Guerv\u00f3s, J.J.M., Adamidis, P.A., Beyer, H.-G., Fern\u00e1ndez-Villaca\u00f1as, J.-L., Schwefel, H.-P. (eds.) PPSN 2002. LNCS, vol.\u00a02439, pp. 7\u201311. Springer, Heidelberg (2002)"},{"key":"3_CR11","unstructured":"Hopper, E.: Two-Dimensional Packing Utilising Evolutionary Algorithms and other Meta-Heuristic Methods. PhD. Thesis Cardiff University (2000)"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/S0377-2217(99)00357-4","volume":"128","author":"E. Hopper","year":"2001","unstructured":"Hopper, E., Turton, B.C.H.: An empirical investigation on metaheuristic and heuristic algorithms for a 2d packing problem. European Journal of Operational Research\u00a0128, 34\u201357 (2001)","journal-title":"European Journal of Operational Research"},{"key":"3_CR13","first-page":"159","volume-title":"Metaheuristic algorithms for the strip packing problem","author":"M. Iori","year":"2003","unstructured":"Iori, M., Martello, S., Monaci, M.: Metaheuristic algorithms for the strip packing problem, pp. 159\u2013179. Kluwer Academic Publishers, Dordrecht (2003)"},{"issue":"1","key":"3_CR14","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1137\/0209062","volume":"9","author":"E. Coffmann Jr.","year":"1980","unstructured":"Coffmann Jr., E., Garey, D., Tarjan, R.: Performance bounds for level oriented two-dimensional packing algorithms. SIAM Journal on Computing\u00a09(1), 808\u2013826 (1980)","journal-title":"SIAM Journal on Computing"},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/j.ipl.2004.01.006","volume":"90","author":"N. Lesh","year":"2004","unstructured":"Lesh, N., Marks, J., Mahon, A.Mc., Mitzenmacher, M.: Exhaustive approaches to 2d rectangular perfect packings. Information Processing Letters\u00a090, 7\u201314 (2004)","journal-title":"Information Processing Letters"},{"key":"3_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1064546.1083322","volume":"10","author":"N. Lesh","year":"2005","unstructured":"Lesh, N., Marks, J., Mahon, A.M., Mitzenmacher, M.: New heuristic and interactive approaches to 2d rectangular strip packing. ACM Journal of Experimental Algorithmics\u00a010, 1\u201318 (2005)","journal-title":"ACM Journal of Experimental Algorithmics"},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/j.ipl.2005.08.013","volume":"97","author":"N. Lesh","year":"2006","unstructured":"Lesh, N., Mitzenmacher, M.: Bubble search: A simple heuristic for improving priority-based greedy algorithms. Information Processing Letters\u00a097, 161\u2013169 (2006)","journal-title":"Information Processing Letters"},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1287\/ijoc.15.3.310.16082","volume":"15","author":"S. Martello","year":"2003","unstructured":"Martello, S., Monaci, M., Vigo, D.: An exact approach to the strip-packing problem. INFORMS Journal of Computing\u00a015, 310\u2013319 (2003)","journal-title":"INFORMS Journal of Computing"},{"key":"3_CR19","first-page":"501","volume-title":"Heuristics for large strip packing problems with guillotine patterns:An empirical study","author":"C. Mumford-Valenzuela","year":"2003","unstructured":"Mumford-Valenzuela, C., Vick, J., Wang, P.Y.: Heuristics for large strip packing problems with guillotine patterns:An empirical study, pp. 501\u2013522. Kluwer Academic Publishers, Dordrecht (2003)"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Neveu, B., Trombettoni, G., Araya, I.: Incremental move for strip-packing. In: Proceedings of ICTAI 2007, Patras, Greece (2007)","DOI":"10.1109\/ICTAI.2007.122"},{"key":"3_CR21","doi-asserted-by":"publisher","first-page":"2209","DOI":"10.1016\/j.cor.2005.01.009","volume":"33","author":"D. Zhang","year":"2006","unstructured":"Zhang, D., Kang, Y., Deng, A.: A new heuristic recursive algorithm for the strip rectangular packing problem. Computers and Operations Research\u00a033, 2209\u20132217 (2006)","journal-title":"Computers and Operations Research"}],"container-title":["Studies in Computational Intelligence","Adaptive and Multilevel Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79438-7_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,14]],"date-time":"2021-09-14T16:21:33Z","timestamp":1631636493000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79438-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540794370","9783540794387"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79438-7_3","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[]}}