{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T15:07:52Z","timestamp":1773760072229,"version":"3.50.1"},"reference-count":42,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T00:00:00Z","timestamp":1773705600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62372469"],"award-info":[{"award-number":["62372469"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>Engineering drawings are fundamental to industries such as oil and gas, construction, and manufacturing. However, current practices relying on manual design or rigid parametric templates often suffer from inefficiency and layout inconsistencies. To address these issues, the layout task is formulated as the Orthogonal Rectangle Packing Problem with Multiple Configurations and Complex Constraints (ORPPMC). The Deep Reinforcement Learning for Multi-Configuration Drawing Layout (DRL-MCDL) framework is proposed, which integrates the Pointer Network for Drawing Element Sequencing (PN-DES) with the Target-Type-Matching-based Multi-Pattern Positioning Strategy (TTM-MPPS). Within this framework, PN-DES employs deep reinforcement learning and feature fusion to combine element attributes with layout configurations for optimal sequence inference, while TTM-MPPS performs precise positioning in accordance with industrial rules to ensure strict adherence to aesthetic requirements. Ablation experiments validate the contribution of each module. Experimental results on real-world engineering drawings demonstrate that DRL-MCDL achieves a Feasibility Rate (FR) exceeding 98.5% on standard instances (12\u201340 elements), significantly outperforming traditional methods. Furthermore, it maintains a high inference efficiency with an Average Time (AT) of less than 0.3 s, striking an optimal balance between layout quality and computational speed.<\/jats:p>","DOI":"10.3390\/a19030226","type":"journal-article","created":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T12:42:16Z","timestamp":1773751336000},"page":"226","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Feature-Fusion Deep Reinforcement Learning Framework for Multi-Configuration Engineering Drawing Layout"],"prefix":"10.3390","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3745-6899","authenticated-orcid":false,"given":"Yunlei","family":"Sun","sequence":"first","affiliation":[{"name":"Qingdao Institute of Software, College of Computer Science and Technology, China University of Petroleum (East China), Qingdao 266580, China"},{"name":"Shandong Key Laboratory of Intelligent Oil & Gas Industrial Software, Qingdao 266580, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peng","family":"Dai","sequence":"additional","affiliation":[{"name":"Qingdao Institute of Software, College of Computer Science and Technology, China University of Petroleum (East China), Qingdao 266580, China"},{"name":"Shandong Key Laboratory of Intelligent Oil & Gas Industrial Software, Qingdao 266580, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-4029-4746","authenticated-orcid":false,"given":"Yangxingyue","family":"Liu","sequence":"additional","affiliation":[{"name":"Qingdao Institute of Software, College of Computer Science and Technology, China University of Petroleum (East China), Qingdao 266580, China"},{"name":"Shandong Key Laboratory of Intelligent Oil & Gas Industrial Software, Qingdao 266580, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao","family":"Liu","sequence":"additional","affiliation":[{"name":"Qingdao Institute of Software, College of Computer Science and Technology, China University of Petroleum (East China), Qingdao 266580, China"},{"name":"Shandong Key Laboratory of Intelligent Oil & Gas Industrial Software, Qingdao 266580, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2026,3,17]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Li, J., and Yan, H. (2022, January 3\u20135). Engineering drawing retrieval system based on bag of visual words model. Proceedings of the 2022 IEEE 6th Advanced Information Technology, Electronic and Automation Control Conference (IAEAC), Beijing, China.","DOI":"10.1109\/IAEAC54830.2022.9929624"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"1695","DOI":"10.1007\/s00521-018-3583-1","article-title":"New trends on digitisation of complex engineering drawings","volume":"31","author":"Elyan","year":"2019","journal-title":"Neural Comput. Appl."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/j.neunet.2020.05.025","article-title":"Deep learning for symbols detection and classification in engineering drawings","volume":"129","author":"Elyan","year":"2020","journal-title":"Neural Netw."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Moreno-Garc\u00eda, C.F., Elyan, E., and Jayne, C. (2017, January 25\u201327). Heuristics-based detection to improve text\/graphics segmentation in complex engineering drawings. Proceedings of the 18th International Conference on Engineering Applications of Neural Networks (EANN 2017), Athens, Greece.","DOI":"10.1007\/978-3-319-65172-9_8"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Yu, Y. (2010, January 16\u201318). The parametric design and intelligent assembly system based on the secondary development of solidworks. Proceedings of the 2010 2nd International Conference on Computer Engineering and Technology, Chengdu, China.","DOI":"10.1109\/ICCET.2010.5485257"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"1958","DOI":"10.4028\/www.scientific.net\/AMR.706-708.1958","article-title":"Parametric design and automatic adjustment technique of engineering drawing based on solidworks","volume":"706","author":"Geng","year":"2013","journal-title":"Adv. Mater. Res."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1016\/S0377-2217(98)00011-3","article-title":"An algorithm of global optimization for solving layout problems","volume":"114","author":"Feng","year":"1999","journal-title":"Eur. J. Oper. Res."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.ejor.2003.06.018","article-title":"Optimizing the packing of cylinders into a rectangular container: A nonlinear approach","volume":"160","author":"Birgin","year":"2005","journal-title":"Eur. J. Oper. Res."},{"key":"ref_9","unstructured":"Song, P. (2012, January 14\u201317). Research status and trends of rectangular packing problem. Proceedings of the 2012 7th International Conference on Computer Science & Education (ICCSE), Melbourne, Australia."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1016\/j.ejor.2020.06.050","article-title":"Exact solution techniques for two-dimensional cutting and packing","volume":"289","author":"Iori","year":"2021","journal-title":"Eur. J. Oper. Res."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"3238","DOI":"10.1111\/itor.13236","article-title":"An introduction to the two-dimensional rectangular cutting and packing problem","volume":"30","author":"Oliveira","year":"2023","journal-title":"Int. Trans. Oper. Res."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/j.cie.2017.01.015","article-title":"Two-dimensional disjunctively constrained knapsack problem: Heuristic and exact approaches","volume":"105","author":"Hokama","year":"2017","journal-title":"Comput. Ind. Eng."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1287\/ijoc.2022.1256","article-title":"Arcflow formulations and constraint generation frameworks for the two bar charts packing problem","volume":"35","author":"Barkel","year":"2023","journal-title":"INFORMS J. Comput."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1111\/itor.12258","article-title":"On the generalized bin packing problem","volume":"24","author":"Baldi","year":"2017","journal-title":"Int. Trans. Oper. Res."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1016\/j.ejor.2022.03.012","article-title":"Integrated bin packing and lot-sizing problem considering the configuration-dependent bin packing process","volume":"303","author":"Hao","year":"2022","journal-title":"Eur. J. Oper. Res."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"2119","DOI":"10.1109\/TNNLS.2021.3105905","article-title":"Solving dynamic traveling salesman problems with deep reinforcement learning","volume":"34","author":"Zhang","year":"2021","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"ref_17","unstructured":"Wang, X., and Shi, X. (2022, January 1\u20133). Deep reinforcement learning for the capacitated vehicle routing problem with soft time window. Proceedings of the 2022 14th International Conference on Wireless Communications and Signal Processing (WCSP), Nanjing, China."},{"key":"ref_18","unstructured":"Hu, H., Zhang, X., Yan, X., Wang, L., and Xu, Y. (2017). Solving a new 3d bin packing problem with deep reinforcement learning method. arXiv."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"5298","DOI":"10.1109\/TNNLS.2023.3244024","article-title":"Improvement of reinforcement learning with supermodularity","volume":"34","author":"Meng","year":"2023","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1287\/opre.1120.1150","article-title":"Lp bounds in an interval-graph algorithm for orthogonal-packing feasibility","volume":"61","author":"Belov","year":"2013","journal-title":"Oper. Res."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"101007","DOI":"10.1016\/j.aei.2019.101007","article-title":"Application of industrial pipelines data generator in the experimental analysis: Pipe spooling optimization problem definition, formulation, and testing","volume":"43","author":"Mubarak","year":"2020","journal-title":"Adv. Eng. Inform."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Xu, Y., Wan, S., and Dong, F. (2022, January 1\u201310). Problem-specific knowledge based artificial bee colony algorithm for the rectangle layout optimization problem in satellite design. Proceedings of the International Conference on Software Engineering and Knowledge Engineering (SEKE), Pittsburgh, PA, USA.","DOI":"10.18293\/SEKE2022-014"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1016\/j.cie.2017.03.019","article-title":"A quasi-human strategy-based improved basin filling algorithm for the orthogonal rectangular packing problem with mass balance constraint","volume":"107","author":"Liu","year":"2017","journal-title":"Comput. Ind. Eng."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"124858","DOI":"10.1109\/ACCESS.2022.3225448","article-title":"Meta-heuristic algorithms for the generalized extensible bin packing problem with overload cost","volume":"10","author":"Ding","year":"2022","journal-title":"IEEE Access"},{"key":"ref_25","doi-asserted-by":"crossref","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":"ref_26","first-page":"255","article-title":"Iaga: A new method of automatic layout for dimensioning engineering drawings","volume":"32","author":"Sun","year":"2025","journal-title":"Teh. Vjesn."},{"key":"ref_27","unstructured":"Bello, I., Pham, H., Le, Q.V., Norouzi, M., and Bengio, S. (2016). Neural combinatorial optimization with reinforcement learning. arXiv."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"3103","DOI":"10.1109\/TCYB.2020.2977661","article-title":"Deep reinforcement learning for multiobjective optimization","volume":"51","author":"Li","year":"2020","journal-title":"IEEE Trans. Cybern."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Zhao, H., She, Q., Zhu, C., Yang, Y., and Xu, K. (2021, January 2\u20139). Online 3d bin packing with constrained deep reinforcement learning. Proceedings of the AAAI Conference on Artificial Intelligence, Virtual.","DOI":"10.1609\/aaai.v35i1.16155"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"111990","DOI":"10.1016\/j.knosys.2024.111990","article-title":"A dynamic multi-modal deep reinforcement learning framework for 3d bin packing problem","volume":"299","author":"Zhao","year":"2024","journal-title":"Knowl. Based Syst."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"2168","DOI":"10.1109\/TNNLS.2022.3144515","article-title":"Brain-inspired experience reinforcement model for bin packing in varying environments","volume":"33","author":"Zhang","year":"2022","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"ref_32","first-page":"6659","article-title":"Erdos goes neural: An unsupervised learning framework for combinatorial optimization on graphs","volume":"33","author":"Karalias","year":"2020","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref_33","first-page":"133","article-title":"CaRoLS: Condition-adaptive multi-level road layout synthesis","volume":"104451","author":"Feng","year":"2025","journal-title":"Comput. Graph."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"122219","DOI":"10.1016\/j.eswa.2023.122219","article-title":"A fundamental diagram based hybrid framework for traffic flow estimation and prediction by combining a Markovian model with deep learning","volume":"238","author":"Pan","year":"2024","journal-title":"Expert Syst. Appl."},{"key":"ref_35","unstructured":"Sutskever, I., Vinyals, O., and Le, Q.V. (2014). Sequence to sequence learning with neural networks. Advances in Neural Information Processing Systems, NeurIPS Proceedings."},{"key":"ref_36","unstructured":"Vinyals, O., Fortunato, M., and Jaitly, N. (2015). Pointer networks. Advances in Neural Information Processing Systems, NeurIPS Proceedings."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"1735","DOI":"10.1162\/neco.1997.9.8.1735","article-title":"Long short-term memory","volume":"9","author":"Hochreiter","year":"1997","journal-title":"Neural Comput."},{"key":"ref_38","doi-asserted-by":"crossref","unstructured":"Fang, J., Rao, Y., Zhao, X., and Du, B. (2023). A hybrid reinforcement learning algorithm for 2d irregular packing problems. Mathematics, 11.","DOI":"10.3390\/math11020327"},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"104202","DOI":"10.1016\/j.compind.2024.104202","article-title":"A deep reinforcement learning approach for online and concurrent 3d bin packing optimisation with bin replacement strategies","volume":"164","author":"Tsang","year":"2025","journal-title":"Comput. Ind."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"102028","DOI":"10.1016\/j.aei.2023.102028","article-title":"Towards reliable robot packing system based on deep reinforcement learning","volume":"57","author":"Xiong","year":"2023","journal-title":"Adv. Eng. Inform."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1023\/A:1022672621406","article-title":"Simple statistical gradient-following algorithms for connectionist reinforcement learning","volume":"8","author":"Williams","year":"1992","journal-title":"Mach. Learn."},{"key":"ref_42","unstructured":"Kingma, D.P., and Ba, J. (2014). Adam: A method for stochastic optimization. arXiv."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/19\/3\/226\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T12:47:45Z","timestamp":1773751665000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/19\/3\/226"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,17]]},"references-count":42,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2026,3]]}},"alternative-id":["a19030226"],"URL":"https:\/\/doi.org\/10.3390\/a19030226","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,17]]}}}