仓库拣货员多任务路径优化  

Multi-Task Path Optimization for Warehouse Pickers

作　　者：杨东起 骆心怡 毛鹏[2] YANG Dong-qi;LUO Xin-yi;MAO Peng(College of Light Industry&Food,Nanjing Forestry University,Nanjing Jiangsu 210037,China;College of Civil Engineering,Nanjing Forestry University,Nanjing Jiangsu 210037,China)

机构地区：[1]南京林业大学轻工与食品学院,江苏南京210037 [2]南京林业大学土木工程学院,江苏南京210037

出　　处：《计算机仿真》2023年第4期139-144,共6页Computer Simulation

基　　金：国家自然科学基金资助项目(72071115);江苏省大学生创新创业训练重点项目(202010298065Z)。

摘　　要：随着供应链思想在本世纪初的发展,越来越多的企业注意到仓库管理的重要性。为了有效提高仓库管理的工作效率,往往需要结合科学技术来实现。聚焦于优化仓库中的拣货路径,探究当拣货员在仓库执行多任务时如何实现最优路径规划。总结了拣货员从当前位置运动到下一位置的路程计算公式;提出了利用遗传算法,采用多次单目标规划策略求解拣货员多任务时的最短路径;引入了距离查找表以解决因大量计算两点间的距离而导致求解过程耗时的问题。通过实验,对比验证了所提方法的可行性和有效性。With the development of supply chain theory at the beginning of this century,more and more entrepreneurs pay attention to the importance of warehouse management.In order to better improve the efficiency of warehouse management,it always needs to be done in conjunction with science and technology.This paper focuses on exploring how to achieve the optimal path when the pickers have multiple tasks in the warehouse.The distance formula between the current position and the next position was summarized.The optimal path of the pickers'multi-task was solved based on genetic algorithm as the single objective programming.The distance look-up table was proposed to solve the problem of time-consuming solving process due to a large amount of calculation of distance between two points.Finally,the feasibility and effectiveness of the proposed method were verified by experiments.

关 键 词：仓库管理 路径优化 遗传算法 查找表 

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