Name
Title | ||
|---|---|---|
A Novel Bin Design Problem and High Performance Algorithm for E-commerce Logistics System. |
Abstract | ||
|---|---|---|
Packing cost accounts for a large part of the e-commerce logistics cost. Mining the patterns of customer orders and designing suitable packing bins help to reduce operating cost. In the classical bin packing problem, a given set of cuboid-shaped items should be packed into bins with given and fixed-sizes (length, width and height) to minimize the number of bins that are used. However, a novel bin design problem is proposed in this paper. The decision variables are the geometric sizes of bins, and the objective is to minimize the total surface area. To solve the problem, a low computational-complexity, high-performance heuristic algorithm based on dynamic programming and depth-first tree search, named DPTS, is developed. Based on real historical data that are collected from logistics scenario, numerical experiments show that the DPTS out-performed 5.8% than the greedy local search (GLS) algorithm in the total cost. Whatu0027s more, DPTS algorithm requires only about 1/50 times of the computational resources compared to the GLS algorithm. This demonstrates that DPTS algorithm is very efficient in bin design problem and can help logistics companies to make appropriate design. |
Year | Venue | DocType |
|---|---|---|
2018 | arXiv: Data Structures and Algorithms | Journal |
Volume | Citations | PageRank |
abs/1812.02565 | 0 | 0.34 |
References | Authors | |
0 | 7 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xinhang Zhang | 1 | 0 | 0.68 |
| Haoyuan Hu | 2 | 3 | 1.47 |
| Longfei Wang | 3 | 7 | 2.24 |
| Zhijun Sun | 4 | 0 | 1.01 |
| Ying Zhang | 5 | 86 | 26.59 |
| Kunpeng Han | 6 | 0 | 0.34 |
| Yinghui Xu | 7 | 172 | 20.23 |