Author
Listed:
- Li Li
(School of Mechanical Engineering, Guangxi University, Nanning 530004, China)
- Yan Wei
(School of Mechanical Engineering, Guangxi University, Nanning 530004, China)
- Yanjie Liang
(Business School, University of Jinan, Jinan 250022, China)
- Jin Ren
(School of Mechanical Engineering, Guangxi University, Nanning 530004, China)
Abstract
Currently, with the widespread popularization of e-commerce systems, enterprises have increasingly high requirements for the timeliness of order fulfillment. It has become particularly critical to enhance the operational efficiency of heterogeneous robotic “goods-to-person” (G2P) systems in book e-commerce fulfillment, reduce enterprise operational costs, and achieve highly efficient, low-carbon, and sustainable warehouse management. Therefore, this study focuses on determining the optimal storage location assignment strategy and order batching method. By comprehensively considering the characteristics of book e-commerce, such as small-batch, high-frequency orders and diverse SKU requirements, as well as existing system issues including uncoordinated storage assignment and order processing, and differences in the operational efficiency of heterogeneous robots, this study proposes a joint optimization framework for storage location assignment and order batching centered on a multi-objective model. The framework integrates the time costs of robot picking operations, SKU turnover rates, and inter-commodity correlations, introduces the STCSPBC storage strategy to optimize storage location assignment, and designs the SA-ANS algorithm to solve the storage assignment problem. Meanwhile, order batching optimization is based on dynamic inventory data, and the S-O Greedy algorithm is adopted to find solutions with lower picking costs. This achieves the joint optimization of storage location assignment and order batching, improves the system’s picking efficiency, reduces operational costs, and realizes green and sustainable management. Finally, validation via a spatiotemporal network model shows that the proposed joint optimization framework outperforms existing benchmark methods, achieving a 45.73% improvement in average order hit rate, a 48.79% reduction in total movement distance, a 46.59% decrease in operation time, and a 24.04% reduction in conflict frequency.
Suggested Citation
Li Li & Yan Wei & Yanjie Liang & Jin Ren, 2026.
"Joint Optimization of Storage Assignment and Order Batching for Efficient Heterogeneous Robot G2P Systems,"
Sustainability, MDPI, vol. 18(2), pages 1-30, January.
Handle:
RePEc:gam:jsusta:v:18:y:2026:i:2:p:743-:d:1838080
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:gam:jsusta:v:18:y:2026:i:2:p:743-:d:1838080. 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: MDPI Indexing Manager The email address of this maintainer does not seem to be valid anymore. Please ask MDPI Indexing Manager to update the entry or send us the correct address
(email available below). General contact details of provider: https://www.mdpi.com .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.