{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,5]],"date-time":"2026-07-05T04:31:25Z","timestamp":1783225885597,"version":"3.54.6"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,2,28]],"date-time":"2013-02-28T00:00:00Z","timestamp":1362009600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1007\/s10479-013-1341-4","type":"journal-article","created":{"date-parts":[[2013,2,27]],"date-time":"2013-02-27T07:29:45Z","timestamp":1361950185000},"page":"241-264","source":"Crossref","is-referenced-by-count":54,"title":["An effective heuristic for the two-dimensional irregular bin packing problem"],"prefix":"10.1007","volume":"206","author":[{"given":"Eunice","family":"L\u00f3pez-Camacho","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gabriela","family":"Ochoa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hugo","family":"Terashima-Mar\u00edn","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Edmund K.","family":"Burke","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,2,28]]},"reference":[{"issue":"3","key":"1341_CR1","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/j.ejor.2010.09.023","volume":"209","author":"S. D. Allen","year":"2011","unstructured":"Allen, S. D., Burke, E. K., & Kendall, G. (2011). A hybrid placement strategy for the three-dimensional strip packing problem. European Journal of Operational Research, 209(3), 219\u2013227. doi: 10.1016\/j.ejor.2010.09.023 .","journal-title":"European Journal of Operational Research"},{"issue":"8","key":"1341_CR2","doi-asserted-by":"crossref","first-page":"1160","DOI":"10.1287\/mnsc.47.8.1160.10230","volume":"47","author":"J. A. Bennell","year":"2001","unstructured":"Bennell, J. A., & Dowsland, K. A. (2001). Hybridising tabu search with optimisation techniques for irregular stock cutting. Management Science, 47(8), 1160\u20131172.","journal-title":"Management Science"},{"issue":"2","key":"1341_CR3","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1016\/j.ejor.2006.11.038","volume":"184","author":"J. A. Bennell","year":"2008","unstructured":"Bennell, J. A., & Oliveira, J. F. (2008). The geometry of nesting problems: a tutorial. European Journal of Operational Research, 184(2), 397\u2013415.","journal-title":"European Journal of Operational Research"},{"issue":"S1","key":"1341_CR4","doi-asserted-by":"crossref","first-page":"S93","DOI":"10.1057\/jors.2008.169","volume":"60","author":"J. A. Bennell","year":"2009","unstructured":"Bennell, J. A., & Oliveira, J. F. (2009). A tutorial in irregular shape packing problems. Journal of the Operational Research Society, 60(S1), S93\u2013S105.","journal-title":"Journal of the Operational Research Society"},{"issue":"2","key":"1341_CR5","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/s10732-008-9095-x","volume":"16","author":"J. A. Bennell","year":"2010","unstructured":"Bennell, J. A., & Song, X. (2010). A beam search implementation for the irregular shape packing problem. Journal of Heuristics, 16(2), 167\u2013188.","journal-title":"Journal of Heuristics"},{"key":"1341_CR6","first-page":"123","volume-title":"Proceedings of the 6th international conference on practice and theory of automated timetabling","author":"B. Bilgin","year":"2006","unstructured":"Bilgin, B., \u00d6zcan, E., & Korkmaz, E. E. (2006). An experimental study on hyper-heuristics and exam timetabling. In Proceedings of the 6th international conference on practice and theory of automated timetabling (pp. 123\u2013140)."},{"key":"1341_CR7","first-page":"3425","volume-title":"IEEE international conference on systems, man and cybernetics","author":"C. Bounsaythip","year":"1997","unstructured":"Bounsaythip, C., & Maouche, S. (1997). Irregular shape nesting and placing with evolutionary approach. In IEEE international conference on systems, man and cybernetics (Vol.\u00a04, pp. 3425\u20133430)."},{"key":"1341_CR8","first-page":"453","volume-title":"Australian joint conference on artificial intelligence","author":"E. K. Burke","year":"1999","unstructured":"Burke, E. K., & Kendall, G. (1999a). Applying ant algorithms and the no fit polygon to the nesting problem. In Australian joint conference on artificial intelligence (pp. 453\u2013464). London: Springer."},{"key":"1341_CR9","unstructured":"Burke, E. K., & Kendall, G. (1999b). Implementation and performance improvement of the evaluation of a two dimensional bin packing problem using the no fit polygon (Tech. Rep.). University of Nottingham. Report ASAP99001."},{"issue":"3","key":"1341_CR10","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1287\/opre.1060.0293","volume":"54","author":"E. K. Burke","year":"2006","unstructured":"Burke, E. K., Hellier, R. S. R., Kendall, G., & Whitwell, G. (2006). A new bottom-left-fill heuristic algorithm for the two-dimensional irregular packing problem. Operations Research, 54(3), 587\u2013601.","journal-title":"Operations Research"},{"issue":"1","key":"1341_CR11","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.ejor.2006.03.011","volume":"179","author":"E. K. Burke","year":"2007","unstructured":"Burke, E. K., Hellier, R. S. R., Kendall, G., & Whitwell, G. (2007). Complete and robust no-fit polygon generation for the irregular stock cutting problem. European Journal of Operational Research, 179(1), 27\u201349.","journal-title":"European Journal of Operational Research"},{"key":"1341_CR12","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1016\/0377-2217(95)00019-M","volume":"84","author":"K. A. Dowsland","year":"1995","unstructured":"Dowsland, K. A., & Dowsland, W. B. (1995). Solution approaches to irregular nesting problems. European Journal of Operational Research, 84, 506\u2013521.","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"1341_CR13","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1057\/palgrave.jors.2600563","volume":"49","author":"K. A. Dowsland","year":"1998","unstructured":"Dowsland, K. A., Dowsland, W. B., & Bennell, J. A. (1998). Jostling for position: local improvement for irregular cutting patterns. Journal of the Operational Research Society, 49(6), 647\u2013658.","journal-title":"Journal of the Operational Research Society"},{"issue":"2","key":"1341_CR14","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/S0377-2217(02)00131-5","volume":"141","author":"K. A. Dowsland","year":"2002","unstructured":"Dowsland, K. A., Vaid, S., & Dowsland, W. B. (2002). An algorithm for polygon placement using a bottom-left strategy. European Journal of Operational Research, 141(2), 371\u2013381.","journal-title":"European Journal of Operational Research"},{"key":"1341_CR15","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0377-2217(90)90350-K","volume":"44","author":"H. Dychoff","year":"1990","unstructured":"Dychoff, H. (1990). A typology of cutting and packing problems. European Journal of Operational Research, 44, 145\u2013159.","journal-title":"European Journal of Operational Research"},{"key":"1341_CR16","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/S0377-2217(02)00130-3","volume":"141","author":"A. M. Gomes","year":"2002","unstructured":"Gomes, A. M., & Oliveira, J. F. (2002). A 2-exchange heuristic for nesting problems. European Journal of Operational Research, 141, 359\u2013370.","journal-title":"European Journal of Operational Research"},{"key":"1341_CR17","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1111\/1475-3995.00404","volume":"10","author":"M. Hifi","year":"2003","unstructured":"Hifi, M., & M\u2019Hallah, R. (2003). A hybrid algorithm for the two-dimensional layout problem: the cases of regular and irregular shapes. International Transactions in Operational Research, 10, 195\u2013216.","journal-title":"International Transactions in Operational Research"},{"issue":"4","key":"1341_CR18","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1023\/A:1012590107280","volume":"16","author":"E. Hopper","year":"2001","unstructured":"Hopper, E., & Turton, B. C. H. (2001). A review of the application of meta-heuristic algorithms to 2D strip packing problems. Artificial Intelligence Review, 16(4), 257\u2013300. doi: 10.1023\/A:1012590107280 .","journal-title":"Artificial Intelligence Review"},{"issue":"1","key":"1341_CR19","first-page":"93","volume":"2","author":"E. Hopper","year":"2002","unstructured":"Hopper, E., & Turton, B. C. H. (2002). An empirical study of meta-heuristics applied to 2D rectangular bin packing\u2014part\u00a0II. Studia Informatica Universalis, 2(1), 93\u2013106.","journal-title":"Studia Informatica Universalis"},{"key":"1341_CR20","first-page":"963","volume-title":"Symposium on applied computing","author":"L. Hu-yao","year":"2006","unstructured":"Hu-yao, L., & Yuan-jun, H. (2006). NFP-based nesting algorithm for irregular shapes. In Symposium on applied computing (pp. 963\u2013967). New York: ACM."},{"key":"1341_CR21","first-page":"313","volume-title":"International design conference","author":"L. Kos","year":"2000","unstructured":"Kos, L., & Duhovnik, J. (2000). Rod cutting optimization with store utilization. In International design conference, Dubrovnik, Croatia (pp. 313\u2013318)."},{"issue":"3","key":"1341_CR22","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/S0010-4485(96)00065-6","volume":"29","author":"H. Lamousin","year":"1997","unstructured":"Lamousin, H., & Waggenspack, J. (1997). Nesting of two-dimensional irregular parts using a shape reasoning heuristic. Computer-Aided Design, 29(3), 221\u2013238. doi: 10.1016\/S0010-4485(96)00065-6 .","journal-title":"Computer-Aided Design"},{"issue":"4","key":"1341_CR23","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1115\/1.2831075","volume":"118","author":"H. J. Lamousin Jr.","year":"1996","unstructured":"Lamousin Jr., H. J., & Dobson, G. T. (1996). Nesting of complex 2-D parts within irregular boundaries. Journal of Manufacturing Science and Engineering, 118(4), 615\u2013622. doi: 10.1115\/1.2831075 .","journal-title":"Journal of Manufacturing Science and Engineering"},{"key":"1341_CR24","first-page":"1521","volume-title":"Lecture notes in computer science. Conference on genetic and evolutionary computation","author":"J. G. Mar\u00edn-Bl\u00e1zquez","year":"2006","unstructured":"Mar\u00edn-Bl\u00e1zquez, J. G., & Schulenburg, S. (2006). Multi-step environment learning classifier systems applied to hyper-heuristics. In Lecture notes in computer science. Conference on genetic and evolutionary computation (pp. 1521\u20131528). New York: ACM."},{"issue":"2","key":"1341_CR25","doi-asserted-by":"crossref","first-page":"145","DOI":"10.15807\/jorsj.45.145","volume":"45","author":"H. Okano","year":"2002","unstructured":"Okano, H. (2002). A scanline-based algorithm for the 2D free-form bin packing problem. Journal of the Operations Research Society of Japan, 45(2), 145\u2013161.","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"1341_CR26","doi-asserted-by":"crossref","first-page":"31","DOI":"10.18489\/sacj.v48i1.87","volume":"48","author":"N. Pillay","year":"2012","unstructured":"Pillay, N. (2012). A study of evolutionary algorithm selection hyper-heuristics for the one-dimensional bin-packing problem. South African Computer Journal, 48, 31\u201340.","journal-title":"South African Computer Journal"},{"issue":"12","key":"1341_CR27","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1016\/S0010-4485(00)00112-3","volume":"33","author":"R. Ramesh","year":"2001","unstructured":"Ramesh, R. (2001). A generic approach for nesting of 2-D parts in 2-D sheets using genetic and heuristic algorithms. Computer-Aided Design, 33(12), 879\u2013891. doi: 10.1016\/S0010-4485(00)00112-3 .","journal-title":"Computer-Aided Design"},{"key":"1341_CR28","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1007\/0-387-28356-0_17","volume-title":"Search methodologies: introductory tutorials in optimization and decision support techniques","author":"P. Ross","year":"2005","unstructured":"Ross, P. (2005). Hyper-heuristics. In E. K. Burke & G. Kendall (Eds.), Search methodologies: introductory tutorials in optimization and decision support techniques (pp. 529\u2013556). New York: Springer."},{"key":"1341_CR29","first-page":"1493","volume":"2","author":"P. Ross","year":"2005","unstructured":"Ross, P., & Mar\u00edn-Bl\u00e1zquez, J. G. (2005). Constructive hyper-heuristics in class timetabling. IEEE Congress on Evolutionary Computation, 2, 1493\u20131500.","journal-title":"IEEE Congress on Evolutionary Computation"},{"key":"1341_CR30","first-page":"942","volume-title":"Lecture notes in computer science. Conference on genetic and evolutionary computation","author":"P. Ross","year":"2002","unstructured":"Ross, P., Schulenburg, S., Mar\u00edn-Bl\u00e1zquez, J. G., & Hart, E. (2002). Hyper-heuristics: learning to combine simple heuristics in bin-packing problems. In Lecture notes in computer science. Conference on genetic and evolutionary computation (pp. 942\u2013948). San Francisco: Morgan Kaufmann"},{"key":"1341_CR31","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"1295","DOI":"10.1007\/3-540-45110-2_5","volume-title":"Conference on genetic and evolutionary computation","author":"P. Ross","year":"2003","unstructured":"Ross, P., Mar\u00edn-Bl\u00e1zquez, J. G., Schulenburg, S., & Hart, E. (2003). Learning a procedure that can solve hard bin-packing problems: a new GA-based approach to hyper-heuristics. In Lecture notes in computer science: Vol.\u00a02724. Conference on genetic and evolutionary computation (pp. 1295\u20131306). Berlin: Springer."},{"key":"1341_CR32","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1007\/978-3-642-32964-7_35","volume-title":"Parallel problem solving from nature\u2014PPSN XII","author":"K. Sim","year":"2012","unstructured":"Sim, K., Hart, E., & Paechter, B. (2012). A hyper-heuristic classifier for one dimensional bin packing problems: improving classification accuracy by attribute evolution. In C. A. C. Coello, V. Cutello, K. Deb, S.\u00a0Forrest, G. Nicosia, & M. Pavone (Eds.), Lecture notes in computer science: Vol.\u00a07492. Parallel problem solving from nature\u2014PPSN XII (pp. 348\u2013357). Berlin: Springer."},{"key":"1341_CR33","first-page":"637","volume-title":"Lecture notes in computer science. Conference on genetic and evolutionary computation","author":"H. Terashima-Mar\u00edn","year":"2005","unstructured":"Terashima-Mar\u00edn, H., Flores-\u00c1lvarez, E. J., & Ross, P. (2005a). Hyper-heuristics and classifier systems for solving 2D-regular cutting stock problems. In Lecture notes in computer science. Conference on genetic and evolutionary computation (pp. 637\u2013643). New York: ACM."},{"key":"1341_CR34","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/11579427_19","volume-title":"MICAI 2005: advances in artificial intelligence","author":"H. Terashima-Mar\u00edn","year":"2005","unstructured":"Terashima-Mar\u00edn, H., Tavernier-Deloya, J. M., & Valenzuela-Rend\u00f3n, M. (2005b). Scheduling transportation events with grouping genetic algorithms and the heuristic DJD. In A. Gelbukh, L. De Albornoz, & H. Terashima-Mar\u00edn (Eds.), Lecture notes in computer science: Vol.\u00a03789. MICAI 2005: advances in artificial intelligence (pp. 185\u2013194). Berlin: Springer."},{"key":"1341_CR35","first-page":"591","volume-title":"Lecture notes in computer science. Conference on genetic and evolutionary computation","author":"H. Terashima-Mar\u00edn","year":"2006","unstructured":"Terashima-Mar\u00edn, H., Far\u00edas-Z\u00e1rate, C. J., Ross, P., & Valenzuela-Rend\u00f3n, M. (2006). A GA-based method to produce generalized hyper-heuristics for the 2D-regular cutting stock problem. In Lecture notes in computer science. Conference on genetic and evolutionary computation (pp. 591\u2013598). New York: ACM."},{"key":"1341_CR36","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/s10479-008-0475-2","volume":"179","author":"H. Terashima-Mar\u00edn","year":"2010","unstructured":"Terashima-Mar\u00edn, H., Ross, P., Far\u00edas-Z\u00e1rate, C. J., L\u00f3pez-Camacho, E., & Valenzuela-Rend\u00f3n, M. (2010). Generalized hyper-heuristics for solving 2D regular and irregular packing problems. Annals of Operations Research, 179, 369\u2013392. doi: 10.1007\/s10479-008-0475-2 .","journal-title":"Annals of Operations Research"},{"key":"1341_CR37","first-page":"429","volume-title":"Genetic and evolutionary computation conference. Late breaking papers","author":"A. Uday","year":"2001","unstructured":"Uday, A., Goodman, E. D., & Debnath, A. A. (2001). Nesting of irregular shapes using feature matching and parallel genetic algorithms. In E. D. Goodman (Ed.), Genetic and evolutionary computation conference. Late breaking papers (pp. 429\u2013434)."},{"issue":"3","key":"1341_CR38","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1016\/j.ejor.2005.12.047","volume":"183","author":"G. W\u00e4scher","year":"2007","unstructured":"W\u00e4scher, G., Hausner, H., & Schumann, H. (2007). An improved typology of cutting and packing problems. European Journal of Operational Research, 183(3), 1109\u20131130. Forthcoming special issue on cutting, packing and related problems.","journal-title":"European Journal of Operational Research"},{"key":"1341_CR39","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1117\/12.132078","volume-title":"Machine vision applications, architectures, and systems integration, proc. SPIE","author":"P. F. Whelan","year":"1992","unstructured":"Whelan, P. F., & Batchelor, B. G. (1992). Development of a vision system for the flexible packing of random shapes. In Machine vision applications, architectures, and systems integration, proc. SPIE (pp. 223\u2013232)."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-013-1341-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-013-1341-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-013-1341-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,10]],"date-time":"2019-07-10T00:48:18Z","timestamp":1562719698000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-013-1341-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,28]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["1341"],"URL":"https:\/\/doi.org\/10.1007\/s10479-013-1341-4","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2,28]]}}}