波次分区拣货时装箱与货位指派问题协同优化的模型与算法  

Model and algorithm for cartonization and slotting optimization simultaneously in wave-picking zone-based system

作　　者：李英德[1] 

机构地区：[1]浙江工业大学机械学院,杭州310014

出　　处：《系统工程理论与实践》2013年第5期1269-1276,共8页Systems Engineering-Theory & Practice

基　　金：国家自然科学基金(70971118);浙江省科技厅公益性基金(2012C31012);浙江工业大学校级自然科学研究基金(2012XZ001)

摘　　要：在一种常见的周期性"波次分区拣货、整体补货"的动态环境中,货位指派和装箱问题发生的频率相同,互为优化条件,同时解决两个问题可使拣货效率获得更大的提升.研究了基于SKUs相关性的装箱和货位指派的协同优化问题,建立了以最小化最大分区拣货处理时间为目标的数学模型,设计了"SKUs对"位置交换策略,提出了基于SKUs相关性的SAC算法和基于货位位置的NFDP算法分别来求解两个问题,在此基础上,提出了协同解决两个NP-hard问题的SAC-NFDP算法.测试结果表明,SAC-NFDP算法性能良好,对拣货效率改进明显.In wave-picking and entire-replenishment zone-based warehouse, the slotting and cartonization problems are the optimization conditions each other; they need to be solved simultaneously to improve the picking efficiency. A mix integer program model to minimize the max pick wave make span among all zones was proposed, the SAC algorithm for slotting based on SKUs correlation and NFDP algorithm for car- tonization based on SKUs proximity were designed. Based on the two algorithms, the SAC-NFDP heuristic algorithm was given to solve the two NP-hard problems -- slotting and cartonization simultaneously. Ex- amples results show that SAC-NFDP algorithm has perfect performance and promising computational results.

关 键 词：波次分区拣货 SKUs相关性 协同优化 SAC-NFDP算法 相关性位置变换 拣货波次时间 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]