{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T07:20:46Z","timestamp":1777706446499,"version":"3.51.4"},"reference-count":28,"publisher":"SAGE Publications","issue":"2","license":[{"start":{"date-parts":[[2024,3,23]],"date-time":"2024-03-23T00:00:00Z","timestamp":1711152000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Intelligent &amp; Fuzzy Systems: Applications in Engineering and Technology"],"published-print":{"date-parts":[[2026,2]]},"abstract":"<jats:p>Within various industrial settings, such as shipping, aeronautics, woodworking, and footwear, there exists a significant challenge: optimizing the extraction of sections from material sheets, a process known as \u201cnesting\u201d, to minimize wasted surface area. This paper investigates efficient solutions to complex nesting problems, emphasizing rapid computation over ultimate precision. We introduce a dual-approach methodology that couples both a greedy technique and a genetic algorithm. The genetic algorithm is instrumental in determining the optimal sequence for placing sections, ensuring each is located in its current best position. A specialized representation system is devised for both the sections and the material sheet, promoting streamlined computation and tangible results. By balancing speed and accuracy, this study offers robust solutions for real-world nesting challenges within a reduced computational timeframe.<\/jats:p>","DOI":"10.3233\/jifs-219345","type":"journal-article","created":{"date-parts":[[2024,3,26]],"date-time":"2024-03-26T12:03:27Z","timestamp":1711454607000},"page":"292-306","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":1,"title":["An efficient algorithm for irregular pattern nesting based on genetic algorithm and greedy strategy"],"prefix":"10.1177","volume":"50","author":[{"given":"German","family":"Martinez","sequence":"first","affiliation":[{"name":"INESCOP \u2013 Footwear Technology Center, Elda (Alicante), Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduard-Andrei","family":"Duta","sequence":"additional","affiliation":[{"name":"University of Alicante","place":["Spain"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jose-Luis","family":"Sanchez-Romero","sequence":"additional","affiliation":[{"name":"University of Alicante","place":["Spain"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio","family":"Jimeno-Morenilla","sequence":"additional","affiliation":[{"name":"University of Alicante","place":["Spain"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Higinio","family":"Mora-Mora","sequence":"additional","affiliation":[{"name":"University of Alicante","place":["Spain"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2024,3,23]]},"reference":[{"key":"e_1_3_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/360881.360919"},{"key":"e_1_3_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cirpj.2014.06.001"},{"key":"e_1_3_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0010-4485(00)00112-3"},{"key":"e_1_3_1_5_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207549508930225"},{"key":"e_1_3_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(94)00166-9"},{"key":"e_1_3_1_7_1","doi-asserted-by":"publisher","DOI":"10.1243\/PIME_PROC_1996_210_150_02"},{"key":"e_1_3_1_8_1","doi-asserted-by":"publisher","DOI":"10.1080\/0951192X.2015.1036522"},{"key":"e_1_3_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2013.06.020"},{"key":"e_1_3_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2013.04.009"},{"key":"e_1_3_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.proeng.2017.04.041"},{"key":"e_1_3_1_12_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2017.1413256"},{"key":"e_1_3_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3114331"},{"key":"e_1_3_1_14_1","first-page":"12","article-title":"Jostle heuristics for the 2D-irregular shapes bin packing problems with free rotation,","volume":"2","author":"Ranga P.A.","year":"2018","unstructured":"RangaP.A.JuliaA.B.AntonioM., Jostle heuristics for the 2D-irregular shapes bin packing problems with free rotation, , Int J Prod Econ2 (2018), 12\u201326.","journal-title":"Int J Prod Econ"},{"key":"e_1_3_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2017.03.059"},{"key":"e_1_3_1_16_1","first-page":"1","article-title":"Two-dimensional irregular packing problems: A review,","volume":"2","author":"Guo B.","year":"2022","unstructured":"GuoB.ZhangY.HuJ.LiJ.WuF.PengQ.ZhangQ., Two-dimensional irregular packing problems: A review, , Front Mech Eng2 (2022), 1\u201315.","journal-title":"Front Mech Eng"},{"key":"e_1_3_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107175"},{"key":"e_1_3_1_18_1","first-page":"236","article-title":"Robust hyper-heuristic algorithms for the offline oriented\/non-oriented 2D bin packing problems,","volume":"2","author":"Muhammed B.","year":"2015","unstructured":"MuhammedB.TanselD.AhmetC., Robust hyper-heuristic algorithms for the offline oriented\/non-oriented 2D bin packing problems, , Appl Soft Comput2 (2015), 236\u2013245.","journal-title":"Appl Soft Comput"},{"key":"e_1_3_1_19_1","doi-asserted-by":"publisher","DOI":"10.1155\/2021\/5054916"},{"key":"e_1_3_1_20_1","doi-asserted-by":"publisher","DOI":"10.1111\/itor.13122"},{"key":"e_1_3_1_21_1","doi-asserted-by":"crossref","first-page":"012002","DOI":"10.1088\/1742-6596\/2181\/1\/012002","article-title":"A reinforcement learning algorithm for the 2D-rectangular strip packing problem,","volume":"2","author":"Zhao X.","year":"2022","unstructured":"ZhaoX.RaoY.FangJ., A reinforcement learning algorithm for the 2D-rectangular strip packing problem, , J Phys Conf Ser2 (2022), 012002.","journal-title":"J Phys Conf Ser"},{"key":"e_1_3_1_22_1","doi-asserted-by":"crossref","unstructured":"LeaoA.A.ToledoF.M.OliveiraJ.F.CarravillaM.A.Alvarez-Vald\u00e9sR. Irregular packing problems: A review of mathematical models Eur J Oper Res 2020.","DOI":"10.1016\/j.ejor.2019.04.045"},{"key":"e_1_3_1_23_1","doi-asserted-by":"crossref","unstructured":"BaldacciR.BoschettiM.A.GanovelliM.ManiezzoV. Algorithms for nesting with defects Discret Appl Math 2014.","DOI":"10.1016\/j.dam.2012.03.026"},{"key":"e_1_3_1_24_1","first-page":"39","article-title":"A hybrid solving algorithm on two-dimensional irregular graphics nesting problem,","volume":"2","author":"Du B.","year":"2022","unstructured":"DuB.GuoX.FangJ.WangP.RaoY., A hybrid solving algorithm on two-dimensional irregular graphics nesting problem, , Forg Stamp Technol2 (2022), 39\u201345.","journal-title":"Forg Stamp Technol"},{"key":"e_1_3_1_25_1","doi-asserted-by":"crossref","unstructured":"XuJ.WuX.LiuH. An optimization algorithm based on no-fit polygon method and hybrid heuristic strategy for irregular nesting problem 2017 36th Chinese Control Conference (CCC) (2017) 2858\u20132863.","DOI":"10.23919\/ChiCC.2017.8027799"},{"key":"e_1_3_1_26_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2017.1394598"},{"key":"e_1_3_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ifacol.2019.10.010"},{"key":"e_1_3_1_28_1","doi-asserted-by":"publisher","DOI":"10.31181\/oresta180222031d"},{"key":"e_1_3_1_29_1","unstructured":"CNC-APPS. Available online: https:\/\/cnc-apps.com\/en\/(accessed on 18 October 2021)."}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems: Applications in Engineering and Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-219345","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/JIFS-219345","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-219345","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:46:50Z","timestamp":1777456010000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JIFS-219345"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,23]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,2]]}},"alternative-id":["10.3233\/JIFS-219345"],"URL":"https:\/\/doi.org\/10.3233\/jifs-219345","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,23]]}}}