{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,3]],"date-time":"2025-09-03T10:58:43Z","timestamp":1756897123665,"version":"3.37.3"},"reference-count":59,"publisher":"Oxford University Press (OUP)","issue":"6","license":[{"start":{"date-parts":[[2024,10,27]],"date-time":"2024-10-27T00:00:00Z","timestamp":1729987200000},"content-version":"vor","delay-in-days":1,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,11,8]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>The problem of nesting frequently arises in the industrial environment, and it has a strong ecological and economic impact in the manufacturing processes. It basically consists of placing a set of pieces (polygons) on a material sheet, making sure that the pieces do not overlap and that they do not exceed the boundaries of the sheet. With regard to irregular 2D polygons, the problem is NP-complete. Therefore, different heuristics have been developed so as to cope with the problem. In this paper, the application of the Jaya metaheuristic algorithm to the nesting problem is proposed. This algorithm has been already applied to several engineering problems and has generally demonstrated better results than most metaheuristic algorithms. In this paper, the Jaya algorithm has been adapted to the specific features of the nesting problem so as to optimize the placement of pieces on a sheet, with the objective of minimizing material waste and computational time. The results of our experimentation demonstrate the algorithm\u2019s effectiveness in reducing the convex hull area across various datasets, showing potential in solving complex, irregular shape nesting problems. This research provides a new application of the Jaya algorithm and opens ways for future work in optimization techniques and parameter-free heuristic algorithms for nesting.<\/jats:p>","DOI":"10.1093\/jcde\/qwae093","type":"journal-article","created":{"date-parts":[[2024,10,27]],"date-time":"2024-10-27T04:36:13Z","timestamp":1730003773000},"page":"112-121","source":"Crossref","is-referenced-by-count":2,"title":["An approach to apply the Jaya optimization algorithm to the nesting of irregular patterns"],"prefix":"10.1093","volume":"11","author":[{"given":"Eduard-Andrei","family":"Duta","sequence":"first","affiliation":[{"name":"Department of Computer Technology, University of Alicante , Carretera de San Vicente, s\/n, San Vicente E-03690 ,","place":["Spain"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3789-6475","authenticated-orcid":false,"given":"Antonio","family":"Jimeno-Morenilla","sequence":"additional","affiliation":[{"name":"Department of Computer Technology, University of Alicante , Carretera de San Vicente, s\/n, San Vicente E-03690 ,","place":["Spain"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8766-2813","authenticated-orcid":false,"given":"Jose-Luis","family":"Sanchez-Romero","sequence":"additional","affiliation":[{"name":"Department of Computer Technology, University of Alicante , Carretera de San Vicente, s\/n, San Vicente E-03690 ,","place":["Spain"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio","family":"Macia-Lillo","sequence":"additional","affiliation":[{"name":"Department of Computer Technology, University of Alicante , Carretera de San Vicente, s\/n, San Vicente E-03690 ,","place":["Spain"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Higinio","family":"Mora-Mora","sequence":"additional","affiliation":[{"name":"Department of Computer Technology, University of Alicante , Carretera de San Vicente, s\/n, San Vicente E-03690 ,","place":["Spain"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2024,10,26]]},"reference":[{"key":"2024121710003886900_bib1","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0010-4485(76)90006-3","article-title":"Nesting two-dimensional shapes in rectangular modules","volume":"8","author":"Adamowicz","year":"1976","journal-title":"Computer Aided Design"},{"key":"2024121710003886900_bib2","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1109\/TSMC.1980.4308483","article-title":"Optimal allocation of two-dimensional irregular shapes using heuristic search methods","volume-title":"IEEE Transactions on Systems, Man, and Cybernetics","author":"Albano","year":"1980"},{"key":"2024121710003886900_bib3","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1016\/S0010-4485(00)00112-3","article-title":"A generic approach for nesting of 2D parts in 2D sheets using genetic and heuristic algorithms","volume":"33","author":"Babu","year":"2001","journal-title":"Computer Aided Design"},{"key":"2024121710003886900_bib4","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/S0305-0548(00)00021-6","article-title":"The irregular cutting-stock problem\u2014a new procedure for deriving the no-fit polygon","volume":"28","author":"Bennell","year":"2001","journal-title":"Computers & Operations Research"},{"key":"2024121710003886900_bib5","doi-asserted-by":"publisher","first-page":"1160","DOI":"10.1287\/mnsc.47.8.1160.10230","article-title":"Hybridising tabu search with optimisation techniques for irregular stock cutting","volume":"47","author":"Bennell","year":"2001","journal-title":"Management Science"},{"key":"2024121710003886900_bib6","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/j.cor.2006.02.026","article-title":"A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums","volume":"35","author":"Bennell","year":"2008","journal-title":"Computer Operational Research"},{"key":"2024121710003886900_bib7","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s10732-008-9095-x","article-title":"A beam search implementation for the irregular shape packing problem","volume":"16","author":"Bennell","year":"2010","journal-title":"Journal of Heuristic"},{"key":"2024121710003886900_bib8","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/BF02022998","article-title":"Using a Tabu search approach for solving the two-dimensional irregular cutting problem","volume":"41","author":"Blazewicz","year":"1993","journal-title":"Annals of Operations Research"},{"key":"2024121710003886900_bib9","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1287\/opre.1060.0293","article-title":"A new bottom-left-fill heuristic algorithm for the two-dimensional irregular packing problem","volume":"\u00a03","author":"Burke","year":"2006","journal-title":"Operations Research"},{"key":"2024121710003886900_bib10","first-page":"51","article-title":"Applying evolutionary algorithms and the no fit polygon to the nesting problem","volume-title":"Proceedings of the International Conference on Artificial Intelligence","author":"Burke","year":"1999"},{"key":"2024121710003886900_bib11","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/3-540-46695-9_38","article-title":"Applying ant algorithms and the no fit polygon to the nesting problem","volume-title":"Advanced Topics in Artificial Intelligence \u2013 12th Australian Joint Conference on AI,\u00a0AI 1999. Lecture Notes in Computer Science, vol 1747. Springer, Berlin, Heidelberg","author":"Burke","year":"1999"},{"key":"2024121710003886900_bib12","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1111\/1475-3995.00434","article-title":"Solving nesting problems with non-convex polygons by constraint logic programming","volume":"10","author":"Carravilla","year":"2003","journal-title":"International Transactions in Operational Research"},{"key":"2024121710003886900_bib13","doi-asserted-by":"publisher","first-page":"1521","DOI":"10.1016\/j.cor.2004.11.005","article-title":"An improved method for calculating the no-fit polygon","volume":"33","author":"Dean","year":"2006","journal-title":"Computers & Operations Research"},{"key":"2024121710003886900_bib14","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1016\/j.ejor.2013.06.020","article-title":"A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering","volume":"231","author":"Elkeran","year":"2013","journal-title":"European Journal of Operational Research"},{"key":"2024121710003886900_bib15","doi-asserted-by":"publisher","first-page":"131223","DOI":"10.1109\/ACCESS.2021.3114331","article-title":"Sequence transfer-based particle swarm optimization algorithm for irregular packing problems","volume":"9","author":"Fang","year":"2021","journal-title":"IEEE Access"},{"key":"2024121710003886900_bib16","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1023\/B:JIMS.0000018032.38317.f3","article-title":"Employing subgroup evolution for irregular-shape nesting","volume":"15","author":"Fischer","year":"2004","journal-title":"Journal of Intelligent Manufacturing"},{"key":"2024121710003886900_bib17","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s10732-008-9088-9","article-title":"Mixed-integer programming models for the nesting problem","volume":"15","author":"Fischetti","year":"2009","journal-title":"Journal of Heuristic"},{"key":"2024121710003886900_bib18","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0020-0190(81)90111-3","article-title":"Optimal packing and covering in the plane are NP-complete","volume":"12","author":"Fowler","year":"1981","journal-title":"Information Processing Letters"},{"key":"2024121710003886900_bib19","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1016\/j.ejor.2004.09.008","article-title":"Solving irregular strip packing problems by hybridising simulated annealing and linear programming","volume":"171","author":"Gomes","year":"2006","journal-title":"European Journal of Operational Research"},{"key":"2024121710003886900_bib20","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1023\/A:1007658212860","article-title":"Solving an apparel trim placement problem using a maximum cover problem approach","volume":"31","author":"Grinde","year":"1999","journal-title":"IIE Transactions"},{"key":"2024121710003886900_bib21","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1243\/PIME_PROC_1996_210_150_02","article-title":"Two-stage approach for nesting in Two-dimensional cutting problems using neural network and simulated annealing","volume-title":"Proceedings of the Institute of Mechanical Engineers, Part B, Journal of Engineering Manufacture","author":"Han","year":"1996"},{"key":"2024121710003886900_bib22","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1093\/jcde\/qwae001","article-title":"A new approach for solving global optimization and engineering problems based on modified sea horse optimizer","volume":"11","author":"Hashim","year":"2024","journal-title":"Journal of Computational Design and Engineering"},{"key":"2024121710003886900_bib23","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/BF02099693","article-title":"A simulated annealing approach to the nesting problem in the textile manufacturing industry","volume":"57","author":"Heckmann","year":"1995","journal-title":"Annals of Operations Research"},{"key":"2024121710003886900_bib24","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/S0377-2217(97)00049-0","article-title":"Computing closely matching upper and lower bounds on textile nesting problems","volume":"108","author":"Heckmann","year":"1998","journal-title":"European Journal of Operational Research"},{"key":"2024121710003886900_bib25","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1111\/1475-3995.00404","article-title":"A hybrid algorithm for the two-dimensional layout problem: The cases of regular and irregular shapes","volume":"10","author":"Hifi","year":"2003","journal-title":"International Transactions in Operational Research"},{"key":"2024121710003886900_bib26","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1023\/A:1012590107280","article-title":"A review of the application of meta-heuristic algorithms to 2D strip packing problems","volume":"16","author":"Hopper","year":"2001","journal-title":"Artificial Intelligence Review"},{"key":"2024121710003886900_bib27","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/S0360-8352(99)00097-2","article-title":"A genetic algorithm for a 2D industrial packing problem","volume":"37","author":"Hopper","year":"1999","journal-title":"Computer Industrial Engineering"},{"key":"2024121710003886900_bib28","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/S0377-2217(99)00357-4","article-title":"An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem","volume":"128","author":"Hopper","year":"2001","journal-title":"European Journal of Operational Research"},{"key":"2024121710003886900_bib29","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.disopt.2009.04.002","article-title":"An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem","volume":"6","author":"Imamichi","year":"2009","journal-title":"Discrete Optimization"},{"key":"2024121710003886900_bib30","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/BF01215974","article-title":"Two-dimensional packing problems using genetic algorithms","volume":"14","author":"Jain","year":"1998","journal-title":"Engineering with Computers"},{"key":"2024121710003886900_bib31","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0377-2217(94)00166-9","article-title":"On genetic algorithms for the packing of polygons","volume":"88","author":"Jakobs","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"2024121710003886900_bib32","doi-asserted-by":"publisher","first-page":"396","DOI":"10.3182\/20130522-3-BR-4036.00041","article-title":"A hybrid methodology for tackling the irregular strip packing problem","volume-title":"11th IFAC Workshop on Intelligent Manufacturing Systems","author":"Junior","year":"2013"},{"key":"2024121710003886900_bib33","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1109\/ICNC.2008.885","article-title":"Application of improved ant colony system algorithm in optimization of irregular parts nesting","volume-title":"2008 Fourth International Conference on Natural Computation","author":"Liang","year":"2008"},{"key":"2024121710003886900_bib34","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1109\/ICEE.2010.200","article-title":"Improved irregular parts nesting with particle swarm optimization","volume-title":"2010 IEEE International Conference on E-Business and E-Government","author":"Liang","year":"2010"},{"key":"2024121710003886900_bib35","doi-asserted-by":"publisher","first-page":"12474","DOI":"10.3390\/app132212474","article-title":"Optimizing two-dimensional irregular packing: A hybrid approach of genetic algorithm and linear programming","volume":"13","author":"Liu","year":"2013","journal-title":"Applied Sciences"},{"key":"2024121710003886900_bib36","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1631\/jzus.2006.A0570","article-title":"Algorithm for 2D irregular-shaped nesting problem based on the NFP Algorithm and lowest-gravity-center principle","volume":"7","author":"Liu","year":"2006","journal-title":"Journal of Zhejiang University, Science A"},{"key":"2024121710003886900_bib37","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0895-7177(92)90078-Y","article-title":"Composite stock cutting through simulated annealing","volume":"16","author":"Lutfiyya","year":"1992","journal-title":"Math. Comput. Modelling"},{"key":"2024121710003886900_bib38","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1007\/s00170-024-13436-8","article-title":"Manipulation order optimization in industrial pick-and-place operations: Application to textile and leather industry","volume":"133","author":"Martinez-Peral","year":"2024","journal-title":"International Journal of Advanced Manufacturing Technology"},{"key":"2024121710003886900_bib39","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-642-46787-5_13","article-title":"Algorithms for nesting problems","volume":"396","author":"Oliveira","year":"1993","journal-title":"Lecture Notes in Economics and Mathematical Systems"},{"key":"2024121710003886900_bib40","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s002910050105","article-title":"TOPOS\u2014A new constructive algorithm for nesting problems","volume":"22","author":"Oliveira","year":"2000","journal-title":"OR-Spektrum"},{"key":"2024121710003886900_bib41","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1080\/0951192X.2015.1036522","article-title":"A random-key genetic algorithm for solving the nesting problem","volume":"29","author":"Pinheiro","year":"2016","journal-title":"International Journal of Computer Integrated Manufacturing"},{"key":"2024121710003886900_bib42","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1109\/IEEM.2008.4737855","article-title":"Solving two dimensional layout optimization problems with irregular shapes by using meta-heuristic","author":"Ramakrishnan","year":"2008","journal-title":"2008 IEEE International Conference on Industrial Engineering and Engineering Management"},{"key":"2024121710003886900_bib43","doi-asserted-by":"publisher","first-page":"19","DOI":"10.5267\/j.ijiec.2015.8.004","article-title":"Jaya: A simple and new optimization algorithm for solving constrained and unconstrained optimization problems","volume":"7.1","author":"Rao","year":"2016","journal-title":"International Journal of Industrial Engineering Computations"},{"key":"2024121710003886900_bib44","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78922-4","volume-title":"Jaya: an Advanced Optimization Algorithm and Its Engineering Applications","author":"Rao","year":"2019"},{"key":"2024121710003886900_bib45","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1080\/0305215X.2016.1164855","article-title":"A new optimization algorithm for solving complex constrained design optimization problems","volume-title":"Engineering Optimization","author":"Rao","year":"2017"},{"key":"2024121710003886900_bib46","doi-asserted-by":"publisher","first-page":"5054916","DOI":"10.1155\/2021\/5054916","article-title":"Hybridizing beam search with tabu search for the irregular packing problem","volume":"2021","author":"Rao","year":"2021","journal-title":"Mathematical Problems in Engineering"},{"key":"2024121710003886900_bib47","doi-asserted-by":"publisher","first-page":"1359","DOI":"10.1007\/s00366-018-0668-5","article-title":"A novel hybrid PSO\u2013GWO algorithm for optimization problems","volume":"35","author":"\u015eenel","year":"2019","journal-title":"Engineering with Computers"},{"key":"2024121710003886900_bib48","doi-asserted-by":"publisher","first-page":"268","DOI":"10.4236\/ajor.2013.32024","article-title":"A particle swarm optimization algorithm for a 2-D irregular strip packing problem","volume":"3","author":"Shalaby","year":"2013","journal-title":"American Journal of Operational Research"},{"key":"2024121710003886900_bib49","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/j.cirpj.2014.06.001","article-title":"Optimal directional nesting of planar profiles on fabric bands for composites manufacturing","volume":"7","author":"Siasos","year":"2014","journal-title":"CIRP Journal of Manufacturing Science and Technology"},{"key":"2024121710003886900_bib50","first-page":"1","article-title":"Phi-functions for primary 2D-objects","volume":"2","author":"Stoyan","year":"2001","journal-title":"Studia Universalis"},{"key":"2024121710003886900_bib51","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/s00500-002-0203-9","article-title":"Solution for textile nesting problems using adaptive meta-heuristics and grouping","volume":"7","author":"Takahara","year":"2003","journal-title":"Soft Computing"},{"key":"2024121710003886900_bib52","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s10479-008-0475-2","article-title":"Generalized hyper-heuristics for solving 2D regular and irregular packing problems","volume":"179","author":"Terashima-Marin","year":"2010","journal-title":"Annals of Operations Research"},{"key":"2024121710003886900_bib53","doi-asserted-by":"publisher","first-page":"108928","DOI":"10.1016\/j.asoc.2022.108928","article-title":"Marker planning problem in the apparel industry: Hybrid PSO-based heuristics","volume":"123","author":"Tsao","year":"2022","journal-title":"Applied Soft Computing"},{"key":"2024121710003886900_bib54","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.proeng.2017.04.041","article-title":"Metaheuristic algorithms for nesting problem of rectangular pieces","volume":"183","author":"Valvo","year":"2017","journal-title":"Procedia Engineering"},{"key":"2024121710003886900_bib55","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1093\/jcde\/qwae050","article-title":"Hunger games search algorithm based on stochastic individual information for engineering design optimization problems","volume":"11","author":"Wang","year":"2024","journal-title":"Journal of Computational Design and Engineering"},{"key":"2024121710003886900_bib56","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1533\/9780857097842.81","article-title":"Optimizing cut order planning in apparel production using evolutionary strategies","author":"Wong","year":"2013","journal-title":"Woodhead Publishing Series in Textiles"},{"key":"2024121710003886900_bib57","doi-asserted-by":"publisher","first-page":"473","DOI":"10.3182\/20130708-3-CN-2036.00094","article-title":"A heuristic based on PSO for irregular cutting stock problem","volume-title":"13th IFAC Symposium on Large Scale Complex System: Theory and Applications","author":"Xu","year":"2013"},{"key":"2024121710003886900_bib58","doi-asserted-by":"publisher","first-page":"1229","DOI":"10.1007\/s10845-020-01723-6","article-title":"Comprehensive learning Jaya algorithm for engineering design optimization problems","volume":"33.5","author":"Zhang","year":"2022","journal-title":"Journal of Intelligent Manufacturing"},{"key":"2024121710003886900_bib59","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1093\/jcde\/qwae030","article-title":"Multi-strategy augmented Harris Hawks optimization for feature selection","volume":"11","author":"Zhao","year":"2024","journal-title":"Journal of Computational Design and Engineering"}],"container-title":["Journal of Computational Design and Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/jcde\/advance-article-pdf\/doi\/10.1093\/jcde\/qwae093\/60135352\/qwae093.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/jcde\/article-pdf\/11\/6\/112\/61212299\/qwae093.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/jcde\/article-pdf\/11\/6\/112\/61212299\/qwae093.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,17]],"date-time":"2024-12-17T10:00:53Z","timestamp":1734429653000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/jcde\/article\/11\/6\/112\/7845885"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,26]]},"references-count":59,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,11,8]]}},"URL":"https:\/\/doi.org\/10.1093\/jcde\/qwae093","relation":{},"ISSN":["2288-5048"],"issn-type":[{"type":"electronic","value":"2288-5048"}],"subject":[],"published-other":{"date-parts":[[2024,12]]},"published":{"date-parts":[[2024,10,26]]}}}