考虑拆零分组的装箱问题研究
首发时间:2022-06-22
摘要:为解决拆零分组约束下周转箱使用数量过多而导致仓库拣选资源消耗过大的问题,对考虑拆零分组的装箱问题展开研究。以周转箱使用数量最少为目标建立整数规划模型,并根据问题特点设计一种基于贪婪思想的启发式算法。通过不同规模的数值实验表明设计的算法能在较短时间内得到近似最优解,同时与现有企业使用的方法相比,所提算法给出的装箱方案高效实用,平均减少11%的周转箱使用数量,并且在中小订单规模中减少率达13.45%,为企业提高拣选效率提供理论依据和参考。
For information in English, please click here
Research on Bin Packing Problem Considering Disassembling Group
Abstract:In order to solve the problem of excessive consumption of warehouse picking resources caused by too many turnover bins under the restriction of disassembling group, the bin packing problem considering disassembling group was studied. The integer programming model was established to minimize the number of turnover bins, then a heuristic algorithm based on greedy was designed according to the characteristics of the problem. Numerical experiments of different scales show that the proposed algorithm can obtain an approximate optimal solution in a short time, and compared with the methods used by existing enterprises, the packing scheme given by the proposed algorithm is efficient and practical, reducing the number of turnover bins by 11% on average, and the reduction rate reaches 13.45% in small and medium-sized order scale, which providesa theoretical basis and reference for enterprises to improve the picking efficiency.
Keywords: broken case picking bin packing problem disassembling group heuristic algorithm
引用
No.****
动态公开评议
共计0人参与
勘误表
考虑拆零分组的装箱问题研究
评论
全部评论0/1000