{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T22:20:45Z","timestamp":1775082045150,"version":"3.50.1"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,4,8]],"date-time":"2010-04-08T00:00:00Z","timestamp":1270684800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2011,8]]},"DOI":"10.1007\/s10878-009-9282-1","type":"journal-article","created":{"date-parts":[[2010,4,7]],"date-time":"2010-04-07T18:21:26Z","timestamp":1270664486000},"page":"180-201","source":"Crossref","is-referenced-by-count":63,"title":["A parallel multi-population genetic algorithm for\u00a0a\u00a0constrained two-dimensional orthogonal packing\u00a0problem"],"prefix":"10.1007","volume":"22","author":[{"given":"Jos\u00e9 Fernando","family":"Gon\u00e7alves","sequence":"first","affiliation":[]},{"given":"Mauricio G. C.","family":"Resende","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,4,8]]},"reference":[{"key":"9282_CR1","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1057\/palgrave.jors.2601829","volume":"56","author":"R Alvarez-Valdes","year":"2005","unstructured":"Alvarez-Valdes R, Parre\u00f1o F, Tamarit J (2005) A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems. J Oper Res Soc 56:414\u2013425","journal-title":"J Oper Res Soc"},{"key":"9282_CR2","doi-asserted-by":"publisher","first-page":"1167","DOI":"10.1016\/j.ejor.2005.11.068","volume":"183","author":"R Alvarez-Valdes","year":"2007","unstructured":"Alvarez-Valdes R, Parre\u00f1o F, Tamarit J (2007) A tabu search algorithm for a two-dimensional non-guillotine cutting problem. Eur J Oper Res 183:1167\u20131182","journal-title":"Eur J Oper Res"},{"key":"9282_CR3","unstructured":"Amaral A, Letchford AN (2001) An improved upper bound for the two-dimensional non-guillotine cutting problem. Technical report, Lancaster University, UK. Available online at \n                    http:\/\/www.lancs.ac.uk\/staff\/letchfoa\/ngc.doc"},{"key":"9282_CR4","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1016\/0377-2217(95)00026-M","volume":"84","author":"M Arenales","year":"1995","unstructured":"Arenales M, Morabito R (1995) An and\/or-graph approach to the solution of two dimensional guillotine cutting problems. Eur J Oper Res 84:599\u2013617","journal-title":"Eur J Oper Res"},{"key":"9282_CR5","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"JC Bean","year":"1994","unstructured":"Bean JC (1994) Genetics and random keys for sequencing and optimization. ORSA J Comput 6:154\u2013160","journal-title":"ORSA J Comput"},{"key":"9282_CR6","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1287\/opre.33.1.49","volume":"33","author":"JE Beasley","year":"1985","unstructured":"Beasley JE (1985) An exact two-dimensional non-guillotine cutting tree search procedure. Oper Res 33:49\u201364","journal-title":"Oper Res"},{"key":"9282_CR7","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1016\/S0377-2217(03)00139-5","volume":"156","author":"JE Beasley","year":"2004","unstructured":"Beasley JE (2004) A population heuristic for constrained two-dimensional non-guillotine cutting. Eur J Oper Res 156:601\u2013627","journal-title":"Eur J Oper Res"},{"key":"9282_CR8","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1093\/imaman\/13.2.95","volume":"13","author":"MA Boschetti","year":"2002","unstructured":"Boschetti MA, Hadjiconstantinou E, Mingozzi A (2002) New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem. IMA J Manag Math 13:95\u2013119","journal-title":"IMA J Manag Math"},{"key":"9282_CR9","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1002\/net.20070","volume":"46","author":"LS Buriol","year":"2005","unstructured":"Buriol LS, Resende MGC, Ribeiro CC, Thorup M (2005) A hybrid genetic algorithm for the weight setting problem in OSPF\/IS-IS routing. Networks 46:36\u201356","journal-title":"Networks"},{"key":"9282_CR10","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1002\/net.20141","volume":"49","author":"LS Buriol","year":"2007","unstructured":"Buriol LS, Resende MGC, Thorup M (2007) Survivable IP network design with OSPF routing. Networks 49:51\u201364","journal-title":"Networks"},{"key":"9282_CR11","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/S0167-6377(03)00057-9","volume":"32","author":"A Caprara","year":"2004","unstructured":"Caprara A, Monaci M (2004) On the 2-dimensional knapsack problem. Oper Res Lett 32:5\u201314","journal-title":"Oper Res Lett"},{"key":"9282_CR12","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1287\/opre.25.1.30","volume":"25","author":"N Christofides","year":"1977","unstructured":"Christofides N, Whitlock C (1977) An algorithm for two dimensional cutting problems. Oper Res 25:31\u201344","journal-title":"Oper Res"},{"key":"9282_CR13","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/0377-2217(92)90288-K","volume":"56","author":"KA Dowsland","year":"1992","unstructured":"Dowsland KA, Dowsland WB (1992) Packing problems. Eur J Oper Res 56:2\u201314","journal-title":"Eur J Oper Res"},{"key":"9282_CR14","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0377-2217(90)90350-K","volume":"44","author":"H Dyckhoff","year":"1990","unstructured":"Dyckhoff H (1990) A typology of cutting and packing problems. Eur J Oper Res 44:145\u2013159","journal-title":"Eur J Oper Res"},{"key":"9282_CR15","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1023\/A:1014852026591","volume":"6","author":"M Ericsson","year":"2002","unstructured":"Ericsson M, Resende MGC, Pardalos PM (2002) A genetic algorithm for the weight setting problem in OSPF routing. J Combin Optim 6:299\u2013333","journal-title":"J Combin Optim"},{"key":"9282_CR16","series-title":"Springer lecture notes in computer science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/3-540-63397-9_12","volume-title":"Algorithms\u2014ESA \u201997","author":"S Fekete","year":"1997","unstructured":"Fekete S, Schepers J (1997a) A new exact algorithm for general orthogonal d-dimensional knapsack problems. In: Algorithms\u2014ESA \u201997. Springer lecture notes in computer science, vol 1284. Springer, Berlin, pp 144\u2013156"},{"key":"9282_CR17","unstructured":"Fekete SP, Schepers J (1997b) On higher-dimensional packing I: Modeling. Technical Report ZPR 97-288, Mathematisches Institut, Universitat zu K\u00f6ln"},{"key":"9282_CR18","unstructured":"Fekete SP, Schepers J (1997c) On higher-dimensional packing II: Bounds. Technical Report ZPR97-289, Mathematisches Institut, Universitat zu K\u00f6ln"},{"key":"9282_CR19","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1287\/moor.1030.0079","volume":"29","author":"SP Fekete","year":"2004","unstructured":"Fekete SP, Schepers J (2004a) A combinatorial characterization of higher-dimensional orthogonal packing. Math Oper Res 29:353\u2013368","journal-title":"Math Oper Res"},{"key":"9282_CR20","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s001860400376","volume":"60","author":"SP Fekete","year":"2004","unstructured":"Fekete SP, Schepers J (2004b) A general framework for bounds for higher-dimensional orthogonal packing problems. Math Methods Oper Res 60:311\u2013329","journal-title":"Math Methods Oper Res"},{"key":"9282_CR21","unstructured":"Fekete SP, Schepers J (2004c) An exact algorithm for higher-dimensional orthogonal packing. Technical report, Mathematisches Institut, Universitat zu K\u00f6ln. Working paper. Available online at \n                    http:\/\/www.math.tu-bs.de\/~fekete"},{"key":"9282_CR22","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"TA Feo","year":"1989","unstructured":"Feo TA, Resende MGC (1989) A probabilistic heuristic for a computationally difficult set covering problem. Oper Res Lett 8:67\u201371","journal-title":"Oper Res Lett"},{"key":"9282_CR23","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo TA, Resende MGC (1995) Greedy randomized adaptive search procedures. J Glob Optim 6:109\u2013133","journal-title":"J Glob Optim"},{"key":"9282_CR24","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"M Garey","year":"1979","unstructured":"Garey M, Johnson D (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, New York"},{"key":"9282_CR25","volume-title":"Genetic algorithms in search optimization and machine learning","author":"D Goldberg","year":"1989","unstructured":"Goldberg D (1989) Genetic algorithms in search optimization and machine learning. Addison-Wesley, Reading"},{"key":"9282_CR26","doi-asserted-by":"publisher","first-page":"1212","DOI":"10.1016\/j.ejor.2005.11.062","volume":"183","author":"JF Gon\u00e7alves","year":"2007","unstructured":"Gon\u00e7alves JF (2007) A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem. Eur J Oper Res 183:1212\u20131229","journal-title":"Eur J Oper Res"},{"key":"9282_CR27","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1023\/A:1020377910258","volume":"8","author":"JF Gon\u00e7alves","year":"2002","unstructured":"Gon\u00e7alves JF, Almeida JR (2002) A hybrid genetic algorithm for assembly line balancing. J Heuristics 8:629\u2013642","journal-title":"J Heuristics"},{"key":"9282_CR28","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/j.cie.2004.07.003","volume":"47","author":"JF Gon\u00e7alves","year":"2004","unstructured":"Gon\u00e7alves JF, Resende MGC (2004) An evolutionary algorithm for manufacturing cell formation. Comput Ind Eng 47:247\u2013273","journal-title":"Comput Ind Eng"},{"key":"9282_CR29","unstructured":"Gon\u00e7alves JF, Resende MGC (2009) Biased random key genetic algorithms for combinatorial optimization. Technical report, AT&T Labs Research Technical Report, Florham Park, NJ 07733 USA"},{"key":"9282_CR30","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.ejor.2004.03.012","volume":"167","author":"JF Gon\u00e7alves","year":"2005","unstructured":"Gon\u00e7alves JF, Mendes JJM, Resende MGC (2005) A hybrid genetic algorithm for the job shop scheduling problem. Eur J Oper Res 167:77\u201395","journal-title":"Eur J Oper Res"},{"key":"9282_CR31","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0377-2217(93)E0278-6","volume":"83","author":"E Hadjiconstantinou","year":"1995","unstructured":"Hadjiconstantinou E, Christofides N (1995) An exact algorithm for general, orthogonal, two dimensional knapsack problems. Eur J Oper Res 83:39\u201356","journal-title":"Eur J Oper Res"},{"key":"9282_CR32","doi-asserted-by":"publisher","first-page":"1150","DOI":"10.1016\/j.ejor.2005.11.061","volume":"183","author":"E Hadjiconstantinou","year":"2007","unstructured":"Hadjiconstantinou E, Iori M (2007) A hybrid genetic algorithm for the two-dimensional knapsack problem. Eur J Oper Res 183:1150\u20131166","journal-title":"Eur J Oper Res"},{"key":"9282_CR33","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0377-2217(91)90293-5","volume":"54","author":"RW Haessler","year":"1991","unstructured":"Haessler RW, Sweeney PE (1991) Cutting stock problems and solution procedures. Eur J Oper Res 54:141\u2013150","journal-title":"Eur J Oper Res"},{"key":"9282_CR34","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0167-6377(98)00048-0","volume":"24","author":"P Healy","year":"1999","unstructured":"Healy P, Creavin M, Kuusik A (1999) An optimal algorithm for rectangle placement. Oper Res Lett 24:73\u201380","journal-title":"Oper Res Lett"},{"key":"9282_CR35","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 BCH (2001) An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem. Eur J Oper Res 128:34\u201357","journal-title":"Eur J Oper Res"},{"key":"9282_CR36","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0377-2217(94)00166-9","volume":"88","author":"S Jakobs","year":"1996","unstructured":"Jakobs S (1996) On genetic algorithms for the packing of polygons. Eur J Oper Res 88:165\u2013181","journal-title":"Eur J Oper Res"},{"key":"9282_CR37","first-page":"130","volume":"4","author":"KK Lai","year":"1997","unstructured":"Lai KK, Chan JWM (1997a) An evolutionary algorithm for the rectangular cutting stock problem. Int J Ind Eng 4:130\u2013139","journal-title":"Int J Ind Eng"},{"key":"9282_CR38","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S0360-8352(96)00205-7","volume":"32","author":"KK Lai","year":"1997","unstructured":"Lai KK, Chan JWM (1997b) Developing a simulated annealing algorithm for the cutting stock problem. Comput Ind Eng 32:115\u2013127","journal-title":"Comput Ind Eng"},{"key":"9282_CR39","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/S0360-8352(01)00021-3","volume":"40","author":"TW Leung","year":"2001","unstructured":"Leung TW, Chan CK, Troutt MD (2001) Applications of genetic search and simulated annealing to the two-dimensional non-guillotine cutting stock problem. Comput Ind Eng 40:201\u2013214","journal-title":"Comput Ind Eng"},{"key":"9282_CR40","first-page":"241","volume":"141","author":"TW Leung","year":"2003","unstructured":"Leung TW, Chan CK, Troutt MD (2003) Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem. Eur J Oper Res 141:241\u2013252","journal-title":"Eur J Oper Res"},{"key":"9282_CR41","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/S0377-2217(97)00437-2","volume":"112","author":"D Liu","year":"1999","unstructured":"Liu D, Teng H (1999) An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles. Eur J Oper Res 112:413\u2013420","journal-title":"Eur J Oper Res"},{"key":"9282_CR42","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1080\/02331939308843904","volume":"28","author":"G Scheithauer","year":"1993","unstructured":"Scheithauer G, Terno J (1993) Modeling of packing problems. Optimization 28:63\u201384","journal-title":"Optimization"},{"key":"9282_CR43","unstructured":"Spears WM, Dejong KA (1991) On the virtues of parameterized uniform crossover. In: Proceedings of the fourth international conference on genetic algorithms, pp 230\u2013236"},{"key":"9282_CR44","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1057\/jors.1992.101","volume":"43","author":"PE Sweeney","year":"1992","unstructured":"Sweeney PE, Paternoster ER (1992) Cutting and packing problems: A categorized, application-orientated research bibliography. J Oper Res Soc 43:691\u2013706","journal-title":"J Oper Res Soc"},{"key":"9282_CR45","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1080\/07408178808966200","volume":"20","author":"RD Tsai","year":"1988","unstructured":"Tsai RD, Malstrom EM, Meeks HD (1988) A two-dimensional palletizing procedure for warehouse loading operations. IIE Trans 20:418\u2013425","journal-title":"IIE Trans"},{"key":"9282_CR46","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1287\/opre.31.3.573","volume":"31","author":"PY Wang","year":"1983","unstructured":"Wang PY (1983) Two algorithms for constrained two-dimensional cutting stock problems. Oper Res 31:573\u2013586","journal-title":"Oper Res"},{"key":"9282_CR47","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1016\/j.ejor.2005.12.047","volume":"183","author":"G W\u00e4scher","year":"2007","unstructured":"W\u00e4scher G, Haussner H, Schumann H (2007) An improved typology of cutting and packing problems. Eur J Oper Res 183:1109\u20131130","journal-title":"Eur J Oper Res"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-009-9282-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-009-9282-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-009-9282-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-009-9282-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,18]],"date-time":"2019-11-18T22:08:16Z","timestamp":1574114896000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-009-9282-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4,8]]},"references-count":47,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,8]]}},"alternative-id":["9282"],"URL":"https:\/\/doi.org\/10.1007\/s10878-009-9282-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,4,8]]}}}