检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]同济大学中德学院,上海201804
出 处:《物流技术》2016年第5期130-135,156,共7页Logistics Technology
摘 要:以含有多条横向巷道的仓库为对象,以行走总距离最短为目标,对其拣选作业路径问题进行了研究,在对该问题进行了数学描述的基础上,通过设定拣选点在去程或回程上的分布规则以及相邻巷道拣选点的作业顺序,开发和实现了一种新的基于组合式规则的启发式算法。同时,分析了不同的拣选巷道长度、拣选巷道数量、拣选点数及横向巷道数量对拣选作业行走总距离的影响。实验结果表明,横向巷道能够明显优化拣选距离,但其数量不宜超过4条。In this paper, with a warehouse with multiple transverse alleys as the object and with the shortest total travelling distance as the objective, we studied the picking path optimization of the warehouse, and then on the basis of a mathematical description of the problem,developed and realized a heuristic algorithm based on combination rules. Meanwhile, we analyzed the influence of different length and quantity of the picking alleys, the number of picking stations and the quantity of transverse alleys on the total travelling distance, through which we found that through the transverse alleys we can remarkably optimize the picking distance, but there should not be more than 4 of them in a warehouse.
分 类 号:TP273[自动化与计算机技术—检测技术与自动化装置]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.3