{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T12:51:09Z","timestamp":1761396669742,"version":"3.40.5"},"reference-count":70,"publisher":"Wiley","license":[{"start":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T00:00:00Z","timestamp":1699228800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Applied Computational Intelligence and Soft Computing"],"published-print":{"date-parts":[[2023,11,6]]},"abstract":"<jats:p>The stochastic skiving stock problem (SSP), a relatively new combinatorial optimization problem, is considered in this paper. The conventional SSP seeks to determine the optimum structure that skives small pieces of different sizes side by side to form as many large items (products) as possible that meet a desired width. This study studies a multiproduct case for the SSP under uncertain demand and waste rate, including products of different widths. This stochastic version of the SSP considers a random demand for each product and a random waste rate during production. A two-stage stochastic programming approach with a recourse action is implemented to study this stochastic <jats:inline-formula>\n                     <a:math xmlns:a=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M1\">\n                        <a:mi mathvariant=\"script\">N<\/a:mi>\n                        <a:mi mathvariant=\"script\">P<\/a:mi>\n                     <\/a:math>\n                  <\/jats:inline-formula>-hard problem on a large scale. Furthermore, the problem is solved in two phases. In the first phase, the dragonfly algorithm constructs minimal patterns that serve as an input for the next phase. The second phase performs sample-average approximation, solving the stochastic production problem. Results indicate that the two-phase heuristic approach is highly efficient regarding computational run time and provides robust solutions with an optimality gap of 0.3% for the worst-case scenario. In addition, we also compare the performance of the dragonfly algorithm (DA) to the particle swarm optimization (PSO) for pattern generation. Benchmarks indicate that the DA produces more robust minimal pattern sets as the tightness of the problem increases.<\/jats:p>","DOI":"10.1155\/2023\/9918022","type":"journal-article","created":{"date-parts":[[2023,11,7]],"date-time":"2023-11-07T00:05:15Z","timestamp":1699315515000},"page":"1-23","source":"Crossref","is-referenced-by-count":2,"title":["A Two-Phase Pattern Generation and Production Planning Procedure for the Stochastic Skiving Process"],"prefix":"10.1155","volume":"2023","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5562-6367","authenticated-orcid":true,"given":"Tolga Kudret","family":"Karaca","sequence":"first","affiliation":[{"name":"Department of Computer Engineering, Istanbul Topkap\u0131 University, Zeytinburnu, Istanbul 34087, T\u00fcrkiye"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3838-8824","authenticated-orcid":true,"given":"Funda","family":"Samanlioglu","sequence":"additional","affiliation":[{"name":"Department of Industrial Engineering, Kadir Has University, Cibali, Istanbul 34083, T\u00fcrkiye"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6066-5336","authenticated-orcid":true,"given":"Ayca","family":"Altay","sequence":"additional","affiliation":[{"name":"Department of Industrial and Systems Engineering, Rutgers University, 96 Frelinghuysen Rd., Piscataway, NJ 08540, USA"}]}],"member":"311","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.1111\/1475-3995.00433"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.50.6.923.348"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1155\/2019\/6507054"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ifacol.2016.07.557"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2019.104770"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2020.03.060"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1111\/itor.12390"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1007\/s10479.008.0454.7"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2008.04.042"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1504\/ijmor.2013.050604"},{"key":"11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-0237-4","volume-title":"Introduction to Stochastic Programming","author":"J. R. Birge","year":"2011"},{"volume-title":"Stochastic Programming","year":"1994","author":"P. Kall","key":"12"},{"key":"13","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611973433","volume-title":"Lectures on Stochastic Programming: Modeling and Theory","author":"A. Shapiro","year":"2014"},{"key":"14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-1-4684-9256-9_1","article-title":"Stochastic programming models: wait-and-see versus here-and-now","volume-title":"Decision Making Under Uncertainty","author":"R. J. Wets","year":"2002"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-015-1920-1"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1007\/bf01580086"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1137\/s003614459531004x"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.12.047"},{"key":"19","doi-asserted-by":"publisher","DOI":"10.1080\/02331934.2018.1494171"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2015.11.005"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1007\/s00186-016-0552-2"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1590\/0101-7438.2019.039.01.0001"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(84)90004-x"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1287\/opre.11.6.863"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2003.12.021"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1287\/opre.9.6.849"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2023.109164"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.5772\/59793"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1016\/s0305-0548(00)00095-2"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(95)00102-6"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1186\/2251-712x-8-24"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1016\/s0360-8352(96)00205-7"},{"key":"33","first-page":"1","article-title":"Ant colony optimisation for bin packing and cutting stock problems","volume-title":"UK Workshop on Computational Intelligence","author":"F. Ducatelle","year":"2001"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601771"},{"key":"35","first-page":"166","article-title":"Genetic algorithms for cutting stock problems: with and without contiguity","volume-title":"Progress in Evolutionary Computation","author":"R. Hinterding","year":"1993"},{"key":"36","doi-asserted-by":"publisher","DOI":"10.1016\/s0360-8352(01)00021-3"},{"key":"37","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2013.02.009"},{"key":"38","doi-asserted-by":"publisher","DOI":"10.1590\/s0101-74382009000200006"},{"key":"39","doi-asserted-by":"publisher","DOI":"10.1016\/s0305-0548(01)00039-9"},{"key":"40","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-015-1839-6"},{"key":"41","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2017.05.015"},{"article-title":"Column generation within the L-shaped method for stochastic linear programs","year":"2008","author":"M. C. Demirci","key":"42"},{"key":"43","doi-asserted-by":"publisher","DOI":"10.1080\/10170669.2012.744362"},{"key":"44","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2006.03.026"},{"key":"45","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.27.8.946"},{"key":"46","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.02.022"},{"key":"47","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2016.09.019"},{"key":"48","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2010.11.042"},{"key":"49","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2009.03.018"},{"first-page":"136","article-title":"A dragonfly algorithm for solving traveling salesman problem","author":"A. I. Hammouri","key":"50"},{"key":"51","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-020-03317-8"},{"first-page":"491","article-title":"Solving 0\u20131 knapsack problems by binary dragonfly algorithm","author":"M. Abdel-Basset","key":"52"},{"first-page":"12","article-title":"Binary dragonfly algorithm for feature selection","author":"M. M. Mafarja","key":"53"},{"key":"54","doi-asserted-by":"publisher","DOI":"10.4018\/ijsir.2019070102"},{"key":"55","doi-asserted-by":"publisher","DOI":"10.1016\/j.egypro.2019.01.476"},{"key":"56","unstructured":"AydinN.Sampling based progressive hedging algorithms for stochastic programming problems2012Detroit, MichiganWayne State UniversityPhD Thesis"},{"volume-title":"Complexity of Two and Multi-Stage Stochastic Programming Problems","year":"2005","author":"A. Shapiro","key":"57"},{"key":"58","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1137\/S1052623499363220","article-title":"The sample average approximation method for stochastic programs with integer recourse","volume":"12","author":"S. Ahmed","year":"2002","journal-title":"SIAM Journal on Optimization"},{"key":"59","doi-asserted-by":"publisher","DOI":"10.1007\/s001860300280"},{"key":"60","doi-asserted-by":"publisher","DOI":"10.1137\/s1052623499363220"},{"volume-title":"Optimization In Operations Research","year":"1998","author":"R. L. Rardin","key":"61"},{"volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","year":"1979","author":"M. Garey","key":"62"},{"key":"63","doi-asserted-by":"publisher","DOI":"10.1137\/s0097539700382820"},{"key":"64","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2021.107549"},{"key":"65","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-812441-3.00002-1"},{"key":"66","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.11.043"},{"first-page":"1","article-title":"Optimal bidding strategy for demand response aggregator in day-ahead markets via stochastic programming and robust optimization","author":"M. Wei","key":"67"},{"key":"68","doi-asserted-by":"publisher","DOI":"10.1021\/acssuschemeng.2c00211"},{"key":"69","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2023.106348"},{"key":"70","doi-asserted-by":"publisher","DOI":"10.1016\/j.scs.2022.103935"}],"container-title":["Applied Computational Intelligence and Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/acisc\/2023\/9918022.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/acisc\/2023\/9918022.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/acisc\/2023\/9918022.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,7]],"date-time":"2023-11-07T00:05:24Z","timestamp":1699315524000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/acisc\/2023\/9918022\/"}},"subtitle":[],"editor":[{"given":"Yiming","family":"Tang","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2023,11,6]]},"references-count":70,"alternative-id":["9918022","9918022"],"URL":"https:\/\/doi.org\/10.1155\/2023\/9918022","relation":{},"ISSN":["1687-9732","1687-9724"],"issn-type":[{"type":"electronic","value":"1687-9732"},{"type":"print","value":"1687-9724"}],"subject":[],"published":{"date-parts":[[2023,11,6]]}}}