{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,28]],"date-time":"2026-09-28T08:56:54Z","timestamp":1790585814790,"version":"4.1.0"},"reference-count":68,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T00:00:00Z","timestamp":1787702400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2026,9,25]],"date-time":"2026-09-25T00:00:00Z","timestamp":1790294400000},"content-version":"vor","delay-in-days":30,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Commun"],"DOI":"10.1038\/s41467-026-76915-4","type":"journal-article","created":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T12:35:36Z","timestamp":1787747736000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Digital twin based sorting optimization for parcel distribution centers in logistics networks"],"prefix":"10.1038","volume":"17","author":[{"given":"Ran","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9153-8815","authenticated-orcid":false,"given":"Wei","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3211-7820","authenticated-orcid":false,"given":"Yuanming","family":"Tian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2863-086X","authenticated-orcid":false,"given":"Renming","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-0692-9239","authenticated-orcid":false,"given":"Boqun","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Le","family":"Liao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiang","family":"Song","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaoqi","family":"Qin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Han","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2608-775X","authenticated-orcid":false,"given":"Shuguang","family":"Cui","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5965-0823","authenticated-orcid":false,"given":"Chuan","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,8,26]]},"reference":[{"key":"76915_CR1","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1080\/00207543.2019.1612964","volume":"58","author":"S Winkelhaus","year":"2020","unstructured":"Winkelhaus, S. & Grosse, E. H. Logistics 4.0: a systematic review towards a new logistics system. Int. J. Prod. Res. 58, 18\u201343 (2020).","journal-title":"Int. J. Prod. Res."},{"key":"76915_CR2","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1080\/03088839.2011.572705","volume":"38","author":"H-S Nam","year":"2011","unstructured":"Nam, H.-S. & Song, D.-W. Defining maritime logistics hub and its implication for container port. Marit. Policy Manag. 38, 269\u2013292 (2011).","journal-title":"Marit. Policy Manag."},{"key":"76915_CR3","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.proeng.2017.06.023","volume":"192","author":"P Dro\u017adziel","year":"2017","unstructured":"Dro\u017adziel, P., Wi\u0144ska, M., Madle\u0148\u00e1k, R. & Szumski, P. Optimization of the post logistics network and location of the local distribution center in selected area of the Lublin province. Procedia Eng. 192, 130\u2013135 (2017).","journal-title":"Procedia Eng."},{"key":"76915_CR4","doi-asserted-by":"crossref","unstructured":"Higginson, J. K. & Bookbinder, J. H. Distribution centres in supply chain operations. in (eds. Langevin, A. & Riopel, D.) Logistics Systems: Design and Optimization, 67\u201391 (Springer, 2005).","DOI":"10.1007\/0-387-24977-X_3"},{"key":"76915_CR5","unstructured":"Frazelle, E.World-Class Warehousing and Material Handling (McGraw-Hill, 2016)."},{"key":"76915_CR6","doi-asserted-by":"crossref","unstructured":"Brandimarte, P. & Zotteri, G. Network design and transportation. in Introduction to Distribution Logistics, 53\u201390 (John Wiley & Sons, 2007).","DOI":"10.1002\/9780470170052.ch2"},{"key":"76915_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TICPS.2023.3283230","volume":"1","author":"Y Liu","year":"2023","unstructured":"Liu, Y., Tao, X., Li, X., Colombo, A. W. & Hu, S. Artificial intelligence in smart logistics cyber-physical systems: state-of-the-arts and potential applications. IEEE Trans. Ind. Cyber Phys. Syst. 1, 1\u201320 (2023).","journal-title":"IEEE Trans. Ind. Cyber Phys. Syst."},{"key":"76915_CR8","doi-asserted-by":"publisher","first-page":"102808","DOI":"10.1016\/j.tre.2022.102808","volume":"164","author":"X Xu","year":"2022","unstructured":"Xu, X., Chen, Y., Zou, B. & Gong, Y. Assignment of parcels to loading stations in robotic sorting systems. Transp. Res. Part E Logist. Transp. Rev. 164, 102808 (2022).","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"key":"76915_CR9","doi-asserted-by":"publisher","first-page":"3099","DOI":"10.3934\/mbe.2023146","volume":"20","author":"T Mukherjee","year":"2023","unstructured":"Mukherjee, T., Sangal, I., Sarkar, B. & Almaamari, Q. A. Logistic models to minimize the material handling cost within a cross-dock. Math. Biosci. Eng. 20, 3099\u20133119 (2023).","journal-title":"Math. Biosci. Eng."},{"key":"76915_CR10","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1016\/j.ejor.2022.07.024","volume":"306","author":"R Khir","year":"2023","unstructured":"Khir, R., Erera, A. & Toriello, A. Robust planning of sorting operations in express delivery systems. Eur. J. Oper. Res. 306, 615\u2013631 (2023).","journal-title":"Eur. J. Oper. Res."},{"key":"76915_CR11","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.eswa.2013.07.007","volume":"41","author":"Z Miao","year":"2014","unstructured":"Miao, Z., Cai, S. & Xu, D. Applying an adaptive tabu search algorithm to optimize truck-dock assignment in the crossdock management system. Expert Syst. Appl. 41, 16\u201322 (2014).","journal-title":"Expert Syst. Appl."},{"key":"76915_CR12","doi-asserted-by":"publisher","first-page":"8562","DOI":"10.1080\/00207543.2024.2337109","volume":"62","author":"JC Chen","year":"2024","unstructured":"Chen, J. C., Anggrahini, D. & Chen, T.-L. Current research and future challenges in parcel hub towards logistics 4.0: a systematic literature review from a decision-making perspective. Int. J. Prod. Res. 62, 8562\u20138593 (2024).","journal-title":"Int. J. Prod. Res."},{"key":"76915_CR13","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1002\/j.2158-1592.2010.tb00131.x","volume":"31","author":"KK Yang","year":"2010","unstructured":"Yang, K. K., Balakrishnan, J. & Cheng, C. H. An analysis of factors affecting cross docking operations. J. Bus. Logist. 31, 121\u2013148 (2010).","journal-title":"J. Bus. Logist."},{"key":"76915_CR14","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/s12063-011-0057-3","volume":"4","author":"K Stephan","year":"2011","unstructured":"Stephan, K. & Boysen, N. Vis-\u00e0-vis vs. mixed dock door assignment: a comparison of different cross dock layouts. Oper. Manag. Res. 4, 150\u2013163 (2011).","journal-title":"Oper. Manag. Res."},{"key":"76915_CR15","doi-asserted-by":"crossref","unstructured":"McGuire, P. M. Belt conveyors. in (ed. Badiru, A.) Conveyors: Application, Selection, and Integration, 44\u201380 (CRC Press, 2023).","DOI":"10.1201\/9781003376613-4"},{"key":"76915_CR16","doi-asserted-by":"publisher","first-page":"1353","DOI":"10.1080\/24725854.2021.1889078","volume":"53","author":"R Khir","year":"2021","unstructured":"Khir, R., Erera, A. & Toriello, A. Two-stage sort planning for express parcel delivery. IISE Trans. 53, 1353\u20131368 (2021).","journal-title":"IISE Trans."},{"key":"76915_CR17","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1287\/trsc.2015.0662","volume":"52","author":"LJ Novoa","year":"2018","unstructured":"Novoa, L. J., Jarrah, A. I. & Morton, D. P. Flow balancing with uncertain demand for automated package sorting centers. Transp. Sci. 52, 210\u2013227 (2018).","journal-title":"Transp. Sci."},{"key":"76915_CR18","doi-asserted-by":"publisher","first-page":"6956","DOI":"10.1080\/00207543.2017.1421789","volume":"56","author":"Z He","year":"2018","unstructured":"He, Z., Aggarwal, V. & Nof, S. Y. Differentiated service policy in smart warehouse automation. Int. J. Prod. Res. 56, 6956\u20136970 (2018).","journal-title":"Int. J. Prod. Res."},{"key":"76915_CR19","doi-asserted-by":"publisher","first-page":"1428","DOI":"10.1287\/trsc.2017.0782","volume":"52","author":"JP Van Der Gaast","year":"2018","unstructured":"Van Der Gaast, J. P., De Koster, R. B. & Adan, I. J. Conveyor merges in zone picking systems: a tractable and accurate approximate model. Transp. Sci. 52, 1428\u20131443 (2018).","journal-title":"Transp. Sci."},{"key":"76915_CR20","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1287\/opre.2019.1885","volume":"68","author":"JP Van Der Gaast","year":"2020","unstructured":"Van Der Gaast, J. P., De Koster, R. B., Adan, I. J. & Resing, J. A. Capacity analysis of sequential zone picking systems. Oper. Res. 68, 161\u2013179 (2020).","journal-title":"Oper. Res."},{"key":"76915_CR21","doi-asserted-by":"publisher","first-page":"996","DOI":"10.1016\/j.ejor.2008.04.035","volume":"196","author":"C Osorio","year":"2009","unstructured":"Osorio, C. & Bierlaire, M. An analytic finite capacity queueing network model capturing the propagation of congestion and blocking. Eur. J. Oper. Res. 196, 996\u20131007 (2009).","journal-title":"Eur. J. Oper. Res."},{"key":"76915_CR22","doi-asserted-by":"publisher","first-page":"S83","DOI":"10.1057\/jors.2008.178","volume":"60","author":"D Worthington","year":"2009","unstructured":"Worthington, D. Reflections on queue modelling from the last 50 years. J. Oper. Res. Soc. 60, S83\u2013S92 (2009).","journal-title":"J. Oper. Res. Soc."},{"key":"76915_CR23","doi-asserted-by":"crossref","unstructured":"Gosavi, A. Simulation-Based Optimization (Springer, 2015).","DOI":"10.1007\/978-1-4899-7491-4"},{"key":"76915_CR24","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/j.cie.2005.07.002","volume":"49","author":"DL McWilliams","year":"2005","unstructured":"McWilliams, D. L., Stanfield, P. M. & Geiger, C. D. The parcel hub scheduling problem: a simulation-based solution approach. Comput. Ind. Eng. 49, 393\u2013412 (2005).","journal-title":"Comput. Ind. Eng."},{"key":"76915_CR25","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1287\/trsc.2014.0540","volume":"51","author":"S Fedtke","year":"2017","unstructured":"Fedtke, S. & Boysen, N. Layout planning of sortation conveyors in parcel distribution centers. Transp. Sci. 51, 3\u201318 (2017).","journal-title":"Transp. Sci."},{"key":"76915_CR26","doi-asserted-by":"publisher","first-page":"102192","DOI":"10.1016\/j.simpat.2020.102192","volume":"106","author":"T-L Chen","year":"2021","unstructured":"Chen, T.-L., Chen, J. C., Huang, C.-F. & Chang, P.-C. Solving the layout design problem by simulation-optimization approach\u2014a case study on a sortation conveyor system. Simul. Modell. Pract. Theory 106, 102192 (2021).","journal-title":"Simul. Modell. Pract. Theory"},{"key":"76915_CR27","doi-asserted-by":"crossref","unstructured":"Bangsow, S. Tecnomatix Plant Simulation (Springer, 2020).","DOI":"10.1007\/978-3-030-41544-0"},{"key":"76915_CR28","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1287\/trsc.2016.0722","volume":"51","author":"N Boysen","year":"2017","unstructured":"Boysen, N., Fedtke, S. & Weidinger, F. Truck scheduling in the postal service industry. Transp. Sci. 51, 723\u2013736 (2017).","journal-title":"Transp. Sci."},{"key":"76915_CR29","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/j.omega.2009.10.008","volume":"38","author":"N Boysen","year":"2010","unstructured":"Boysen, N. & Fliedner, M. Cross dock scheduling: classification, literature review and research agenda. Omega 38, 413\u2013422 (2010).","journal-title":"Omega"},{"key":"76915_CR30","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1016\/j.omega.2012.01.005","volume":"40","author":"J Van Belle","year":"2012","unstructured":"Van Belle, J., Valckenaers, P. & Cattrysse, D. Cross-docking: state of the art. Omega 40, 827\u2013846 (2012).","journal-title":"Omega"},{"key":"76915_CR31","unstructured":"Grieves, M. Digital twin: manufacturing excellence through virtual factory replication. White Paper 1, 1\u20137 (Michael W. Grieves, LLC, 2014)."},{"key":"76915_CR32","doi-asserted-by":"publisher","first-page":"101837","DOI":"10.1016\/j.rcim.2019.101837","volume":"61","author":"Y Lu","year":"2020","unstructured":"Lu, Y. et al. Digital twin-driven smart manufacturing: connotation, reference model, applications and research issues. Robot. Comput. Integr. Manuf. 61, 101837 (2020).","journal-title":"Robot. Comput. Integr. Manuf."},{"key":"76915_CR33","first-page":"1","volume":"11","author":"M Shafto","year":"2010","unstructured":"Shafto, M. et al. Draft modeling, simulation, information technology & processing roadmap. Technol. Area. 11, 1\u201332 (2010).","journal-title":"Technol. Area"},{"key":"76915_CR34","doi-asserted-by":"crossref","unstructured":"Korth, B., Schwede, C. & Zajac, M. Simulation-ready digital twin for realtime management of logistics systems. In Proc. 2018 IEEE International Conference on Big Data (Big Data) 4194\u20134201 (IEEE, 2018).","DOI":"10.1109\/BigData.2018.8622160"},{"key":"76915_CR35","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-025-96641-z","volume":"15","author":"J Li","year":"2025","unstructured":"Li, J. & Wang, J. Digital twin-driven management strategies for logistics transportation systems. Sci. Rep. 15, 12186 (2025).","journal-title":"Sci. Rep."},{"key":"76915_CR36","first-page":"100443","volume":"33","author":"W Wu","year":"2023","unstructured":"Wu, W. et al. Internet of everything and digital twin enabled service platform for cold chain logistics. J. Ind. Inf. Integr. 33, 100443 (2023).","journal-title":"J. Ind. Inf. Integr."},{"key":"76915_CR37","unstructured":"Wan, Z. et al. AlphaZero-like tree-search can guide large language model decoding and training. In Proc. International Conference on Machine Learning 235, 49890-49920 (PMLR, 2024)."},{"key":"76915_CR38","unstructured":"Xie, Y. et al. Monte Carlo tree search boosts reasoning via iterative preference learning. In Proc. NeurIPS 2024 Workshop on System-2 Reasoning at Scale (2024)."},{"key":"76915_CR39","doi-asserted-by":"crossref","unstructured":"Park, S., Liu, X., Gong, Y. & Choi, E. Ensembling large language models with process reward-guided tree search for better complex reasoning. In Proc. 2025 Conference of the Nations of the Americas Chapter of the Association for Computational Linguistics: Human Language Technology (Vol. 1: Long Papers), 10256\u201310277 (ACL, 2025).","DOI":"10.18653\/v1\/2025.naacl-long.515"},{"key":"76915_CR40","doi-asserted-by":"crossref","unstructured":"Song, X., Zhang, S. & Yu, T. ReKG-MCTS: reinforcing LLM reasoning on knowledge graphs via training-free Monte Carlo tree search. In Proc. Findings of the Association for Computational Linguistics: ACL 2025, 9288\u20139306 (ACL, 2025).","DOI":"10.18653\/v1\/2025.findings-acl.484"},{"key":"76915_CR41","doi-asserted-by":"crossref","unstructured":"Rivi\u00e8re, B., Lathrop, J. & Chung, S.-J. Monte Carlo tree search with spectral expansion for planning with dynamical systems. Sci. Robot. 9,eado1010 (2024).","DOI":"10.1126\/scirobotics.ado1010"},{"key":"76915_CR42","doi-asserted-by":"crossref","unstructured":"Kim, B., Lee, K., Lim, S., Kaelbling, L. & Lozano-P\u00e9rez, T. Monte Carlo tree search in continuous spaces using Voronoi optimistic optimization with regret bounds. In Proc. AAAI Conference on Artificial Intelligence Vol. 34, 9916\u20139924 (AAAI, 2020).","DOI":"10.1609\/aaai.v34i06.6546"},{"key":"76915_CR43","doi-asserted-by":"crossref","unstructured":"Chen, W. & Liu, L. Pareto Monte Carlo tree search for multi-objective informative planning. In Proc. Robotics: Science and Systems XV (2019).","DOI":"10.15607\/RSS.2019.XV.072"},{"key":"76915_CR44","doi-asserted-by":"publisher","first-page":"1074","DOI":"10.1038\/s42003-024-06746-w","volume":"7","author":"Y Yang","year":"2024","unstructured":"Yang, Y. et al. Enabling target-aware molecule generation to follow multi objectives with Pareto MCTS. Commun. Biol. 7, 1074 (2024).","journal-title":"Commun. Biol."},{"key":"76915_CR45","unstructured":"Southiratn, T., Koo, B., Lu, Y. & Kim, S. CombiMOTS: combinatorial multi-objective tree search for dual-target molecule generation. In Proc. 42nd International Conference on Machine Learning Vol. 267, 56650\u201356691 (PMLR, 2025)."},{"key":"76915_CR46","doi-asserted-by":"publisher","first-page":"6537","DOI":"10.1021\/acs.jcim.5c00417","volume":"65","author":"TM Blackshaw","year":"2025","unstructured":"Blackshaw, T. M., Davies, J. C., Spoerer, K. T. & Hirst, J. D. Enhancing Monte Carlo tree search for retrosynthesis. J. Chem. Inf. Model. 65, 6537\u20136546 (2025).","journal-title":"J. Chem. Inf. Model."},{"key":"76915_CR47","first-page":"100130","volume":"7","author":"H Lai","year":"2025","unstructured":"Lai, H. et al. Multi-objective synthesis planning by means of monte carlo tree search. Artif. Intell. Life Sci. 7, 100130 (2025).","journal-title":"Artif. Intell. Life Sci."},{"key":"76915_CR48","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1038\/s42004-023-00911-8","volume":"6","author":"S Hong","year":"2023","unstructured":"Hong, S., Zhuo, H. H., Jin, K., Shao, G. & Zhou, Z. Retrosynthetic planning with experience-guided Monte Carlo tree search. Commun. Chem. 6, 120 (2023).","journal-title":"Commun. Chem."},{"key":"76915_CR49","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1038\/s42004-024-01133-2","volume":"7","author":"D Zhao","year":"2024","unstructured":"Zhao, D., Tu, S. & Xu, L. Efficient retrosynthetic planning with MCTS exploration enhanced A* search. Commun. Chem. 7, 52 (2024).","journal-title":"Commun. Chem."},{"key":"76915_CR50","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1186\/s13321-020-00472-1","volume":"12","author":"S Genheden","year":"2020","unstructured":"Genheden, S. et al. AiZynthFinder: a fast, robust and flexible open-source software for retrosynthetic planning. J. Cheminform. 12, 70 (2020).","journal-title":"J. Cheminform."},{"key":"76915_CR51","unstructured":"Banks, A., Briggs, E., Borgendale, K. & Gupta, R. MQTT Version 5.0. OASIS Standard http:\/\/docs.oasis-open.org\/mqtt\/mqtt\/v5.0\/os\/mqtt-v5.0-os.html (2019)."},{"key":"76915_CR52","doi-asserted-by":"crossref","unstructured":"Fielding, R. T., Nottingham, M. & Reschke, J. HTTP Semantics. RFC 9110 https:\/\/www.rfc-editor.org\/info\/rfc9110 (2022).","DOI":"10.17487\/RFC9110"},{"key":"76915_CR53","doi-asserted-by":"crossref","unstructured":"Shelby, Z., Hartke, K. & Bormann, C. The Constrained Application Protocol (CoAP). RFC 7252 https:\/\/www.rfc-editor.org\/info\/rfc7252 (2014).","DOI":"10.17487\/rfc7252"},{"key":"76915_CR54","doi-asserted-by":"crossref","unstructured":"Rescorla, E. HTTP Over TLS. RFC 2818 https:\/\/www.rfc-editor.org\/info\/rfc2818 (2000).","DOI":"10.17487\/rfc2818"},{"key":"76915_CR55","unstructured":"Epic Games. Unreal Engine 5. Epic Games. Accessed 1 April 2022, https:\/\/www.unrealengine.com\/ (2022)."},{"key":"76915_CR56","unstructured":"Kendall, M. G. & Gibbons, J. D. Rank Correlation Methods (Oxford University Press, 1990)."},{"key":"76915_CR57","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S Ropke","year":"2006","unstructured":"Ropke, S. & Pisinger, D. An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 40, 455\u2013472 (2006).","journal-title":"Transp. Sci."},{"key":"76915_CR58","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1111\/j.2517-6161.1954.tb00149.x","volume":"16","author":"NT Bailey","year":"1954","unstructured":"Bailey, N. T. On queueing processes with bulk service. J. R. Statist. Soc. 16, 80\u201387 (1954).","journal-title":"J. R. Statist. Soc."},{"key":"76915_CR59","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1287\/msom.4.4.258.5732","volume":"4","author":"ME Johnson","year":"2002","unstructured":"Johnson, M. E. & Meller, R. D. Performance analysis of split-case sorting systems. Manuf. Serv. Oper. Manag. 4, 258\u2013274 (2002).","journal-title":"Manuf. Serv. Oper. Manag."},{"key":"76915_CR60","doi-asserted-by":"crossref","unstructured":"Wolsey, L. A. & Nemhauser, G. L. Computational complexity. in Integer and Combinatorial Optimization, 114\u2013145 (John Wiley & Sons, 1999).","DOI":"10.1002\/9781118627372.ch5"},{"key":"76915_CR61","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1287\/opre.14.4.699","volume":"14","author":"EL Lawler","year":"1966","unstructured":"Lawler, E. L. & Wood, D. E. Branch-and-bound methods: a survey. Oper. Res. 14, 699\u2013719 (1966).","journal-title":"Oper. Res."},{"key":"76915_CR62","unstructured":"Bertsekas, D. Dynamic Programming and Optimal Control (Athena Scientific, 2012)."},{"key":"76915_CR63","doi-asserted-by":"crossref","unstructured":"Wolsey, L. A. Integer Programming (John Wiley & Sons, 2020).","DOI":"10.1002\/9781119606475"},{"key":"76915_CR64","unstructured":"Mitchell, M. An Introduction to Genetic Algorithms (MIT Press, 1998)."},{"key":"76915_CR65","unstructured":"Sutton, R. S. & Barto, A. G. Planning and learning with tabular methods. in Reinforcement Learning: An Introduction, 185\u2013188 (MIT Press, 2018)."},{"key":"76915_CR66","doi-asserted-by":"crossref","unstructured":"Ye, D. et al. Mastering complex control in MOBA games with deep reinforcement learning. In Proc. AAAI Conference on Artificial Intelligence Vol. 34, 6672\u20136679 (Association for the Advancement of Artificial Intelligence, 2020).","DOI":"10.1609\/aaai.v34i04.6144"},{"key":"76915_CR67","doi-asserted-by":"crossref","unstructured":"Kocsis, L. & Szepesv\u00e1ri, C. Bandit based Monte-Carlo planning. In Proc. European Conference on Machine Learning 282\u2013293 (Springer, 2006).","DOI":"10.1007\/11871842_29"},{"key":"76915_CR68","doi-asserted-by":"publisher","unstructured":"Zhang, W. et al. Digital twin based sorting optimization for parcel distribution centers in logistics networks. DT-SMCTS. Zenodo, https:\/\/doi.org\/10.5281\/zenodo.21319488 (2026).","DOI":"10.5281\/zenodo.21319488"}],"container-title":["Nature Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.nature.com\/articles\/s41467-026-76915-4","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41467-026-76915-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41467-026-76915-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,9,28]],"date-time":"2026-09-28T08:14:47Z","timestamp":1790583287000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.nature.com\/articles\/s41467-026-76915-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8,26]]},"references-count":68,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,12]]}},"alternative-id":["76915"],"URL":"https:\/\/doi.org\/10.1038\/s41467-026-76915-4","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-6932705\/v1","asserted-by":"object"}]},"ISSN":["2041-1723"],"issn-type":[{"value":"2041-1723","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,8,26]]},"assertion":[{"value":"19 June 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 August 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 August 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare no competing interests.","order":1,"name":"Ethics","label":"Competing interests","group":{"name":"EthicsHeading","label":"Ethics"}}],"article-number":"10199"}}