| 基于聚类和动态规划的组合路径策略 |
| |
| 引用本文： | 冯爱兰,张小青,孔继利.基于聚类和动态规划的组合路径策略[J].运筹与管理,2019,28(8):86-92. |
| |
| 作者姓名： | 冯爱兰 张小青 孔继利 |
| |
| 作者单位： | 1.北京科技大学 机械工程学院物流工程系,北京 100083; 2.北京邮电大学 现代邮政学院,北京 100876 |
| |
| 基金项目： | 国家自然科学基金资助项目(71772010):面向复杂产品研制联盟的云制造资源配置与调度研究 |
| |
| 摘 要： | 为提高电商仓库的拣货作业效率,本文提出了基于聚类和动态规划的组合路径策略,实现了生成路径消耗时间和路径长度之间的平衡,并将这一策略成功地应用到多区型仓库。该策略分四步:首先,根据待拣储位分布特征,运用聚类分析法对其进行分类;然后,以各类的首末储位作为节点,运用动态规划法对已得分类进行排序,得到相应的类序;其次,得到各类内部路径;最后,依次拣取待拣商品,并返回出发点完成拣货作业。在提出新的路径策略后,通过仿真方法将新策略与三种传统路径策略(穿越策略、最大间隙策略和混合策略)和一种优质算法(蚁群算法)进行了对比分析,结果表明:该策略具备良好的适用性和实用性。
|
| 关 键 词： | 拣货路径 聚类分析 动态规划 |
| 收稿时间： | 2018-01-24 |
Combined Strategy Based on Clustering and Dynamic Programmingfor Picking Routing in warehouse |
| |
| FENG Ai-lan,ZHANG Xiao-qing,KONG Ji-li.Combined Strategy Based on Clustering and Dynamic Programmingfor Picking Routing in warehouse[J].Operations Research and Management Science,2019,28(8):86-92. |
| |
| Authors: | FENG Ai-lan ZHANG Xiao-qing KONG Ji-li |
| |
| Affiliation: | 1.University of Science and Technology Beijing, Beijing 100083, China; 2.School of Modern Post, Beijing University of Posts and Telecommunications, Beijing 100876, China |
| |
| Abstract: | In order to improve the efficiency of picking, this paper puts forward a new guidance strategy based on clustering and dynamic Programming for the picking routing in multi-block warehouse, which achieves the balance of the time for generating path and the length of path, and applies it to multi-block warehouse successfully. The strategy can be divided into four steps: Firstly, classify the picking bits by cluster analysis. Then, take the first and last points of each class as nodes, and use the dynamic programming method to sort the obtained classifications to get the corresponding class order. Next, determine the internal routing per class. Finally, pick the items in turn and get the picking routing length. After presenting the new routing strategy, this paper compares the new strategy with the previous heuristic strategies such as S-shape, Largest Gap, and Combined and ACO algorithm through simulation, getting the result: The newly proposed routing strategy has a good feasibility, applicability and practicability. |
| |
| Keywords: | picking routing cluster analysis dynamic programming |
| 本文献已被 CNKI 维普 等数据库收录！ |
| 点击此处可从《运筹与管理》浏览原始摘要信息 |
|
点击此处可从《运筹与管理》下载全文 |
|
