多层仓库最优存贮问题的模拟退火算法
A simulated annealing approach to optimal storing in a multi-level warehouse
摘要:
我们提出了一种模拟退火算法,专门针对优化总检索时间在一个复杂的预批拣选约束下的多级仓库。在欧洲制造商的仓库中,从拣选员到零件的订单拣选过程的真实数据的实验表明,最佳的存储分配不一定显示在物流学中假定的特征,例如正相关项目的聚类或按拣选频率排序的项目。在一个实验中运行的4000多批订单,每批1至150个项目,存储分配建议的算法产生了21%的减少,在总检索时间相对于基于频率的存储分配。
英文摘要:
We propose a simulated annealing algorithm specifically tailored to optimise total retrieval times in a multi-level warehouse under complex pre-batched picking constraints. Experiments on real data from a picker-to-parts order picking process in the warehouse of a European manufacturer show that optimal storage assignments do not necessarily display features presumed in heuristics, such as clustering of positively correlated items or ordering of items by picking frequency. In an experiment run on more than 4000 batched orders with 1 to 150 items per batch, the storage assignment suggested by the algorithm produces a 21\% reduction in the total retrieval time with respect to a frequency-based storage assignment.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。