Author
Listed:
- Zhenyu Huang
(Department of Industrial and Systems Engineering, The Hong Kong Polytechnic University, Kowloon, Hong Kong)
- Zhou Xu
(Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Kowloon, Hong Kong)
- Xiaowen Fu
(Department of Industrial and Systems Engineering, The Hong Kong Polytechnic University, Kowloon, Hong Kong)
Abstract
Parcel-sorting hubs at SF Express face growing pressure to allocate resources—including labor, equipment, and workstations—efficiently amid rising volume volatility and tighter fulfillment windows. Traditional spreadsheet-based planning methods have struggled to keep pace, resulting in frequent mismatches between resource supply and operational demand. This study introduces a simulation-optimization framework implemented at the Shenzhen hub to address these challenges. A discrete-event simulation model captures operational variability and interdependencies, and an embedded optimization solver identifies cost-effective resource plans under real-world constraints. A three-phase field test conducted from March to April 2024 on a high-priority ground-to-air operation achieved an 18.7% cost reduction through simulation-guided refinement and a best case 33.5% savings using solver-based optimization. When scaled across all Shenzhen hub operations for the remainder of 2024, the framework delivered an average cost reduction of 11% with the largest gains observed in air-bound flows constrained by outbound scheduling. Designed for fast deployment by frontline teams, the framework enables timely data-driven decisions without requiring advanced analytical expertise. This work offers a scalable, field-tested approach for improving resource allocation in dynamic logistics environments by combining analytical rigor with operational usability.
Suggested Citation
Zhenyu Huang & Zhou Xu & Xiaowen Fu, 2026.
"Simulation-Optimization for Resource Allocation at SF Express Hub,"
Interfaces, INFORMS, vol. 56(3), pages 243-256, May.
Handle:
RePEc:inm:orinte:v:56:y:2026:i:3:p:243-256
DOI: 10.1287/inte.2024.0187
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:orinte:v:56:y:2026:i:3:p:243-256. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.