{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,2]],"date-time":"2026-10-02T17:14:57Z","timestamp":1790961297093,"version":"4.1.0"},"reference-count":64,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,12,30]],"date-time":"2024-12-30T00:00:00Z","timestamp":1735516800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2024,12,30]],"date-time":"2024-12-30T00:00:00Z","timestamp":1735516800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"name":"The Natural Science Foundation of Wuhan Institute of Technology","award":["K2024017"],"award-info":[{"award-number":["K2024017"]}]},{"name":"The Open Projects of Hubei Engineering Research Center for Intelligent Detection and Identification of Complex Parts","award":["IDICP-KF-2024-12"],"award-info":[{"award-number":["IDICP-KF-2024-12"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["52205536"],"award-info":[{"award-number":["52205536"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci Rep"],"DOI":"10.1038\/s41598-024-81749-5","type":"journal-article","created":{"date-parts":[[2024,12,30]],"date-time":"2024-12-30T19:22:50Z","timestamp":1735586570000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A new approach for bin packing problem using knowledge reuse and improved heuristic"],"prefix":"10.1038","volume":"14","author":[{"given":"Jie","family":"Fang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xubing","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yunqing","family":"Rao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yili","family":"Peng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"kuan","family":"Yan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,12,30]]},"reference":[{"key":"81749_CR1","doi-asserted-by":"crossref","unstructured":"Ke, Q. et al. Electric Vehicle Battery Disassembly sequence planning based on Frame-Subgroup structure combined with genetic Algorithm. Front. Mech. Eng., 6, 576642 (2020).","DOI":"10.3389\/fmech.2020.576642"},{"issue":"3","key":"81749_CR2","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1016\/j.ejor.2005.12.047","volume":"183","author":"W Scher","year":"2007","unstructured":"Scher, W., Hau Ner, G. & Schumann, H. An improved typology of cutting and packing problems. Eur. J. Oper. Res. 183 (3), 1109\u20131130 (2007).","journal-title":"Eur. J. Oper. Res."},{"key":"81749_CR3","doi-asserted-by":"crossref","unstructured":"Kucukyilmaza, T. & Kiziloz, H. E. Cooperative parallel grouping genetic algorithm for the one-dimensional bin packing problem. Comput. Ind. Eng., 125, 157\u2013170. (2018).","DOI":"10.1016\/j.cie.2018.08.021"},{"issue":"4","key":"81749_CR4","doi-asserted-by":"publisher","first-page":"1028","DOI":"10.3390\/math11041028","volume":"11","author":"J Fang","year":"2023","unstructured":"Fang, J. et al. Solving one-dimensional cutting stock problems with the deep reinforcement Learning. Mathematics 11 (4), 1028 (2023).","journal-title":"Mathematics"},{"key":"81749_CR5","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/j.cor.2015.04.024","volume":"63","author":"S Martello","year":"2015","unstructured":"Martello, S. & Monaci, M. Models and algorithms for packing rectangles into the smallest square. Comput. Oper. Res. 63, 161\u2013171 (2015).","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"81749_CR6","doi-asserted-by":"publisher","first-page":"327","DOI":"10.3390\/math11020327","volume":"11","author":"J Fang","year":"2023","unstructured":"Fang, J. et al. A hybrid reinforcement learning algorithm for 2D irregular packing Problems. Mathematics 11 (2), 327 (2023).","journal-title":"Mathematics"},{"key":"81749_CR7","unstructured":"Duan, L. et al. A multi-task selected learning approach for solving 3D flexible bin packing problem. (2018)."},{"key":"81749_CR8","doi-asserted-by":"publisher","first-page":"107683","DOI":"10.1016\/j.knosys.2021.107683","volume":"235","author":"LI","year":"2022","unstructured":"LI et al. One model packs thousands of items with recurrent conditional query learning. Knowl. Based Syst. 235, 107683 (2022).","journal-title":"Knowl. Based Syst."},{"issue":"16","key":"81749_CR9","doi-asserted-by":"publisher","first-page":"12589","DOI":"10.1016\/j.eswa.2012.05.025","volume":"39","author":"A Valle","year":"2012","unstructured":"Valle, A. et al. Heuristics for two-dimensional knapsack and cutting stock problems with items of irregular shape. Expert Syst. Appl. 39 (16), 12589\u201312598 (2012).","journal-title":"Expert Syst. Appl."},{"key":"81749_CR10","doi-asserted-by":"crossref","unstructured":"KOROUPI, F. & LOFTUS, M. Accommodating Diverse Shapes within Hexagonal pavers[J]291507\u20131519, (1991). 8.","DOI":"10.1080\/00207549108948028"},{"key":"81749_CR11","doi-asserted-by":"publisher","first-page":"104108","DOI":"10.1016\/j.apor.2024.104108","volume":"150","author":"W Yunlong","year":"2024","unstructured":"Yunlong, W. et al. Research on intelligent nesting algorithm for irregular ship parts based on no-fit-polygon. Appl. Ocean Res. 150, 104108 (2024).","journal-title":"Appl. Ocean Res."},{"key":"81749_CR12","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.ijpe.2017.09.014","volume":"195","author":"ABEYSOORIYARP BENNELL","year":"2018","unstructured":"BENNELL, A. B. E. Y. S. O. O. R. I. Y. A. R. P., Julia, A., MARTINEZ-SYKORA & Antonio Jostle heuristics for the 2D-irregular shapes bin packing problems with free rotation. Int. J. Prod. Econ. 195, 12\u201326 (2018).","journal-title":"Int. J. Prod. Econ."},{"issue":"SEP","key":"81749_CR13","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1016\/j.eswa.2017.03.059","volume":"81","author":"LR Mundim","year":"2017","unstructured":"Mundim, L. R., Andretta, M. & Queiroz, T. D. A biased random key genetic algorithm for open dimension nesting problems using no-fit raster. Expert Syst. Appl. 81 (SEP.), 358\u2013371 (2017).","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"81749_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10898-018-0638-x","volume":"72","author":"LH Cherri","year":"2018","unstructured":"Cherri, L. H., Cherri, A. C. & Soler, E. M. Mixed integer quadratically-constrained programming model to solve the irregular strip packing problem with continuous rotations. J. Global Optim. 72 (1), 1\u201319 (2018).","journal-title":"J. Global Optim."},{"issue":"3","key":"81749_CR15","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s10732-008-9088-9","volume":"15","author":"M Fischetti","year":"2009","unstructured":"Fischetti, M. & Luzzi, I. Mixed-integer programming models for nesting problems. J. Heuristics. 15 (3), 201\u2013226 (2009).","journal-title":"J. Heuristics"},{"key":"81749_CR16","doi-asserted-by":"crossref","unstructured":"Guo, B. et al. Two-dimensional irregular packing problems: a Review. Front. Mech. Eng., :79. (2022).","DOI":"10.3389\/fmech.2022.966691"},{"issue":"4-part-1","key":"81749_CR17","doi-asserted-by":"publisher","first-page":"948","DOI":"10.1287\/opre.1090.0770","volume":"58","author":"EK Burke","year":"2010","unstructured":"Burke, E. K. et al. Irregular packing using the line and arc no-fit polygon. Oper. Res. 58 (4-part-1), 948\u2013970 (2010).","journal-title":"Oper. Res."},{"issue":"8","key":"81749_CR18","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1109\/TC.1983.1676307","volume":"100","author":"Chazelle","year":"1983","unstructured":"Chazelle The bottomn-left bin-packing heuristic: an efficient implementation. IEEE Trans. Comput. 100 (8), 697\u2013707 (1983).","journal-title":"IEEE Trans. Comput."},{"key":"81749_CR19","doi-asserted-by":"crossref","unstructured":"Wang, X., Dai, C., Zhang, Q. & Tan, M. Layout Optimization of Square Parts Based on BL-IGA Algorithm[C]. In2023 38th Youth Academic Annual Conference of Chinese Association of Automation (YAC), pp. 1051\u20131056.","DOI":"10.1109\/YAC59482.2023.10401517"},{"issue":"1","key":"81749_CR20","first-page":"5546940","volume":"2024","author":"P Mehta","year":"2024","unstructured":"Mehta, P., Kumar, S. & Tejani, G. G. M. O. B. B. O. A Multiobjective Brown Bear optimization algorithm for solving constrained structural optimization Problems[J]. J. Optim. 2024 (1), 5546940 (2024).","journal-title":"J. Optim."},{"issue":"1","key":"81749_CR21","doi-asserted-by":"publisher","first-page":"2114196","DOI":"10.1080\/23311916.2022.2114196","volume":"9","author":"A Nonut","year":"2022","unstructured":"Nonut, A. et al. A small fixed-wing UAV system identification using metaheuristics. Cogent Eng. 9 (1), 2114196 (2022).","journal-title":"Cogent Eng."},{"key":"81749_CR22","doi-asserted-by":"crossref","unstructured":"Chibante, R. (ed) Simulated Annealing: Theory with applications[D] (BoD\u2013Books on Demand, 2010).","DOI":"10.5772\/252"},{"key":"81749_CR23","doi-asserted-by":"crossref","unstructured":"Prajapati, V. K., Jain, M. & Chouhan, L. Tabu search algorithm (TSA): A comprehensive survey[C]\/\/2020 3rd International Conference on Emerging Technologies in Computer Engineering: Machine Learning and Internet of Things (ICETCE). IEEE, : 1\u20138. (2020).","DOI":"10.1109\/ICETCE48199.2020.9091743"},{"issue":"1","key":"81749_CR24","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0377-2217(94)00166-9","volume":"88","author":"S Jakobs","year":"1996","unstructured":"Jakobs, S. On genetic algorithms for packing of polygons. Eur. J. Oper. Res. 88 (1), 165\u2013181 (1996).","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"81749_CR25","first-page":"266","volume":"4","author":"M Li","year":"2005","unstructured":"Li, M., SONG, C. F. & ZHOU, Z. K. Two dimensional irregular parts packing with particle swarm optimization. J. South. Yangtze Univ. 4 (3), 266\u2013269 (2005).","journal-title":"J. South. Yangtze Univ."},{"key":"81749_CR26","doi-asserted-by":"publisher","first-page":"105311","DOI":"10.1016\/j.engappai.2022.105311","volume":"115","author":"E Kaya","year":"2022","unstructured":"Kaya, E. et al. A review on the studies employing artificial bee colony algorithm to solve combinatorial optimization problems. Eng. Appl. Artif. Intell. 115, 105311 (2022).","journal-title":"Eng. Appl. Artif. Intell."},{"key":"81749_CR27","doi-asserted-by":"crossref","unstructured":"Sato, A. K., Martins, T. C. & Guerra Tsuzuki, M. S. A study on GPU acceleration applied to 2D irregular packing problems. Int. J. Comput. Integr. Manuf., (4\/6):35. (2022).","DOI":"10.1080\/0951192X.2022.2050302"},{"issue":"1","key":"81749_CR28","first-page":"51","volume":"2","author":"G Abhishek","year":"2017","unstructured":"Abhishek, G. et al. Insights on transfer optimization: because experience is the best Teacher. IEEE Trans. Emerg. Top. Comput. Intell. 2 (1), 51\u201364 (2017).","journal-title":"IEEE Trans. Emerg. Top. Comput. Intell."},{"issue":"4","key":"81749_CR29","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1109\/TEVC.2013.2281537","volume":"18","author":"M Iqbal","year":"2014","unstructured":"Iqbal, M., Browne, W. N. & Zhang, M. Reusing Building blocks of extracted knowledge to Solve Complex, large-scale boolean Problems. IEEE Trans. Evol. Comput. 18 (4), 465\u2013480 (2014).","journal-title":"IEEE Trans. Evol. Comput."},{"key":"81749_CR30","doi-asserted-by":"crossref","unstructured":"Asta, S. et al. Generalizing hyper-heuristics via apprenticeship learning[C]. Evolutionary Computation in Combinatorial Optimization: 13th European Conference, EvoCOP, Vienna, Austria, April 3\u20135. (2013).","DOI":"10.1007\/978-3-642-37198-1_15"},{"key":"81749_CR31","unstructured":"Pelikan, M. & Hauschild, M. W. and Pier Luca Lanzi. Transfer learning, soft distance-based bias, and the hierarchical boa[C]. Parallel Problem Solving from Nature-PPSN XII: 12th International Conference, Taormina, Italy, September 1\u20135."},{"key":"81749_CR32","doi-asserted-by":"crossref","unstructured":"Mazyavkina, N. et al. Reinforcement Learning for Combinatorial Optimization: A survey[J]134105400 (Computers & Operations Research, 2021).","DOI":"10.1016\/j.cor.2021.105400"},{"issue":"8","key":"81749_CR33","doi-asserted-by":"publisher","first-page":"864","DOI":"10.3390\/math9080864","volume":"9","author":"Q Xu","year":"2021","unstructured":"Xu, Q. et al. Multi-task optimization and multi-task evolutionary computation in the past five years: a brief review. Mathematics 9 (8), 864 (2021).","journal-title":"Mathematics"},{"issue":"6","key":"81749_CR34","doi-asserted-by":"publisher","first-page":"1424","DOI":"10.1109\/TEVC.2021.3133874","volume":"26","author":"X Xue","year":"2021","unstructured":"Xue, X. et al. Evolutionary sequential transfer optimization for objective-heterogeneous problems. IEEE Trans. Evol. Comput. 26 (6), 1424\u20131438 (2021).","journal-title":"IEEE Trans. Evol. Comput."},{"key":"81749_CR35","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s12293-015-0166-x","volume":"7","author":"L Feng","year":"2015","unstructured":"Feng, L. et al. Memes as building blocks: a case study on evolutionary optimization\u2009+\u2009transfer learning for routing problems, Memetic Comput. 7, 159\u2013180 (2015).","journal-title":"Memetic Comput."},{"key":"81749_CR36","doi-asserted-by":"crossref","unstructured":"Gupta, A. et al. On the emerging notion of evolutionary multitasking: a computational analog of cognitive multitasking. Recent. Adv. Evolutionary Multi-objective Optim., :139\u2013157. (2017).","DOI":"10.1007\/978-3-319-42978-6_5"},{"key":"81749_CR37","doi-asserted-by":"crossref","unstructured":"DA et al. Evolutionary multitasking across single and multi-objective formulations for improved problem solving [C]. In: 2016 IEEE Congress on Evolutionary Computation (CEC). IEEE, 1695\u20131701. (2016).","DOI":"10.1109\/CEC.2016.7743992"},{"key":"81749_CR38","unstructured":"MANN, Y. O. G. A. T. A. M. A. D. & Gideon Efficient transfer learning method for automatic hyperparameter tuning[C]. In: Artificial intelligence and statistics. PMLR, pp. 1077\u20131085. (2014)."},{"key":"81749_CR39","doi-asserted-by":"crossref","unstructured":"O\u2019NEILL et al. Common subtrees in related problems: a novel transfer learning approach for genetic programming[C]. In: 2017 IEEE Congress on Evolutionary Computation (CEC). IEEE, 1287\u20131294. (2017).","DOI":"10.1109\/CEC.2017.7969453"},{"issue":"1","key":"81749_CR40","doi-asserted-by":"publisher","first-page":"172","DOI":"10.31577\/cai_2022_1_172","volume":"41","author":"A Yaddaden","year":"2022","unstructured":"Yaddaden, A., Harispe, S. & Vasquez, M. Is transfer learning helpful for neural combinatorial optimization Applied to vehicle routing problems?. Comput. Inform. 41 (1), 172\u2013190 (2022).","journal-title":"Comput. Inform."},{"issue":"8","key":"81749_CR41","doi-asserted-by":"publisher","first-page":"1238","DOI":"10.1080\/0951192X.2023.2165160","volume":"36","author":"F Ning","year":"2023","unstructured":"Ning, F. et al. Manufacturing cost estimation based on similarity. Int. J. Comput. Integr. Manuf. 36 (8), 1238\u20131253 (2023).","journal-title":"Int. J. Comput. Integr. Manuf."},{"key":"81749_CR42","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s12293-015-0162-1","volume":"7","author":"C Patvardhan","year":"2015","unstructured":"Patvardhan, C., Bansal, S. & Srivastav, A. Quantum-inspired evolutionary algorithm for difficult knapsack problems. Memetic Comput. 7, 135\u2013155 (2015).","journal-title":"Memetic Comput."},{"key":"81749_CR43","doi-asserted-by":"crossref","unstructured":"PILLAY, S. C. H. E. E. P. E. R. S. D. Nelishia. A study of transfer learning in a generation constructive hyper-heuristic for one dimensional bin packing[C]. In: 2021 IEEE Symposium Series on Computational Intelligence (SSCI). IEEE, pp. 1\u20137. (2021).","DOI":"10.1109\/SSCI50451.2021.9660092"},{"key":"81749_CR44","doi-asserted-by":"crossref","unstructured":"ALODAT, M. Deep Transfer Learning and Intelligent Item Packing in Retail Management[C]. In: Machine Learning, Image Processing, Network Security and Data Sciences: Select Proceedings of 3rd International Conference on MIND 2021. Singapore: Springer Nature Singapore, pp. 41\u201352. (2023).","DOI":"10.1007\/978-981-19-5868-7_4"},{"key":"81749_CR45","doi-asserted-by":"publisher","first-page":"131223","DOI":"10.1109\/ACCESS.2021.3114331","volume":"9","author":"J Fang","year":"2021","unstructured":"Fang, J. et al. Sequence transfer-based particle swarm optimization algorithm for irregular packing problems. IEEE Access. 9, 131223\u2013131235 (2021).","journal-title":"IEEE Access."},{"issue":"12","key":"81749_CR46","doi-asserted-by":"publisher","first-page":"3236","DOI":"10.13196\/j.cims.2020.12.006","volume":"26","author":"XF Xu","year":"2020","unstructured":"Xu, X. F. et al. Transfer ants reinforcement learning algorithm and its application on rectangular packing problem. Comput. Integr. Manuf. Syst. J. 26 (12), 3236\u20133247. https:\/\/doi.org\/10.13196\/j.cims.2020.12.006 (2020).","journal-title":"Comput. Integr. Manuf. Syst. J."},{"issue":"11","key":"81749_CR47","first-page":"2921","volume":"21","author":"F Zhang","year":"2015","unstructured":"Zhang, F. et al. Packing optimization of rectangle workpieces oriented to variable-sized bin. Comput. Integr. Manuf. Syst. 21 (11), 2921\u20132928 (2015).","journal-title":"Comput. Integr. Manuf. Syst."},{"issue":"22","key":"81749_CR48","doi-asserted-by":"publisher","first-page":"6772","DOI":"10.1080\/00207543.2021.1887534","volume":"60","author":"X Xu","year":"2022","unstructured":"Xu, X. et al. Multi-objective robust optimisation model for MDVRPLS in refined oil distribution. Int. J. Prod. Res. 60 (22), 6772\u20136792 (2022).","journal-title":"Int. J. Prod. Res."},{"issue":"3","key":"81749_CR49","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1016\/j.ejor.2019.04.045","volume":"282","author":"AA Leao","year":"2020","unstructured":"Leao, A. A. et al. Irregular packing problems: a review of mathematical models. Eur. J. Oper. Res. 282 (3), 803\u2013822 (2020).","journal-title":"Eur. J. Oper. Res."},{"key":"81749_CR50","unstructured":"Art, R. C. Jr An Approach to the Two Dimensional Irregular Cutting Stock problem[D] (Massachusetts Institute of Technology, 1966)."},{"issue":"1","key":"81749_CR51","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.ejor.2006.03.011","volume":"179","author":"EK Burke","year":"2007","unstructured":"Burke, E. K. et al. Complete and robust no-fit polygon generation for the irregular stock cutting problem. Eur. J. Oper. Res. 179 (1), 27\u201349 (2007).","journal-title":"Eur. J. Oper. Res."},{"key":"81749_CR52","unstructured":"Liu Huyao. Research of Two Dimensional Nesting Algorithm Based on no Fit Polygon [D] (Shang Hai Jiao Tong University, 2007)."},{"issue":"03","key":"81749_CR53","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1142\/S0218195902000803","volume":"12","author":"M Keil","year":"2002","unstructured":"Keil, M. & Snoeyink, J. On the time bound for convex decomposition of simple polygons. Int. J. Comput. Geom. Appl. 12 (03), 181\u2013192 (2002).","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"1","key":"81749_CR54","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/j.cor.2006.02.026","volume":"35","author":"JA Bennell","year":"2008","unstructured":"Bennell, J. A. & Song, X. A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums. Comput. Oper. Res. 35 (1), 267\u2013281 (2008).","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"81749_CR55","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1016\/0377-2217(95)00021-H","volume":"84","author":"Z Li","year":"1995","unstructured":"Li, Z. & Milenkovic, V. Compaction and separation algorithms for non-convex polygons and their applications. Eur. J. Oper. Res. 84 (3), 539\u2013561 (1995).","journal-title":"Eur. J. Oper. Res."},{"key":"81749_CR56","doi-asserted-by":"publisher","first-page":"106687","DOI":"10.1016\/j.cie.2020.106687","volume":"148","author":"H Frat","year":"2020","unstructured":"Frat, H. & Alpaslan, N. An effective approach to the two-dimensional rectangular packing problem in the manufacturing industry. Comput. Ind. Eng. 148, 106687 (2020).","journal-title":"Comput. Ind. Eng."},{"key":"81749_CR57","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1016\/j.patcog.2017.10.013","volume":"77","author":"J Gu","year":"2018","unstructured":"Gu, J. et al. Recent advances in convolutional neural networks[J]. Pattern Recogn. 77, 354\u2013377 (2018).","journal-title":"Pattern Recogn."},{"key":"81749_CR58","doi-asserted-by":"crossref","unstructured":"Bromley, J. et al. Signature Verification Using a Siamese time Delay Neural network[J]6 (Advances in neural information processing systems, 1993).","DOI":"10.1142\/9789812797926_0003"},{"key":"81749_CR59","unstructured":"Simonyan, K. & Zisserman, A. Very deep convolutional networks for large-scale image recognition. arXiv preprint arXiv:1409.1556. (2014)."},{"issue":"4","key":"81749_CR60","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1109\/34.993558","volume":"24","author":"S Belongie","year":"2002","unstructured":"Belongie, S., Malik, J. & Puzicha, J. Shape matching and object recognition using shape contexts. IEEE Trans. Pattern Anal. Mach. Intell. 24 (4), 509\u2013522 (2002).","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1","key":"81749_CR61","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0305-0548(90)90031-2","volume":"17","author":"MB Wright","year":"1990","unstructured":"Wright, M. B. Speeding up the Hungarian algorithm. Comput. Oper. Res. 17 (1), 95\u201396 (1990).","journal-title":"Comput. Oper. Res."},{"key":"81749_CR62","doi-asserted-by":"crossref","unstructured":"Jie, F. A. N. G. et al. A reinforcement learning algorithm for two-dimensional irregular packing problems[C]. In: Proceedings of the 2021 4th International Conference on Algorithms, Computing and Artificial Intelligence. pp. 1\u20136. (2021).","DOI":"10.1145\/3508546.3508614"},{"key":"81749_CR63","unstructured":"Du, B. Guo Xiaoqiang; Fang Jie; Wang Peng; Rao Yunqing.A Hybrid Solving Algorithm on two-dimensional Irregular Graphics Nesting Problem4739\u201345 (Forging & Stamping Technology, 2022). 3."},{"issue":"11","key":"81749_CR64","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1080\/0951192X.2015.1036522","volume":"29","author":"PR Pinheiro","year":"2016","unstructured":"Pinheiro, P. R., Amaro J\u00fanior, B. & Saraiva, R. D. A random-key genetic algorithm for solving the nesting problem. Int. J. Comput. Integr. Manuf. 29 (11), 1159\u20131165 (2016).","journal-title":"Int. J. Comput. Integr. Manuf."}],"container-title":["Scientific Reports"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.nature.com\/articles\/s41598-024-81749-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41598-024-81749-5","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41598-024-81749-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,30]],"date-time":"2024-12-30T20:04:05Z","timestamp":1735589045000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.nature.com\/articles\/s41598-024-81749-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,30]]},"references-count":64,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,12]]}},"alternative-id":["81749"],"URL":"https:\/\/doi.org\/10.1038\/s41598-024-81749-5","relation":{},"ISSN":["2045-2322"],"issn-type":[{"value":"2045-2322","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,30]]},"assertion":[{"value":"3 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 November 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 December 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}],"article-number":"31708"}}