Joint Order Picking and Packaging Optimization for E-Warehouse with Multiple Zones
- 1School of Management, Jiujiang University, Jiujiang 332005, China
- 2Department of Logistics and Maritime Studies, Faculty of Business, Hong Kong Polytechnic University, Kowloon, Hong Kong
Abstract
E-commerce orders frequently contain items stored in distinct zones or even separate facilities, necessitating the coordination of multiple pickers, which often results in additional waiting time. This research investigates the joint order picking and packaging optimization problem for a multi-zone e-commerce warehouse. We formulate the integrated batching, picker assignment, sequencing, and packaging decisions as a mixed-integer nonlinear programming (MINLP) model and further reformulate the nonlinear relationships into a solvable mixed-integer linear programming (MILP) model for exact-solver validation. Due to the computational intractability of large-scale instances, we introduce a two-stage heuristic framework that combines spatial-first and temporal-first batching rules with an RP-VNS improvement procedure. Computational experiments compare the proposed algorithms with Gurobi on small-scale instances and with two greedy benchmarks and an ALNS-based metaheuristic on large-scale instances. The results show that the spatial-first heuristic (SFH) consistently achieves the lowest total cost, while the temporal-first heuristic (TFH) also improves upon ALNS in most settings. Relative to ALNS, SFH and TFH reduce total operational costs by up to 28.85% and 20.93%, respectively. Additional VNS ablation and routing-policy experiments further demonstrate the contribution of VNS on the tested instances and the robustness of the proposed framework under alternative routing assumptions.
Related
- A Quality-Risk-Aware Stochastic Dynamic Programming Model for Blade Replacement Optimization in IC Packaging Singulation
- Data-driven joint optimization of maintenance and spare parts provisioning: A distributionally robust approach
- QoS-Aware Joint Concurrency and HARQ-Limit Design for HARQ-CC-Aided Slow Fluid Antenna Multiple Access
- Joint Estimation and Grouping of Quantile Association Curves across Multiple Responses
- Capacity Analysis and Joint Gaussian Beam Pattern Optimization for Positioning-Assisted Communications
BibTeX
@article{wang2026joint,
title = {{Joint Order Picking and Packaging Optimization for E-Warehouse with Multiple Zones}},
author = {Jian Wang and Mingzhong Wan and Yan Liu},
journal = {Mathematics},
year = {2026},
month = oct,
doi = {10.3390/math14193614},
url = {https://www.mdpi.com/2227-7390/14/19/3614},
note = {CC BY 4.0},
}
RIS
TY - JOUR
TI - Joint Order Picking and Packaging Optimization for E-Warehouse with Multiple Zones
AU - Jian Wang
AU - Mingzhong Wan
AU - Yan Liu
PY - 2026
DA - 2026/10/06
JO - Mathematics
DO - 10.3390/math14193614
UR - https://www.mdpi.com/2227-7390/14/19/3614
AB - E-commerce orders frequently contain items stored in distinct zones or even separate facilities, necessitating the coordination of multiple pickers, which often results in additional waiting time. This research investigates the joint order picking and packaging optimization problem for a multi-zone e-commerce warehouse. We formulate the integrated batching, picker assignment, sequencing, and packaging decisions as a mixed-integer nonlinear programming (MINLP) model and further reformulate the nonlinear relationships into a solvable mixed-integer linear programming (MILP) model for exact-solver validation. Due to the computational intractability of large-scale instances, we introduce a two-stage heuristic framework that combines spatial-first and temporal-first batching rules with an RP-VNS improvement procedure. Computational experiments compare the proposed algorithms with Gurobi on small-scale instances and with two greedy benchmarks and an ALNS-based metaheuristic on large-scale instances. The results show that the spatial-first heuristic (SFH) consistently achieves the lowest total cost, while the temporal-first heuristic (TFH) also improves upon ALNS in most settings. Relative to ALNS, SFH and TFH reduce total operational costs by up to 28.85% and 20.93%, respectively. Additional VNS ablation and routing-policy experiments further demonstrate the contribution of VNS on the tested instances and the robustness of the proposed framework under alternative routing assumptions.
SN - 2227-7390
ER -