{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:19:33Z","timestamp":1740169173653,"version":"3.37.3"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100012309","name":"Thailand Research Fund through the Royal Golden Jubilee Ph.D. Program","doi-asserted-by":"publisher","award":["PHD\/0099\/2557"],"award-info":[{"award-number":["PHD\/0099\/2557"]}],"id":[{"id":"10.13039\/501100012309","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.3008922","type":"journal-article","created":{"date-parts":[[2020,7,13]],"date-time":"2020-07-13T21:54:01Z","timestamp":1594677241000},"page":"130647-130660","source":"Crossref","is-referenced-by-count":3,"title":["Trim Loss Optimization in Paper Production Using Reinforcement Artificial Bee Colony"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2746-0595","authenticated-orcid":false,"given":"Suthida","family":"Fairee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0828-5798","authenticated-orcid":false,"given":"Charoenchai","family":"Khompatraporn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8541-1922","authenticated-orcid":false,"given":"Booncharoen","family":"Sirinaovakul","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Santitham","family":"Prom-On","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"crossref","first-page":"547","DOI":"10.22237\/jmasm\/1509496200","article-title":"JMASM 49: A compilation of some popular goodness of fit tests for normal distribution: Their algorithms and MATLAB codes (MATLAB)","volume":"16","author":"kocako\u00e7","year":"2017","journal-title":"J Modern Appl Statist Meth"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.5812\/ijem.3505"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1287\/opre.11.6.863"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1287\/opre.6.3.419"},{"article-title":"An idea based on honey bee swarm for numerical optimization","year":"2005","author":"karaboga","key":"ref31"},{"article-title":"Improving Artificial Bee Colony algorithm by reinforcement learning","year":"2019","author":"fairee","key":"ref30"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.4135\/9781412985949"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ASYU.2018.8554009"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2010.07.015"},{"journal-title":"Cutting Stock Problem Solver-Based","year":"2020","key":"ref34"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1111\/itor.12390","article-title":"A heuristic for the skiving and cutting stock problem in paper and plastic film industries","volume":"26","author":"chen","year":"2019","journal-title":"Int Trans Oper Res"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-008-0323-y"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"5675","DOI":"10.1080\/00207543.2014.903347","article-title":"Multiple-choice knapsack-based heuristic algorithm for the two-stage two-dimensional cutting stock problem in the paper industry","volume":"52","author":"kim","year":"2014","journal-title":"Int J Prod Res"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"6111","DOI":"10.1007\/s00500-017-2666-8","article-title":"Solving binary cutting stock with matheuristics using particle swarm optimization and simulated annealing","volume":"22","author":"sanchez","year":"2018","journal-title":"Soft Comput"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1016\/j.ejor.2014.03.027","article-title":"Solving real-world cutting stock-problems in the paper industry: Mathematical approaches, experience and challenges","volume":"238","author":"kallrath","year":"2014","journal-title":"Eur J Oper Res"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0925-5273(94)00045-X","article-title":"The cutting stock problem—A survey","volume":"36","author":"cheng","year":"1994","journal-title":"Int J Prod Econ"},{"key":"ref15","first-page":"3166","article-title":"Gbest-guided artificial bee colony algorithm for numerical function optimization","volume":"217","author":"zhu","year":"2010","journal-title":"Appl Math Comput"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2020.03.064"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s13369-018-3562-y"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.06.044"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2019.06.021"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.01.016"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s11750-019-00531-3"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.01.001"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2008.07.001"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/j.ejor.2013.11.026","article-title":"The one-dimensional cutting stock problem with usable leftovers—A survey","volume":"236","author":"cherri","year":"2014","journal-title":"Eur J Oper Res"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0200738"},{"journal-title":"Algorithms for Knapsack problems","year":"1990","author":"martello","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(91)90293-5"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1057\/s41274-016-0098-y","article-title":"New model and heuristic solution approach for one-dimensional cutting stock problem with usable leftovers","volume":"68","author":"cui","year":"2017","journal-title":"J Oper Res Soc"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2018.2819680"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"614","DOI":"10.1016\/j.cor.2006.03.026","article-title":"Roll assortment optimization in a paper mill: An integer programming approach","volume":"35","author":"chauhan","year":"2008","journal-title":"Comput Oper Res"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2019.05.013"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2011.08.003"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2018.05.006"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.03.001"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ECTI-CON47248.2019.8955176"},{"key":"ref41","first-page":"255","article-title":"KEEL data-mining software tool: Data set repository, integration of algorithms and experimental analysis framework","volume":"17","author":"alcal\u00e1-fdez","year":"2011","journal-title":"J Multiple-Valued Logic Soft Comput"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1142\/S0218213019500040"},{"key":"ref26","first-page":"25","article-title":"Artificial Bee Colony algorithm variants and its application to colormap quantization","author":"akay","year":"2018","journal-title":"Evolutionary and Swarm Intelligence Algorithms"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2018.08.004"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09139502.pdf?arnumber=9139502","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T01:09:45Z","timestamp":1641949785000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9139502\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":41,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3008922","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2020]]}}}