|
|
|
Slotting optimization based on SKUs correlations
with Serpentine routing policy |
| LI Ying-de1, LU Jian-sha1, PAN Guo-qiang1,2 |
1. College of Mechanical Engineering of Zhejiang University of Technology, Hangzhou 310014, China;
2. Department of Transport Management of Zhejiang Institute of Communications, Hangzhou 311112, China |
|
|
|
Abstract In order to explore the effect rules of the stock keeping units (SKUs) correlation on picking efficiency in a zone-based wave picking system with serpentine routing policy, a mix integer program model to minimize the pick wave makespan was described. The simulated annealing for slotting considering correlation (SASC_C) heuristic and simulated annealing for slotting randomly (SASR) heuristic were developed. The SASR ignored the SKUs correlation. The SASC_C set the COI solution as the initial solution; the slots sequential movement policy based on the dynamic correlations was proposed to reassign the stronger SKUs to the same aisle and the closed slots as much as possible. The promising computational results show the SASC_C has far better convergence speed than SASR; the solution of SASC_C is better than those of COI and SASC; the average improvement ranges from 0.73% to 14.6% and from1.06% to 10.6% respectively; the more correlation strength, the more improvements on the picking efficiency will be; the more visited aisles in one tour, the more decrease of improvement will be. The effect rules of SKUs correlations are distinct with the Serpentine and Return routing policy. By making the best of SKUs correlation to slotting, the picking efficiency can get some improvement.
|
|
Published: 23 September 2012
|
|
|
穿越策略下考虑相关性的货位优化方法
为研究品项相关性对拣货效率的影响规律，通过分析穿越策略下分区分批拣货时品项间相关性关系的特点，以批次拣货时间最短为目标建立了货位指派优化的数学模型,提出基于品项相关性的货位指派优化算法(SASC_C),该算法以COI法解为初始解,通过货位逐次变换策略将相关性强的品项尽可能的指派到尽可能少的巷道中来提高拣货效率.算法测试结果表明:SASC_C算法的收敛速度明显快于不考虑相关性的随机型算法（SASR）;求解质量平均改进约1.06%~10.6%,比COI法的解平均改进0.73 %~14.6%;相关性强度越高,改进效果越明显;在穿越策略下,改进效果随访问巷道数的增多而减弱.充分利用品项间的相关性关系进行货位优化,有利于提高穿越策略下的拣货效率.
|
|
| ［1］ KOSTER R D， DUC T L， ROODBERGEN K J. Design and control of ware house order picking: A literature review ［J］.European Journal of Operation Research, 2007, 182(2): 481-501.
［2］ FRAZELLE E H. Worldclass warehousing and material handling ［M］. New York: McGraw Hill, 2002.
［3］ HESKETT J L. Cubeperorder indexa key to warehouse stock location ［J］.Transport and Distribution Management, 1963, 3: 27-31.
［4］ PETERSE C J, ASEE G. Improving order picking performance through the implementation of classbased storage ［J］.International Journal of Physical and Logistical Management, 2004, 34(7): 534-544.
［5］ FRAZELLE E H, SHAEP G P. Correlated assignment strategy improve orderpicking operation［J］.Industrial Engineering, 1989, 4: 33-37.
［6］ MAMZINI R. Correlated storage assignment in an order picking system ［J］. International Journal of Industrial Engineering, 2006, 13(4): 1675-1692.
［7］ CARON F, MARCHET G, PEREGO A. Routing policies and COIbased storage policies in pickertopart systems ［J］.International Journal of Production Research, 1998, 36(3): 713-732.
［8］ LANDER T L, BEAVER M K, SADIQ M. Software for dynamic reconfigurable order picking systems ［J］.Computer & Industrial Engineering,1994, 1(4): 245-248.
［9］ SADIQ M, LANDER T L. An assignment algorithm for dynamic picking systems ［J］.IIE Transaction,1996, 28(8): 607-616.
［10］ 肖建,郑立.考虑需求相关性的多巷道仓库货位分批问题［J］.计算机集成制造系统,2008,14(12): 2447-2451.
XIAO Jian, ZHENG Li. Storage location assignment in a multi aisle warehouse considering demand correlations ［J］. Computer Integrated Manufacturing Systems, 2008, 14(12): 2447-2451.
［11］ KIM B S, SMITH J S. Dynamic slotting for zonebased distribution center picking operation ［C］ ∥ Proceedings of the 10th International Material Handing Research Colloquium. Dortmund: Institute of Material Handling, 2008(a): 559-599.
［12］ 李英德,鲁建厦.基于相关性的周期性货位优化的模型与算法［J］.机械工程学报,2011,47(20): 75-88.
LI Yingde,LU Jiansha. Model and algorithm for periodic storage allocation based on correlations ［J］. Journal of Mechanical Engineering. 2011, 47(20): 75-88. |
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
| |
Shared |
|
|
|
|
| |
Discussed |
|
|
|
|
