{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T15:16:01Z","timestamp":1781104561542,"version":"3.54.1"},"reference-count":20,"publisher":"IGI Global Scientific Publishing","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,4,1]]},"abstract":"<p>In this paper, the authors present a hybrid genetic approach for the two-dimensional rectangular guillotine oriented cutting-stock problem. In this method, the genetic algorithm is used to select a set of cutting patterns while the linear programming model permits one to create the lengths to produce with each cutting pattern to fulfil the customer orders with minimal production cost. The effectiveness of the hybrid genetic approach has been evaluated through a set of instances which are both randomly generated and collected from the literature.<\/p>","DOI":"10.4018\/jamc.2010040103","type":"journal-article","created":{"date-parts":[[2010,6,30]],"date-time":"2010-06-30T21:06:22Z","timestamp":1277931982000},"page":"34-49","source":"Crossref","is-referenced-by-count":1,"title":["A Hybrid Genetic Algorithm for Optimization of Two-dimensional Cutting-Stock Problem"],"prefix":"10.4018","volume":"1","author":[{"given":"Ahmed","family":"Mellouli","sequence":"first","affiliation":[{"name":"University of Sfax, Tunisia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Faouzi","family":"Masmoudi","sequence":"additional","affiliation":[{"name":"University of Sfax, Tunisia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Imed","family":"Kacem","sequence":"additional","affiliation":[{"name":"University Paul Verlaine - Metz, LITA, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohamed","family":"Haddar","sequence":"additional","affiliation":[{"name":"University of Sfax, Tunisia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"jamc.2010040103-0","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.07.033"},{"key":"jamc.2010040103-1","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1057\/palgrave.jors.2600351","article-title":"An algorithm for a cutting stock problem on a strip.","volume":"48","author":"S.Benati","year":"1997","journal-title":"The Journal of the Operational Research Society"},{"key":"jamc.2010040103-2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.07.032"},{"key":"jamc.2010040103-3","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(90)90350-K"},{"key":"jamc.2010040103-4","doi-asserted-by":"crossref","unstructured":"Esbensen, H. (1992). Genetic algorithm for macro cell placement. In Proceedings of the European Design Automation Conference (EUDO-VHDL) (pp. 52-57).","DOI":"10.1109\/EURDAC.1992.246265"},{"key":"jamc.2010040103-5","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1057\/jors.1988.6","article-title":"Mathematical programming models for cutting stock problems in the clothing industry.","volume":"39","author":"A.Farley","year":"1988","journal-title":"The Journal of the Operational Research Society"},{"key":"jamc.2010040103-6","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1060.0369"},{"key":"jamc.2010040103-7","doi-asserted-by":"crossref","first-page":"1289","DOI":"10.1057\/palgrave.jors.2601019","article-title":"Resolution of strip-packing problems with genetic algorithms.","volume":"51","author":"A.Gomez","year":"2000","journal-title":"The Journal of the Operational Research Society"},{"key":"jamc.2010040103-8","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00435-X"},{"key":"jamc.2010040103-9","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(94)00166-9"},{"key":"jamc.2010040103-10","unstructured":"Kado, K., Ross, P., & Corne, D. (1995). A study of genetic algorithm hybrids for facility layout problem. In Proceedings of the Sixth International Conference on Genetic Algorithms (pp. 498-505)."},{"key":"jamc.2010040103-11","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2004.02.003"},{"key":"jamc.2010040103-12","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00123-6"},{"key":"jamc.2010040103-13","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.15.3.310.16082"},{"issue":"2","key":"jamc.2010040103-14","first-page":"201","article-title":"An algorithm for the two-dimensional cutting-stock problem based on a pattern generation procedure.","volume":"19","author":"A.Mellouli","year":"2008","journal-title":"International Journal of Information and Management Sciences"},{"key":"jamc.2010040103-15","doi-asserted-by":"publisher","DOI":"10.1016\/S0010-4485(03)00003-4"},{"key":"jamc.2010040103-16","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.12.050"},{"key":"jamc.2010040103-17","unstructured":"Teghem, J. (1996). Programmation lin\u00e9aire. Editions Ellipses, 51-62."},{"key":"jamc.2010040103-18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.12.047"},{"key":"jamc.2010040103-19","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2004.02.003"}],"container-title":["International Journal of Applied Metaheuristic Computing"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=44953","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T17:05:08Z","timestamp":1654103108000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jamc.2010040103"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2010,4,1]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,4]]}},"URL":"https:\/\/doi.org\/10.4018\/jamc.2010040103","relation":{},"ISSN":["1947-8283","1947-8291"],"issn-type":[{"value":"1947-8283","type":"print"},{"value":"1947-8291","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,4,1]]}}}