{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T04:47:57Z","timestamp":1769057277252,"version":"3.49.0"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,11,15]],"date-time":"2008-11-15T00:00:00Z","timestamp":1226707200000},"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":[[2010,9]]},"DOI":"10.1007\/s10479-008-0475-2","type":"journal-article","created":{"date-parts":[[2008,11,14]],"date-time":"2008-11-14T14:56:11Z","timestamp":1226674571000},"page":"369-392","source":"Crossref","is-referenced-by-count":69,"title":["Generalized hyper-heuristics for solving 2D Regular and\u00a0Irregular Packing Problems"],"prefix":"10.1007","volume":"179","author":[{"given":"H.","family":"Terashima-Mar\u00edn","sequence":"first","affiliation":[]},{"given":"P.","family":"Ross","sequence":"additional","affiliation":[]},{"given":"C. J.","family":"Far\u00edas-Z\u00e1rate","sequence":"additional","affiliation":[]},{"given":"E.","family":"L\u00f3pez-Camacho","sequence":"additional","affiliation":[]},{"given":"M.","family":"Valenzuela-Rend\u00f3n","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,11,15]]},"reference":[{"key":"475_CR1","doi-asserted-by":"crossref","unstructured":"Bai,\u00a0R., Burke,\u00a0E.\u00a0K., & Kendall,\u00a0G. (2008). Heuristic, meta-heuristic and hyper-heuristic approaches for fresh produce inventory control and shelf space allocation. Journal of the Operational Research Society (to appear).","DOI":"10.1057\/palgrave.jors.2602463"},{"key":"475_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0055923","volume-title":"Genetic programming: an introduction","author":"W. Banzhaf","year":"1998","unstructured":"Banzhaf,\u00a0W., Nordin,\u00a0P., Keller,\u00a0R.\u00a0E., & Francone,\u00a0F.\u00a0D. (1998). Genetic programming: an introduction. London: Morgan Kaufmann."},{"key":"475_CR3","unstructured":"Beasley,\u00a0J.\u00a0E. (2003). Operations research library. Collection of problems for 2D packing and cutting. http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/info.html ."},{"issue":"5","key":"475_CR4","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1057\/jors.1987.70","volume":"38","author":"J.\u00a0O. Berkey","year":"1987","unstructured":"Berkey,\u00a0J.\u00a0O., & Wang,\u00a0P.\u00a0Y. (1987). Two-dimensional finite bin packing algorithms. Journal of Operational Research Society, 38(5), 423\u2013429.","journal-title":"Journal of Operational Research Society"},{"key":"475_CR5","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/0-306-48056-5_16","volume-title":"Handbook of metaheuristics","author":"E. Burke","year":"2003","unstructured":"Burke,\u00a0E., Hart,\u00a0E., Kendall,\u00a0G., Newall,\u00a0J., Ross,\u00a0P., & Schulenburg,\u00a0S. (2003a). Hyper-heuristics: an emerging direction in modern research technology. In Handbook of metaheuristics (pp.\u00a0457\u2013474). Dordrecht: Kluwer Academic."},{"issue":"6","key":"475_CR6","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1023\/B:HEUR.0000012446.94732.b6","volume":"9","author":"E.\u00a0K. Burke","year":"2003","unstructured":"Burke,\u00a0E.\u00a0K., Kendall,\u00a0G., & Soubeiga,\u00a0E. (2003b). A tabu-search hyperheuistic for timetabling and rostering. Journal of Heuristics, 9(6), 451\u2013470.","journal-title":"Journal of Heuristics"},{"key":"475_CR7","doi-asserted-by":"crossref","unstructured":"Burke,\u00a0E.\u00a0K., Hyde,\u00a0M.\u00a0R., & Kendall,\u00a0G. (2006). Evolving bin packing heuristics with genetic programming. In 9th PPSN (pp.\u00a0860\u2013869). Reykjavik. LNCS.","DOI":"10.1007\/11844297_87"},{"issue":"1","key":"475_CR8","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.ejor.2005.08.012","volume":"176","author":"E.\u00a0K. Burke","year":"2007","unstructured":"Burke,\u00a0E.\u00a0K., McCollum,\u00a0B., Meisels,\u00a0A., Petrovic,\u00a0S., & Qu,\u00a0R. (2007). A graph-based hyperheuristic for timetabling problems. European Journal of the Operational Research, 176(1), 177\u2013192.","journal-title":"European Journal of the Operational Research"},{"key":"475_CR9","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0925-5273(94)00045-X","volume":"36","author":"C.\u00a0H. Cheng","year":"1994","unstructured":"Cheng,\u00a0C.\u00a0H., Fiering,\u00a0B.\u00a0R., & Chang,\u00a0T.\u00a0C. (1994). The cutting stock problem. A survey. International Journal of Production Economics, 36, 291\u2013305.","journal-title":"International Journal of Production Economics"},{"issue":"6","key":"475_CR10","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1057\/palgrave.jors.2600563","volume":"49","author":"K.\u00a0A. Dowsland","year":"1998","unstructured":"Dowsland,\u00a0K.\u00a0A., Dowsland,\u00a0W.\u00a0B., & Bennell,\u00a0J.\u00a0A. (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":"475_CR11","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/S0377-2217(02)00131-5","volume":"141","author":"K.\u00a0A. Dowsland","year":"2002","unstructured":"Dowsland,\u00a0K.\u00a0A., Vaid,\u00a0S., & Dowsland,\u00a0W.\u00a0B. (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"},{"issue":"2","key":"475_CR12","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1016\/j.ejor.2004.04.030","volume":"168","author":"K. Dowsland","year":"2006","unstructured":"Dowsland,\u00a0K., Herbert,\u00a0E., Kendall,\u00a0G., & Burke,\u00a0E. (2006). Using the search bounds to enhance a genetic algorithms approach to two rectangle packing problems. European Journal of Operational Research, 168(2), 390\u2013402.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"475_CR13","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1016\/j.ejor.2005.03.058","volume":"179","author":"K. Dowsland","year":"2007","unstructured":"Dowsland,\u00a0K., Soubeiga,\u00a0E., & Burke,\u00a0E.\u00a0K. (2007). A simulated annealing hyper-heuristic for determining shipper sizes. European Journal of the Operational Research, 179(3), 759\u2013774.","journal-title":"European Journal of the Operational Research"},{"key":"475_CR14","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0377-2217(90)90350-K","volume":"44","author":"H. Dyckhoff","year":"1990","unstructured":"Dyckhoff,\u00a0H. (1990). A topology of cutting and packing problems. European Journal of Operational Research, 44, 145\u2013159.","journal-title":"European Journal of Operational Research"},{"key":"475_CR15","volume-title":"Artificial intelligence through simulated evolution","author":"D.\u00a0B. Fogel","year":"1966","unstructured":"Fogel,\u00a0D.\u00a0B., Owens,\u00a0L.\u00a0A., & Walsh,\u00a0M. (1966). Artificial intelligence through simulated evolution. New York: Wiley."},{"key":"475_CR16","unstructured":"Fujita,\u00a0K., Akagji,\u00a0S., & Kirokawa,\u00a0N. (1993). Hybrid approach for optimal nesting using a genetic algorithm and a local minimisation algorithm. In Proceedings of the 19th annual ASME design automation conference, Part 1 (of\u00a02) (Vol.\u00a065, part\u00a01, pp.\u00a0477\u2013484). Albuquerque, NM, USA."},{"key":"475_CR17","volume-title":"Computers and intractability","author":"M. Garey","year":"1979","unstructured":"Garey,\u00a0M., & Johnson,\u00a0D. (1979). Computers and intractability. New York: W.\u00a0H. Freeman."},{"key":"475_CR18","volume-title":"Genetic algorithms in search, optimization and machine learning","author":"D. Goldberg","year":"1989","unstructured":"Goldberg,\u00a0D. (1989). Genetic algorithms in search, optimization and machine learning. Reading: Addison-Wesley."},{"key":"475_CR19","first-page":"493","volume":"3","author":"D. Goldberg","year":"1989","unstructured":"Goldberg,\u00a0D., Korb,\u00a0B., & Deb,\u00a0K. (1989). Messy genetic algorithms: Motivation, analysis and first results. Complex Systems, 3, 493\u2013530.","journal-title":"Complex Systems"},{"key":"475_CR20","first-page":"256","volume":"8","author":"B.\u00a0L. Golden","year":"1976","unstructured":"Golden,\u00a0B.\u00a0L. (1976). Approaches to the cutting stock problem. AIIE Transactions, 8, 256\u2013274.","journal-title":"AIIE Transactions"},{"issue":"1","key":"475_CR21","first-page":"33","volume":"2","author":"M. Hifi","year":"2002","unstructured":"Hifi,\u00a0M., & MHallah,\u00a0R. (2002). A best-local position procedure-based heuristic for two-dimensional layout problems. Studia Informatica Universalis, International Journal on Informatics, 2(1), 33\u201356.","journal-title":"Studia Informatica Universalis, International Journal on Informatics"},{"key":"475_CR22","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1111\/1475-3995.00404","volume":"10","author":"M. Hifi","year":"2003","unstructured":"Hifi,\u00a0M., & MHallah,\u00a0R. (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"},{"key":"475_CR23","volume-title":"Adaptation in natural and artificial systems","author":"J. Holland","year":"1975","unstructured":"Holland,\u00a0J. (1975). Adaptation in natural and artificial systems. Ann Arbor: The University of Michigan Press."},{"issue":"1","key":"475_CR24","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/S0377-2217(99)00357-4","volume":"128","author":"E. Hopper","year":"2001","unstructured":"Hopper,\u00a0E., & Turton,\u00a0B.\u00a0C. (2001a). An empirical investigation of metaheuristic and heuristic algorithms for a 2D packing problem. European Journal of Operational Research, 128(1), 34\u201357.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"475_CR25","first-page":"77","volume":"2","author":"E. Hopper","year":"2001","unstructured":"Hopper,\u00a0E., & Turton,\u00a0B.\u00a0C. (2001b). An empirical study of meta-heuristics applied to 2D rectangular bin packing. Studia Informatica Universalis, 2(1), 77\u2013106.","journal-title":"Studia Informatica Universalis"},{"key":"475_CR26","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0377-2217(94)00166-9","volume":"88","author":"S. Jakobs","year":"1996","unstructured":"Jakobs,\u00a0S. (1996). On genetic algorithms for the packing of polygons. European Journal of Operations Research, 88, 165\u2013181.","journal-title":"European Journal of Operations Research"},{"key":"475_CR27","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1287\/mnsc.6.4.366","volume":"6","author":"L.\u00a0V. Kantorovich","year":"1960","unstructured":"Kantorovich,\u00a0L.\u00a0V. (1960). Mathematical methods of organizing and planning production. Management Science, 6, 366\u2013422.","journal-title":"Management Science"},{"key":"475_CR28","unstructured":"Kendall,\u00a0G., Soubeiga,\u00a0E., & Cowling,\u00a0P. (2004). Choice function and random hyperheuristics. In N. Press (Ed.), 4th Asia-Pacific conference on simulated evolution and learning (pp.\u00a0667\u2013671). Nanyang."},{"issue":"2","key":"475_CR29","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1016\/0377-2217(95)00029-P","volume":"84","author":"B. Kr\u00f6ger","year":"1995","unstructured":"Kr\u00f6ger,\u00a0B. (1995). Guillotineable bin packing: A genetic approach. European Journal of Operational Research, 84(2), 645\u2013661.","journal-title":"European Journal of Operational Research"},{"key":"475_CR30","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1016\/S0377-2217(97)00437-2","volume":"112","author":"D. Liu","year":"1999","unstructured":"Liu,\u00a0D., & Teng,\u00a0H. (1999). An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangle. European Journal of Operations Research, 112, 413\u2013419.","journal-title":"European Journal of Operations Research"},{"key":"475_CR31","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/978-3-540-71231-2_14","volume-title":"Learning classifier systems","author":"J.\u00a0G. Mar\u00edn-Bl\u00e1zquez","year":"2007","unstructured":"Mar\u00edn-Bl\u00e1zquez,\u00a0J.\u00a0G., & Schulenburg,\u00a0S. (2007). A hyper-heuristic framework for XCS: learning to create novel problem-solving algorithms constructed from simpler algorithmic ingredients. In P.\u00a0L. Lanzi, W. Stolzmann, & S.\u00a0W. Wilson (Eds.), Learning classifier systems (pp.\u00a0193\u2013218). Berlin: Springer."},{"issue":"3","key":"475_CR32","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1287\/mnsc.44.3.388","volume":"44","author":"S. Martello","year":"1998","unstructured":"Martello,\u00a0S., & Vigo,\u00a0D. (1998). Exact solution of the two-dimensional finite bin packing problem. Management Science, 44(3), 388\u2013399.","journal-title":"Management Science"},{"key":"475_CR33","doi-asserted-by":"crossref","unstructured":"Poli,\u00a0R., Woodward,\u00a0J., & Burke,\u00a0E.\u00a0K. (2007). A histogram-matching approach to the evolution of bin packing strategies. In Proceedings of congress on evolutionary computation CEC2007 (pp.\u00a03500\u20133507). Singapore.","DOI":"10.1109\/CEC.2007.4424926"},{"key":"475_CR34","volume-title":"Evolutionstrategie: optimierung technischer systeme nach prinzipien dier biolischen evolution","author":"I. Rechenberg","year":"1973","unstructured":"Rechenberg,\u00a0I. (1973). Evolutionstrategie: optimierung technischer systeme nach prinzipien dier biolischen evolution. Stuttgart: Frommann-Holzboog."},{"issue":"3","key":"475_CR35","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/BF02125404","volume":"63","author":"C. Reeves","year":"1996","unstructured":"Reeves,\u00a0C. (1996). Hybrid genetic algorithms for bin-packing and related problems. Annals of Operations Research, 63(3), 371\u2013396.","journal-title":"Annals of Operations Research"},{"key":"475_CR36","unstructured":"Ross,\u00a0P., Schulenburg,\u00a0S., Bl\u00e1zquez,\u00a0J.\u00a0M., & Hart,\u00a0E. (2002). Hyper-heuristics: learning to combine simple heuristics in bin-packing problems. In Proceedings of GECCO 2002 (pp.\u00a0942\u2013948)."},{"key":"475_CR37","doi-asserted-by":"crossref","unstructured":"Ross,\u00a0P., Bl\u00e1zquez,\u00a0J.\u00a0M., Schulenburg,\u00a0S., & Hart,\u00a0E. (2003). Learning a procedure that can solve hard bin-packing problems: a new GA-based approach to hyper-heuristics. In Proceedings of GECCO 2003 (pp.\u00a01295\u20131306).","DOI":"10.1007\/3-540-45110-2_5"},{"key":"475_CR38","volume-title":"Numerical optimization of computer models","author":"H.\u00a0P. Schwefel","year":"1981","unstructured":"Schwefel,\u00a0H.\u00a0P. (1981). Numerical optimization of computer models. Chichester: Wiley."},{"key":"475_CR39","doi-asserted-by":"crossref","unstructured":"Terashima-Mar\u00edn,\u00a0H., Flores-\u00c1lvarez,\u00a0E.\u00a0J., & Ross,\u00a0P. (2005a). Hyper-heuristics and classifier systems for solving 2D-regular cutting stock problems. In Proceedings of the genetic and evolutionary computation conference 2005 (pp.\u00a0637\u2013643).","DOI":"10.1145\/1068009.1068115"},{"key":"475_CR40","doi-asserted-by":"crossref","unstructured":"Terashima-Mar\u00edn,\u00a0H., Mor\u00e1n-Saavedra,\u00a0A., & Ross,\u00a0P. (2005b). Forming hyper-heuristics with GAs when solving 2D-regular cutting stock problems. In Proceedings of the congress on evolutionary computation (pp.\u00a01104\u20131110), 2005.","DOI":"10.1109\/CEC.2005.1554814"},{"key":"475_CR41","doi-asserted-by":"crossref","unstructured":"Terashima-Mar\u00edn,\u00a0H., Far\u00edas-Z\u00e1rate,\u00a0C.\u00a0J., Ross,\u00a0P., & Valenzuela-Rend\u00f3n,\u00a0M. (2006). A GA-based method to produce generalized hyper-heuristics for the 2D-regular cutting stock problem. In Proceedings of the genetic and evolutionary computation conference 2006 (pp.\u00a0591\u2013598).","DOI":"10.1145\/1143997.1144102"},{"key":"475_CR42","unstructured":"Uday,\u00a0A., Goodman,\u00a0E.\u00a0D., & Debnath,\u00a0A.\u00a0A. (2001). Nesting of irregular shapes using feature matching and parallel genetic algorithms. In E.D. Goodman (Ed.), 2001 genetic and evolutionary computation conference late breaking papers (pp.\u00a0429\u2013434). San Francisco, California, USA."},{"key":"475_CR43","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4660.001.0001","volume-title":"The MIT encyclopedia of the cognitive science","author":"R.\u00a0A. Wilson","year":"1999","unstructured":"Wilson,\u00a0R.\u00a0A., & Keil,\u00a0F.\u00a0C. (1999). The MIT encyclopedia of the cognitive science. Cambridge: MIT Press."},{"issue":"3","key":"475_CR44","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,\u00a0G., Haussner,\u00a0H., & Schumann,\u00a0H. (2007). An improved typology of cutting and packing problems. European Journal of Operational Research, 183(3), 1109\u20131130.","journal-title":"European Journal of Operational Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0475-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-008-0475-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0475-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,21]],"date-time":"2023-05-21T02:55:10Z","timestamp":1684637710000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-008-0475-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11,15]]},"references-count":44,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,9]]}},"alternative-id":["475"],"URL":"https:\/\/doi.org\/10.1007\/s10479-008-0475-2","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,11,15]]}}}