DS-ALNS for Practical Sorting Optimization in Parcel Distribution Centers

Parcel distribution centers (PDCs) of major carriers aim to efficiently sort the inbound parcels into downstream destinations via a parcel-sorting system (PSS). Inbound parcels are released into the PSS and diverted to the assigned grids, followed by packing into bins and loading onto outbound trucks. Maximizing the sorting throughput requires an optimized assignment of parcel destinations to grids, which is considerably complex when incorporating the dynamic models of parcel movement, packing behaviors, conveyor system congestion, and the practical operation constraints posed by real-world sorting. Given the limited research on the sorting optimization of the cross-belt sorter system (CBSS), we first provide a systematic introduction to its structure, and conduct detailed throughput analysis. Sub-sequently, we establish a specific optimization formulation with practical operational constraints. Then, we formulate the sorting optimization problem into a uniformed grids assignment problem and decompose it into the grids quantities assignment and constraint-based positioning assignment problems, circumventing the computational challenge posed by the enormous solution space and constraint dimensions while ensuring operational feasibility. Targeting each of the sub-problems, we propose a dual-stage adaptive large neighborhood search (DS-ALNS) scheme, which implements the ALNS algorithm to tackle the grid quantities and constraint-based positioning assignments, respectively. Moreover, we implement a rank correlation transformation design to tackle the computational complexity challenge by transforming the decision variables from determining the assigned quantities of the grids into the destinations, significantly reducing the solution space. We evaluate the effectiveness and operational feasibility through the Digital Twin (DT) system in various PDCs with real-world sorting data. The DT experiments results demonstrate that the proposed DS-ALNS can achieve a decent increase in both stationary and peak sorting throughput up to 3.08% and 7.42% respectively, underlining the effectiveness and practical applicability.

Authors

Institutions

Publication Details

Published
2025-03-26
DOI
https://doi.org/10.1109/icit63637.2025.10965324
Primary Topic
Advanced Manufacturing and Logistics Optimization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

DS-ALNS for Practical Sorting Optimization in Parcel Distribution Centers

Yuanming Tian, Li‐Man Liao, Wei Zhang, Ruijie Liu et al.
Advanced Manufacturing and Logistics Optimization
article

DS-ALNS for Practical Sorting Optimization in Parcel Distribution Centers

Yuanming Tian, Li‐Man Liao, Wei Zhang, Ruijie Liu, Bin Huang, Chuan Huang
article en

Abstract

Parcel distribution centers (PDCs) of major carriers aim to efficiently sort the inbound parcels into downstream destinations via a parcel-sorting system (PSS). Inbound parcels are released into the PSS and diverted to the assigned grids, followed by packing into bins and loading onto outbound trucks. Maximizing the sorting throughput requires an optimized assignment of parcel destinations to grids, which is considerably complex when incorporating the dynamic models of parcel movement, packing behaviors, conveyor system congestion, and the practical operation constraints posed by real-world sorting. Given the limited research on the sorting optimization of the cross-belt sorter system (CBSS), we first provide a systematic introduction to its structure, and conduct detailed throughput analysis. Sub-sequently, we establish a specific optimization formulation with practical operational constraints. Then, we formulate the sorting optimization problem into a uniformed grids assignment problem and decompose it into the grids quantities assignment and constraint-based positioning assignment problems, circumventing the computational challenge posed by the enormous solution space and constraint dimensions while ensuring operational feasibility. Targeting each of the sub-problems, we propose a dual-stage adaptive large neighborhood search (DS-ALNS) scheme, which implements the ALNS algorithm to tackle the grid quantities and constraint-based positioning assignments, respectively. Moreover, we implement a rank correlation transformation design to tackle the computational complexity challenge by transforming the decision variables from determining the assigned quantities of the grids into the destinations, significantly reducing the solution space. We evaluate the effectiveness and operational feasibility through the Digital Twin (DT) system in various PDCs with real-world sorting data. The DT experiments results demonstrate that the proposed DS-ALNS can achieve a decent increase in both stationary and peak sorting throughput up to 3.08% and 7.42% respectively, underlining the effectiveness and practical applicability.

Chinese University of Hong Kong, Shenzhen (CN)
Openalex Percentile: Top 89%
Advanced Manufacturing and Logistics Optimization
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.