Digital Twin based Sorting Optimization for Parcel Distribution Centers in Logistics Networks

preprint OA: closed
Full text JSON View at publisher

Abstract

Abstract Parcel distribution centers (PDCs) in logistics networks aim to efficiently sort the inbound parcels for downstream destinations via a parcel-sorting system (PSS), by which the parcels are diverted to the assigned grids and packed into bins for outbound truck deliveries. Considering the dynamic parcel movements, random packing behaviors, and conveyor system congestion, maximizing the sorting throughput by assigning grids to parcel destinations presents significant computational challenges. This work establishes the first high fidelity parcel-sorting digital twin system (PSDTS) implemented on an industrial scale that models the real-time interactions among parcels, sorters, and packers, and simulates the throughput performance under a specific sorting plan. Then, to address the computational challenges and operational constraints in PSS, a digital twin-based structured Monte Carlo tree search (DT-SMCTS) framework, combining integer nonlinear programming and geographic destination graph networks, is proposed to optimize the sorting plan. The proposed PSDTS and DT-SMCTS have been widely deployed in 146 PDCs (approximately 30% of all SF Express PDCs in China), and the effectiveness is demonstrated through both the DT numerical results and field experiments: The proposed DT-SMCTS framework increases the average and peak sorting throughputs by 10.56% and 7.72%, respectively, and reduces the number of sorted parcels that require multiple conveyor cycles by 60.81%.
Full text 15,555 characters · extracted from preprint-html · click to expand
Digital Twin based Sorting Optimization for Parcel Distribution Centers in Logistics Networks | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Article Digital Twin based Sorting Optimization for Parcel Distribution Centers in Logistics Networks Chuan Huang, Wei Zhang, Ran Li, Yuanming Tian, Renming Liu, Boqun Huang, and 5 more This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-6932705/v1 This work is licensed under a CC BY 4.0 License Status: Under Review Version 1 posted You are reading this latest preprint version Abstract Parcel distribution centers (PDCs) in logistics networks aim to efficiently sort the inbound parcels for downstream destinations via a parcel-sorting system (PSS), by which the parcels are diverted to the assigned grids and packed into bins for outbound truck deliveries. Considering the dynamic parcel movements, random packing behaviors, and conveyor system congestion, maximizing the sorting throughput by assigning grids to parcel destinations presents significant computational challenges. This work establishes the first high fidelity parcel-sorting digital twin system (PSDTS) implemented on an industrial scale that models the real-time interactions among parcels, sorters, and packers, and simulates the throughput performance under a specific sorting plan. Then, to address the computational challenges and operational constraints in PSS, a digital twin-based structured Monte Carlo tree search (DT-SMCTS) framework, combining integer nonlinear programming and geographic destination graph networks, is proposed to optimize the sorting plan. The proposed PSDTS and DT-SMCTS have been widely deployed in 146 PDCs (approximately 30% of all SF Express PDCs in China), and the effectiveness is demonstrated through both the DT numerical results and field experiments: The proposed DT-SMCTS framework increases the average and peak sorting throughputs by 10.56% and 7.72%, respectively, and reduces the number of sorted parcels that require multiple conveyor cycles by 60.81%. Physical sciences/Engineering/Mechanical engineering Scientific community and society/Business and industry/Industry Scientific community and society/Business and industry/Engineering/Mechanical engineering Logistics networks parcel-sorting digital twin (DT) Monte Carlo tree search (MCTS) Full Text Additional Declarations There is NO Competing Interest. Supplementary Files SupplementaryInformation.pdf Supplementary Information: Practical Parcel Data Analysis, PSDTS Fidelity & Solution Space Derivations 3DVisualizationofPSDTS.mp4 3D Animation of the Parcel-Sorting Digital Twin System Cite Share Download PDF Status: Under Review Version 1 posted You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-6932705","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Article","associatedPublications":[],"authors":[{"id":490389304,"identity":"1e20035f-4014-48b8-85e4-92dc716bfb0a","order_by":0,"name":"Chuan Huang","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA60lEQVRIiWNgGAWjYBACAwh1AIiZDzAwNiQAGQlEa2FLIFkLjwFxWswlkp89/FJzJ7F/ds/Hz7w70hj42XMMGH7uwK3FckaaubHMsWeJM+6c3SzNeyaHQbLnjQFj7xk8DruRYCYt2XA4seFG7jZm3rYKoEiOATNjGz4t6d/AWubfyHkG1mJPWEuOmeRHoJYNN3LYgFpyGAwkCGk586ZMmuHYYeONN9KMJee2pfFInHlWcLAXn5bj6dskf9Qclp13I/nhh7dtyXL87ckbH/zEowUEmHmQOGD2AfwaGBgYfxBSMQpGwSgYBSMbAADVhlfPKK4U4wAAAABJRU5ErkJggg==","orcid":"","institution":"School of Science and Engineering, The Chinese University of Hong Kong, Shenzhen \u0026 Future Network of Intelligence Institute","correspondingAuthor":true,"prefix":"","firstName":"Chuan","middleName":"","lastName":"Huang","suffix":""},{"id":490389305,"identity":"1e04eb8b-8786-4a7c-97f9-0a4c0f58022a","order_by":1,"name":"Wei Zhang","email":"","orcid":"","institution":"School of Science and Engineering, The Chinese University of Hong Kong, Shenzhen \u0026 Future Network of Intelligence Institute","correspondingAuthor":false,"prefix":"","firstName":"Wei","middleName":"","lastName":"Zhang","suffix":""},{"id":490389306,"identity":"ba4aee9d-daa1-4617-8890-0314c2d8d56e","order_by":2,"name":"Ran Li","email":"","orcid":"","institution":"Department of Information Engineering, The Chinese University of Hong Kong","correspondingAuthor":false,"prefix":"","firstName":"Ran","middleName":"","lastName":"Li","suffix":""},{"id":490389307,"identity":"bcca3875-a185-4378-bf8e-9d83ab9e83de","order_by":3,"name":"Yuanming Tian","email":"","orcid":"","institution":"School of Science and Engineering, The Chinese University of Hong Kong, Shenzhen \u0026 Future Network of Intelligence Institute","correspondingAuthor":false,"prefix":"","firstName":"Yuanming","middleName":"","lastName":"Tian","suffix":""},{"id":490389308,"identity":"c479102b-8b20-4a2c-b943-8734bd1ee3bb","order_by":4,"name":"Renming Liu","email":"","orcid":"","institution":"Shunfeng Technology, and the Tsinghua Shenzhen International Graduate School, Shenzhen","correspondingAuthor":false,"prefix":"","firstName":"Renming","middleName":"","lastName":"Liu","suffix":""},{"id":490389309,"identity":"0bc5e625-c06e-49cb-b15b-8f5834824591","order_by":5,"name":"Boqun Huang","email":"","orcid":"https://orcid.org/0009-0008-0692-9239","institution":"School of Science and Engineering, The Chinese University of Hong Kong, Shenzhen \u0026 Future Network of Intelligence Institute","correspondingAuthor":false,"prefix":"","firstName":"Boqun","middleName":"","lastName":"Huang","suffix":""},{"id":490389310,"identity":"f74577e1-a58f-44f7-8ab0-c5940b5114de","order_by":6,"name":"Le Liao","email":"","orcid":"","institution":"Shunfeng Technology","correspondingAuthor":false,"prefix":"","firstName":"Le","middleName":"","lastName":"Liao","suffix":""},{"id":490389311,"identity":"797a3a53-26f0-4e3a-85eb-6590833d6b18","order_by":7,"name":"Xiang Song","email":"","orcid":"","institution":"Shunfeng Technology","correspondingAuthor":false,"prefix":"","firstName":"Xiang","middleName":"","lastName":"Song","suffix":""},{"id":490389312,"identity":"9ee14451-ee47-41f6-b31f-009288ee30bc","order_by":8,"name":"Xiaoqi Qin","email":"","orcid":"","institution":"School of Information and Communication Engineering and the State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications","correspondingAuthor":false,"prefix":"","firstName":"Xiaoqi","middleName":"","lastName":"Qin","suffix":""},{"id":490389313,"identity":"2af68866-a69e-4ca6-977a-51dd20c7d8cd","order_by":9,"name":"Han Zhang","email":"","orcid":"","institution":"School of Information and Communication Engineering and the State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications","correspondingAuthor":false,"prefix":"","firstName":"Han","middleName":"","lastName":"Zhang","suffix":""},{"id":490389314,"identity":"607c2b30-dfe9-4ccc-9443-c60f91eb31e2","order_by":10,"name":"Shuguang Cui","email":"","orcid":"https://orcid.org/0000-0003-2608-775X","institution":"The Chinese University of Hong Kong, Shenzhen, China, 518066","correspondingAuthor":false,"prefix":"","firstName":"Shuguang","middleName":"","lastName":"Cui","suffix":""}],"badges":[],"createdAt":"2025-06-19 15:46:02","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-6932705/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-6932705/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":87542787,"identity":"c009854f-e434-47ac-921a-d7afe85f2044","added_by":"auto","created_at":"2025-07-25 04:07:55","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":15355719,"visible":true,"origin":"","legend":"Article File","description":"","filename":"DigitalTwinbasedSortingOptimizationforParcelDistributionCentersinLogisticsNetworks.pdf","url":"https://assets-eu.researchsquare.com/files/rs-6932705/v1_covered_a4cf569a-85ce-4965-a341-fb22c5c1e7e6.pdf"},{"id":87542541,"identity":"b43da652-ce64-4dc4-a2d8-0c63d0d768f9","added_by":"auto","created_at":"2025-07-25 03:59:48","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"supplement","size":299470,"visible":true,"origin":"","legend":"Supplementary Information: Practical Parcel Data Analysis, PSDTS Fidelity \u0026 Solution Space Derivations","description":"","filename":"SupplementaryInformation.pdf","url":"https://assets-eu.researchsquare.com/files/rs-6932705/v1/4ef3ae91294903c43fb19eed.pdf"},{"id":87542542,"identity":"36463534-ad48-4d86-852b-d8bef18f4e0d","added_by":"auto","created_at":"2025-07-25 03:59:48","extension":"mp4","order_by":2,"title":"","display":"","copyAsset":false,"role":"supplement","size":27781805,"visible":true,"origin":"","legend":"3D Animation of the Parcel-Sorting Digital Twin System","description":"","filename":"3DVisualizationofPSDTS.mp4","url":"https://assets-eu.researchsquare.com/files/rs-6932705/v1/8f71e906a118f0fb24f1d083.mp4"}],"financialInterests":"There is \u003cb\u003eNO\u003c/b\u003e Competing Interest.","formattedTitle":"Digital Twin based Sorting Optimization for Parcel Distribution Centers in Logistics Networks","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":true,"hideJournal":false,"highlight":"","institution":"","isAcceptedByJournal":false,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"nature-portfolio","isNatureJournal":true,"hasQc":false,"allowDirectSubmit":false,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"","title":"Nature Portfolio","twitterHandle":"","acdcEnabled":false,"dfaEnabled":false,"editorialSystem":"ejp","reportingPortfolio":"","inReviewEnabled":true,"inReviewRevisionsEnabled":false},"keywords":"Logistics networks, parcel-sorting, digital twin (DT), Monte Carlo tree search (MCTS)","lastPublishedDoi":"10.21203/rs.3.rs-6932705/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-6932705/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"Parcel distribution centers (PDCs) in logistics networks aim to efficiently sort the inbound parcels for downstream destinations via a parcel-sorting system (PSS), by which the parcels are diverted to the assigned grids and packed into bins for outbound truck deliveries. Considering the dynamic parcel movements, random packing behaviors, and conveyor system congestion, maximizing the sorting throughput by assigning grids to parcel destinations presents significant computational challenges. This work establishes the first high fidelity parcel-sorting digital twin system (PSDTS) implemented on an industrial scale that models the real-time interactions among parcels, sorters, and packers, and simulates the throughput performance under a specific sorting plan. Then, to address the computational challenges and operational constraints in PSS, a digital twin-based structured Monte Carlo tree search (DT-SMCTS) framework, combining integer nonlinear programming and geographic destination graph networks, is proposed to optimize the sorting plan. The proposed PSDTS and DT-SMCTS have been widely deployed in 146 PDCs (approximately 30% of all SF Express PDCs in China), and the effectiveness is demonstrated through both the DT numerical results and field experiments: The proposed DT-SMCTS framework increases the average and peak sorting throughputs by 10.56% and 7.72%, respectively, and reduces the number of sorted parcels that require multiple conveyor cycles by 60.81%.","manuscriptTitle":"Digital Twin based Sorting Optimization for Parcel Distribution Centers in Logistics Networks","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2025-07-25 03:59:43","doi":"10.21203/rs.3.rs-6932705/v1","editorialEvents":[],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"nature-communications","isNatureJournal":true,"hasQc":false,"allowDirectSubmit":false,"externalIdentity":"NCOMMS","sideBox":"Learn more about [Nature Communications](http://www.nature.com/ncomms/)","snPcode":"","submissionUrl":"https://mts-ncomms.nature.com/","title":"Nature Communications","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"ejp","reportingPortfolio":"Nature Communications","inReviewEnabled":true,"inReviewRevisionsEnabled":false}}],"origin":"","ownerIdentity":"f5745af3-58ed-4c58-8638-19c0e1370fc1","owner":[],"postedDate":"July 25th, 2025","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"under-review","subjectAreas":[{"id":52069878,"name":"Physical sciences/Engineering/Mechanical engineering"},{"id":52069879,"name":"Scientific community and society/Business and industry/Industry"},{"id":52069880,"name":"Scientific community and society/Business and industry/Engineering/Mechanical engineering"}],"tags":[],"updatedAt":"2026-02-01T08:44:09+00:00","versionOfRecord":[],"versionCreatedAt":"2025-07-25 03:59:43","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-6932705","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-6932705","identity":"rs-6932705","version":["v1"]},"buildId":"8U1c8b4HqxoKbykW_rLl7","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: preprint-html

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2025) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00