Digital twin based sorting optimization for parcel distribution centers in logistics networks

Parcel distribution centers in logistics networks aim to sort inbound parcels for downstream destinations through parcel-sorting systems, where parcels are diverted to assigned grids and packed into bins for outbound truck deliveries. Considering dynamic parcel movements, random packing behaviors, and conveyor congestion, maximizing sorting throughput by assigning grids to destinations presents significant computational challenges. This work establishes a high-fidelity parcel-sorting digital-twin system that models real-time interactions among parcels, sorters, and packers, and simulates throughput performance under specific sorting plans. To address the computational challenges and real-world operational constraints, a digital twin-based structured Monte Carlo tree search optimization framework, combining integer nonlinear programming and geographic destination graph networks, is proposed to optimize sorting plans. The proposed digital twin and optimization framework have been deployed in 146 parcel distribution centers (approximately 30% of SF Express parcel distribution centers in China) and demonstrated their effectiveness through both numerical and field experiments: the proposed framework increases average and peak sorting throughputs by 10.56% and 7.72%, respectively, and reduces recirculated parcels by 60.81%, compared to field-implemented method. Furthermore, it outperforms the basic digital twin-based Monte Carlo tree search baseline by 6.77% and 4.99% in average and peak throughputs, respectively, and reduces recirculated parcels by 54.57%. Authors demonstrate a high-fidelity digital twin system for parcel sorting, integrating real parcel-level data and device mechanisms, and proposes a structured Monte Carlo tree search framework that combines integer nonlinear programming and geographic graph modules to optimize grid-to-destination assignments, improving throughput and reducing congestion in large-scale distribution centers.

Authors

Institutions

Publication Details

Journal
Nature Communications
Published
2026-08-26
DOI
https://doi.org/10.1038/s41467-026-76915-4
Primary Topic
Vehicle Routing Optimization Methods
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
article

Digital twin based sorting optimization for parcel distribution centers in logistics networks

Shuguang Cui, Renming Liu, Xiaoqi Qin, Wei Zhang et al.
Nature Communications
Vehicle Routing Optimization Methods
article

Digital twin based sorting optimization for parcel distribution centers in logistics networks

Shuguang Cui, Renming Liu, Xiaoqi Qin, Wei Zhang, Ran Li, Chuan Huang, Yuanming Tian, Boqun Huang, Xiang Song, Le Liao, Han Zhang
article en

Abstract

Parcel distribution centers in logistics networks aim to sort inbound parcels for downstream destinations through parcel-sorting systems, where parcels are diverted to assigned grids and packed into bins for outbound truck deliveries. Considering dynamic parcel movements, random packing behaviors, and conveyor congestion, maximizing sorting throughput by assigning grids to destinations presents significant computational challenges. This work establishes a high-fidelity parcel-sorting digital-twin system that models real-time interactions among parcels, sorters, and packers, and simulates throughput performance under specific sorting plans. To address the computational challenges and real-world operational constraints, a digital twin-based structured Monte Carlo tree search optimization framework, combining integer nonlinear programming and geographic destination graph networks, is proposed to optimize sorting plans. The proposed digital twin and optimization framework have been deployed in 146 parcel distribution centers (approximately 30% of SF Express parcel distribution centers in China) and demonstrated their effectiveness through both numerical and field experiments: the proposed framework increases average and peak sorting throughputs by 10.56% and 7.72%, respectively, and reduces recirculated parcels by 60.81%, compared to field-implemented method. Furthermore, it outperforms the basic digital twin-based Monte Carlo tree search baseline by 6.77% and 4.99% in average and peak throughputs, respectively, and reduces recirculated parcels by 54.57%. Authors demonstrate a high-fidelity digital twin system for parcel sorting, integrating real parcel-level data and device mechanisms, and proposes a structured Monte Carlo tree search framework that combines integer nonlinear programming and geographic graph modules to optimize grid-to-destination assignments, improving throughput and reducing congestion in large-scale distribution centers.

Nature Communications
Beijing University of Posts and Telecommunications (CN), Chinese University of Hong Kong (HK), Chinese University of Hong Kong, Shenzhen (CN), Institute for the Future (US), Shenzhen Technology University (CN)
Industry, innovation and infrastructure
Openalex Percentile: Top 10%
Vehicle Routing Optimization Methods
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.