{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:09:45Z","timestamp":1757624985943,"version":"3.44.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032035493"},{"type":"electronic","value":"9783032035509"}],"license":[{"start":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T00:00:00Z","timestamp":1756252800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T00:00:00Z","timestamp":1756252800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-03550-9_29","type":"book-chapter","created":{"date-parts":[[2025,8,26]],"date-time":"2025-08-26T22:03:52Z","timestamp":1756245832000},"page":"431-444","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Reinforcement Learning-Based Algorithm for Optimizing Marking Sequences in Nesting Drawings"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-8617-3983","authenticated-orcid":false,"given":"Heechang","family":"Yoon","sequence":"first","affiliation":[]},{"given":"Youngin","family":"Cho","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0004-1652-1991","authenticated-orcid":false,"given":"Sookyoug","family":"Son","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7612-7361","authenticated-orcid":false,"given":"Jonghun","family":"Woo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,27]]},"reference":[{"key":"29_CR1","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1137\/0110015","volume":"10","author":"M Held","year":"1962","unstructured":"Held, M., Karp, R.M.: A dynamic programming approach to sequencing problems. J. Soc. Ind. Appl. Math. 10, 196\u2013210 (1962)","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"29_CR2","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1145\/321043.321046","volume":"7","author":"CE Miller","year":"1960","unstructured":"Miller, C.E., Tucker, A.W., Zemlin, R.A.: Integer programming formulation of traveling salesman problems. J. ACM (JACM) 7, 326\u2013329 (1960)","journal-title":"J. ACM (JACM)"},{"key":"29_CR3","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1126\/science.251.4995.754","volume":"251","author":"DL Miller","year":"1991","unstructured":"Miller, D.L., Pekny, J.F.: Exact solution of large asymmetric traveling salesman problems. Science 251, 754\u2013761 (1991)","journal-title":"Science"},{"key":"29_CR4","unstructured":"Applegate, D.L.: The Traveling Salesman Problem: A Computational Study. Princeton University Press (2006)"},{"key":"29_CR5","doi-asserted-by":"publisher","first-page":"624","DOI":"10.1016\/j.jmsy.2014.05.011","volume":"33","author":"SU Sherif","year":"2014","unstructured":"Sherif, S.U., Jawahar, N., Balamurali, M.: Sequential optimization approach for nesting and cutting sequence in laser cutting. J. Manuf. Syst. 33, 624\u2013638 (2014)","journal-title":"J. Manuf. Syst."},{"key":"29_CR6","unstructured":"Fu, C., Zhang, L., Wang, X., Qiao, L.: Solving TSP problem with improved genetic algorithm. In: AIP Conference Proceedings. AIP Publishing"},{"key":"29_CR7","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/j.neucom.2016.04.027","volume":"205","author":"J Kanda","year":"2016","unstructured":"Kanda, J., De Carvalho, A., Hruschka, E., Soares, C., Brazdil, P.: Meta-learning to select the best meta-heuristic for the traveling salesman problem: a comparison of meta-features. Neurocomputing 205, 393\u2013406 (2016)","journal-title":"Neurocomputing"},{"key":"29_CR8","unstructured":"Vinyals, O., Fortunato, M., Jaitly, N.: Pointer networks. In: Advances in Neural Information Processing Systems, vol. 28 (2015)"},{"key":"29_CR9","unstructured":"Bello, I., Pham, H., Le, Q.V., Norouzi, M., Bengio, S.: Neural combinatorial optimization with reinforcement learning. arXiv preprint arXiv:1611.09940 (2016)"},{"key":"29_CR10","unstructured":"Kool, W., Van Hoof, H., Welling, M.: Attention, learn to solve routing problems! arXiv preprint arXiv:1803.08475 (2018)"},{"key":"29_CR11","unstructured":"Khalil, E., Dai, H., Zhang, Y., Dilkina, B., Song, L.: Learning combinatorial optimization algorithms over graphs. In: Advances in Neural Information Processing Systems, vol. 30 (2017)"},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"Drori, I., et al.: Learning to solve combinatorial optimization problems on real-world graphs in linear time. In: 2020 19th IEEE International Conference on Machine Learning and Applications (ICMLA), pp. 19\u201324. IEEE (2020)","DOI":"10.1109\/ICMLA51294.2020.00013"},{"key":"29_CR13","unstructured":"Sun, Z., Yang, Y.: DIFUSCO: graph-based diffusion solvers for combinatorial optimization. In: Advances in Neural Information Processing Systems, vol. 36, pp. 3706\u20133731 (2023)"},{"key":"29_CR14","unstructured":"Luo, F., Lin, X., Liu, F., Zhang, Q., Wang, Z.: Neural combinatorial optimization with heavy decoder: toward large scale generalization. In: Advances in Neural Information Processing Systems, vol. 36, pp. 8845\u20138864 (2023)"},{"key":"29_CR15","unstructured":"Liu, H., Kuang, Y., Wang, J., Li, X., Zhang, Y., Wu, F.: Promoting generalization for exact solvers via adversarial instance augmentation (2023). https:\/\/arxiv.org\/abs\/2310.14161"},{"key":"29_CR16","doi-asserted-by":"publisher","first-page":"5408","DOI":"10.1109\/TCAD.2022.3164330","volume":"41","author":"S Sanyal","year":"2022","unstructured":"Sanyal, S., Roy, K.: Neuro-Ising: Accelerating large-scale traveling salesman problems via graph neural network guided localized Ising solvers. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 41, 5408\u20135420 (2022)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"29_CR17","unstructured":"Vaswani, A., et al.: Attention is all you need. In: Advances in Neural Information Processing Systems, vol. 30 (2017)"},{"key":"29_CR18","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1023\/A:1022672621406","volume":"8","author":"RJ Williams","year":"1992","unstructured":"Williams, R.J.: Simple statistical gradient-following algorithms for connectionist reinforcement learning. Mach. Learn. 8, 229\u2013256 (1992)","journal-title":"Mach. Learn."}],"container-title":["IFIP Advances in Information and Communication Technology","Advances in Production Management Systems. Cyber-Physical-Human Production Systems: Human-AI Collaboration and Beyond"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-03550-9_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T16:44:36Z","timestamp":1757436276000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-03550-9_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,27]]},"ISBN":["9783032035493","9783032035509"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-03550-9_29","relation":{},"ISSN":["1868-4238","1868-422X"],"issn-type":[{"type":"print","value":"1868-4238"},{"type":"electronic","value":"1868-422X"}],"subject":[],"published":{"date-parts":[[2025,8,27]]},"assertion":[{"value":"27 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APMS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IFIP International Conference on Advances in Production Management Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kamakura","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apms2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.apms-conference.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}