旋转货架系统配货作业优化问题启发式算法

Heuristics for Order Picking Optimization Problem of Multiple Carousels System in Distribution Center

旋转货架系统配置配货作业是现代配送中心中一项非常重要的作业活动。研究具有多个水平旋转货架系统的配货作业问题,建立对应的模型。在分析该类型作业中,整个货架系统配货顺序最优单个货架物品拣选顺序必然最优的特点基础上,设计改进临近域算法,并提出随机确定位置启发式算法。最后,通过模拟测试,效果良好。

Recent technological developments have revolutionized the design and operation of warehousing systems. Carousel system, are becoming increasingly prevalent. It requires computerized control algorithms to support scheduling and picking decisions. This paper considers the order picking problem of it. A new improved nearest items heuristics （INIH） and a SVRH heuristics are presented according to the characteristics that the optimal picking order of the materials in the single carousel will come forth of the optimal sequence of the whole assignment. Finally, Experimental results verify that the optimum solutions are quickly and steadily achieved and show its better performance.